meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 9 months |
| seen | 3 hours ago | |
| stats | profile views | 105 |
|
2d |
answered | How does OAEP improve the security of RSA? |
|
May 16 |
comment |
Generating IV in TLS 1.2 @D.W.: why, yes, I do have a proof of security: see eprint.iacr.org/2008/121.pdf ; see the part where they show an encrypted counter for a CBC mode IV is secure |
|
May 15 |
comment |
Generating IV in TLS 1.2 @user1966074: The decryptor side does the standard CBC-mode decryption, which is (for TLS) precisely as you stated. |
|
May 15 |
reviewed | Approve suggested edit on Partial collisions for md5 |
|
May 15 |
answered | Generating IV in TLS 1.2 |
|
May 14 |
comment |
Encrypting a broadcast channel What's the security goal behind having multiple keys? So that we can encrypt data that can be decrypted by a specific subset of the subscribers (e.g. Alice can decrypt it, but Bob can't, even though both Alice and Bob are both subscribers)? Alternatively, is it so that you can do traitor-tracing (that is, if someone leaks his key, we can figure out who that is)? |
|
May 14 |
reviewed | Approve suggested edit on Why is H(k||x) not a secure MAC construction? |
|
May 9 |
comment |
Increased CRC collision probability when adding bits to input message @jmbeck: hmmmm, would it be possible to encode the version bits in the message length? That is, version 1 messages are a specific length (which is what you're currently doing now), version 2 messages are longer (and have an explicit version field, a longer check value, etc). I don't know if that's possible; I thought it may be worth considering. |
|
May 9 |
awarded | Enlightened |
|
May 9 |
awarded | Nice Answer |
|
May 8 |
answered | Increased CRC collision probability when adding bits to input message |
|
May 7 |
answered | Weak One Way Function |
|
May 7 |
reviewed | Edit suggested edit on RSA Encryption Sckeme |
|
May 7 |
revised |
RSA Encryption Sckeme fixed spelling and grammar |
|
May 6 |
comment |
What is a CBC Mac Scheme? How does knowing one block release other? possible duplicate of CBC-MAC , fixed length, all blocks returned |
|
May 6 |
comment |
What should be the size of a Diffie-Hellman private key? @divbyzero: except for where I endorsed the python implementation (which used a 1024-bit modulus), I don't see where I (even implicitly) mentioned modulus size at all in the above answers. I may have mentioned the advise to use at least 1024 bits in answers to other questions. |
|
May 5 |
comment |
What should be the size of a Diffie-Hellman private key? @divbyzero: actually, I suggested a 256 bit secret exponent ($A \ge 2^{256}$), not 128 bit. |
|
May 5 |
reviewed | Approve suggested edit on How can rainbow tables be used for a dictionary attack? |
|
May 4 |
answered | How to derive two keys from one password |
|
May 2 |
reviewed | Approve suggested edit on Decrypt digital signature using RSA public key with openssl |
