meta user
network profile
| bio | website | ethanheilman.tumblr.com |
|---|---|---|
| location | Cambridge, MA | |
| age | 30 | |
| visits | member for | 1 year, 11 months |
| seen | Jun 10 at 15:24 | |
| stats | profile views | 32 |
Security Hobbyist
Github: Ethan Heilman
Twitter: Ethan Heilman
Play FlipIt:
http://ethanheilman.github.com/flipIt/playable_with_instructions.html
Blog entries:
|
Jul 13 |
awarded | Citizen Patrol |
|
Jul 13 |
comment |
What is the general justification for the hardness of finding preimages for cryptographic hash functions? What are the philosophical underpinnings of 'fuzzy' or 'cowboy' cryptography that attempt to explain why it is hard to break. While there is probably no known hard-science theory that explains why SHA2 hasn't been broken yet, there may be explanations in philosophy or other softer fields. What are the stories cryptographers tell themselves about why SHA2 provides resistance to attempts to break it? |
|
Jul 12 |
comment |
What is the general justification for the hardness of finding preimages for cryptographic hash functions? I know that there are functions that are justifiably hard to invert given a under a particular a mathematical assumption (discrete log problem as done in the paper provided). Most cryptographic hash functions do not use such assumptions, yet in practice they appear to be hard to invert. What is the thinking on why this is? Is the conventional wisdom that some mysterious one way property is hiding in xor-rotations and GF s-boxes? |
|
Jul 12 |
awarded | Student |
|
Jul 12 |
awarded | Supporter |
|
Jul 12 |
asked | What is the general justification for the hardness of finding preimages for cryptographic hash functions? |
|
Jul 12 |
awarded | Autobiographer |
