scientific article; zbMATH DE number 1962816

MaRDI QIDQ4418652zbMATH OpenFDO

Authors Eike Kiltz

Publication date 11 August 2003

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

Mathematics Subject Classification ID

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

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.
• scientific article; zbMATH DE number 1500548

Cited in

(2)

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

This page was built for publication:

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