Questions tagged [quantum-computing]

refers to hardware and software of quantum computers, and what their capabilities will be. For protecting your data against a quantum attacker, see [post-quantum].

Quantum computers are an upcoming technology that leverages the power of quantum physics to perform computations. They take advantage of quantum superposition in order to gain speedups ranging from quadratic (Grover's Algorithm) to exponential (Shor's Algorithm) in certain special problems.

Quantum computers are not general purpose computers: quantum computers are fundamentally incapable of doing most of the computations that we take for granted on classical computers. So while these speedups sound impressive, they only apply to a very specific set of problems.

However, two of the problems where quantum computers have an advantage include factoring numbers into their primes (exp. speedup), and brute-forcing a key (quadratic speedup), which makes quantum computers of interest to information security professionals.

The threat of quantum computing is not imminent: in 2014 professor Matteo Mariantoni gave a talk in which he estimated that the earliest possible date for a large-scale quantum computer is the year 2030 at a cost of 1 billion dollars for research, construction, and the required nuclear power plants to operate it.

26 questions
93
votes
4 answers

Will quantum computers render AES obsolete?

This is a spin off from: Use multiple computers for faster brute force Here's at least one source which says that quantum computers are on the way to being able to break RSA in the not too distant future. I am not a security expert, and don't know…
BuvinJ
  • 993
  • 1
  • 7
  • 11
36
votes
2 answers

How many qubits are needed to factor 2048-bit RSA keys on a quantum computer?

I've been reading about quantum computing and turns out that 512-bit quantum processors are already a thing. I also read about Shor's algorithm, which can break RSA and several asymmetric encryption schemas in the next upcoming years. Quantum…
Nacib Neme
  • 1,194
  • 2
  • 9
  • 11
34
votes
2 answers

When could 256 bit encryption be brute forced?

Assuming quantum computing continues to improve and continues to perform like this: ... quantum computer completes 2.5-billion-year task in minutes is it reasonable to expect that 256 bit encryption will be possible to brute force at some point in…
stevec
  • 1,214
  • 1
  • 7
  • 16
5
votes
2 answers

What SSH keys should I generate with ssh-keygen to be safe in a quantum computer based world?

What SSH keys should I generate with ssh-keygen to be safe in a quantum computer based world?
niving6473
  • 111
  • 4
5
votes
2 answers

How safe is this "Multidimensional-Encryption method" (includes xAES, familiar from Unseen.is)?

I would like to ask about this encryption method that I found: USPTO patent and it is related to this question here: A service that claims beyond army level encryption and Unseen.is encryption claims revisited with their proprietary, patented “xAES”…
4
votes
2 answers

Quantum Computer Advantage in SSH Login

I understand that quantum computers are many orders of magnitude faster than today's binary computer and that this is expected to enable decryption that was unlikely (it would take too long) with today's binary computers. That being said, how would…
gatorback
  • 1,541
  • 2
  • 12
  • 17
3
votes
1 answer

What happens to PKI once quantum computers can break encryption?

They say that public key infrastructure or PKI uses very complex encryption. What if that encryption breaks one day when quantum computers complete? What if they decrypt all private messages and data? What will be the replacement then?
3
votes
3 answers

What is a quantum computing attack?

As far as i know, a quantum attack is a brute force attack performed by a quantum computer. source: wiki Is this very simple definition correct ? or the scope of a quantum computing attack is bigger.
Baptiste
  • 1,643
  • 10
  • 20
2
votes
1 answer

What can you do with a sufficiently complex quantum computer against Elliptic Curve Cryptography?

I've heard that a modified version of Shor's algorithm can "break" ECC. But what does this mean specifically? What are all the things you can do with this algorithm? Can you: decrypt messages encrypted with the private key? Does the original…
B T
  • 197
  • 1
  • 9
2
votes
1 answer

Can I render public-key cryptography quantum resistant if I treat even the public keys as secret?

Here is the situation - RSA/ECC is not quantum resistant, because a quantum computer feasibly calculate the private key based on the knowledge of the public key (because the quantum computers tackle much easier the hardness of prime factorization, I…
1
vote
1 answer

Calculating D-Wave's integer factorization capabilties

D-Wave has teased the ability to perform integer factorization previously, but if you jump to ~10:00 in this presentation they actually appear to outline how they can perform integer factorization using quantum annealing and at ~12:10 they can…
Indolering
  • 852
  • 6
  • 21
1
vote
1 answer

Proof of quantum safety of the Merkle signature scheme

The Wikipedia article about the Merkle signature scheme claims that it is very adjustable and resistant against quantum computing. What proof is there of this?
1
vote
1 answer

Password cracking using Quantum Computers

Suppose that I have a password that is n-digits long. Each digit can take m values. So the number of permutations will be m^n. I wanted to know how much time it would take a quantum computer to crack this password. Is there a specific algorithm to…
sato
  • 121
  • 5
1
vote
1 answer

Size of a secure random number taking into account quantum computing and size of universe

Most random secure numbers are 256 to 512 bits. But given the size of the universe and eventually quantum computing, I am wondering what is a better sized randomly generated number, taking into account minimizing its size while also making it unique…
Lance
  • 588
  • 5
  • 16
1
vote
0 answers

How long until quantum computers are able to decrypt RSA using Shor's algorithm?

Based on this question: How many qubits are needed to factor 2048-bit RSA keys on a quantum computer? It's going to take 20-30 years for quantum computers to reach that state but some people are giving much shorter estimates. So what is the most…
Richard Jones
  • 497
  • 1
  • 6
  • 9
1
2