Quantum lattice enumeration in limited depth
type: Item
instance of: scholarly article
title: Quantum lattice enumeration in limited depth
DOI: 10.1007/978-3-031-68391-6_3
author: Nina Bindel
author: Xavier Bonnetain
author: Marcel Tiepelt
author: Fernando Virdia
publication date: 2024-12-13T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7958250
zbMATH Keywords: quantum cryptanalysis
zbMATH Keywords: lattice enumeration
zbMATH Keywords: post-quantum cryptography
zbMATH Keywords: quantum circuits
MaRDI profile type: Publication
cites work: A sieve algorithm for the shortest lattice vector problem
cites work: Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
cites work: Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
cites work: Estimate all the {LWE, NTRU} schemes!
cites work: The general sieve kernel and new records in lattice reduction
cites work: Estimating quantum speedups for lattice sieves
cites work: On the concrete hardness of learning with errors
cites work: Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games
cites work: Lower bounds on lattice enumeration with extreme pruning
cites work: Quantum lattice enumeration and tweaking discrete pruning
cites work: Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator
cites work: Lattice Decoding Attacks on Binary LWE
cites work: Concrete analysis of quantum lattice enumeration
cites work: New directions in nearest neighbor searching with applications to lattice sieving
cites work: Lower bound for quantum phase estimation
cites work: Finding many collisions via reusable quantum walks. Application to lattice sieving
cites work: BKZ 2.0: Better Lattice Security Estimates
cites work: Improvements to quantum search techniques for block-ciphers, with applications to AES
cites work: Q3522581
cites work: Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
cites work: Q3549702
cites work: Lattice Enumeration Using Extreme Pruning
cites work: Quantum Random Access Memory
cites work: Improved Quantum Circuits for Elliptic Curve Discrete Logarithms
cites work: Parallel Shortest Lattice Vector Enumeration on Graphics Cards
cites work: Implementing Grover oracles for quantum key search on AES and LowMC
cites work: Quantum cryptanalysis in the RAM model: claw-finding attacks on SIKE
cites work: Quantum algorithms for the approximate \(k\)-list problem and their application to lattice sieving
cites work: Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
cites work: Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search
cites work: Better Key Sizes (and Attacks) for LWE-Based Encryption
cites work: Fast Lattice Point Enumeration with Minimal Overhead
cites work: Practical, Predictable Lattice Basis Reduction
cites work: Q4612479
cites work: Sieve algorithms for the shortest vector problem are practical
cites work: On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: Lattice basis reduction: Improved practical algorithms and solving subset sum problems
cites work: Q4266548
cites work: Quantum circuit implementations of AES with fewer qubits
description: scientific article; zbMATH DE number 7958250