Cryptographic Functions from Worst-Case Complexity Assumptions

DOI10.1007/978-3-642-02295-1_13zbMath1191.94098OpenAlexW112021158MaRDI QIDQ5188549

Daniele Micciancio

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_13

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Local Testing of Lattices ⋮ Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures ⋮ The Geometry of Lattice Cryptography

Uses Software

• SWIFFT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic encryption
• On Lovász' lattice reduction and the nearest lattice point problem
• A hierarchy of polynomial time lattice basis reduction algorithms
• Factoring polynomials with rational coefficients
• Lattice reduction: a toolbox for the cryptoanalyst
• A relation of primal--dual lattices and the complexity of shortest lattice vector problem
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
• Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard
• Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
• Fast LLL-type lattice reduction
• Lattice problems and norm embeddings
• SWIFFT: A Modest Proposal for FFT Hashing
• Lossy trapdoor functions and their applications
• Trapdoors for hard lattices and new cryptographic constructions
• The worst-case behavior of schnorr's algorithm approximating the shortest nonzero vector in a lattice
• Representing hard lattices with O(n log n) bits
• Generalized Compact Knapsacks Are Collision Resistant
• Symplectic Lattice Reduction and NTRU
• Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
• A Framework for Efficient and Composable Oblivious Transfer
• The Generalized Basis Reduction Algorithm
• On Polynomial-Factor Approximations to the Shortest Lattice Vector Length
• Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor
• A more efficient algorithm for lattice basis reduction
• A sieve algorithm for the shortest lattice vector problem
• On the Complexity of Lattice Problems with Polynomial Approximation Factors
• Floating-Point LLL Revisited
• Advances in Cryptology - CRYPTO 2003
• New lattice-based cryptographic constructions
• Lattice-Based Identification Schemes Secure Under Active Attacks
• Asymptotically Efficient Lattice-Based Digital Signatures
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• Predicting Lattice Reduction
• Theory of Cryptography
• Algorithmic Number Theory
• On lattices, learning with errors, random linear codes, and cryptography
• Selecting cryptographic key sizes

This page was built for publication: Cryptographic Functions from Worst-Case Complexity Assumptions