ETRU: NTRU over the Eisenstein integers
From MaRDI portal
Publication:488263
DOI10.1007/S10623-013-9850-3zbMATH Open1303.94085OpenAlexW1966244415MaRDI QIDQ488263FDOQ488263
Katherine Jarvis, Monica Nevins
Publication date: 23 January 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-013-9850-3
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- BKZ 2.0: Better Lattice Security Estimates
- SWIFFT: A Modest Proposal for FFT Hashing
- ETRU: NTRU over the Eisenstein integers
- MaTRU: A New NTRU-Based Cryptosystem
- A hierarchy of polynomial time lattice basis reduction algorithms
- On Ideal Lattices and Learning with Errors over Rings
- Factoring polynomials with rational coefficients
- Predicting Lattice Reduction
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
- The shortest vector in a lattice is hard to approximate to within some constant
- New Chosen-Ciphertext Attacks on NTRU
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- Hermite’s Constant and Lattice Algorithms
- Practical Lattice-Based Cryptography: NTRUEncrypt and NTRUSign
- An Introduction to Mathematical Cryptography
- NTRU over rings beyond \(\mathbb{Z}\)
Cited In (7)
- ETRU
- ETRU: NTRU over the Eisenstein integers
- A non-commutative cryptosystem based on quaternion algebras
- NTRU Algorithm: Nth Degree Truncated Polynomial Ring Units
- NTRU in Quaternion Algebras of Bounded Discriminant
- NTRU over Galois rings
- D-NTRU: more efficient and average-case IND-CPA secure NTRU variant
Uses Software
This page was built for publication: ETRU: NTRU over the Eisenstein integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q488263)
