NTRU over rings beyond \(\mathbb{Z}\)

DOI10.1007/s10623-009-9342-7zbMath1200.94050OpenAlexW2040765034MaRDI QIDQ977194

Camelia KarimianPour, Monica Nevins, Ali Miri

Publication date: 21 June 2010

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-009-9342-7

zbMATH Keywords

public-key cryptographyNTRUEisenstein integers

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Integral domains (13G05)

Related Items (6)

NTRU Algorithm: Nth Degree Truncated Polynomial Ring Units ⋮ A non-commutative cryptosystem based on quaternion algebras ⋮ Efficient Nyberg-Rueppel type of NTRU digital signature algorithm ⋮ ETRU: NTRU over the Eisenstein integers ⋮ A new NTRU cryptosystem outperforms three highly secured NTRU-analog systems through an innovational algebraic structure ⋮ Cryptanalysis of ITRU

Uses Software

• NTRU
• MaTRU

Cites Work

• The Euclidean algorithm in algebraic number fields
• A Characterization of Polynomial Domains Over a Field
• MaTRU: A New NTRU-Based Cryptosystem
• An Introduction to Mathematical Cryptography
• Topics in Cryptology – CT-RSA 2005
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: NTRU over rings beyond \(\mathbb{Z}\)