scientific article; zbMATH DE number 1088230

Shai Halevi, Oded Goldreich, Shafi Goldwasser

Publication date: 25 June 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

closest vector problem public-key cryptosystems orthogonality defect lattice reduction problems smallest basis problem

Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (60)

SoK: how (not) to design and implement post-quantum cryptography ⋮ Post-quantum cryptography: lattice signatures ⋮ A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme ⋮ \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon} ⋮ Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography ⋮ A Fast Phase-based Enumeration Algorithm for SVP Challenge Through $$y$$-Sparse Representations of Short Lattice Vectors ⋮ Bonsai trees, or how to delegate a lattice basis ⋮ PASS-encrypt: a public key cryptosystem based on partial evaluation of polynomials ⋮ The 2010 Benjamin Franklin Medal in Computer and Cognitive Science presented to Shafrira Goldwasser, Ph.D. ⋮ Efficient Nyberg-Rueppel type of NTRU digital signature algorithm ⋮ Sieve algorithms for some orthogonal integer lattices ⋮ Gaussian sampling of lattices for cryptographic applications ⋮ On the hardness of the finite field isomorphism problem ⋮ A signature scheme from the finite field isomorphism problem ⋮ The Efficiency of Embedding-Based Attacks on the GGH Lattice-Based Cryptosystem ⋮ Cryptanalysis of the GGH cryptosystem ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Lattice attacks against elliptic-curve signatures with blinded scalar multiplication ⋮ Loop-abort faults on lattice-based Fiat-Shamir and hash-and-sign signatures ⋮ Lattice-based cryptography: a survey ⋮ Compact lattice gadget and its applications to hash-and-sign signatures ⋮ Lattice polly cracker cryptosystems ⋮ Fault analysis of the NTRUSign digital signature scheme ⋮ Explicit Hard Instances of the Shortest Vector Problem ⋮ Analysis of Error Terms of Signatures Based on Learning with Errors ⋮ Public key compression for constrained linear signature schemes ⋮ Secure multi-source network coding scheme with lattice signature ⋮ Algorithms for the Shortest and Closest Lattice Vector Problems ⋮ A public-key encryption scheme based on non-linear indeterminate equations ⋮ Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors ⋮ Generating shorter bases for hard random lattices ⋮ Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices ⋮ Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures ⋮ Rigorous and Efficient Short Lattice Vectors Enumeration ⋮ Finding Shortest Lattice Vectors in the Presence of Gaps ⋮ An experimental comparison of some LLL-type lattice basis reduction algorithms ⋮ A Digital Signature Scheme Based on CVP ∞ ⋮ Learning strikes again: the case of the DRS signature scheme ⋮ Quantum walk public-key cryptographic system ⋮ Improvement of Lattice-Based Cryptography Using CRT ⋮ Improvements in the analysis of Kannan's CVP algorithm ⋮ Lattice-based identity-based resplittable threshold public key encryption scheme ⋮ Predicting Lattice Reduction ⋮ Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures ⋮ Modular lattice signatures, revisited ⋮ Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices ⋮ Hardness of approximating the minimum solutions of linear Diophantine equations ⋮ A relation of primal--dual lattices and the complexity of shortest lattice vector problem ⋮ On the limits of nonapproximability of lattice problems ⋮ Unnamed Item ⋮ Cryptography Based on Quadratic Forms: Complexity Considerations ⋮ Lattice-based revocable certificateless signature ⋮ Unnamed Item ⋮ Public-key cryptography and invariant theory ⋮ A lattice-based public-key cryptosystem ⋮ A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor ⋮ The Complexity of Public-Key Cryptography ⋮ A note on BDD problems with $\lambda_2$-gap ⋮ Cryptanalysis of ITRU ⋮ On removing rejection conditions in practical lattice-based signatures

This page was built for publication: