Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices

DOI10.1007/978-3-662-46800-5_30zbMath1370.94532OpenAlexW2151785200MaRDI QIDQ2948355

Publication date: 30 September 2015

Published in: Advances in Cryptology -- EUROCRYPT 2015 (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01235176/file/Fast_Gram_Schmidt_paper.pdf

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Cryptography (94A60)

Related Items (4)

Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space ⋮ A Linear Algebra Attack on the Non-commuting Cryptography Class Based on Matrix Power Function ⋮ Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices ⋮ The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs

Uses Software

mctoolbox

This page was built for publication: Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices