ETRU: NTRU over the Eisenstein integers

DOI10.1007/s10623-013-9850-3zbMath1303.94085OpenAlexW1966244415MaRDI QIDQ488263

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

zbMATH Keywords

public-key cryptographylattice-based cryptographyNTRUEisenstein integers

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

NTRU Algorithm: Nth Degree Truncated Polynomial Ring Units, A non-commutative cryptosystem based on quaternion algebras, NTRU over Galois rings, D-NTRU: more efficient and average-case IND-CPA secure NTRU variant, ETRU: NTRU over the Eisenstein integers, ETRU

Uses Software

• NTL
• BKZ
• SWIFFT
• NTRU
• MaTRU

Cites Work

• Unnamed Item
• Unnamed Item
• ETRU: NTRU over the Eisenstein integers
• NTRU over rings beyond \(\mathbb{Z}\)
• A hierarchy of polynomial time lattice basis reduction algorithms
• Factoring polynomials with rational coefficients
• The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
• Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
• BKZ 2.0: Better Lattice Security Estimates
• SWIFFT: A Modest Proposal for FFT Hashing
• On Ideal Lattices and Learning with Errors over Rings
• 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
• MaTRU: A New NTRU-Based Cryptosystem
• Predicting Lattice Reduction
• An Introduction to Mathematical Cryptography
• New Chosen-Ciphertext Attacks on NTRU