The core idea is to replace Grover's algorithm used in [Laa16] in a key part of the sieving algorithm by a quantum random walk in which we add a layer of local ...
May 12, 2021 · Abstract:Lattice-based cryptography is one of the leading proposals for post-quantum cryptography. The Shortest Vector Problem (SVP) is ...
Dec 1, 2021 · Quantum Random Walks on the Johnson Graph. A very standard graph on which we can perform QRW is the Johnson graph J(n, r). Each vertex v ...
Duration: 24:57
Posted: Dec 2, 2021
Posted: Dec 2, 2021
Lattice-based cryptography is one of the leading proposals for post-quantum cryptography. The Shortest Vector Problem (SVP) is arguably the most important ...
Lattice sieve algorithms are amongst the foremost methods of solving SVP. The asymptotically fastest known classical and quantum sieves solve SVP in a d- ...
Oct 8, 2021 · This April, a new quantum lattice sieving algorithm via quantum random walks was published [5]. This algorithm reduces the core-SVP ...
People also ask
What is the lattice sieving algorithm?
May 12, 2021 · Lattice-based cryptography is one of the leading proposals for post-quantum cryptography. The Shortest Vector Problem (SVP) is arguably the ...
Lattice Sieving via Quantum Random Walks · List of references · Publications that cite this publication.
May 12, 2021 · The core idea is to replace Grover's algorithm used in [Laa16 PhD] in a key part of the sieving algorithm by a quantum random walk in which ...