User lamontap

21 votes

Assuming a 1024qb quantum computer, how long to brute force 1024bit RSA, 256bit AES and 512bit SHA512

answered Aug 23, 2013 at 15:17

5 votes

Accepted

What does the "static" assumption mean?

answered Aug 25 at 20:22

4 votes

Can an AI really generate random numbers?

answered Apr 24 at 20:55

2 votes

Accepted

batch Fiat-Shamir

answered Jul 7 at 19:27

2 votes

Accepted

Is it possible to perform an unlimited amount of multiplications on the same ciphertext in fully homomorphic encryption?

answered Aug 8 at 21:02

2 votes

From Entropy's perspective how Encryption affects a Message?

answered Sep 6 at 21:03

2 votes

Difference between PRF, Pseudorandom Function and Pseudorandom Function Family

answered Oct 25 at 14:37

2 votes

Accepted

Parse Algorithm in Kyber Specification

answered Nov 15 at 17:51

1 vote

Special Soundness $\Sigma$-Protocols

answered Sep 29 at 18:43

1 vote

On the construction and notation of a certain OWF

answered Oct 5 at 20:51

1 vote

Accepted

State of the art for Graph Isomorphism

answered Sep 12 at 19:32

1 vote

Accepted

Amplifying the completeness and soundness of a proof scheme

answered Sep 13 at 20:09

1 vote

What does the bounded storage model mean?

answered Sep 22, 2022 at 15:51

1 vote

Homomorphic encryption with both algorithm and data encrypted?

answered May 1 at 20:41

1 vote

Accepted

Fiat-Shamir with interactions

answered May 3 at 20:34

1 vote

Accepted

Digital signature scheme with blinded public key

answered Jun 6 at 20:31

1 vote

Proving an identification-scheme based on a digital signature is secure

answered Jun 27 at 20:41

1 vote

Proof that a particular algorithm has been used

answered Jan 8, 2021 at 22:35

0 votes

The challenge c in Sigma protocol (using Fiat Shamir)

answered Jan 8, 2021 at 22:49

0 votes

BB84 quantum protocol

answered Sep 8, 2016 at 12:04

0 votes

Accepted

Is there a SNARK system that will give the same proof bytes for different witnesses?

answered Jul 7 at 19:53

0 votes

Zero-Knowledge Proof of Encryption with a Specific Key

answered Sep 20 at 19:30

0 votes

Post-quantum EU-CMA security from OWF-only

answered Aug 28 at 19:06

Stack Exchange Network

23 Answers

Assuming a 1024qb quantum computer, how long to brute force 1024bit RSA, 256bit AES and 512bit SHA512

What does the "static" assumption mean?

Can an AI really generate random numbers?

batch Fiat-Shamir

Is it possible to perform an unlimited amount of multiplications on the same ciphertext in fully homomorphic encryption?

From Entropy's perspective how Encryption affects a Message?

Difference between PRF, Pseudorandom Function and Pseudorandom Function Family

Parse Algorithm in Kyber Specification

Special Soundness $\Sigma$-Protocols

On the construction and notation of a certain OWF

State of the art for Graph Isomorphism

Amplifying the completeness and soundness of a proof scheme

What does the bounded storage model mean?

Homomorphic encryption with both algorithm and data encrypted?

Fiat-Shamir with interactions

Digital signature scheme with blinded public key

Proving an identification-scheme based on a digital signature is secure

Proof that a particular algorithm has been used

The challenge c in Sigma protocol (using Fiat Shamir)

BB84 quantum protocol

Is there a SNARK system that will give the same proof bytes for different witnesses?

Zero-Knowledge Proof of Encryption with a Specific Key

Post-quantum EU-CMA security from OWF-only