A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Benchmarking the quantum cryptanalysis of symmetric, public-key and hash-based cryptographic schemes
[article]
2019
arXiv
pre-print
Quantum algorithms can break factoring and discrete logarithm based cryptography and weaken symmetric cryptography and hash functions. In order to estimate the real-world impact of these attacks, apart from tracking the development of fault-tolerant quantum computers it is important to have an estimate of the resources needed to implement these quantum attacks. For attacking symmetric cryptography and hash functions, generic quantum attacks are substantially less powerful than they are for
arXiv:1902.02332v2
fatcat:u5h2qcpbkbbmjozhx63wlujz6y