Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices
type: Item
instance of: scholarly article
title: Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices
zbMATH Open document ID: 1479.94319
DOI: 10.1007/978-3-030-45727-3_2
author: Pierre-Alain Fouque
author: Paul Kirchner
author: Mehdi Tibouchi
author: Alexandre Wallet
author: Yang Yu
publication date: 2021-12-01T00:00:00Z
Mathematics Subject Classification ID: 94A62
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7436940
zbMATH Keywords: lattice Gaussian sampling
zbMATH Keywords: GPV lattice-trapdoor paradigm for signatures
MaRDI profile type: Publication
full work available at URL: 978-3-030-45727-3 2
OpenAlex ID: W3021798710
cites work: On Lovász' lattice reduction and the nearest lattice point problem
cites work: An Improved Compression Technique for Signatures Based on Learning with Errors
cites work: Masking the GLP lattice-based signature scheme at any order
cites work: LWE without modular reduction and improved side-channel attacks against BLISS
cites work: Flush, Gauss, and reload -- a cache attack on the BLISS lattice-based signature scheme
cites work: Lattice Signatures and Bimodal Gaussians
cites work: Integral matrix Gram root and lattice Gaussian sampling without floats
cites work: Efficient Identity-Based Encryption over NTRU Lattices
cites work: Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures
cites work: Fast Fourier Orthogonalization
cites work: Loop-Abort Faults on Lattice-Based Signatures and Key Exchange Protocols
cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems
cites work: Symplectic Lattice Reduction and NTRU
cites work: Q4474162
cites work: Trapdoors for hard lattices and new cryptographic constructions
cites work: Q4737253
cites work: Q4364546
cites work: Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
cites work: Q4418531
cites work: Rounded Gaussians -- fast and secure constant-time sampling for lattice-based crypto
cites work: Constant-Time Discrete Gaussian Sampling
cites work: Q4952720
cites work: Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
cites work: Lattice Signatures without Trapdoors
cites work: Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices
cites work: A practical implementation of identity-based encryption over NTRU lattices
cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
cites work: Gaussian sampling over the integers: efficient, generic, constant-time
cites work: Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
cites work: An Efficient and Parallel Gaussian Sampler for Lattices
cites work: Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
cites work: One bit is all it takes: a devastating timing attack on BLISS's non-constant time sign flips
cites work: Learning strikes again: the case of the DRS signature scheme
description: scientific article; zbMATH DE number 7436940