An algebraic algorithm for breaking NTRU with multiple keys

DOI10.1007/S10623-024-01473-ZMaRDI QIDQ6651896zbMATH OpenFDO

Authors Shi Bai, Hansraj Jangir, Tran Ngo, William Youmans

Publication date 11 December 2024

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

Full work available at URL https://doi.org/10.1007/S10623-024-01473-Z

zbMATH Keywords

cryptanalysislattice-based cryptographylinearizationNTRU problem with multiple keys

Mathematics Subject Classification ID

Computational learning theory (68Q32) Analysis of algorithms (68W40) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1722678
• An algebraic broadcast attack against NTRU
• scientific article; zbMATH DE number 2043328
• Vulnerable public keys in NTRU cryptosystem
• scientific article; zbMATH DE number 1186948

Cites work

• A decade of lattice cryptography
• A hierarchy of polynomial time lattice basis reduction algorithms
• A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
• A polynomial time algorithm for breaking NTRU encryption with multiple keys
• A Subfield Lattice Attack on Overstretched NTRU Assumptions
• Analyzing blockwise lattice algorithms using dynamical systems
• Choosing parameters for NTRUEncrypt
• Fiat-Shamir signatures based on module-NTRU
• scientific article; zbMATH DE number 1722680 (Why is no real title available?)
• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• scientific article; zbMATH DE number 1962147 (Why is no real title available?)
• scientific article; zbMATH DE number 2086714 (Why is no real title available?)
• Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
• Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
• Lattice-Based Cryptography
• Making NTRU as secure as worst-case problems over ideal lattices
• New Algorithms for Learning in Presence of Errors
• NTRU Fatigue: How Stretched is Overstretched?
• NTRU prime: reducing attack surface at low cost
• On lattices, learning with errors, random linear codes, and cryptography
• On the hardness of the NTRU problem
• Predicting Lattice Reduction
• Revisiting Lattice Attacks on Overstretched NTRU Parameters
• Revisiting lower dimension lattice attacks on NTRU
• Revisiting the expected cost of solving uSVP and applications to LWE
• Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
• Shorter lattice-based zero-knowledge proofs via one-time commitments

Cited in

(1)

• Giant does not mean strong: cryptanalysis of BQTRU

This page was built for publication: An algebraic algorithm for breaking NTRU with multiple keys

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