| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 9 months |
| seen | Dec 11 '12 at 12:32 | |
| stats | profile views | 1 |
|
Jun 21 |
asked | Do I have to recompute all hashes if I change the work factor in bcrypt? |
|
Jun 13 |
comment |
Attack vectors introduced by compilers @Martin Berger: I'm not aware of any compiler doing automatic memoization. I guess this would be a good question for Stack Overflow. |
|
Jun 9 |
awarded | Teacher |
|
Jun 9 |
answered | Attack vectors introduced by compilers |
|
Jun 9 |
comment |
What's the reason for applying the hash twice when hashing with salt? @PaĆlo Ebermann: I've seen in multiple times in comments to a post about recent LinkedIn passwords leakage. |
|
Jun 9 |
asked | What's the reason for applying the hash twice when hashing with salt? |
|
May 12 |
comment |
Is it fair to assume that SHA1 collisions won't occur on a set of <100k strings You might find this Stack Overflow question and its answers useful stackoverflow.com/q/862346/57428 It uses MD5 in the same scenario, but based on the file contents. |
|
May 5 |
awarded | Student |
|
May 5 |
asked | How do I demonstrate that a PRNG not designed for cryptography is not suitable for generating passwords? |
|
Aug 3 |
comment |
What alphanumeric string length can be used to guarantee no hash collisions from CRC-64? @brandx: You have two paths. Path 1 is to search for analysis of CRC64 specifically - maybe one can strictly prove something given how CRC64 works under the hood and how it treats data. Path 2 is to assume that CRC64 is like a crypto hash - hashes anything into random-looking stuff and then you can't have a guarantee unless you test an exact string set. |
|
Aug 3 |
awarded | Editor |
|
Aug 3 |
revised |
What alphanumeric string length can be used to guarantee no hash collisions from CRC-64? added 149 characters in body |
|
Aug 3 |
awarded | Supporter |
|
Aug 3 |
answered | What alphanumeric string length can be used to guarantee no hash collisions from CRC-64? |