A Lattice Attack on Homomorphic NTRU with Non-invertible Public Keys

DOI10.1007/978-3-319-89500-0_22zbMath1452.94059OpenAlexW2796784884MaRDI QIDQ3297504

Seongan Lim, Soyoung Ahn, Hyang-Sook Lee, Ikkwon Yie

Publication date: 20 July 2020

Published in: Information and Communications Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-89500-0_22

zbMATH Keywords

latticesLLL algorithmNTRUhomomorphic NTRUIND-CPA security

Mathematics Subject Classification ID

Cryptography (94A60)

Uses Software

• NTRU

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring polynomials with rational coefficients
• A Subfield Lattice Attack on Overstretched NTRU Assumptions
• Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
• 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
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption

This page was built for publication: A Lattice Attack on Homomorphic NTRU with Non-invertible Public Keys