- From: Gabe Cohen <gabe@tbd.email>
- Date: Wed, 4 Jan 2023 03:03:46 +0000
- To: W3C Credentials CG <public-credentials@w3.org>
- Message-ID: <CAPPN6pjQqw12FuO34a2z-NEokz4nSZFMHX53hbQhMzfBNdLT3w@mail.gmail.com>
Breaking RSA is now a more real threat than ever! https://www.schneier.com/blog/archives/2023/01/breaking-rsa-with-a-quantum-computer.html We have long known from Shor’s algorithm that factoring with a quantum > computer is easy. But it takes a big quantum computer, on the orders of > millions of qbits, to factor anything resembling the key sizes we use > today. What the researchers have done is combine classical lattice > reduction factoring techniques with a quantum approximate optimization > algorithm. This means that they only need a quantum computer with 372 > qbits, which is well within what’s possible today. (The IBM Osprey is a > 433-qbit quantum computer, for example. Others are on their way as well.) > The importance of hybrid and PQC solutions from DIDs and VCs is extremely pressing. I know there is some work on post quantum signature type <https://www.ietf.org/archive/id/draft-prorock-cose-post-quantum-signatures-01.txt>. Is anyone else working on similar systems? Gabe Cohen Lead Platform Engineer, Verifiable Credentials gabe@tbd.email <gcohen@tbd.email> TBD <http://tbd.website/> | LinkedIn <https://linkedin.com/in/cohengabe> | Twitter <https://twitter.com/decentralgabe>
Received on Wednesday, 4 January 2023 03:04:19 UTC