David 天宇 Wong's user avatar
David 天宇 Wong's user avatar
David 天宇 Wong's user avatar
David 天宇 Wong
  • Member for 10 years, 3 months
  • Last seen more than a month ago
  • Bordeaux, France
31 votes
2 answers
6k views

How does a non-prime modulus for Diffie-Hellman allow for a backdoor?

8 votes
1 answer
2k views

Why was Vaudenay's original padding oracle attack not exploitable on TLS 1.0?

8 votes
2 answers
846 views

Do you really need a KDF when you have a PRF?

6 votes
0 answers
388 views

Why is Keccak-f reversible? [duplicate]

6 votes
2 answers
751 views

power consumption in a XOR

6 votes
1 answer
585 views

Double-and-add/Montgomery VS blinding

5 votes
2 answers
224 views

Why not to use curve over field of $p^m$ with $p > 2$ for ECDSA?

4 votes
2 answers
637 views

Why does a non-prime DH modulus creates a "NOBUS" backdoor

4 votes
1 answer
574 views

KDF vs Stream Cipher

4 votes
1 answer
373 views

What is the last value in a cipher suite?

4 votes
0 answers
82 views

Do we still need HMAC now that SHA3 is here? [duplicate]

4 votes
1 answer
384 views

Last Sbox of a block cipher for Linear Cryptanalysis

3 votes
1 answer
110 views

linear cryptanalysis: how are the subkey bits removed from the linear approximation?

3 votes
0 answers
77 views

Delinearization in whitebox techniques

3 votes
1 answer
2k views

How do you test the security of your cipher?

3 votes
2 answers
546 views

KDF followed by a Hash?

3 votes
1 answer
383 views

Is xgcd faster than Fermat for calculating $d$ in RSA?

3 votes
2 answers
670 views

How do we find the subkey out of a differential cryptanalysis?

2 votes
1 answer
2k views

display an image encrypted with ECB [closed]

2 votes
1 answer
334 views

Incorrect Test Vectors for AES' MixColumns?

2 votes
1 answer
1k views

How to compute the discrete logarithm of Diffie-Hellman with a composite modulus?

1 vote
1 answer
384 views

Why does Carter-Wegman (and AES-GCM) use different keys for PRF and keyed-hash

0 votes
0 answers
71 views

hashing two inputs with a single encryption

0 votes
2 answers
330 views

Is the complexity of Pollard rho for discrete logartihm really the modulus?

0 votes
2 answers
281 views

Why not just encrypt the message and the hash of the message to achieve cryptographic integrity? [duplicate]