9,417 reputation
12345
bio website github.com/CodesInChaos
location Frankfurt, Germany
age
visits member for 3 years
seen 7 hours ago

May
9
revised encrypt message with one digest 0-9 instead of 01-26
fixed capitalization and grammar
May
8
revised Weak One Way Function
added 10 characters in body
May
8
comment Many consecutive hashes to slow down brute force attack?
The entropy loss due to collisions is negligible. Nobody has ever found even a single SHA-256 collision. There is no practical security difference between hashing a salted password multiple times and PBKDF2.
May
7
reviewed Edit suggested edit on What should be the size of a Diffie-Hellman private key?
May
7
revised What should be the size of a Diffie-Hellman private key?
fixed grammar
May
4
revised Is there any strong enough pen-and-paper or mind cipher?
deleted 2 characters in body; edited title
May
2
reviewed Edit suggested edit on Decrypt digital signature using RSA public key with openssl
May
2
revised Decrypt digital signature using RSA public key with openssl
English; formatting
May
2
reviewed Approve suggested edit on Decrypt digital signature using RSA public key with openssl
May
1
reviewed Approve suggested edit on Is it generally possible to employ brute force methods when the encryption scheme is not known? Why or why not?
Apr
29
comment Adding and multiplication in jacobian coordinates
Once again, what do you mean by "multiplication of 2 points"? I don't think this is a supported operation on elliptic curves.
Apr
29
reviewed Approve suggested edit on Quality of randomness on a Linux system with haveged
Apr
29
reviewed Approve suggested edit on Adding and multiplication in jacobian coordinates
Apr
29
reviewed Approve suggested edit on LT codes with Homomorphic hashing
Apr
29
comment Secure order preserving hash function
Your requirements are simply a contradiction. Order preservation allows binary search which allows trivial and efficient inversion of any unkeyed function.
Apr
29
comment Secure order preserving hash function
Your requirement trivially allows a binary search to recover the the message in a chosen plaintext scenario. It's also easy to prove that the only way to satisfy the condition is order preserving encryption. So I have no clue what you even mean by an oder preserving hash.
Apr
29
comment Counter Mode: static IV but different keys
For secure network protocols you typically run an ephemeral key-exchange at the beginning, so you end up with a unique master key in any case. So using nonce=0 is actually a bit easier, but generating a random nonce is very easy as well.
Apr
29
comment Secure order preserving hash function
Read the CryptoDB paper. I think what they use is the best thing we have, but it obviously has significant weaknesses inherent in order preserving encryption.
Apr
29
comment Secure order preserving hash function
That can't really be a hash anymore. Your condition can only be satisfied by order preserving encryption. It implies having different results for each input, and not just that collisions are hard to find.
Apr
28
comment standard way to authenticate parties with public keys without certificates
You need some way to associate Bob with his public key. Either per finger print verification (SSH style) which shifts to problem to obtaining the fingerprint, per trusted third party(CA), per web of trust,... You alway need some mechanism. Else how do you define "Bob", if not by his public key.