An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
From MaRDI portal
Publication:2971014
Recommendations
- Cryptanalysis of NTRU where the private polynomial has one or more consecutive zero coefficients
- More efficient algorithms for the NTRU key generation using the field norm
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- NTRU algorithm: N\textsuperscript{th} degree truncated polynomial ring units
- Vulnerable public keys in NTRU cryptosystem
Cites work
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Candidate Multilinear Maps from Ideal Lattices
- Cryptanalysis of GGH map
- Cryptanalysis of GGH15 multilinear maps
- Cryptanalysis of the new CLT multilinear map over the integers
- GGHLite: more efficient multilinear maps from ideal lattices
- Implementing candidate graded encoding schemes from ideal lattices
- Lattice signatures and bimodal Gaussians
- New Multilinear Maps Over the Integers
- Practical multilinear maps over the integers
Cited in
(41)- Fast reduction of algebraic lattices over cyclotomic fields
- Combiners for functional encryption, unconditionally
- Collusion resistant traitor tracing from learning with errors
- From Minicrypt to Obfustopia via private-key functional encryption
- Multikey fully homomorphic encryption and applications
- NTRU Fatigue: How Stretched is Overstretched?
- One-shot verifiable encryption from lattices
- A thorough treatment of highly-efficient NTRU instantiations
- A practical post-quantum public-key cryptosystem based on spLWE
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
- Attribute based encryption for deterministic finite automata from DLIN
- Characterizing overstretched NTRU attacks
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- A polynomial time algorithm for breaking NTRU encryption with multiple keys
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- Generalized hardness assumption for self-bilinear map with auxiliary information
- Optimal broadcast encryption from pairings and LWE
- On the ideal shortest vector problem over random rational primes
- A lattice attack on homomorphic NTRU with non-invertible public keys
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
- From FE combiners to secure MPC and back
- Message recovery attack on NTRU using a lattice independent from the public key
- FINAL: faster FHE instantiated with NTRU and LWE
- Provably secure NTRUEncrypt over any cyclotomic field
- From minicrypt to obfustopia via private-key functional encryption
- Provably secure NTRU instances over prime cyclotomic rings
- Cryptanalyses of Candidate Branching Program Obfuscators
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
- \textsc{Antrag}: annular NTRU trapdoor generation. Making \textsc{Mitaka} as secure as FALCON
- A trace map attack against special ring-LWE samples
- Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping
- Can PPAD hardness be based on standard cryptographic assumptions?
- Public key encryption with equality test from generic assumptions in the random oracle model
- A framework for cryptographic problems from linear algebra
- On the hardness of the NTRU problem
- Algebraic aspects of solving ring-LWE, including ring-based improvements in the Blum-Kalai-Wasserman algorithm
- The whole is less than the sum of its parts: constructing more efficient lattice-based AKEs
- Functional encryption: deterministic to randomized functions from simple assumptions
- Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions
- Ideal-SVP is hard for small-norm uniform prime ideals
This page was built for publication: An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2971014)
