Complexity theoretic aspects of some cryptographic functions

DOI10.1007/3-540-45071-8_31MaRDI QIDQ3082937zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Eike Kiltz, Hans Ulrich Simon

Publication date 18 March 2011

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

Full work available at URL https://doi.org/10.1007/3-540-45071-8_31

Mathematics Subject Classification ID

Matrices of integers (15B36) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• Threshold circuit lower bounds on cryptographic functions
• Complexity theoretic lower bounds on cryptographic functions.
• scientific article; zbMATH DE number 1866861
• Spectral norm of symmetric functions
• Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness

Cited in

(9)

• Threshold circuit lower bounds on cryptographic functions
• The complexity of certain multi-exponentiation techniques in cryptography
• Komplexitätstheorie und Kryptologie
• Complexity theoretic lower bounds on cryptographic functions.
• Complexity Measures for Public-Key Cryptosystems
• scientific article; zbMATH DE number 4083538 (Why is no real title available?)
• The Complexity of Public-Key Cryptography
• scientific article; zbMATH DE number 975406 (Why is no real title available?)
• On the Cryptographic Complexity of the Worst Functions

This page was built for publication: Complexity theoretic aspects of some cryptographic functions

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