The Efficiency of Embedding-Based Attacks on the GGH Lattice-Based Cryptosystem
From MaRDI portal
Publication:6123830
DOI10.47836/mjms.17.4.09OpenAlexW4389741241MaRDI QIDQ6123830
No author found.
Publication date: 8 April 2024
Published in: Malaysian Journal of Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.47836/mjms.17.4.09
latticespost-quantum cryptographylattice-based cryptosystemGGH cryptosystemembedded latticesembedding-based attacks
Cites Work
- Cryptanalysis of the GGH cryptosystem
- Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
- Mathematics of Public Key Cryptography
- Lattice-based Cryptography
- Predicting Lattice Reduction
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The Efficiency of Embedding-Based Attacks on the GGH Lattice-Based Cryptosystem