Quantum LLL with an application to Mersenne number cryptosystems

DOI10.1007/978-3-030-30530-7_1MaRDI QIDQ2284101zbMATH OpenOpenAlexFDO

Authors Marcel Tiepelt, Alan Szepieniec

Publication date 14 January 2020

Full work available at URL https://doi.org/10.1007/978-3-030-30530-7_1

zbMATH Keywords

Grover's algorithmlattice reductionLLLMersenne number cryptosystemsquantum circuit

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Cryptography (94A60)

Recommendations

• Algorithms and Computation
• Solving some cryptanalytic problems for lattice-based cryptosystems with quantum annealing method
• Attacks on the AJPS Mersenne based cryptosystem
• Solving the shortest vector problem in lattices faster using quantum search
• Finding shortest lattice vectors faster using quantum search

Cited in

(4)

• Attacks on the AJPS Mersenne based cryptosystem
• scientific article; zbMATH DE number 2086396 (Why is no real title available?)
• Algorithms and Computation
• Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves

This page was built for publication: Quantum LLL with an application to Mersenne number cryptosystems

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