More efficient algorithms for the NTRU key generation using the field norm
From MaRDI portal
Publication:2289442
DOI10.1007/978-3-030-17259-6_17OpenAlexW2920399571MaRDI QIDQ2289442FDOQ2289442
Authors: Thomas Pornin, Thomas Prest 
Publication date: 28 January 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-17259-6_17
Recommendations
- NTRU algorithm: N\textsuperscript{th} degree truncated polynomial ring units
- Practical lattice-based cryptography: \texttt{NTRUEncrypt} and \texttt{NTRUSign}
- scientific article; zbMATH DE number 1962147
- Algorithms for the Generalized NTRU Equations and their Storage Analysis
- Symplectic Lattice Reduction and NTRU
Cited In (14)
- Fast Fourier Orthogonalization over NTRU Lattices
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
- Algorithms for the Generalized NTRU Equations and their Storage Analysis
- \textsc{Antrag}: annular NTRU trapdoor generation. Making \textsc{Mitaka} as secure as FALCON
- Improvement of key generation for a number field based knapsack cryptosystem
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon}
- A refined hardness estimation of LWE in two-step mode
- \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple
- A key-recovery attack against Mitaka in the \(t\)-probing model
- D-NTRU: more efficient and average-case IND-CPA secure NTRU variant
- Theoretical and empirical analysis of FALCON and SOLMAE using their Python implementation
- Symplectic Lattice Reduction and NTRU
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2289442)
