Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
From MaRDI portal
Publication:1015359
DOI10.1007/S00145-008-9031-0zbMATH Open1159.94369OpenAlexW1992226551MaRDI QIDQ1015359FDOQ1015359
Authors: Phong Q. Nguyen, Oded Regev 
Publication date: 8 May 2009
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-008-9031-0
Recommendations
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
- Learning a zonotope and more: cryptanalysis of ntrusign countermeasures
- scientific article; zbMATH DE number 2086714
- scientific article; zbMATH DE number 2081055
- Cryptography from learning parity with noise
- Cryptanalysis of the GGH cryptosystem
- Cryptanalysis of GGH15 multilinear maps
- Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices
- Cryptanalysis of the multivariate signature scheme proposed in PQCrypto 2013
- Cryptanalysis of a round optimal lattice-based multisignature scheme
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Trapdoors for hard lattices and new cryptographic constructions
- Title not available (Why is that?)
- Lattice-based Cryptography
- Asymptotically Efficient Lattice-Based Digital Signatures
- On Lovász' lattice reduction and the nearest lattice point problem
- Advances in Cryptology - CRYPTO 2003
- 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?)
- Title not available (Why is that?)
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cryptographic functions from worst-case complexity assumptions
- Title not available (Why is that?)
- Lattice-Based Cryptography
Cited In (24)
- On statistical learning of simplices: unmixing problem revisited
- Generating shorter bases for hard random lattices
- Efficient Nyberg-Rueppel type of NTRU digital signature algorithm
- Lattice-based revocable certificateless signature
- Eigenvectors of Orthogonally Decomposable Functions
- Learning a zonotope and more: cryptanalysis of ntrusign countermeasures
- Learning strikes again: the case of the DRS signature scheme
- Cryptography and Coding
- Title not available (Why is that?)
- A spectral algorithm for latent Dirichlet allocation
- Learning strikes again: the case of the DRS signature scheme
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
- A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme
- \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon}
- Cryptanalysis of the GGH cryptosystem
- \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple
- Loop-abort faults on lattice-based Fiat-Shamir and hash-and-sign signatures
- Modular lattice signatures, revisited
- Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices
- Sealing the leak on classical NTRU signatures
- Giophantus distinguishing attack is a low dimensional learning with errors problem
- A signature scheme from the finite field isomorphism problem
- Theoretical and empirical analysis of FALCON and SOLMAE using their Python implementation
- Integer LWE with non-subgaussian error and related attacks
Uses Software
This page was built for publication: Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1015359)
