User Meir Maor

30 votes

Accepted

In 2020, SHA-1 practically broken in chosen-prefix collision (CP-collision). Can double SHA-1 hashing prevent CP-collision?

answered Jan 7, 2020 at 17:50

27 votes

Accepted

Why can't they just fix SHA-1 if it's broken?

answered May 3, 2017 at 3:45

24 votes

Accepted

What is hardened SHA-1, how does it work and how much protection does it offer?

answered Feb 23, 2017 at 20:31

21 votes

Accepted

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

answered Jul 23, 2021 at 21:04

16 votes

Cryptography elements needed for a story

answered Aug 27, 2020 at 14:58

16 votes

Accepted

Deep Learning application in decryption?

answered Sep 8, 2018 at 6:08

15 votes

Is it possible to recover the seed used by Python's pseudo-random number generator?

answered Dec 9, 2017 at 11:39

13 votes

Accepted

Are there any benefits to using ECB over CBC?

answered Apr 11, 2018 at 13:02

13 votes

Kyber and Dilithium explained to primary school students?

answered Jan 16, 2023 at 6:47

11 votes

Do RSA signatures really need padding?

answered Oct 22, 2022 at 8:14

11 votes

Accepted

Which is the simplest cryptographic algorithm which is close to commercial-level security?

answered Aug 9, 2020 at 15:39

10 votes

Would this be considered a secure password hash?

answered Jan 31, 2022 at 9:35

9 votes

Accepted

How to prevent the solution of a discrete logarithm problem from being found in a collision way by accident

answered Aug 27, 2022 at 7:00

9 votes

Accepted

Can the same One-Time-Pad be re-used with some tricks

answered Sep 10, 2018 at 17:35

9 votes

Why can every prime number be written as 6k±1?

answered Aug 3, 2019 at 8:37

9 votes

PhD in cryptography using elliptic curves

answered Sep 22, 2017 at 4:59

9 votes

S-box basic question

answered Jul 3, 2017 at 18:15

8 votes

Accepted

Is it possible to compress a random sequence with high entropy?

answered Oct 1, 2017 at 4:22

8 votes

How many trials does it take to break HMAC-MD5?

answered May 21, 2018 at 5:39

8 votes

What password hash function for the next 50 years?

answered Jul 24, 2018 at 17:15

8 votes

Is it possible to find the product of two numbers without knowing the two numbers?

answered Jan 30, 2018 at 17:17

8 votes

Soft question: What are examples of beautiful proofs in cryptography?

answered Jun 13, 2019 at 14:38

8 votes

Can we pick which key is private or public in asymmetric encryption? Do the keys actually encrypt and decrypt a cipher text?

answered Aug 20, 2021 at 10:06

7 votes

Accepted

Understanding WannaCrypt's hybrid encryption scheme

answered Mar 18, 2018 at 8:36

6 votes

Why do memory-hard functions rely on a time-space trade-off?

answered Jul 13, 2018 at 17:37

6 votes

Academic breach revealed too late

answered Oct 18, 2019 at 11:56

6 votes

Smallest Guaranteed hash collision cycle length

answered May 11, 2019 at 17:45

6 votes

What conditions does a provable secure cryptosystem satisfy?

answered Oct 26, 2018 at 8:13

6 votes

DDH hardness with shared public parameters

answered Jan 26, 2023 at 12:53

5 votes

How to destroy a randomly generated key after using it?

answered Aug 24, 2022 at 19:35

Stack Exchange Network

361 Answers

In 2020, SHA-1 practically broken in chosen-prefix collision (CP-collision). Can double SHA-1 hashing prevent CP-collision?

Why can't they just fix SHA-1 if it's broken?

What is hardened SHA-1, how does it work and how much protection does it offer?

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

Cryptography elements needed for a story

Deep Learning application in decryption?

Is it possible to recover the seed used by Python's pseudo-random number generator?

Are there any benefits to using ECB over CBC?

Kyber and Dilithium explained to primary school students?

Do RSA signatures really need padding?

Which is the simplest cryptographic algorithm which is close to commercial-level security?

Would this be considered a secure password hash?

How to prevent the solution of a discrete logarithm problem from being found in a collision way by accident

Can the same One-Time-Pad be re-used with some tricks

Why can every prime number be written as 6k±1?

PhD in cryptography using elliptic curves

S-box basic question

Is it possible to compress a random sequence with high entropy?

How many trials does it take to break HMAC-MD5?

What password hash function for the next 50 years?

Is it possible to find the product of two numbers without knowing the two numbers?

Soft question: What are examples of beautiful proofs in cryptography?

Can we pick which key is private or public in asymmetric encryption? Do the keys actually encrypt and decrypt a cipher text?

Understanding WannaCrypt's hybrid encryption scheme

Why do memory-hard functions rely on a time-space trade-off?

Academic breach revealed too late

Smallest Guaranteed hash collision cycle length

What conditions does a provable secure cryptosystem satisfy?

DDH hardness with shared public parameters

How to destroy a randomly generated key after using it?