Cryptanalysis of the GGH cryptosystem
From MaRDI portal
Publication:626951
DOI10.1007/S11786-009-0018-5zbMATH Open1205.94088OpenAlexW2057776873MaRDI QIDQ626951FDOQ626951
Authors: Moon Sung Lee, Sang Geun Hahn
Publication date: 19 February 2011
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-009-0018-5
Recommendations
- On the smallest-basis problem underlying the GGH lattice-based cryptosystem
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
- A Lattice Based Public Key Cryptosystem Using Polynomial Representations
- Cryptanalysis of GGH15 multilinear maps
Cites Work
- Title not available (Why is that?)
- Minkowski's Convex Body Theorem and Integer Programming
- Title not available (Why is that?)
- On Lovász' lattice reduction and the nearest lattice point problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the smallest-basis problem underlying the GGH lattice-based cryptosystem
- Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13
- The Efficiency of Embedding-Based Attacks on the GGH Lattice-Based Cryptosystem
Uses Software
This page was built for publication: Cryptanalysis of the GGH cryptosystem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q626951)