A generalization of NTRUEncrypt

DOI10.1007/978-981-99-2366-3_6MaRDI QIDQ6608565zbMATH OpenFDO

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

Publication date 20 September 2024

Full work available at URL https://doi.org/10.1007/978-981-99-2366-3_6

zbMATH Keywords

\(\phi\)-cyclic codeconvolutional modular latticeideal matricesNTRU

Mathematics Subject Classification ID

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

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}

Cites work

• Choosing parameters for NTRUEncrypt
• Dual generalizations of the concept of cyclicity of codes
• Generalized Compact Knapsacks Are Collision Resistant
• scientific article; zbMATH DE number 3989251 (Why is no real title available?)
• scientific article; zbMATH DE number 1185220 (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 1250549 (Why is no real title available?)
• scientific article; zbMATH DE number 1559544 (Why is no real title available?)
• scientific article; zbMATH DE number 1852141 (Why is no real title available?)
• Lattice-based Cryptography
• Making NTRU as secure as worst-case problems over ideal lattices

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)