Fast Fourier Orthogonalization

DOI10.1145/2930889.2930923zbMath1365.65105OpenAlexW2478290527MaRDI QIDQ2985827

Thomas Prest, Léo Ducas

Publication date: 10 May 2017

Published in: Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/24688

zbMATH Keywords

complexityfast Fourier transformcryptographyGram-Schmidt orthogonalizationorthogonalizationcirculant matricesperformancesmatrix factorizationlattice algorithmsGram-Schmidt decompositionnearest plane algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05) Orthogonalization in numerical linear algebra (65F25)

Related Items (13)

Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions ⋮ Gadget-based iNTRU lattice trapdoors ⋮ Faster Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon} ⋮ Towards a Simpler Lattice Gadget Toolkit ⋮ Improved power analysis attacks on Falcon ⋮ Shorter hash-and-sign lattice-based signatures ⋮ \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple ⋮ BLOOM: bimodal lattice one-out-of-many proofs and applications ⋮ Compact lattice gadget and its applications to hash-and-sign signatures ⋮ Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices ⋮ Implementation of lattice trapdoors on modules and applications ⋮ Integral matrix Gram root and lattice Gaussian sampling without floats

This page was built for publication: Fast Fourier Orthogonalization