Post-quantum cryptography: lattice signatures
type: Item
instance of: scholarly article
title: Post-quantum cryptography: lattice signatures
zbMATH Open document ID: 1170.94010
author: Richard Lindner
author: Markus Rückert
author: Michael Schneider
author: Johannes Buchmann
published in: Computing
publication date: 2009-08-10T00:00:00Z
review text: This paper discusses various lattice based signature schemes in post-quantum cryptography and considers successively the GGH scheme (Goldreich, Goldwasser, Halevi), the NTRUSign scheme (Hoffstein, Howgrave-Graham, Pipher, Silverman, Whyte), the hash-based signature schemes of Merkle, and the GTV (Gentry, Peikert, Vaikuntanathan) signature scheme and its security. New results are stated on the construction of secure Merkle tree signature scheme.
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 81P68
zbMATH DE Number: 5592791
zbMATH Keywords: digital signatures
zbMATH Keywords: post-quantum cryptography
zbMATH Keywords: lattices
reviewed by: Guy Jumarie
describes a project that uses: SWIFFT
describes a project that uses: NTRU
MaRDI profile type: MaRDI publication profile
full work available at URL: s00607-009-0042-y
OpenAlex ID: W2005760721
cites work: Q4228459
cites work: Q4938616
cites work: On Lovász' lattice reduction and the nearest lattice point problem
cites work: Merkle Signatures with Virtually Unlimited Signature Capacity
cites work: Merkle Tree Traversal Revisited
cites work: Explicit Hard Instances of the Shortest Vector Problem
cites work: Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard
cites work: Symplectic Lattice Reduction and NTRU
cites work: Q4474162
cites work: Trapdoors for hard lattices and new cryptographic constructions
cites work: Q4364546
cites work: Q2778851
cites work: Q4418545
cites work: Hardness of approximating the shortest vector problem in lattices
cites work: Q4952720
cites work: Factoring polynomials with rational coefficients
cites work: Generalized Compact Knapsacks Are Collision Resistant
cites work: Asymptotically Efficient Lattice-Based Digital Signatures
cites work: SWIFFT: A Modest Proposal for FFT Hashing
cites work: Q4787204
cites work: Q4829810
cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
cites work: Q4941861
cites work: Theory of Cryptography
cites work: On the Complexity of Lattice Problems with Polynomial Approximation Factors
cites work: Lattice problems and norm embeddings
cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
cites work: Advances in Cryptology - EUROCRYPT 2004
DOI: 10.1007/S00607-009-0042-Y
Recommended article: Q2943320
Recommended article: Post-quantum cryptography: lattice identification schemes
Recommended article: Post-quantum Cryptography: Code-Based Signatures
Recommended article: Q5217747
Recommended article: Q5194165
Recommended article: Lattice-based Cryptography
Recommended article: Lattice-Based Cryptography
Recommended article: Asymptotically Efficient Lattice-Based Digital Signatures
Recommended article: Asymptotically efficient lattice-based digital signatures
description: scientific article; zbMATH DE number 5592791