Non-uniform Cracks in the Concrete: The Power of Free Precomputation

DOI10.1007/978-3-642-42045-0_17zbMath1326.94076WikidataQ56553888 ScholiaQ56553888MaRDI QIDQ2867160

Tanja Lange, Daniel J. Bernstein

Publication date: 10 December 2013

Published in: Advances in Cryptology - ASIACRYPT 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-42045-0_17

zbMATH Keywords

provable security; concrete security; non-constructive algorithms; algorithm cost metrics; non-uniform algorithms

Mathematics Subject Classification ID

94A60: Cryptography

68P25: Data encryption (aspects in computer science)

Related Items

Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited, Recent progress on the elliptic curve discrete logarithm problem, Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound, Short variable length domain extenders with beyond birthday bound security, On the bit security of cryptographic primitives, Random oracles and non-uniformity, State separation for code-based game-playing proofs, On the security of the WOTS-PRF signature scheme, NTRU prime: reducing attack surface at low cost, Cryptographic pseudorandom generators can make cryptosystems problematic, Solving discrete logarithm problems faster with the aid of pre-computation, Efficiently Computing Data-Independent Memory-Hard Functions, Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks