10,529 reputation
12455
bio website github.com/CodesInChaos
location Frankfurt, Germany
age
visits member for 3 years, 6 months
seen 16 hours ago

May
10
comment Security of Salsa20 with some known plaintext?
@D.W. Salsa20 is a stream cipher. It always uses something similar to CTR mode.
May
9
comment Recommended way of adding a pepper/secret key to password before hashing?
I would encrypt the hash
May
9
reviewed Edit encrypt message with one digest 0-9 instead of 01-26
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 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 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 Decrypt digital signature using RSA public key with openssl
May
1
reviewed Approve 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 Quality of randomness on a Linux system with haveged
Apr
29
reviewed Approve Adding and multiplication in jacobian coordinates
Apr
29
reviewed Approve 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.