346 reputation
110
bio website
location
age
visits member for 1 year, 5 months
seen May 12 at 1:10

Mar
24
comment Even passwords are vulnerable to hash collision attacks?
I assumed first preimage is something that works with selected hash function and is faster than general purpose attacks like bruteforce or rainbow.
Mar
23
comment Secure modulus length for Diffie-Hellman
Yes, but computing capabilities have grown a litte since then.
Mar
23
comment Secure modulus length for Diffie-Hellman
May 2003 . You are a bad CO.
Mar
23
comment Secure modulus length for Diffie-Hellman
<if the messages are encrypted.> - no, not really
Mar
23
comment How can I validate a hashed password if all I have is another hash?
If you already use public key cryptography, take a look on SRP - at least it is not homebrew.
Mar
23
comment Even passwords are vulnerable to hash collision attacks?
Are bruteforce or rainbow tables really first preimage attacks?
Mar
7
comment What data is saved in RSA private key?
Are you talking about openssl compatible key? Can you give the code?
Mar
7
comment What data is saved in RSA private key?
It's not an answer for "how can i view them?".
Mar
6
comment Timing attack on modular exponentiation
Well, which part of it? It's hard to understand it all at once :)
Mar
6
comment Timing attack on modular exponentiation
Constant time = worst time, right? 2 * |x|
Mar
6
comment Timing attack on modular exponentiation
CPU can't usually operate on integers bigger that 64 bits, so it depends not on CPU but on modpow implementation in big integer library.
Mar
6
comment Timing attack on modular exponentiation
How could it help finding the power if we would know amount of 1 bits in it?
Mar
4
comment Can SRP be used with Elliptic Curves?
Argh, just forgot that, but the rest should work fine with ECC. But why can't we just leave the same + operation mod N?
Mar
1
comment Timing attack on modular exponentiation
Can you explain how blinding works for modexp?
Feb
28
comment Is SHA-1 collision free on data up to 20 bytes long?
I don't see any mathematical proof, ether for or against the assumption. This question is probably a duplicate of that, but that question has no answer too. And, not the last reason i want this question to be opened, i can't comment there and can here.
Feb
28
comment Is SHA-1 collision free on data up to 20 bytes long?
I don't see any answer there, only assumtions, that it is most likely not true, e.g. there is no proof either for it or for the opposite. Unfortunately, i can't comment there.