| bio | website | github.com/CodesInChaos |
|---|---|---|
| location | Munich, Germany | |
| age | ||
| visits | member for | 1 year, 10 months |
| seen | 3 mins ago | |
| stats | profile views | 109 |
- Jabber/XMPP: CodeInChaos@jabber.ccc.de
- IRC: CodesInChaos on freenode
- Email: My nick on gmail
- Blog: codesinchaos.wordpress.com
- GitHub: github.com/CodesInChaos
- Google+
- Twitter @CodesInChaos
|
Jul 10 |
comment |
Which of these 3 AES 128 symmetric encrypt/decrypt routines is most secure? The MAC in AES-GCM isn't HMAC. |
|
Jul 10 |
comment |
KDF with low-entropy salts The only advantage of that over a direct brute-force is that it can be done before the leak. It doesn't reduce the total work an attacker has to do at all. |
|
Jul 10 |
revised |
KDF with low-entropy salts added 196 characters in body |
|
Jul 10 |
comment |
KDF with low-entropy salts The linked question is pretty different from this one, since it derives the salt solely from the thing being hashed. Which is equivalent to not using a salt at all. |
|
Jul 10 |
comment |
KDF with low-entropy salts Can you justify your unpredictability requirement? |
|
Jul 10 |
answered | KDF with low-entropy salts |
|
Jul 10 |
comment |
Entropy of system data - use all and hash, or trim least significant bits? The important part of fortuna isn't how it generates its output. The important part is how it accumulates entropy in different pools and mixes that entropy into generator state. |
|
Jul 10 |
comment |
Entropy of system data - use all and hash, or trim least significant bits? Your pooling algorithm looks strange. Why don't you use a fortuna like design? |
|
Jul 10 |
comment |
About “nonce” in Initialization Vector(IV) An IV or nonce is a sequence of bytes, the concept of letters doesn't make much sense here. So what's your question? Are you talking about the ASCII representation of those bytes? Or the hex representation? |
|
Jul 9 |
comment |
Length of data to hash for PGP cross posted and answered on SO: stackoverflow.com/questions/11256853/… |
|
Jul 9 |
revised |
Encryption with private key? deleted 30 characters in body; edited tags |
|
Jul 9 |
comment |
Encryption with private key? What kind of padding do you use? |
|
Jul 9 |
comment |
Encryption with private key? cross posted: security.stackexchange.com/questions/17013/… |
|
Jul 9 |
comment |
Do Quantum Key Distribution and Physical Unclonable Functions combine, and how? I don't get how PUF solve MitM. |
|
Jul 8 |
revised |
why do we need Diffie Hellman? added 369 characters in body |
|
Jul 7 |
revised |
Is SSL getting faster because it's getting less secure? added 854 characters in body |
|
Jul 7 |
answered | Is SSL getting faster because it's getting less secure? |
|
Jul 7 |
revised |
why do we need Diffie Hellman? added 57 characters in body |
|
Jul 7 |
answered | why do we need Diffie Hellman? |
|
Jul 6 |
comment |
“SHA-256” vs “any 256 bits of SHA-512”, which is more secure? I'd even say it's more secure, since state collisions become much harder, protecting against a certain class of multi-collisions. It also prevents length-extension. |