Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with post-quantum-cryptography
Search options not deleted
user 84695
This tag refers to public-key algorithms based on problems that quantum computers can't solve efficiently. Existing algorithms such as RSA, Diffie-Hellman, and ECDSA are known to be breakable using Shor's algorithm on quantum computers. Symmetric-key algorithms generally don't fall under this category.
0
votes
What is the quantum-resistant signature scheme with the smallest signature + pubkey?
The Winternitz OTS or a variant of it like SPHICS+ is your best bet.
This paper gives more detail on W-OTS.
It works similar to the Lamport scheme but each public/private key pair is a chain of 2^n ha …
- 1,463
6
votes
2
answers
431
views
Is this variant of Diffie-Hellman viable and quantum resilient?
In this paper the author suggests using a variant of Diffie-Hellman which involves floating-point numbers of arbitrary size in the generation of a shared secret. There are no primes, calculations are …
- 1,463
0
votes
Accepted
Can we place the WOTS scheme into a Merkle tree structure?
This question is essentially "can we put the HORS scheme on a tree". And the answer is yes, as it is the basically HORST.
The question adds confusion by mentioning a Merkle tree and not mentioning an …
- 1,463
2
votes
2
answers
153
views
Can we place the WOTS scheme into a Merkle tree structure?
In post-quantum signature schemes that are (to put it simply) built out of merkle trees, they usually employ some sort of OTS scheme on the very bottom leaves. I.e WOTS Winternitz scheme.
A relativel …
- 1,463
1
vote
1
answer
193
views
Can we use a Merkle Tree structure to reduce digest size?
A 2nd preimage attack is possible on the standard Merkle tree as pictured below.
I'm aware that we can add identifiers (to differentiate nodes) to the input of each hash as discussed in the link. If …
- 1,463
2
votes
Post-quantum asymmetric encryption algorithms
The NIST post-quantum schemes mainly consist of KEMs and signature schemes due to the fact that quantum computers don't break all existing cryptography.
As per Daniel Bernstein :
...there is no justi …
- 1,463