Complexity theoretic lower bounds on cryptographic functions.

MaRDI QIDQ3563071zbMATH OpenFDO

Authors Eike Kiltz

Publication date 28 May 2010

Full work available at URL http://nbn-resolving.de/urn/resolver.pl?urn=urn:nbn:de:hbz:294-10060

zbMATH Keywords

interpolationcomplexity theorylower boundcryptologyDiffie-Hellman algorithm

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Threshold circuit lower bounds on cryptographic functions
• Complexity theoretic aspects of some cryptographic functions
• Number theoretic methods in cryptography. Complexity lower bounds
• scientific article; zbMATH DE number 1866875
• Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem

Cited in

(4)

• Complexity theoretic aspects of some cryptographic functions
• Komplexitätstheorie und Kryptologie
• On the Cryptographic Complexity of the Worst Functions
• Threshold circuit lower bounds on cryptographic functions

This page was built for publication: Complexity theoretic lower bounds on cryptographic functions.

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