User poncho - Cryptography Stack Exchange

109 votes

Accepted

What is the difference between CBC and GCM mode?

answered Apr 9, 2012 at 2:42

100 votes

Accepted

How does RSA signature verification work?

answered Aug 21, 2013 at 12:07

83 votes

Accepted

How does one attack a two-time pad (i.e. one time pad with key reuse)?

answered Apr 1, 2012 at 1:34

56 votes

Have any cryptographic breaks been executed in the real world since World War II?

answered Feb 22, 2022 at 4:03

50 votes

Accepted

HMAC vs ECDSA for JWT

answered Nov 18, 2015 at 19:20

49 votes

Accepted

Signatures: RSA compared to ECDSA

answered Jul 12, 2012 at 20:24

48 votes

Accepted

Is using the same IV in AES similar to not using an IV in the first place?

answered Mar 20, 2018 at 9:38

47 votes

Accepted

How does recovering the public key from an ECDSA signature work?

answered Jul 12, 2014 at 22:37

43 votes

HMAC-SHA1 vs HMAC-SHA256

answered Apr 4, 2014 at 0:41

39 votes

Accepted

Why do we use encrypt-decrypt-encrypt (EDE) in 3DES, rather than encrypting three times?

answered Mar 9, 2012 at 14:09

38 votes

Accepted

In RSA, why is it important to choose e so that it is coprime to φ(n)?

answered Dec 11, 2013 at 2:58

37 votes

Applicability of IBM's projected 50-qubit quantum computer Q to cryptanalysis?

answered Mar 6, 2017 at 16:50

36 votes

2way cryptography

answered Jul 14, 2017 at 14:58

35 votes

Accepted

How to solve MixColumns

answered Apr 19, 2012 at 18:15

31 votes

Accepted

Why must IV/key-pairs not be reused in CTR mode?

answered Jun 20, 2012 at 17:57

30 votes

Accepted

Chinese Remainder Theorem and RSA

answered May 9, 2012 at 16:22

30 votes

Accepted

How does IBM's 53-bit quantum computer compare to classical ones for cryptanalytic tasks?

answered Sep 18, 2019 at 19:53

29 votes

Are longer passwords really safer against brute force attacks?

answered Mar 13, 2020 at 17:47

29 votes

Is it safe to use a randomized IV for CTR mode?

answered Feb 13, 2012 at 18:05

29 votes

Accepted

How does encryption work in elliptic curve cryptography?

answered Dec 30, 2015 at 22:26

28 votes

Accepted

Can a computationally unbounded adversary break any public-key encryption scheme?

answered Sep 25, 2011 at 17:21

27 votes

Accepted

NIST Diffie-Hellman prime: how was it picked? Where did it come from?

answered May 9, 2016 at 18:57

26 votes

Accepted

Does Curve25519 only provide 112 bit security?

answered Aug 27, 2015 at 17:53

26 votes

Why use an Initialization Vector (IV)?

answered Sep 20, 2011 at 16:36

26 votes

Why is elliptic curve cryptography not widely used, compared to RSA?

answered Nov 15, 2011 at 15:25

26 votes

Accepted

What was NIST’s reason to switch naming from MD… (Message Digest) to SHA… (Secure Hashing Algorithm)?

answered Mar 14, 2018 at 17:40

26 votes

Accepted

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

answered Apr 15, 2019 at 20:18

25 votes

RSA: What would happen if you chose n to be a prime?

answered Mar 28, 2018 at 15:25

25 votes

Why is SSL on top of TCP?

answered Dec 8, 2017 at 6:45

25 votes

Accepted

Is (AES-)GCM parallelizable?

answered Aug 13, 2015 at 21:56

Stack Exchange Network

2,933 Answers

What is the difference between CBC and GCM mode?

How does RSA signature verification work?

How does one attack a two-time pad (i.e. one time pad with key reuse)?

Have any cryptographic breaks been executed in the real world since World War II?

HMAC vs ECDSA for JWT

Signatures: RSA compared to ECDSA

Is using the same IV in AES similar to not using an IV in the first place?

How does recovering the public key from an ECDSA signature work?

HMAC-SHA1 vs HMAC-SHA256

Why do we use encrypt-decrypt-encrypt (EDE) in 3DES, rather than encrypting three times?

In RSA, why is it important to choose e so that it is coprime to φ(n)?

Applicability of IBM's projected 50-qubit quantum computer Q to cryptanalysis?

2way cryptography

How to solve MixColumns

Why must IV/key-pairs not be reused in CTR mode?

Chinese Remainder Theorem and RSA

How does IBM's 53-bit quantum computer compare to classical ones for cryptanalytic tasks?

Are longer passwords really safer against brute force attacks?

Is it safe to use a randomized IV for CTR mode?

How does encryption work in elliptic curve cryptography?

Can a computationally unbounded adversary break any public-key encryption scheme?

NIST Diffie-Hellman prime: how was it picked? Where did it come from?

Does Curve25519 only provide 112 bit security?

Why use an Initialization Vector (IV)?

Why is elliptic curve cryptography not widely used, compared to RSA?

What was NIST’s reason to switch naming from MD… (Message Digest) to SHA… (Secure Hashing Algorithm)?

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

RSA: What would happen if you chose n to be a prime?

Why is SSL on top of TCP?

Is (AES-)GCM parallelizable?