Fast Fourier Orthogonalization over NTRU Lattices
From MaRDI portal
Publication:6487353
DOI10.1007/978-3-031-15777-6_7zbMath1512.94117MaRDI QIDQ6487353
Yongbin Zhou, Rui Zhang, Unnamed Author, Shuo Sun, Unnamed Author, Yang Tao
Publication date: 9 December 2022
Cryptography (94A60) Natural language processing (68T50) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Unnamed Item
- Integral matrix Gram root and lattice Gaussian sampling without floats
- Raptor: a practical lattice-based (linkable) ring signature
- Faster multiplication in \(\mathbb{Z}_{2^m}[x\) on Cortex-M4 to speed up NIST PQC candidates]
- Efficient Identity-Based Encryption over NTRU Lattices
- Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices
- Fast Fourier Orthogonalization
- Making NTRU as Secure as Worst-Case Problems over 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
- An Efficient and Parallel Gaussian Sampler for Lattices
- Generalized Compact Knapsacks Are Collision Resistant
- Fully homomorphic encryption using ideal lattices
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
This page was built for publication: Fast Fourier Orthogonalization over NTRU Lattices
