87 reputation
4
bio website
location
age
visits member for 2 years, 4 months
seen Aug 8 '12 at 22:36

Jul
23
comment Recovering state of modified RC4 key scheduling algorithm
@IlmariKaronen: I meant non inclusive "to", fixed.
Jul
23
comment Recovering state of modified RC4 key scheduling algorithm
@fgrieu: again, you are correct, unbounded length is easy, so let's assume it's bounded by $N \leq 256$.
Jul
23
comment Recovering state of modified RC4 key scheduling algorithm
@fgrieu: you are right, fixed.
Jul
23
comment Recovering state of modified RC4 key scheduling algorithm
@fgrieu: k can have arbitrary content and arbitrary length.
Jun
19
comment Partial collisions for md5
@poncho: because it might be cheaper (?). Plus collisions don't solve the preimage problem.
Jun
4
comment LFSR dynamic mutation
How to recover k[], if C<=L?
Jun
2
comment LFSR dynamic mutation
I meant values as in three variables: state, C, i, not all history of states. What if only the first and last states are available?
Jun
2
comment LFSR dynamic mutation
What about recovering the k[] tab knowing values of state, C and i?