NTRU prime: reducing attack surface at low cost
From MaRDI portal
(Redirected from Publication:1746970)
Recommendations
- On the efficiency of provably secure NTRU
- Characterizing overstretched NTRU attacks
- Reduced memory meet-in-the-middle attack against the NTRU private key
- Revisiting lower dimension lattice attacks on NTRU
- Low-cost solutions for preventing simple side-channel analysis: side-channel atomicity
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- Towards closing the security gap of Tweak-aNd-Tweak (TNT)
- From Passive to Covert Security at Low Cost
- Preventing scaling of successful attacks: a cross-layer security architecture for resource-constrained platforms
Cites work
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1962809 (Why is no real title available?)
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- A key recovery attack on MDPC with CCA security using decoding errors
- Advances in Cryptology - CRYPTO 2003
- BKZ 2.0: Better lattice security estimates
- Batch Binary Edwards
- Choosing parameters for NTRUEncrypt
- Cryptography and Coding
- Cryptography and Coding
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
- Fast implementation of Curve25519 using AVX2
- Finding shortest lattice vectors faster using quantum search
- Flush, Gauss, and reload -- a cache attack on the BLISS lattice-based signature scheme
- High-speed key encapsulation from NTRU
- Lattice signatures and bimodal Gaussians
- Learning with rounding, revisited. New reduction, properties and applications
- Making NTRU as secure as worst-case problems over ideal lattices
- Middle-product Learning with Errors
- NTRU prime: reducing attack surface at low cost
- New Algorithms for Learning in Presence of Errors
- Non-uniform cracks in the concrete: the power of free precomputation
- OAEP reconsidered
- On ideal lattices and learning with errors over rings
- On the hardness of learning with rounding over small modulus
- Parallel collision search with cryptanalytic applications
- Pseudorandom functions and lattices
- Pseudorandomness of ring-LWE for any ring and modulus
- Public-key cryptosystems from the worst-case shortest vector problem
- Reduced memory meet-in-the-middle attack against the NTRU private key
- Sandy2x: new Curve25519 speed records
- Software speed records for lattice-based signatures
- Speeding up the number theoretic transform for faster ideal lattice-based cryptography
- Topics in Cryptology – CT-RSA 2005
- Towards Practical Lattice-Based Public-Key Encryption on Reconfigurable Hardware
- Worst-case to average-case reductions for module lattices
Cited in
(47)- A polynomial time algorithm for breaking NTRU encryption with multiple keys
- Full domain functional bootstrapping using the prime cyclotomic ring
- Efficient verifiable mixnets from lattices, revisited
- An efficient noncommutative NTRU from semidirect product
- Reducing the number of qubits in solving LWE
- A framework for cryptographic problems from linear algebra
- Vulnerable public keys in NTRU cryptosystem
- Quantum key search for ternary LWE
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Estimate all the \(\{\)LWE, NTRU\(\}\) schemes!
- High-speed key encapsulation from NTRU
- How to meet ternary LWE keys
- A Systematic Approach and Analysis of Key Mismatch Attacks on Lattice-Based NIST Candidate KEMs
- A new post-quantum multivariate polynomial public key encapsulation algorithm
- Efficiently masking polynomial inversion at arbitrary order
- Characterizing overstretched NTRU attacks
- Polynomial-time key-recovery attacks against \texttt{NTRUReEncrypt} from ASIACCS'15
- A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
- Exploiting algebraic structures in probing security
- Compact encryption based on Module-NTRU problems
- An improved practical key mismatch attack against NTRU
- Hybrid dual and meet-LWE attack
- The matrix reloaded: multiplication strategies in FrodoKEM
- NTRU prime: reducing attack surface at low cost
- DAWN: smaller and faster NTRU encryption via double encoding
- Quantum collision search for ternary LWE keys
- A note on short invertible ring elements and applications to cyclotomic and trinomials number fields
- SoK: on the security of cryptographic problems from linear algebra
- Memory-efficient attacks on small LWE keys
- Gadget-based iNTRU lattice trapdoors
- Efficient implementation of hybrid encryption from coding theory
- Short Stickelberger class relations and application to Ideal-SVP
- A holistic approach towards side-channel secure fixed-weight polynomial sampling
- Runtime code generation for constant-time secret-indexed array accesses: applications to PERK and NTRU
- Compact privacy protocols from post-quantum and timed classical assumptions
- Measure-rewind-measure: tighter quantum random oracle model proofs for one-way to hiding and CCA security
- On the ideal shortest vector problem over random rational primes
- Message recovery attack in NTRU through VFK lattices
- Fast first-order masked NTTRU
- Message recovery attack on NTRU using a lattice independent from the public key
- An algebraic algorithm for breaking NTRU with multiple keys
- New NTRU Records with Improved Lattice Bases
- NTRU in Quaternion Algebras of Bounded Discriminant
- Cryptanalysis of rank-2 module-LIP: a single real embedding is all it takes
- Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices
- The direction of updatable encryption does not matter much
- Memory-efficient attacks on small LWE keys
This page was built for publication: NTRU prime: reducing attack surface at low cost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1746970)
