Fast Fourier Orthogonalization over NTRU Lattices
From MaRDI portal
Publication:6487353
Recommendations
- Shorter hash-and-sign lattice-based signatures
- Fast Fourier orthogonalization
- \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon}
- More efficient algorithms for the NTRU key generation using the field norm
- \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple
Cites work
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- An efficient and parallel Gaussian sampler for lattices
- Bonsai trees, or how to delegate a lattice basis
- Efficient identity-based encryption over NTRU lattices
- Efficient lattice (H)IBE in the standard model
- Fast Fourier orthogonalization
- Faster multiplication in \(\mathbb{Z}_{2^m}[x]\) on Cortex-M4 to speed up NIST PQC candidates
- Fully homomorphic encryption using ideal lattices
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Generalized Compact Knapsacks Are Collision Resistant
- Integral matrix Gram root and lattice Gaussian sampling without floats
- Making NTRU as secure as worst-case problems over ideal lattices
- Quadratic time, linear space algorithms for Gram-Schmidt orthogonalization and Gaussian sampling in structured lattices
- Raptor: a practical lattice-based (linkable) ring signature
- Trapdoors for hard lattices and new cryptographic constructions
Cited in
(5)- NFLlib: NTT-Based Fast Lattice Library
- Fast Falcon signature generation and verification using ARMv8 NEON instructions
- Fast Fourier orthogonalization
- scientific article; zbMATH DE number 3850444 (Why is no real title available?)
- Closed-Form Orthogonal Number Theoretic Transform Eigenvectors and the Fast Fractional NTT
This page was built for publication: Fast Fourier Orthogonalization over NTRU Lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487353)
