Hash function vulnerability! So, security of hash functions used in blockchain tech can be compromised by QC… fact!

Anyway, Grover's algorithm could be employed to perform a 'brute-force search' on hash functions with 'quadratic speedup', potentially reducing the time required to find a 'collision' while Schor’s algo go for large numbers factorization & effectively could break Cryptographic primitives…

https://www.sec.gov/Archives/edgar/data/1869699/000119312521201955/d165184ds1.htm

Reply to this note

Please Login to reply.

Discussion

It's a well-known theoretical but so is a meteor impact.