925 reputation
69
bio website
location
age
visits member for 3 years, 1 month
seen yesterday

Jul
16
answered advances in usability for cryptography/authentication
Jul
14
answered Current mathematics theory used in cryptography/coding theory
Jul
14
revised RSA with small exponents?
added 7 characters in body
Jul
14
awarded  Editor
Jul
14
revised RSA with small exponents?
added 1 characters in body
Jul
14
answered RSA with small exponents?
Jul
12
awarded  Teacher
Jul
12
comment What is the general justification for the hardness of finding preimages for cryptographic hash functions?
The difference is more on the underlying primitives you call as "mathematical". A discrete log problem is as mathematical (IMO) as the "fuzzy" problems involved in hash functions. The reason (as you probably know) for using such fuzzy security is efficiency. It is much faster to use a SHA256 than to use a DL based hash.
Jul
12
answered Why use a 1-2 Oblivious Transfer instead of a 1 out of n Oblivious Transfer?
Jul
12
answered What is the general justification for the hardness of finding preimages for cryptographic hash functions?