NTRU in Quaternion Algebras of Bounded Discriminant
From MaRDI portal
Publication:6493389
DOI10.1007/978-3-031-40003-2_10MaRDI QIDQ6493389
Publication date: 26 April 2024
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Quaternion and other division algebras: arithmetic, zeta functions (11R52) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quotients of orders in cyclic algebras and space-time codes
- ETRU: NTRU over the Eisenstein integers
- NTRU over rings beyond \(\mathbb{Z}\)
- A non-commutative cryptosystem based on quaternion algebras
- Provably secure NTRUEncrypt over any cyclotomic field
- NTRU prime: reducing attack surface at low cost
- Discretisation and product distributions in ring-LWE
- Non-commutative ring learning with errors from cyclic algebras
- Approximate trapdoors for lattices and smaller hash-and-sign signatures
- \(\delta\)-subgaussian random variables in cryptography
- Another look at tightness. II: Practical issues in cryptography
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Transcript Secure Signatures Based on Modular Lattices
- Choosing Parameters for NTRUEncrypt
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- EUCLIDEAN MINIMA AND CENTRAL DIVISION ALGEBRAS
- On the Densest MIMO Lattices From Cyclic Division Algebras
- Fast Multiplication for Skew Polynomials
- Quaternion Algebras
- Advances in Cryptology - CRYPTO 2003
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Topics in Cryptology – CT-RSA 2005
- Number fields
- On module unique-SVP and NTRU
- On the hardness of the NTRU problem
- Entropic hardness of Module-LWE from module-NTRU
This page was built for publication: NTRU in Quaternion Algebras of Bounded Discriminant
