Fast Fourier Orthogonalization over NTRU Lattices
From MaRDI portal
Publication:6487353
DOI10.1007/978-3-031-15777-6_7zbMATH Open1512.94117MaRDI QIDQ6487353FDOQ6487353
Authors: Shuo Sun, Yongbin Zhou, Rui Zhang, Yang Tao 
Publication date: 9 December 2022
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
Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Natural language processing (68T50)
Cites Work
- Title not available (Why is that?)
- Fully homomorphic encryption using ideal lattices
- Trapdoors for hard lattices and new cryptographic constructions
- Bonsai trees, or how to delegate a lattice basis
- Efficient lattice (H)IBE in the standard model
- Making NTRU as secure as worst-case problems over ideal lattices
- Generalized Compact Knapsacks Are Collision Resistant
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- An efficient and parallel Gaussian sampler for lattices
- Efficient identity-based encryption over NTRU lattices
- Faster multiplication in \(\mathbb{Z}_{2^m}[x]\) on Cortex-M4 to speed up NIST PQC candidates
- Fast Fourier orthogonalization
- Raptor: a practical lattice-based (linkable) ring signature
- Integral matrix Gram root and lattice Gaussian sampling without floats
- Quadratic time, linear space algorithms for Gram-Schmidt orthogonalization and Gaussian sampling in structured lattices
Cited In (5)
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)
