More efficient algorithms for the NTRU key generation using the field norm

DOI10.1007/978-3-030-17259-6_17OpenAlexW2920399571MaRDI QIDQ2289442

Thomas Prest, Thomas Pornin

Publication date: 28 January 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-17259-6_17

zbMATH Keywords

NTRU latticessignature algorithms

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices ⋮ \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon} ⋮ A key-recovery attack against Mitaka in the \(t\)-probing model ⋮ \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple ⋮ Algorithms for the Generalized NTRU Equations and their Storage Analysis ⋮ Fast reduction of algebraic lattices over cyclotomic fields

This page was built for publication: More efficient algorithms for the NTRU key generation using the field norm