A Subfield Lattice Attack on Overstretched NTRU Assumptions
From MaRDI portal
Publication:2835586
DOI10.1007/978-3-662-53018-4_6zbMath1351.94019OpenAlexW2477092523MaRDI QIDQ2835586
Léo Ducas, Martin R. Albrecht, Shi Bai
Publication date: 30 November 2016
Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53018-4_6
Related Items
How to meet ternary LWE keys ⋮ Towards faster polynomial-time lattice reduction ⋮ A trace map attack against special ring-LWE samples ⋮ Algorithmic acceleration of B/FV-like somewhat homomorphic encryption for compute-enabled RAM ⋮ The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks ⋮ Return of GGH15: provable security against zeroizing attacks ⋮ Constructions for quantum indistinguishability obfuscation ⋮ Multi-key FHE from LWE, Revisited ⋮ Faster homomorphic encryption over GPGPUs via hierarchical DGT ⋮ Gadget-based iNTRU lattice trapdoors ⋮ Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions ⋮ NTRU Fatigue: How Stretched is Overstretched? ⋮ Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings ⋮ Flattening NTRU for evaluation key free homomorphic encryption ⋮ Characterizing overstretched NTRU attacks ⋮ A thorough treatment of highly-efficient NTRU instantiations ⋮ On the security of functional encryption in the generic group model ⋮ Revisiting lower dimension lattice attacks on NTRU ⋮ Fiat-Shamir signatures based on module-NTRU ⋮ A polynomial time algorithm for breaking NTRU encryption with multiple keys ⋮ FINAL: faster FHE instantiated with NTRU and LWE ⋮ Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping ⋮ Subfield attacks on HSVP in ideal lattices ⋮ D-NTRU: more efficient and average-case IND-CPA secure NTRU variant ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ On the hardness of the NTRU problem ⋮ A full RNS variant of FV like somewhat homomorphic encryption schemes ⋮ Subfield algorithms for ideal- and module-SVP based on the decomposition group ⋮ An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero ⋮ Maliciously circuit-private multi-key FHE and MPC based on LWE ⋮ A Practical Post-Quantum Public-Key Cryptosystem Based on $$\textsf {spLWE}$$ ⋮ On Rectangular Unimodular Matrices over the Algebraic Integers ⋮ Provably secure NTRUEncrypt over any cyclotomic field ⋮ A Lattice Attack on Homomorphic NTRU with Non-invertible Public Keys ⋮ A public-key encryption scheme based on non-linear indeterminate equations ⋮ Vulnerable public keys in NTRU cryptosystem ⋮ Circuit-Private Multi-key FHE ⋮ Provably Secure NTRU Instances over Prime Cyclotomic Rings ⋮ Revisiting Lattice Attacks on Overstretched NTRU Parameters ⋮ One-Shot Verifiable Encryption from Lattices ⋮ On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL ⋮ Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges ⋮ A framework for cryptographic problems from linear algebra ⋮ Modular lattice signatures, revisited ⋮ On the ideal shortest vector problem over random rational primes ⋮ The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs ⋮ Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13 ⋮ Algebraic Aspects of Solving Ring-LWE, Including Ring-Based Improvements in the Blum--Kalai--Wasserman Algorithm ⋮ Fast reduction of algebraic lattices over cyclotomic fields ⋮ Cryptanalyses of Candidate Branching Program Obfuscators
Uses Software
Cites Work
- Homomorphic AES evaluation using the modified LTV scheme
- Advances in cryptology -- CRYPTO 2013. 33rd annual cryptology conference, Santa Barbara, CA, USA, August 18--22, 2013. Proceedings, Part I
- Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x\) and some cryptographic applications]
- The probability that random algebraic integers are relatively \(r\)-prime
- A hierarchy of polynomial time lattice basis reduction algorithms
- Factoring polynomials with rational coefficients
- Subexponential time relations in the class group of large degree number fields
- Advances in cryptology -- CRYPTO 2015. 35th annual cryptology conference, Santa Barbara, CA, USA, August 16--20, 2015. Proceedings. Part II
- Implementing Candidate Graded Encoding Schemes from Ideal Lattices
- Weak Instances of PLWE
- Which Ring Based Somewhat Homomorphic Encryption Scheme is Best?
- ON THE MERTENS–CESÀRO THEOREM FOR NUMBER FIELDS
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Provably Weak Instances of Ring-LWE Revisited
- How (Not) to Instantiate Ring-LWE
- Lattice Signatures and Bimodal Gaussians
- Practical Multilinear Maps over the Integers
- Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
- Revisiting the Gentry-Szydlo Algorithm
- Subexponential class group and unit group computation in large degree number fields
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- Choosing Parameters for NTRUEncrypt
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
- BKZ 2.0: Better Lattice Security Estimates
- An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
- Provably Weak Instances of Ring-LWE
- On Ideal Lattices and Learning with Errors over Rings
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- Efficient Public Key Encryption Based on Ideal Lattices
- Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
- Candidate Multilinear Maps from Ideal Lattices
- A Comparison of the Homomorphic Encryption Schemes FV and YASHE
- Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
- A quantum algorithm for computing the unit group of an arbitrary degree number field
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- GGHLite: More Efficient Multilinear Maps from Ideal Lattices
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Recovering Short Generators of Principal Ideals in Cyclotomic Rings
- Advances in cryptology - EUROCRYPT 2001. 20th international conference on theory and application of cryptographic techniques, Innsbruck, Austria, May 6--10, 2001. Proceedings
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
