On the Efficiency of Provably Secure NTRU

DOI10.1007/978-3-319-11659-4_2zbMath1306.94036OpenAlexW103701422MaRDI QIDQ2938672

Patrick Weiden, Daniel Cabarcas, Johannes A. Buchmann

Publication date: 14 January 2015

Published in: Post-Quantum Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-11659-4_2

zbMATH Keywords

latticeefficiencypublic-key encryptionlearning with errorsdiscrete Gaussian distributionNTRUEncrypt

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (3)

High-Performance Ideal Lattice-Based Cryptography on 8-Bit ATxmega Microcontrollers ⋮ D-NTRU: more efficient and average-case IND-CPA secure NTRU variant ⋮ Provably secure NTRUEncrypt over any cyclotomic field

This page was built for publication: On the Efficiency of Provably Secure NTRU