(Credit Denis Rothman via Linkedin)
In an article published recently by Denis Rothman on Linkedin an interest topic has been posed. Recent advancements in Quantum Computing may pose a risk in cryptosecurity based on 2048-bit-RSA-key-length. How far is quantum computing from running Shor's factorization algorithm ?
Let's make a Google Search with "Shor's quantum algorithm RSA"
In un articolo pubblicato recentemente da Denis Rothman su Linkedin, viene posto un argomento integerssante.I recenti progressi nel QUantum Computing potrebbero prre a rischio la criptografia basata su chiavi RSA di lunghezza 2048 bit. Quanto è lontano il quantum computing da far girare l'algoritmo di fattorizzazione di Shor?
Cerchiamo notizie su Google con "Shor's quantum algorithm RSA"
Cerchiamo notizie su Google con "Shor's quantum algorithm RSA"
Reference
https://www.linkedin.com/feed/update/urn:li:activity:6594496446345551872/
https://medium.com/@aditya.yadav/rsa-2048-cracked-using-shors-algorithm-on-a-quantum-computer-660cb2297a95
https://www.technologyreview.com/s/613596/how-a-quantum-computer-could-break-2048-bit-rsa-encryption-in-8-hours/
https://medium.com/@aditya.yadav/rsa-2048-cracked-using-shors-algorithm-on-a-quantum-computer-660cb2297a95
https://www.technologyreview.com/s/613596/how-a-quantum-computer-could-break-2048-bit-rsa-encryption-in-8-hours/
Nessun commento:
Posta un commento