Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The Efficiency of Embedding-Based Attacks on the GGH Lattice-Based Cryptosystem

From MaRDI portal
Publication:6123830
Jump to:navigation, search

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


zbMATH Keywords

latticespost-quantum cryptographylattice-based cryptosystemGGH cryptosystemembedded latticesembedding-based attacks


Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6123830&oldid=35582399"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 10 July 2024, at 06:27.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki