Stack Exchange Network

Stack Exchange network consists of 174 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange

Questions tagged [quantum-resistance]

An algorithm is quantum resistant if it can resist analysis using a quantum computer, using quantum analyzing techniques, such as Shor's algorithm.

1
vote
2answers
227 views

Are zero-knowledge proofs quantum-resistant?

Are zero-knowledge proofs quantum-resistant?
2
votes
2answers
212 views

Attacking AES128 with Grover's algorithm

How many plain text / cipher text pairs are required by Grover's algorithm when it is used to try and discover a secret AES key? I am trying to determine if having a device which limits the speed at ...
4
votes
1answer
134 views

What does Keccak being “efficiently invertible” mean?

Reading through Wikipedia, I saw this: It has been shown that the Merkle–Damgård construction, as used by SHA-2, is collapsing and, by consequence, quantum collision-resistant, but for the sponge ...
-5
votes
1answer
63 views

What happens when quantum-resistant cryptography is implemented using a quantum computer?

What happens when quantum-resistant cryptography is implemented using a quantum computer? Give the whole deal with the qubits, is this even a worthy action?
3
votes
0answers
51 views

Ambainis quantum collision-finding alg; triple hash output lengths?

I just stumbled onto a series of 2017 papers about applying the Ambainis quantum collision-finding algorithm to hash functions. (disclaimer: I haven't read all of them in full yet): Post-quantum ...
2
votes
0answers
135 views

Post quantum zkSNARK?

Do there exist any zkSNARK constructions that are based on post quantum cryptography? The encryption scheme used in the zkSNARK that is employed in Zcash for instance uses an encryption scheme of the ...
0
votes
1answer
201 views

Quantum Resistance Characteristics - why symmetric?

I have heard that public key cryptography may be “totally broken” by Quantum computers running Shor’s algorithm, whils symmetric key ciphers are safe, but Grover’s algorithm may require twice as many ...
1
vote
1answer
317 views

Will the ECDSA with SHA-3 implementation be quantum-proof?

I know, that ECDSA could be broken by quantum computers, but since there is post-quantum hash function SHA-3, does not this make the digital signature resistant to them?
0
votes
1answer
101 views

Are sufficiently large key sizes enough to deter quantum attacks for symmetric key ciphers? [duplicate]

Are sufficiently large key sizes enough to deter quantum attacks for symmetric key ciphers such as AES?
-2
votes
1answer
71 views

Would fragmenting data into several independent secured files would make a system Quantum-Resistant?

In 2018 IBM is making available the first quantum computers. This can be a disaster for most security systems based on computing power. Could this type of scheme bring a solution to this problem ? ...
2
votes
1answer
78 views

Responsibility of quantum-weak cryptography

At this point, should we consider it irresponsible to design new systems that assume hardness of problems already known vulnerable to quantum computers, such as factoring of large numbers or discrete ...
2
votes
0answers
275 views

XTS-AES-128 and Grover's algorithm

AES-128 is considered weak against quantum computers because Grover's algorithm effectively halves its key length to unacceptable 64 bits. XTS-AES-128 as described in IEEE 1619-2007 doubles key ...
0
votes
1answer
310 views

Quantum algorithm for elliptic curve's private keys

Is there a quantum algorithm to find private keys generated using elliptic curves ?
4
votes
1answer
870 views

How can Shor's Algorithm be applied to ECC?

I have not found a specific answer to this question on here. Shor's algorithm can be used to factorize a large (semi)prime $N$ by reducing the task to period-finding of a function $f(x)=x^a$ mod $N$. ...
4
votes
2answers
266 views

Diode vs quantum computer

Consider everyone's favourite pseudo random number generator, RANDU where V is the output of any successive iteration. $$ V_{j+1} = 65539 \cdot V_j \; mod \; 2^{31} $$ I've purposefully chosen ...
3
votes
1answer
169 views

Does key-length recommendation provided by NIST consider quantum computer?

Here we can see the suggested key-length by NIST in a few decades: https://www.keylength.com/en/4/#Biblio10 Does this consider quantum-computer?
1
vote
1answer
151 views

Code families in McEliece cryptosytem

What are the families of codes frequently used in McEliece cryptosystem or its variants? I know that binary Goppa codes were used in the original system but many codes with efficient decoding ...
7
votes
2answers
428 views

Is there any quantum resistant pen-and-paper or mind cipher?

I know about VIC and Solitare but as I understand they are not quantum resistant ciphers. Is there any quantum resistant pen-and-paper or mind cipher?
8
votes
2answers
427 views

What impact could general quantum computing have on BCrypt?

While discussing the 72 character limit of BCrypt, the question of resilience to quantum cryptanalysis came up. A search online didn't give me much of a lead as to what research has been done in this ...
4
votes
1answer
886 views

Does perfect forward secrecy (using DH or ECDH) imply quantum resistance?

Does perfect forwarding secrecy, as used for e.g. the DHE_ and ECDHE_ TLS ciphersuites make it impossible for quantum analysis ...