SAFENetwork Quantum Resistant?

To me that article sounds like opinions and assumptions à la “if everything continues as expected, then …”.
I think @draw put it very well in his first answer

It has to be seen if, when and how quantum computing will work

Until that is not clear, I believe the OP question can not be answered definitely.

3 Likes

While we don’t know how the hardware might perform, there are few quantum algorithms that would take advantage of a quantum computer for cracking.

Without algorithms, the quantum computers might as well be the heaviest paperweight in the world.

Two major ones are Shor’s algorithm (for asymmetric crypto) and Grover’s algorithm (for symmetric crypto)
The one that applies to SafeNetwork would be Grover’s, and it only reduces the actual strength to half. So a AES-256 would have the strength of a AES-128 on a quantum computer with Grover’s algorithm.
It is similar for the hash function SHA3.

So that’s the current theoretical limit of the advantages that you can get on a fully functional quantum computer.

PS: as a side note, Shor’s algorithm completely destroys the future viability of current public-key cryptography.

6 Likes

Correct me if I am wrong, but half of AES-256 is AES-255, right? Difficulty doubles with each increment.

Power of the q computer doubles with each new bit. How long until it cracks the one time pad? There is always that as a recourse against the quantum.

Two people meet up and exchange quadrillions of serial one time pads and then each with a copy of the random 1 time pads can communicate indefinitely at distance going through their one time pads.

If they can just exchange some strange action at a distance physical bits (being sure they are not coupled on the way to other such bits) they might not even have to meet to exchange pads. If quantum teleportation which has been demostrated is possible so also is quantum communication- qbits in a q machine use such a channel as a kind of bus. Even if quantum communication turns out to not be super practical even beyond pad exchange there can always be pad exchange. But I guess people might also be left hand decrypting electronically communicated messages because how would you trust storing the pads electronically even if electronics generated the pads- and you’d destroy the isolated pad generators any way.

1 Like

Ok, what kind of PubKey crypto is Safe using? There has to be some kind of PubKey crypto for node IDs, SafeCoin owners etc.

edit: Hash-based Signatures could be used, but hard to impl

Currently I think they are still using the libsodium library so they are using Curve25519xsalsa20poly1305 for Public-key authenticated encryption, xsalsa20poly1305 for Secret-key authenticated encryption, ed25519 as Public-key signatures and SHA-512.

But in Nov 17 @dirvine said:

It would be interesting if there was any updates on that idea.

In this case, Grover’s algorithm halves the effective key length for symmetric encryption.
AES-512 → AES-256
AES-256 → AES-128
So even though it takes a significant hit, it would be still considered fairly secure (aka. “quantum resistant”)

1 Like

No, only sha3_256 and not from libsodium but from tiny_keccak. They are using cryptographic primitives from rust_sodium (a library wrapper over libsodium) but not its hash part anymore.

A long time ago they were using sha512, and I think the evolution has been:

  • sha512 from libsodium
  • sha256 from libsodium
  • sha3_256 from tiny_keccak
5 Likes

Are there more sources available stating that AES-256 is quantum resistant?

I’ve been watching this project closely: https://csrc.nist.gov/projects/post-quantum-cryptography/round-2-submissions

1 Like

Like this. You could build this in two a messaging app. Meet in person with a friend, rub your phone’s together as you generate one time pads.

Next to each friend in your address bar, have a one time pad health bar, visual indication of how many more secure messages you can send.

4 Likes

Yeah, I like it too! It reminds me of one of the quantum isms- two things that touch forever resonate. Given the singularity it would seem there is already a quantum back channel.

I’ve been sceptical that Quantum computing would develop fast enough to become a serious threat to network security in the near term (in any network) … but now beginning to think it needs to be taken very seriously.

6 Likes

From Financial Times article:

The system can only perform a single, highly technical calculation, according to the researchers, and the use of quantum machines to solve practical problems is still years away.

And in this article from MIT Technology Review some other critical remarks.

5 Likes

The paper on NASA’s website was taken down … they sure have stirred the pot and are inviting a lot of speculation and conspiracy … publicity stunt? IDK. Wait and see I guess.

Even if it’s a minor improvement, Moore’s law may apply to qubits too, so IMO nothings off the table yet.

2 Likes

As I see it - and I am not in the field - once knew a bit about photo-lithography - Moore’s “law” is not a law in the sense that Newton’s Laws are, merely a remarkably prescient observation and prediction on the evolving state of semi-conductor technology with major emphasis on photo-lithography. These advances continued until we ran up against some quantum roadblocks which mean we are unlikely to see any further huge increases in the density of devices on a wafer.
So these advantages are already won and cannot be won again in a parallel field. However as more teams work on qubits and there are more eyes on the problem/field making all the bugs shallower, we can expect the pace to pick up. But nothing so far suggests anything like the dramatic gains of Moore;s law is in effect . Yet…

1 Like

I’ve always thought of Moore’s Law as a market tool… an agreement between chip manufacturers not to get too far ahead of each other.

1 Like

Nah, it was an observation of an engineer and has held true until recently. For NAND memory it is in an explosion. For single place transistor it has slowed down.

Also it is not what most think it is. It was # transistors per unit area increase.

It was not computer power

4 Likes

When satoshi’s coins get moved, and banking encryption is wrecked it will all be to late to stress about it! Fear not.

wow, that’s really interesting and looks like it could be built fairly quickly with existing lithography techniques. If it works as well as they think could possibly even crimp the demand for qbit computers down the track. I expect all the qbit research funders are going to be worried about the maturity date of their investments when they learn about this tech.

The circuit successfully solved what is often considered a “quantum” problem: Breaking down, or factoring, numbers such as 35,161 and 945 into smaller numbers, a calculation known as integer factorization. These calculations are well within the capabilities of today’s classical computers, but the researchers believe that the probabilistic approach demonstrated in this paper would take up much less space and energy.

“On a chip, this circuit would take up the same area as a transistor, but perform a function that would have taken thousands of transistors to perform. It also operates in a manner that could speed up calculation through the parallel operation of a large number of p-bits,” said Ahmed Zeeshan Pervaiz, a Ph.D. student in electrical and computer engineering at Purdue.

Realistically, hundreds of p-bits would be needed to solve bigger problems—but that’s not too far off, the researchers say.

2 Likes

Speaking of Moore’s law, this is very good:

8 Likes

Is Quantum Resistant important for SafeNetwork?

1 Like