Christian Cachin, Klaus Kursawe, et al.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Paper
Lower bounds for polynomial evaluation and interpolation problems
Abstract
We show that there is a set of points p1, p2, . . . , pn such that any arithmetic circuit of depth d for polynomial evaluation (or interpolation) at these points has size Ω (n log n/log(2 + d/log n)). Moreover, for circuits of sub-logarithmic depth d, we obtain a lower bound of Ω(dn1+1/d) on its size.
Related
Paper
OAEP Reconsidered
Victor Shoup
Journal of Cryptology
Christian Cachin, Klaus Kursawe, et al.
Journal of Cryptology
Ashok K. Chandra, Prabhakar Raghavan, et al.
Computational Complexity