User Mark

41 votes

Accepted

Encryption that purposefully take hours to decrypt

answered Apr 19, 2020 at 4:43

34 votes

Accepted

How can I force slow decryption in the browser?

answered Apr 6, 2021 at 20:34

17 votes

Accepted

Why are finite fields so important in cryptography?

answered Jun 20, 2021 at 1:10

15 votes

Meaning of "Security can be reduced to a problem"

answered May 26, 2020 at 5:55

15 votes

Accepted

What are the drawbacks of "lightweight crypto"?

answered Feb 3 at 3:57

13 votes

Why was the term "discrete" used in discrete logarithm?

answered Apr 15, 2019 at 20:49

13 votes

Current Consensus on Security of Lattice Based Cryptography?

answered Apr 12, 2022 at 6:18

11 votes

Why is lattice-based cryptography believed to be hard against quantum computer?

answered Apr 15, 2022 at 18:46

11 votes

Accepted

Clarification of the provable cryptography controversies

answered Oct 8, 2021 at 16:03

10 votes

Are there prime numbers that are easy to modulo within 40 bits to 60 bits?

answered May 3, 2022 at 7:37

10 votes

Accepted

Notion of elementary operation when complexities in the form of $2^{128}$

answered Mar 14, 2022 at 3:05

9 votes

Accepted

Why do Problems for Post-Quantum algorithms have to be NP-Hard?

answered Apr 17, 2021 at 16:31

8 votes

Why Elliptic Curve Cryptography protocols depend on fixed curves?

answered Jun 25, 2021 at 6:11

8 votes

Make a Strong, Easy-to-Remember Password Using Classical Cryptography?

answered Jul 23, 2021 at 20:35

8 votes

Accepted

If OWF were to exist, do we know for sure that one of the candidate OWF would indeed be a OWF?

answered Jun 23, 2020 at 0:19

8 votes

What does the work "An Efficient Quantum Algorithm for Lattice Problems Achieving Subexponential Approximation Factor" mean?

answered Sep 22, 2021 at 7:50

7 votes

How is R-LWE related to lattice cryptography and homomorphic encryption?

answered Apr 7, 2021 at 4:41

7 votes

Bits of entropy needed to choose a random element from a list?

answered Sep 1, 2020 at 0:55

7 votes

Can combining two secure block ciphers be insecure?

answered Sep 6, 2020 at 3:31

6 votes

Accepted

Differential privacy guarantees of Gaussian noise, when each coordinate has different sensitivity

answered Oct 15, 2020 at 22:24

6 votes

Why I can't permutate an email and get away with it?

answered Nov 7, 2020 at 6:42

6 votes

When is a large semiprime possible to factor?

answered Jul 11, 2021 at 1:48

6 votes

Mathematical proof or any reference of "Deterministic random bit generator cannot produce more randomness than the randomness of seed"

answered Mar 11, 2020 at 16:00

6 votes

security parameter in lattice cryptography

answered Mar 31, 2020 at 8:06

6 votes

The successive minima of a lattice

answered Feb 13 at 18:06

6 votes

Is finding an encryption (or hash) algorithm science, or is it art?

answered Feb 11 at 4:23

5 votes

What does it mean for a number to be “in the order of” a prime number?

answered Dec 10, 2019 at 6:34

5 votes

Imposibility of bias-resistant coin tossing (Cleve'86) and its connection to modern notion of fairness in Secure Multiparty Computation

answered Jul 7, 2020 at 19:47

5 votes

Accepted

BGW Multiplication: How does it work?

answered Apr 24, 2020 at 7:35

5 votes

How to ethically publish the result in case we prove that $P = NP$?

answered Dec 17, 2020 at 6:22

Stack Exchange Network

300 Answers

Encryption that purposefully take hours to decrypt

How can I force slow decryption in the browser?

Why are finite fields so important in cryptography?

Meaning of "Security can be reduced to a problem"

What are the drawbacks of "lightweight crypto"?

Why was the term "discrete" used in discrete logarithm?

Current Consensus on Security of Lattice Based Cryptography?

Why is lattice-based cryptography believed to be hard against quantum computer?

Clarification of the provable cryptography controversies

Are there prime numbers that are easy to modulo within 40 bits to 60 bits?

Notion of elementary operation when complexities in the form of $2^{128}$

Why do Problems for Post-Quantum algorithms have to be NP-Hard?

Why Elliptic Curve Cryptography protocols depend on fixed curves?

Make a Strong, Easy-to-Remember Password Using Classical Cryptography?

If OWF were to exist, do we know for sure that one of the candidate OWF would indeed be a OWF?

What does the work "An Efficient Quantum Algorithm for Lattice Problems Achieving Subexponential Approximation Factor" mean?

How is R-LWE related to lattice cryptography and homomorphic encryption?

Bits of entropy needed to choose a random element from a list?

Can combining two secure block ciphers be insecure?

Differential privacy guarantees of Gaussian noise, when each coordinate has different sensitivity

Why I can't permutate an email and get away with it?

When is a large semiprime possible to factor?

Mathematical proof or any reference of "Deterministic random bit generator cannot produce more randomness than the randomness of seed"

security parameter in lattice cryptography

The successive minima of a lattice

Is finding an encryption (or hash) algorithm science, or is it art?

What does it mean for a number to be “in the order of” a prime number?

Imposibility of bias-resistant coin tossing (Cleve'86) and its connection to modern notion of fairness in Secure Multiparty Computation

BGW Multiplication: How does it work?

How to ethically publish the result in case we prove that $P = NP$?