Reputation
3,707
Top tag
Next privilege 4,000 Rep.
Access 'trusted user' tools
Badges
12 26
Newest
 Enlightened
Impact
~44k people reached

  • 0 posts edited
  • 2 helpful flags
  • 550 votes cast
May
6
comment How is HMAC(message,key) more secure than Hash(key1+message+key2)
OK, changed it to a less confusing formula, that matches Yasuda's paper.
May
6
comment How is HMAC(message,key) more secure than Hash(key1+message+key2)
$1$, followed by enough $0$s to pad out to block length. I think it should be intelligible now?
May
6
revised How is HMAC(message,key) more secure than Hash(key1+message+key2)
Use Yasuda's notation
May
6
comment How is HMAC(message,key) more secure than Hash(key1+message+key2)
Right, I got the message padding wrong. Fixed now.
May
6
revised How is HMAC(message,key) more secure than Hash(key1+message+key2)
added 1 character in body
May
6
answered How is HMAC(message,key) more secure than Hash(key1+message+key2)
May
4
revised Factoring two RSA moduli $N_i=p_i\cdot q_i$ knowing that $p_2=p_1+2$?
deleted 4 characters in body
May
4
revised Factoring two RSA moduli $N_i=p_i\cdot q_i$ knowing that $p_2=p_1+2$?
edited body
May
4
answered Factoring two RSA moduli $N_i=p_i\cdot q_i$ knowing that $p_2=p_1+2$?
Apr
20
awarded  Enlightened
Apr
20
awarded  Nice Answer
Mar
29
awarded  Revival
Mar
28
answered What aspect of elliptic curve encryption paradigms makes them especially susceptible to quantum based attack algorithms?
Dec
17
comment N way collision of hashes
The exact work factor is worked out in Suzuki et al: $(n!)^{1/n}\cdot T^{1-1/s}$.
Nov
19
comment Do data-dependent rotations have any advantage over fixed rotations?
Probably. Analysis is still more difficult on data-dependent rotations, and so it may be wise to assume the attacker can force them to have no difference. This is especially the case in hash functions, where the attacker controls almost everything; here's an example. When assuming no differences in the rotations, fixed rotations start to seem like the better choice.
Nov
19
answered Do data-dependent rotations have any advantage over fixed rotations?
Nov
9
awarded  Enlightened
Nov
9
awarded  Nice Answer
Oct
30
comment What are these twist attacks with cost $2^{58.4}$ on NIST P-224 curve, and when do they apply?
Nevermind, I was assuming you had direct access to the points on the twist. Here you cannot use plain rho.
Oct
30
comment What are these twist attacks with cost $2^{58.4}$ on NIST P-224 curve, and when do they apply?
The complexity for kangaroo is slighly different when taking the negation map into account. You can use rho in this situation, though, like you would in Pohlig-Hellman.