On the smallest-basis problem underlying the GGH lattice-based cryptosystem

MaRDI QIDQ5136785zbMATH OpenFDO

Authors

Publication date 27 November 2020

Full work available at URL https://einspem.upm.edu.my/journal/fullpaper/vol13saugust/1.pdf

zbMATH Keywords

closest-vector problemGGH cryptosystemshortest-vector problemsmallest-basis problem

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Recommendations

• Cryptanalysis of the GGH cryptosystem
• scientific article; zbMATH DE number 1088230
• Improving BDD cryptosystems in general lattices
• A Lattice Based Public Key Cryptosystem Using Polynomial Representations
• scientific article; zbMATH DE number 1304121

Cited in

(5)

• Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
• An upgrade on the key generation algorithm of the GGH-MKA lattice-based encryption scheme
• The Efficiency of Embedding-Based Attacks on the GGH Lattice-Based Cryptosystem
• Cryptanalysis of the GGH cryptosystem
• On the properties of reduced basis related to lattice-reduced algorithm

This page was built for publication: On the smallest-basis problem underlying the GGH lattice-based cryptosystem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136785)