An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
From MaRDI portal
Publication:2971014
DOI10.1112/S1461157016000371zbMath1404.94053MaRDI QIDQ2971014
Jinhyuck Jeong, Jung Hee Cheon, Changmin Lee
Publication date: 4 April 2017
Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items
A trace map attack against special ring-LWE samples ⋮ The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks ⋮ Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions ⋮ From minicrypt to obfustopia via private-key functional encryption ⋮ From FE combiners to secure MPC and back ⋮ Attribute based encryption for deterministic finite automata from DLIN ⋮ NTRU Fatigue: How Stretched is Overstretched? ⋮ Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings ⋮ Characterizing overstretched NTRU attacks ⋮ A thorough treatment of highly-efficient NTRU instantiations ⋮ 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 ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ On the hardness of the NTRU problem ⋮ Public key encryption with equality test from generic assumptions in the random oracle model ⋮ Collusion Resistant Traitor Tracing from Learning with Errors ⋮ A Practical Post-Quantum Public-Key Cryptosystem Based on $$\textsf {spLWE}$$ ⋮ Provably secure NTRUEncrypt over any cyclotomic field ⋮ A Lattice Attack on Homomorphic NTRU with Non-invertible Public Keys ⋮ Provably Secure NTRU Instances over Prime Cyclotomic Rings ⋮ Revisiting Lattice Attacks on Overstretched NTRU Parameters ⋮ From Minicrypt to Obfustopia via Private-Key Functional Encryption ⋮ One-Shot Verifiable Encryption from Lattices ⋮ Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions ⋮ A framework for cryptographic problems from linear algebra ⋮ Can PPAD hardness be based on standard cryptographic assumptions? ⋮ Generalized Hardness Assumption for Self-bilinear Map with Auxiliary Information ⋮ Optimal broadcast encryption from pairings and LWE ⋮ Combiners for functional encryption, unconditionally ⋮ 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 ⋮ A Subfield Lattice Attack on Overstretched NTRU Assumptions ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation ⋮ 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
- Implementing Candidate Graded Encoding Schemes from Ideal Lattices
- Cryptanalysis of the New CLT Multilinear Map over the Integers
- Cryptanalysis of GGH Map
- Cryptanalysis of GGH15 Multilinear Maps
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Lattice Signatures and Bimodal Gaussians
- Practical Multilinear Maps over the Integers
- New Multilinear Maps Over the Integers
- Candidate Multilinear Maps from Ideal Lattices
- GGHLite: More Efficient Multilinear Maps from Ideal Lattices
