Threshold circuit lower bounds on cryptographic functions

DOI10.1016/j.jcss.2005.03.001zbMath1078.68033OpenAlexW1964339966WikidataQ59163786 ScholiaQ59163786MaRDI QIDQ2485284

Hans Ulrich Simon, Eike Kiltz

Publication date: 3 August 2005

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2005.03.001

zbMATH Keywords

Exponential sumsThreshold circuitsSpectral Norm

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic communication complexity
• Majority gates vs. general weighted threshold gates
• Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
• A linear lower bound on the unbounded error probabilistic communication complexity.
• Threshold circuits of bounded depth
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• Complexity Theoretic Aspects of Some Cryptographic Functions
• Harmonic Analysis of Polynomial Threshold Functions
• New directions in cryptography
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Some doubly exponential sums over Z_m
• The Hadamard Maximum Determinant Problem
• On Some Exponential Sums
• On the statistical properties of Diffie-Hellman distributions