meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 10 months |
| seen | 5 hours ago | |
| stats | profile views | 106 |
|
Jun 14 |
answered | Can cryptography be used to hide routing information from the router? |
|
Jun 14 |
reviewed | Approve suggested edit on Why is H(message||secret_key) not vulnerable to length-extension attack? |
|
Jun 14 |
reviewed | Approve suggested edit on understanding a length extension attack |
|
Jun 13 |
revised |
In RSA, do I calculate d from e or e from d? Fixed engish typo |
|
Jun 12 |
comment |
What's efficient MPC protocol for determining if sum's bigger than y? @mikeazo: I would personally expect that there are more efficient ways to solve the millionaire problem than to set up and simulate a circuit; however I don't know; that's why I added this as a comment, rather than an answer. |
|
Jun 11 |
comment |
length extension attack on an MD5 hash of a text file of about 10K Bytes? @PaŭloEbermann: actually, it'll always contain at least one zero byte unless A is at least 8 Petabytes long. So, yes, if you can't live with zero bytes in your byte strings, this observation isn't likely to be greatly useful to you. |
|
Jun 11 |
comment |
What's efficient MPC protocol for determining if sum's bigger than y? I would like to point out that this problem is equivalent to a joint computation of $x_0 > y - x_1$, hence it is the millionaire problem; the most efficient solution for that problem will be the most efficient solution for this. |
|
Jun 11 |
comment |
Can you identify the public key used to encrypt something? @Xeoncross: Yes, there are public-key encryption systems whose ciphertexts need not reveal the target: El Gamal, IES. |
|
Jun 11 |
answered | length extension attack on an MD5 hash of a text file of about 10K Bytes? |
|
Jun 10 |
answered | Can you identify the public key used to encrypt something? |
|
Jun 10 |
reviewed | Edit suggested edit on “proof of access” schemes |
|
Jun 10 |
revised |
“proof of access” schemes English; presentation |
|
Jun 10 |
reviewed | Approve suggested edit on Key distribution and key exchange for simple secure FTP implementation |
|
Jun 9 |
reviewed | Edit suggested edit on How random are commercial TRNGS |
|
Jun 9 |
revised |
How random are commercial TRNGS spelling and grammar |
|
Jun 8 |
reviewed | Approve suggested edit on Bcrypt VS Scrypt, Again? |
|
Jun 7 |
reviewed | Approve suggested edit on Is this OTP scheme safe? |
|
Jun 7 |
comment |
Block cipher fixed points @Truthserum: no, instead it's "just because you managed to find one of several keys that correctly decrypt one block of the message, there is (likely) only one key that will decrypt the entire message". This statement is likely to hold if the message is strictly longer than the key (and the cipher acts approximately like an ideal cipher). |
|
Jun 6 |
answered | Block cipher fixed points |
|
Jun 6 |
answered | Block cipher fixed points |
