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 24733
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.
4
votes
Accepted
Multivariate cryptography - easily invertible quadratic map
Normally a multivariate scheme has a central private polynomial map that transforms linear multivariate polynomials into non-linear multivariate polys. This map has to be (easily) invertible, this is, …
- 898
0
votes
0
answers
66
views
PQC schemes & theory on academic courses
This question doesn't cover any technical aspects of PQC but I would want to know if undergraduate computer scientists study at a good level any of the available PQC schemes in literature during their …
- 898
3
votes
1
answer
419
views
Transition to post-quantum cryptography
Classical asymmetric cryptography is commonly based on the Discrete Logarithm Problem and Integer Factorization, which are known to be solvable with a quantum computer if it has the ability to run Sho …
- 898
1
vote
Accepted
Why does solving the underlying polynomial system "break" the multivariate cryptosystem
Multivariate cryptographic schemes that perform digital signatures like HFEv, FLASH and Quartz have something in common. As opposed to enciphering data like in a normal cryptosystem where a public mul …
- 898
2
votes
The mathematical similarity and difference between code-based PKE and multivariate DSS
Multivariate schemes tipically work with a central polynomial map $\mathcal{F}(X) : F_2^n \mapsto F_2^m$ which is a quadratic map that defines $m$ quadratic equations on $n$ variables. Then select $T, …
- 898
0
votes
Accepted
What are the security implications of knowing the private polynomial $\mathcal{F}$
Let's answer my question after revisiting the research. Start by quoting the following text from [2]. Note that I've changed the variables names to fit my description. Here $P(X) = T \circ F \circ S(X …
- 898
1
vote
1
answer
90
views
What are the security implications of knowing the private polynomial $\mathcal{F}$
First, affine transformations $S,T$ are defined by $S=A_1+v_s, T=A_2+v_t$. Let the private polynomial function $\mathcal{F}$ be known. The short description of the public key map is $P(X) = T \circ \m …
- 898
4
votes
0
answers
81
views
Help with cryptanalysis of branching in schemes based on Multivariate Public Key Cryptography
I'm familiarized with the structure of branching found in Multivariate Cryptography, as it allows us to partition a $n$-tuple over $F_{q}$ into a $k$-tuple where the $i$-th element is in $F_{q^{\lambd …
- 898