A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack

DOI10.1515/jmc-2016-0044zbMath1415.94466OpenAlexW2895540408WikidataQ129162945 ScholiaQ129162945MaRDI QIDQ2415416

Thomas Wunderer

Publication date: 21 May 2019

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc-2016-0044

zbMATH Keywords

cryptanalysisLWElattice-based cryptographyNTRUSVPhybrid attackBLISSNTRU PRIME

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items (5)

How to meet ternary LWE keys ⋮ On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes ⋮ Hybrid dual and meet-LWE attack ⋮ On the measurement and simulation of the BKZ behavior for \(q\)-ary lattices ⋮ Modular lattice signatures, revisited

Uses Software

• SageMath
• BLISS
• DLMF
• BKZ
• NTRU

Cites Work

• Unnamed Item
• Unnamed Item
• Advances in cryptology -- EUROCRYPT 2016. 35th annual international conference on the theory and applications of cryptographic techniques, Vienna, Austria, May 8--12, 2016. Proceedings. Part I
• Advances in cryptology -- CRYPTO 2013. 33rd annual cryptology conference, Santa Barbara, CA, USA, August 18--22, 2013. Proceedings, Part I
• On the concrete hardness of learning with errors
• On Lovász' lattice reduction and the nearest lattice point problem
• NTRU prime: reducing attack surface at low cost
• On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack
• Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator
• Practical, Predictable Lattice Basis Reduction
• Hardness of SIS and LWE with Small Parameters
• Lattice Signatures and Bimodal Gaussians
• Reduced memory meet-in-the-middle attack against the NTRU private key
• Choosing Parameters for NTRUEncrypt
• Better Key Sizes (and Attacks) for LWE-Based Encryption
• BKZ 2.0: Better Lattice Security Estimates
• On the Efficacy of Solving LWE by Reduction to Unique-SVP
• Post-Quantum Cryptography
• A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
• Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
• Lattice Decoding Attacks on Binary LWE
• On Ideal Lattices and Learning with Errors over Rings
• On lattices, learning with errors, random linear codes, and cryptography
• Selecting cryptographic key sizes

This page was built for publication: A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack