meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 11 months |
| seen | Aug 8 '12 at 22:36 | |
| stats | profile views | 1 |
|
Jul 25 |
asked | Pseudo preimage for a hash made from a cipher |
|
Jul 24 |
accepted | Recovering state of modified RC4 key scheduling algorithm |
|
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 |
revised |
Recovering state of modified RC4 key scheduling algorithm added 31 characters in body |
|
Jul 23 |
comment |
Recovering state of modified RC4 key scheduling algorithm @fgrieu: you are right, fixed. |
|
Jul 23 |
revised |
Recovering state of modified RC4 key scheduling algorithm added 4 characters in body |
|
Jul 23 |
comment |
Recovering state of modified RC4 key scheduling algorithm @fgrieu: k can have arbitrary content and arbitrary length. |
|
Jul 22 |
asked | Recovering state of modified RC4 key scheduling algorithm |
|
Jul 22 |
accepted | Partial collisions for md5 |
|
Jun 19 |
comment |
Partial collisions for md5 @poncho: because it might be cheaper (?). Plus collisions don't solve the preimage problem. |
|
Jun 19 |
revised |
Partial collisions for md5 added 134 characters in body |
|
Jun 19 |
asked | Partial collisions for md5 |
|
Jun 12 |
awarded | Tumbleweed |
|
Jun 4 |
comment |
LFSR dynamic mutation How to recover k[], if C<=L? |
|
Jun 3 |
awarded | Scholar |
|
Jun 3 |
accepted | LFSR dynamic mutation |
|
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? |
|
Jun 1 |
awarded | Student |
