Cryptography that will remain secure should large-scale quantum computing become feasible. Based on hard problems with no known polynomial-time quantum algorithm (e.g., Shor's algorithm).
11
votes
3answers
324 views
What exactly is the impact of the hidden subgroup problem on cryptography?
I understand my group theory (allegedly), so I can make partial sense of The Hidden Subgroup problem:
Given a group $G$, a subgroup $H \leq G$, and a set $X$, we say a function $f : G \Rightarrow ...
8
votes
5answers
1k views
What is the post-quantum cryptography alternative to Diffie-Hellman?
Post-quantum cryptography concentrates on cryptographic algorithms that remain secure in the face of large scale quantum computers. In general, the main focus seems to be on public-key encryption ...
7
votes
3answers
294 views
Is key size the only barrier to the adoption of the McEliece cryptosystem, or is it considered broken/potentially vulnerable?
A recent paper showed that the McEliece cryptosystem is not, unlike RSA and other cryptosystems, weakened as drastically by quantum computing because strong Fourier sampling cannot solve the hidden ...
6
votes
3answers
517 views
What security does Keccak offer against quantum attacks, specifically Grover's algorithm?
In the face of non-quantum attacker, Keccak[r=1088,c=512] with 512 bits of output provides:
Collision resistance up to $2^{256}$ operations
Preimage resistance up to $2^{256}$ operations
Second ...
5
votes
1answer
98 views
Using encryption schemes for identification
I've been researching how to implement a post-quantum SSL-like connection authentication, especially correct identification&authentization of the server/client. Because good post-quantum digital ...
4
votes
3answers
223 views
McEliece Cryptosystem Implementations
Are there any current implementations (language irrelevant) of the McEliece Cryptosystem?
I have been hunting around all day, and yet, have only found a few mathematical equations pertaining to the ...
4
votes
1answer
103 views
Which MAC scheme is quantum resistant?
will HMAC survive Grover algorithm ? if not then which MAC scheme provide post-quantum security ?
4
votes
1answer
129 views
Does Grover's algorithm effect block size or only key size?
We know that Grover's algorithm can speed up cracking symmetric keys. Basically the key space is halved. This means we have to use at least a 256 bit key (to get 128 bit security).
I heard somewhere ...
3
votes
3answers
452 views
How will Cryptography be changed by Quantum Computing?
I realise this isn't a 'yes or no' question, and I apologise for asking something that could be seen as a discussion thread, but I had to ask.
I'm currently doing an EPQ in CS (specifically how QC ...
2
votes
1answer
211 views
Is AES-256 a post-quantum secure cipher or not?
We know Grover's algorithm speedup brute-force attacks two time faster in block ciphers (e.g brute-forcing 128 bit keys take $2^{64}$ operations not $2^{128}$).
That explains why we are using 256 bit ...
1
vote
1answer
112 views
Implementations of Ntru TLS
I posted this in a reply to What is the post-quantum cryptography alternative to Diffie-Hellman? but since it's actually another question, it was deleted.
Has anyone come across any implementations ...
1
vote
1answer
132 views
using Post-quantum asymmetric ciphers instead of RSA
We can't trust RSA to encrypt our Emails so what is best post-quantum cryptography system as alternative for RSA which provide good security and don't be breakable? because McEliece cryptosystem looks ...
1
vote
0answers
54 views
PKC McEliece + $S$ + $P$
I am trying implement the McEliece crytosystem in SAGE. My question is How I will be able to choose the appropriate matrix $S$ and $P$?. I ask this because when I trying obtain the vector $\hat{m}=mS$ ...
1
vote
0answers
80 views
Are hash trees an alternative, quantum-resistant signature scheme which can replace RSA?
Can hash trees can provide quantum resistant signatures to replace RSA for signing securely? What is the key size and how many times can we use same key?
0
votes
1answer
112 views
Diffie-Hellman is Post-quantum secured?
If Alice and bob have a secure channel for key-exchange and mallory don't man-in-the-middle attack them but in the future eavesdrop connection and see the key exchanged, can mallory break it like RSA ...
0
votes
1answer
133 views
What are some different cryptography methods?
Some of the most effective cryptography methods and algorithms are based of factoring large prime numbers (e.g. RSA). I'm curious whether there are some other cryptography methods. Somethings that is ...
-1
votes
1answer
39 views
Sematically Secure McEliece
I am read the Lemma 2 (pp13) in the paper [1]. Here a make a question Why "for any $Hash_z$ and any $Gen$"? The author of paper reply
The reason why "for any $Hash_z$ and any $Gen$" is that if ...
-1
votes
0answers
36 views
Adaptative chosen ciphertext security McEliece
I am read the paper and I found the follow Lemma2 (pp. 13)
Suposse that there exists, for any $Hash_z$ and any $Gen$, an algorithm $A$ ...
My question is Why "for any $Hash_z$ and any $Gen$"? Are ...
