Hi All
Yes it is back from 2019 but provides a good background to the threat.
Currently, post quantum cryptography usually involves public key algorithms that are considered secure against quantum attack. However, the most popular public-key algorithms are vulnerable to a strong quantum computer running Shor’s algorithm to solve the mathematical problems that created the security in the first place. By contrast, symmetric cryptographic algorithms and hash functions are thought to be relatively secure against quantum attacks. Cryptography researchers are always trying to prove the equivalence of a cryptographic algorithm and a known hard math problem. These proofs are known as ‘security reductions’ and they demonstrate the difficulty of cracking the algorithm.
Let’s explore the current state of practice in quantum resilience, which includes six different techniques: hash-based, code-based, lattice based, multivariate, supersingular elliptic curve isogeny and symmetric keys.
https://postquantum.com/post-quantum/quantum-computing-security/
Regards
Caute_Cautim
