On the representation of Boolean predicates of the Diffie-Hellman function

DOI10.1007/3-540-36494-3_21MaRDI QIDQ4418652zbMATH OpenFDO

Authors Eike Kiltz

Publication date 11 August 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2607/26070223.htm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Cryptography (94A60)

Recommendations

• Threshold circuit lower bounds on cryptographic functions
• Complexity bounds on general hard-core predicates.
• Hard-core predicates for a Diffie-Hellman problem over finite fields
• On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping.
• Spectral bounds on general hard core predicates. (Extended abstract)

Cited in

(2)

• Communication complexity of some number theoretic functions
• Threshold circuit lower bounds on cryptographic functions

This page was built for publication: On the representation of Boolean predicates of the Diffie-Hellman function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418652)