Provably Secure NTRU Instances over Prime Cyclotomic Rings

DOI10.1007/978-3-662-54365-8_17zbMath1404.94122OpenAlexW2589145172MaRDI QIDQ5738796

Guangwu Xu, Xiaoyun Wang, Yang Yu

Publication date: 13 June 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/28281

zbMATH Keywords

provable securitylattice-based cryptographyNTRUlearning with errors

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

A polynomial time algorithm for breaking NTRU encryption with multiple keys ⋮ D-NTRU: more efficient and average-case IND-CPA secure NTRU variant ⋮ Lattice-based cryptography: a survey ⋮ Provably secure NTRUEncrypt over any cyclotomic field ⋮ On the distribution of low Hamming weight products

Uses Software

• NTRU
• NTRUSign
• ring-LWE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A tail inequality for quadratic forms of subgaussian random vectors
• Limits on the hardness of lattice problems in \(\ell_{p}\) norms
• Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
• A Subfield Lattice Attack on Overstretched NTRU Assumptions
• Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
• Lower Bounds of Shortest Vector Lengths in Random NTRU Lattices
• Ring-LWE in Polynomial Rings
• Efficient Identity-Based Encryption over NTRU Lattices
• An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
• Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
• Trapdoors for hard lattices and new cryptographic constructions
• On Ideal Lattices and Learning with Errors over Rings
• Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
• A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
• Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures
• Candidate Multilinear Maps from Ideal Lattices
• A Toolkit for Ring-LWE Cryptography
• Fully homomorphic encryption using ideal lattices
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• GGHLite: More Efficient Multilinear Maps from Ideal Lattices
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• Short Stickelberger Class Relations and Application to Ideal-SVP
• New Chosen-Ciphertext Attacks on NTRU
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Provably Secure NTRU Instances over Prime Cyclotomic Rings