Chinese researchers: RSA is breakable. Others: Do not panic!

Quantum computing poses a great opportunity but also a great threat to internet security; certain mathematical problems that form the basis of today’s most popular cryptographic algorithms will be much easier to solve with quantum than with “classical”… Continue reading Chinese researchers: RSA is breakable. Others: Do not panic!

Best practice for sharing and storing encrypted data between server and client

I’m working on a system that shares data between a client and server.
The end goal of this system is to store server-encrypted data on the client’s hard drive, using keys generated by the server. the client needs copies of the keys so tha… Continue reading Best practice for sharing and storing encrypted data between server and client

Breaking RSA with a Quantum Computer

A group of Chinese researchers have just published a paper claiming that they can—although they have not yet done so—break 2048-bit RSA. This is something to take seriously. It might not be correct, but it’s not obviously wrong.

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 …

Continue reading Breaking RSA with a Quantum Computer

When signing with server public key, how do I prove server key is trustworthy?

I have a server-side app in a Docker container that communicates with my desktop client app.
I am struggling with how to ensure that the response from the server is trustworthy. I am fairly new to working with RSA key pairs and establishin… Continue reading When signing with server public key, how do I prove server key is trustworthy?