A generalization of NTRUEncrypt

DOI10.1007/978-981-99-2366-3_6MaRDI QIDQ6608565FDOQ6608565

Authors: Liu Fengxia, Huang Wenlin, Xu Jie, Tian Kun 

Publication date: 20 September 2024

Recommendations

• Making NTRU as secure as worst-case problems over ideal lattices
• Provably secure NTRUEncrypt over any cyclotomic field
• NTRU over rings beyond \(\mathbb{Z}\)
• Provably secure NTRU instances over prime cyclotomic rings
• Practical lattice-based cryptography: \texttt{NTRUEncrypt} and \texttt{NTRUSign}

zbMATH Keywords

NTRUideal matrices\(\phi\)-cyclic codeconvolutional modular lattice

Mathematics Subject Classification ID

Cryptography (94A60) Cyclic codes (94B15) Lattices and convex bodies (number-theoretic aspects) (11H06) Number-theoretic algorithms; complexity (11Y16) Other types of codes (94B60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Dual generalizations of the concept of cyclicity of codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lattice-based Cryptography
• Title not available (Why is that?)
• Making NTRU as secure as worst-case problems over ideal lattices
• Generalized Compact Knapsacks Are Collision Resistant
• Title not available (Why is that?)
• Choosing parameters for NTRUEncrypt

This page was built for publication: A generalization of NTRUEncrypt

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