Revisiting Lattice Attacks on Overstretched NTRU Parameters
From MaRDI portal
Publication:5738868
DOI10.1007/978-3-319-56620-7_1zbMath1410.94084OpenAlexW2603065436MaRDI QIDQ5738868
Paul Kirchner, Pierre-Alain Fouque
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-56620-7_1
Related Items
Towards faster polynomial-time lattice reduction, Gadget-based iNTRU lattice trapdoors, NTRU Fatigue: How Stretched is Overstretched?, Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS, Flattening NTRU for evaluation key free homomorphic encryption, Characterizing overstretched NTRU attacks, A thorough treatment of highly-efficient NTRU instantiations, Shorter hash-and-sign lattice-based signatures, 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, On module unique-SVP and NTRU, D-NTRU: more efficient and average-case IND-CPA secure NTRU variant, Fast practical lattice reduction through iterated compression, On the hardness of the NTRU problem, Fast blind rotation for bootstrapping FHEs, Compact lattice gadget and its applications to hash-and-sign signatures, On the (M)iNTRU assumption in the integer case, Provably secure NTRUEncrypt over any cyclotomic field, A framework for cryptographic problems from linear algebra, On the ideal shortest vector problem over random rational primes, Algebraic Aspects of Solving Ring-LWE, Including Ring-Based Improvements in the Blum--Kalai--Wasserman Algorithm, Fast reduction of algebraic lattices over cyclotomic fields
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Homomorphic AES evaluation using the modified LTV scheme
- A hierarchy of polynomial time lattice basis reduction algorithms
- New bounds in some transference theorems in the geometry of numbers
- Implementing Candidate Graded Encoding Schemes from Ideal Lattices
- Practical, Predictable Lattice Basis Reduction
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Lattice Signatures and Bimodal Gaussians
- Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
- Efficient Identity-Based Encryption over NTRU Lattices
- Depth Optimized Efficient Homomorphic Sorting
- Private Computation on Encrypted Genomic Data
- 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
- Symplectic Lattice Reduction and NTRU
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- A Comparison of the Homomorphic Encryption Schemes FV and YASHE
- Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Advanced Lectures on Machine Learning
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
