A thorough treatment of highly-efficient NTRU instantiations
From MaRDI portal
Publication:6091128
DOI10.1007/978-3-031-31368-4_3zbMath1527.94035OpenAlexW3204214465WikidataQ126176073 ScholiaQ126176073MaRDI QIDQ6091128
Julien Duman, Eike Kiltz, Kathrin Hövelmanns, Gregor Seiler, Vadim Lyubashevsky, Dominique Unruh
Publication date: 24 November 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-31368-4_3
Cites Work
- Unnamed Item
- Unnamed Item
- On the concrete hardness of learning with errors
- On the hardness of module-LWE with binary secret
- Shortest vector from lattice sieving: a few dimensions for free
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Saber: module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM
- A modular analysis of the Fujisaki-Okamoto transformation
- The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
- Online-extractability in the quantum random-oracle model
- Quantum security proofs using semi-classical oracles
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- Worst-case to average-case reductions for module lattices
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
- Revocable Quantum Timed-Release Encryption
- On Ideal Lattices and Learning with Errors over Rings
- Generalized Compact Knapsacks Are Collision Resistant
- Efficient Public Key Encryption Based on Ideal Lattices
- High-Speed Key Encapsulation from NTRU
- Classical hardness of learning with errors
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- On lattices, learning with errors, random linear codes, and cryptography
- NTRU Fatigue: How Stretched is Overstretched?
This page was built for publication: A thorough treatment of highly-efficient NTRU instantiations
