The Geometry of Provable Security: Some Proofs of Security in Which Lattices Make a Surprise Appearance

DOI10.1007/978-3-642-02295-1_12zbMath1191.94089OpenAlexW340107117MaRDI QIDQ5188548

Craig Gentry

Publication date: 5 March 2010

Published in: The LLL Algorithm (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02295-1_12

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• A hierarchy of polynomial time lattice basis reduction algorithms
• Factoring polynomials with rational coefficients
• RSA-OAEP is secure under the RSA assumption
• Finding a Small Root of a Univariate Modular Equation
• The random oracle methodology, revisited
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm
• Nonmalleable Cryptography
• Generation of Elements with Small Modular Squares and Provably Fast Integer Factoring Algorithms
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Information Security and Privacy
• Advances in Cryptology - CRYPTO 2003
• Topics in Cryptology – CT-RSA 2004
• Theory of Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item