NEV: faster and smaller NTRU encryption using vector decoding
From MaRDI portal
Publication:6595920
DOI10.1007/978-981-99-8739-9_6zbMATH Open1547.94437MaRDI QIDQ6595920
Jiang Zhang, Di Yan, Dengguo Feng
Publication date: 30 August 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the concrete hardness of learning with errors
- IND-CCA-secure key encapsulation mechanism in the quantum random oracle model, revisited
- New bounds in some transference theorems in the geometry of numbers
- A modular analysis of the Fujisaki-Okamoto transformation
- (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes
- Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes
- Lossiness and entropic hardness for ring-LWE
- LWE with side information: attacks and concrete security estimation
- Online-extractability in the quantum random-oracle model
- Tighter proofs of CCA security in the quantum random oracle model
- When NTT meets Karatsuba: preprocess-then-NTT technique revisited
- Optimizations for NTRU
- Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance
- Efficient Identity-Based Encryption over NTRU Lattices
- Towards Practical Lattice-Based Public-Key Encryption on Reconfigurable Hardware
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- On Ideal Lattices and Learning with Errors over Rings
- An Efficient and Parallel Gaussian Sampler for Lattices
- Efficient Public Key Encryption Based on Ideal Lattices
- Secure integration of asymmetric and symmetric encryption schemes
- Speed Records for NTRU
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Advances in Cryptology - CRYPTO 2003
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- New Chosen-Ciphertext Attacks on NTRU
- On lattices, learning with errors, random linear codes, and cryptography
- NTRU Fatigue: How Stretched is Overstretched?
- A thorough treatment of highly-efficient NTRU instantiations
- On the hardness of the NTRU problem
- Error correction and ciphertext quantization in lattice cryptography
This page was built for publication: NEV: faster and smaller NTRU encryption using vector decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595920)
