A Subfield Lattice Attack on Overstretched NTRU Assumptions
From MaRDI portal
Publication:2835586
DOI10.1007/978-3-662-53018-4_6zbMATH Open1351.94019OpenAlexW2477092523MaRDI QIDQ2835586FDOQ2835586
Authors: Martin R. Albrecht, Shi Bai, Léo Ducas 
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
Recommendations
- Choosing parameters for the subfield lattice attack against overstretched NTRU
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- Subfield attacks on HSVP in ideal lattices
- Revisiting lower dimension lattice attacks on NTRU
- Lattice attacks on NTRU and LWE: a history of refinements
- A lattice attack on homomorphic NTRU with non-invertible public keys
- Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- Parallel symmetric attack on NTRU using non-deterministic lattice reduction
- Integer LWE with non-subgaussian error and related attacks
Cites Work
- BKZ 2.0: Better lattice security estimates
- Title not available (Why is that?)
- Title not available (Why is that?)
- A hierarchy of polynomial time lattice basis reduction algorithms
- On ideal lattices and learning with errors over rings
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Factoring polynomials with rational coefficients
- Efficient public key encryption based on ideal lattices (extended abstract)
- Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The probability that random algebraic integers are relatively \(r\)-prime
- Lattice signatures and bimodal Gaussians
- Practical multilinear maps over the integers
- Improved security for a ring-based fully homomorphic encryption scheme
- Making NTRU as secure as worst-case problems over ideal lattices
- Homomorphic AES evaluation using the modified LTV scheme
- A comparison of the homomorphic encryption schemes FV and YASHE
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Advances in cryptology -- CRYPTO 2013. 33rd annual cryptology conference, Santa Barbara, CA, USA, August 18--22, 2013. Proceedings, Part I
- Analyzing blockwise lattice algorithms using dynamical systems
- Finding short lattice vectors within Mordell's inequality
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- Revisiting the Gentry-Szydlo Algorithm
- Candidate Multilinear Maps from Ideal Lattices
- Title not available (Why is that?)
- How (not) to instantiate ring-LWE
- An improved BKW algorithm for LWE with applications to cryptography and lattices
- Title not available (Why is that?)
- Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
- A quantum algorithm for computing the unit group of an arbitrary degree number field
- Advances in cryptology - EUROCRYPT 2001. 20th international conference on theory and application of cryptographic techniques, Innsbruck, Austria, May 6--10, 2001. Proceedings
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- Recovering short generators of principal ideals in cyclotomic rings
- GGHLite: more efficient multilinear maps from ideal lattices
- Weak instances of PLWE
- Provably weak instances of ring-LWE revisited
- Provably weak instances of Ring-LWE
- Title not available (Why is that?)
- On the Mertens-Cesàro theorem for number fields
- Which ring based somewhat homomorphic encryption scheme is best?
- Subexponential class group and unit group computation in large degree number fields
- Choosing parameters for NTRUEncrypt
- Subexponential time relations in the class group of large degree number fields
- Implementing candidate graded encoding schemes from ideal lattices
- Advances in cryptology -- CRYPTO 2015. 35th annual cryptology conference, Santa Barbara, CA, USA, August 16--20, 2015. Proceedings. Part II
Cited In (59)
- A lattice attack on homomorphic NTRU with non-invertible public keys
- Provably secure NTRUEncrypt over any cyclotomic field
- Algebraic aspects of solving ring-LWE, including ring-based improvements in the Blum-Kalai-Wasserman algorithm
- Algorithmic acceleration of B/FV-like somewhat homomorphic encryption for compute-enabled RAM
- Provably secure NTRU instances over prime cyclotomic rings
- A framework for cryptographic problems from linear algebra
- Vulnerable public keys in NTRU cryptosystem
- One-shot verifiable encryption from lattices
- A full RNS variant of FV like somewhat homomorphic encryption schemes
- Subfield attacks on HSVP in ideal lattices
- NTRU Fatigue: How Stretched is Overstretched?
- Return of GGH15: provable security against zeroizing attacks
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
- How to meet ternary LWE keys
- A trace map attack against special ring-LWE samples
- Multi-key FHE from LWE, revisited
- Characterizing overstretched NTRU attacks
- Faster homomorphic encryption over GPGPUs via hierarchical DGT
- Revisiting lower dimension lattice attacks on NTRU
- On rectangular unimodular matrices over the algebraic integers
- Gadget-based iNTRU lattice trapdoors
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- On the ideal shortest vector problem over random rational primes
- On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
- A public-key encryption scheme based on non-linear indeterminate equations
- A practical post-quantum public-key cryptosystem based on spLWE
- Modular lattice signatures, revisited
- Constructions for quantum indistinguishability obfuscation
- Circuit-private multi-key FHE
- A thorough treatment of highly-efficient NTRU instantiations
- The whole is less than the sum of its parts: constructing more efficient lattice-based AKEs
- Somewhat/fully homomorphic encryption: implementation progresses and challenges
- Multikey fully homomorphic encryption and applications
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- Flattening NTRU for evaluation key free homomorphic encryption
- Towards faster polynomial-time lattice reduction
- On the hardness of the NTRU problem
- D-NTRU: more efficient and average-case IND-CPA secure NTRU variant
- On the (M)iNTRU assumption in the integer case
- Maliciously circuit-private multi-key FHE and MPC based on LWE
- FINAL: faster FHE instantiated with NTRU and LWE
- Cryptanalyses of Candidate Branching Program Obfuscators
- Choosing parameters for the subfield lattice attack against overstretched NTRU
- Fast reduction of algebraic lattices over cyclotomic fields
- On the security of functional encryption in the generic group model
- A polynomial time algorithm for breaking NTRU encryption with multiple keys
- Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions
- Ideal-SVP is hard for small-norm uniform prime ideals
- \textsc{Antrag}: annular NTRU trapdoor generation. Making \textsc{Mitaka} as secure as FALCON
- Memory-efficient attacks on small LWE keys
- Subfield algorithms for ideal- and module-SVP based on the decomposition group
- Message recovery attack on NTRU using a lattice independent from the public key
- An algebraic algorithm for breaking NTRU with multiple keys
- NTRU in Quaternion Algebras of Bounded Discriminant
- Fiat-Shamir signatures based on module-NTRU
- Memory-efficient attacks on small LWE keys
- Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping
Uses Software
This page was built for publication: A Subfield Lattice Attack on Overstretched NTRU Assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835586)
