Does the dual-sieve attack on learning with errors even work?

DOI10.1007/978-3-031-38548-3_2MaRDI QIDQ6145940zbMATH OpenOpenAlexFDO

Authors Léo Ducas, Ludo N. Pulles

Publication date 2 February 2024

Published in Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-38548-3_2

zbMATH Keywords

heuristicslatticeslearning with errorsfast Fourier transformcryptanalysisdual attack

Mathematics Subject Classification ID

Artificial neural networks and deep learning (68T07) Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• Provable dual attacks on learning with errors
• Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS
• Dual lattice attacks for closest vector problems (with preprocessing)
• Rigorous foundations for dual attacks in coding theory
• 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

Cites work

• scientific article; zbMATH DE number 3174791 (Why is no real title available?)
• scientific article; zbMATH DE number 3273551 (Why is no real title available?)
• A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
• A Statistical Decoding Algorithm for General Linear Block Codes
• A study of error floor behavior in QC-MDPC codes
• An Improved LPN Algorithm
• Dual lattice attacks for closest vector problems (with preprocessing)
• Dual vectors and lower bounds for the nearest lattice point problem
• Fast Fourier transforms: A tutorial review and a state of the art
• Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS
• Faster exponential time algorithms for the shortest vector problem
• IX. On the problem of the most efficient tests of statistical hypotheses
• Improved algorithms for the approximate k-List problem in Euclidean norm
• Lattice-based Cryptography
• New directions in nearest neighbor searching with applications to lattice sieving
• 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
• On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
• Shortest vector from lattice sieving: a few dimensions for free
• Sieve algorithms for the shortest vector problem are practical
• Statistical Decoding Revisited
• The general sieve kernel and new records in lattice reduction
• Tuple lattice sieving

Cited in

(13)

• An improved algorithm for code equivalence
• Guidance for efficient selection of secure parameters for fully homomorphic encryption
• Improved provable reduction of NTRU and hypercubic lattices
• On the provable dual attack for LWE by modulus switching
• A hybrid of lattice-reduction and Meet-LWE via near-collision on Babai's plane
• Assessing the impact of a variant of MATZOV's dual attack on Kyber
• Provable dual attacks on learning with errors
• Reduction from sparse LPN to LPN, dual attack 3.0
• Further improvements of the estimation of key enumeration with applications to solving LWE
• Formally verifying Kyber. Episode V: machine-checked IND-CCA security and correctness of ML-KEM in Easycrypt
• Accurate score prediction for Dual-Sieve attacks
• CryptAttackTester: high-assurance attack analysis
• On the independence heuristic in the dual attack

This page was built for publication: Does the dual-sieve attack on learning with errors even work?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6145940)