Solving some cryptanalytic problems for lattice-based cryptosystems with quantum annealing method

DOI10.4213/mvk441zbMath1521.94055OpenAlexW4385956685MaRDI QIDQ6051902

Unnamed Author

Publication date: 20 September 2023

Published in: Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/mvk441

zbMATH Keywords

closest vector problemquantum annealingbounded distance decodingNTRUEncrypt

Mathematics Subject Classification ID

Cryptography (94A60) Decoding (94B35)

Cites Work

• Unnamed Item
• Unnamed Item
• A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
• Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
• A public key cryptosystem and a signature scheme based on discrete logarithms
• On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
• A method for obtaining digital signatures and public-key cryptosystems
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search
• A sieve algorithm for the shortest lattice vector problem

This page was built for publication: Solving some cryptanalytic problems for lattice-based cryptosystems with quantum annealing method