Cryptographic functions from worst-case complexity assumptions
From MaRDI portal
Recommendations
Cites work
- A Framework for Efficient and Composable Oblivious Transfer
- A hierarchy of polynomial time lattice basis reduction algorithms
- A more efficient algorithm for lattice basis reduction
- A relation of primal--dual lattices and the complexity of shortest lattice vector problem
- A sieve algorithm for the shortest lattice vector problem
- Advances in Cryptology - CRYPTO 2003
- Algorithmic Number Theory
- Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor
- Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard
- Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
- Asymptotically Efficient Lattice-Based Digital Signatures
- Factoring polynomials with rational coefficients
- Fast LLL-type lattice reduction
- Finding short lattice vectors within Mordell's inequality
- Floating-Point LLL Revisited
- Generalized Compact Knapsacks Are Collision Resistant
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- scientific article; zbMATH DE number 1676629 (Why is no real title available?)
- scientific article; zbMATH DE number 5485482 (Why is no real title available?)
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1302849 (Why is no real title available?)
- scientific article; zbMATH DE number 1088229 (Why is no real title available?)
- scientific article; zbMATH DE number 1559544 (Why is no real title available?)
- scientific article; zbMATH DE number 1852142 (Why is no real title available?)
- scientific article; zbMATH DE number 2120513 (Why is no real title available?)
- scientific article; zbMATH DE number 2196508 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Lattice problems and norm embeddings
- Lattice reduction: a toolbox for the cryptoanalyst
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Lossy trapdoor functions and their applications
- New lattice-based cryptographic constructions
- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
- On lattices, learning with errors, random linear codes, and cryptography
- On Lovász' lattice reduction and the nearest lattice point problem
- On Polynomial-Factor Approximations to the Shortest Lattice Vector Length
- On the complexity of lattice problems with polynomial approximation factors
- Predicting Lattice Reduction
- Probabilistic encryption
- Representing hard lattices with O(n n) bits (extended abstract)
- Selecting cryptographic key sizes
- SWIFFT: A Modest Proposal for FFT Hashing
- Symplectic Lattice Reduction and NTRU
- The Generalized Basis Reduction Algorithm
- The worst-case behavior of Schnorr's algorithm approximating the shortest nonzero vector in a lattice
- Theory of Cryptography
- Trapdoors for hard lattices and new cryptographic constructions
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Cited in
(4)
This page was built for publication: Cryptographic functions from worst-case complexity assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5188549)
