6
votes
Accepted
Is pairing-based crypto post-quantum secure?
Is pairing-based crypto post-quantum secure?
No. That's because solving the Discrete Logarithm Problem in one of the pairing's source groups breaks the pairing's security, and Shor's algorithm ...
4
votes
Accepted
Where does the 8 come from? Generic Search Problem with Bounded Probabilities
As the paper states, you should look directly at HRS16, Theorem 1.
The proof there seems fairly straightforward, but it seems to depend on theorem 7.2 of Zhandry2012.
This itself appears to depend on ...
2
votes
Tensor product of Pseudorandom States
This is not a PRS. As you note, the tensor product is superposition of $N^2$ possible states and so if it is a PRS it can only be interpreted be with respect to the set $X'=\{0,\ldots,N^2-1\}$ e.g. by ...
1
vote
Quantum computationally indistinguishable
Wikipedia states it clearly that trace distance gives an upper bound on the probability of distinguishing two states.
For a proof, you can use Stinespring's dilation theorem to represent $\mathbf{A}$ ...
1
vote
Why doesn't this factoring to order-finding reduction work?
I would have written a comment to extend on Daniel's answer — but since I am not usually on the stack exchange, I am seemingly not able to comment, and so I will write a follow-up answer instead:
...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
quantum-cryptography × 134post-quantum-cryptography × 45
encryption × 16
quantum-key-distribution × 13
shors-algorithm × 12
public-key × 10
lattice-crypto × 10
elliptic-curves × 9
rsa × 8
quantum-computing × 8
cryptanalysis × 6
random-number-generator × 6
discrete-logarithm × 6
key-exchange × 5
quantum-cryptanalysis × 5
dilithium × 5
aes × 4
zero-knowledge-proofs × 4
homomorphic-encryption × 4
symmetric × 4
decryption × 4
hash × 3
randomness × 3
entropy × 3
factoring × 3