NTRU prime: reducing attack surface at low cost
From MaRDI portal
Publication:1746970
DOI10.1007/978-3-319-72565-9_12zbMATH Open1384.94034OpenAlexW2779943051MaRDI QIDQ1746970FDOQ1746970
Tanja Lange, Chitchanok Chuengsatiansup, Daniel J. Bernstein, Christine van Vredendaal
Publication date: 26 April 2018
Full work available at URL: https://research.tue.nl/nl/publications/5822b8e0-8850-483c-a560-dc4933cac5a4
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
public-key encryptionsecurityvectorizationlattice-based cryptographyNTRUpost-quantum cryptographyideal latticessoftware implementationfast sortingkaratsubaRing LWEsoliloquy
Cites Work
- BKZ 2.0: Better Lattice Security Estimates
- Title not available (Why is that?)
- Public-key cryptosystems from the worst-case shortest vector problem
- New Algorithms for Learning in Presence of Errors
- Parallel collision search with cryptanalytic applications
- Lattice Signatures and Bimodal Gaussians
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
- Worst-case to average-case reductions for module lattices
- On Ideal Lattices and Learning with Errors over Rings
- Batch Binary Edwards
- Topics in Cryptology – CT-RSA 2005
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- Pseudorandom Functions and Lattices
- Title not available (Why is that?)
- OAEP reconsidered
- Flush, Gauss, and reload -- a cache attack on the BLISS lattice-based signature scheme
- A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors
- Advances in Cryptology - CRYPTO 2003
- Finding shortest lattice vectors faster using quantum search
- Speeding up the number theoretic transform for faster ideal lattice-based cryptography
- Sandy2x: New Curve25519 Speed Records
- Fast Implementation of Curve25519 Using AVX2
- Non-uniform Cracks in the Concrete: The Power of Free Precomputation
- Cryptography and Coding
- Learning with Rounding, Revisited
- Pseudorandomness of ring-LWE for any ring and modulus
- Middle-product Learning with Errors
- NTRU prime: reducing attack surface at low cost
- Towards Practical Lattice-Based Public-Key Encryption on Reconfigurable Hardware
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
- On the Hardness of Learning with Rounding over Small Modulus
- Reduced memory meet-in-the-middle attack against the NTRU private key
- Choosing Parameters for NTRUEncrypt
- Software Speed Records for Lattice-Based Signatures
- High-Speed Key Encapsulation from NTRU
- Cryptography and Coding
Cited In (29)
- 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
- Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions
- Efficient Implementation of Hybrid Encryption from Coding Theory
- Short Stickelberger Class Relations and Application to Ideal-SVP
- A Systematic Approach and Analysis of Key Mismatch Attacks on Lattice-Based NIST Candidate KEMs
- How to meet ternary LWE keys
- A new post-quantum multivariate polynomial public key encapsulation algorithm
- Efficiently masking polynomial inversion at arbitrary order
- 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
- Hybrid dual and meet-LWE attack
- The matrix reloaded: multiplication strategies in FrodoKEM
- Memory-efficient attacks on small LWE keys
- NTRU prime: reducing attack surface at low cost
- Gadget-based iNTRU lattice trapdoors
- A holistic approach towards side-channel secure fixed-weight polynomial sampling
- 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 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
- 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
- A polynomial time algorithm for breaking NTRU encryption with multiple 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)
