network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 5 months |
| seen | Dec 11 '12 at 14:31 | |
| stats | profile views | 0 |
|
Dec 20 |
awarded | Student |
|
Dec 6 |
awarded | Scholar |
|
Dec 6 |
awarded | Supporter |
|
Dec 6 |
accepted | Speeding up partially known plaintext preimage recovery attack on MD5 |
|
Dec 6 |
comment |
Speeding up partially known plaintext preimage recovery attack on MD5 Sad to admit you both are completely right, so no donuts for me. |
|
Dec 6 |
awarded | Editor |
|
Dec 6 |
comment |
Speeding up partially known plaintext preimage recovery attack on MD5 I've initially come up with an idea that it's possible to create better (in any definition of "better") algorithm when input is partially known. Please see my question updated for an idea I'm going to implement, but unsure if am I not reinventing the wheel and similar attempt was already done and proven unsuccessful? |
|
Dec 6 |
revised |
Speeding up partially known plaintext preimage recovery attack on MD5 added 3383 characters in body |
|
Dec 5 |
asked | Speeding up partially known plaintext preimage recovery attack on MD5 |
