NTRU in Quaternion Algebras of Bounded Discriminant

DOI10.1007/978-3-031-40003-2_10MaRDI QIDQ6493389zbMATH OpenFDO

Authors Cong Ling, Andrew Mendelsohn

Publication date 26 April 2024

Full work available at URL https://doi.org/10.1007/978-3-031-40003-2_10

Mathematics Subject Classification ID

Quaternion and other division algebras: arithmetic, zeta functions (11R52) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Recommendations

• Making NTRU as secure as worst-case problems over ideal lattices
• A variant of NTRU with split quaternions algebra
• Provably secure NTRUEncrypt over any cyclotomic field
• BI-NTRU encryption schemes: two new secure variants of NTRU
• A non-commutative cryptosystem based on quaternion algebras

Cites work

• -subgaussian random variables in cryptography
• A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
• A non-commutative cryptosystem based on quaternion algebras
• A Subfield Lattice Attack on Overstretched NTRU Assumptions
• Advances in Cryptology - CRYPTO 2003
• Another look at tightness. II: Practical issues in cryptography
• Approximate trapdoors for lattices and smaller hash-and-sign signatures
• Choosing parameters for NTRUEncrypt
• Discretisation and product distributions in ring-LWE
• Entropic hardness of Module-LWE from module-NTRU
• ETRU: NTRU over the Eisenstein integers
• EUCLIDEAN MINIMA AND CENTRAL DIVISION ALGEBRAS
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Fast Multiplication for Skew Polynomials
• scientific article; zbMATH DE number 5485483 (Why is no real title available?)
• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• scientific article; zbMATH DE number 1955782 (Why is no real title available?)
• scientific article; zbMATH DE number 3037565 (Why is no real title available?)
• Introduction to modern cryptography.
• Making NTRU as secure as worst-case problems over ideal lattices
• Non-commutative ring learning with errors from cyclic algebras
• NTRU over rings beyond \(\mathbb{Z}\)
• NTRU prime: reducing attack surface at low cost
• Number fields
• On module unique-SVP and NTRU
• On the Densest MIMO Lattices From Cyclic Division Algebras
• On the hardness of the NTRU problem
• Provably secure NTRUEncrypt over any cyclotomic field
• Quaternion algebras
• Quotients of orders in cyclic algebras and space-time codes
• Topics in Cryptology – CT-RSA 2005
• Transcript secure signatures based on modular lattices
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

Cited in

(6)

• Middle-products of skew polynomials and learning with errors
• A reduction from Hawk to the principal ideal problem in a quaternion algebra
• Giant does not mean strong: cryptanalysis of BQTRU
• DiTRU: a resurrection of NTRU over dihedral group
• \textsf{ABBA}: lattice-based commitments from commutators
• Learning with errors from nonassociative algebras

This page was built for publication: NTRU in Quaternion Algebras of Bounded Discriminant

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6493389)