meta user
network profile
| bio | website | codingrobots.com |
|---|---|---|
| location | ||
| age | 30 | |
| visits | member for | 1 year, 9 months |
| seen | May 17 at 11:14 | |
| stats | profile views | 7 |
Programmer and founder at Coding Robots
|
Dec 13 |
revised |
A single password manager vs password generator/hash Better wording |
|
Dec 13 |
awarded | Citizen Patrol |
|
Dec 13 |
revised |
A single password manager vs password generator/hash Added info about the linked password generator. |
|
Dec 13 |
answered | A single password manager vs password generator/hash |
|
Dec 11 |
comment |
Deriving Keys for Symmetric Encryption and Authentication If your key has 256 bits of entropy and your key derivation function is one-way, adding or removing iterations to key derivation won't make bruteforcing particularly harder or easier -- 1 iteration is already hard enough. Iterations are needed when you're dealing with passwords, which don't have enough entropy. |
|
Dec 11 |
comment |
Can I use PGP to sign a message without providing cryptographic non-repudation? @AJHenderson thanks, the answer looks more clear now. |
|
Dec 10 |
comment |
Can I use PGP to sign a message without providing cryptographic non-repudation? @AJHenderson DH is not asymmetric encryption, but it's an asymmetric algorithm. If we have two classes -- symmetric and asymmetric, where would you put DH? Certainly not symmetric. |
|
Dec 10 |
comment |
Can I use PGP to sign a message without providing cryptographic non-repudation? "With asymmetric cryptography, the sender is not able to encrypt it such that the receiver could have encrypted it without disclosing a private secret." This is incorrect: en.wikipedia.org/wiki/Diffie%E2%80%93Hellman_key_exchange |
|
Dec 9 |
revised |
Why are protocols often proven secure under the random oracle model instead of a hash assumption? Fixed typos and punctuation. |
|
Dec 9 |
comment |
Deriving Keys for Symmetric Encryption and Authentication Why do you need "proof of work" if your master key is random? |
|
Dec 9 |
suggested | suggested edit on Why are protocols often proven secure under the random oracle model instead of a hash assumption? |
|
Dec 7 |
revised |
RSA 4096 bit key benchmark Restore previous version |
|
Dec 7 |
suggested | suggested edit on RSA 4096 bit key benchmark |
|
Dec 5 |
comment |
Compare Blockmode CBC (with diffuser) against XTS @CodesInChaos I think the reference is to Microsoft's Elephant diffuser used in BitLocker (download.microsoft.com/download/0/2/3/… — warning: downloads PDF). |
|
Oct 19 |
revised |
What exactly is addition modulo $2^{32}$ in cryptography? Fixed typo in title. |
|
Oct 19 |
revised |
Traditional DES scheme in Unix crypt function Fixed typo in title. |
|
Oct 19 |
suggested | suggested edit on Traditional DES scheme in Unix crypt function |
|
Oct 19 |
suggested | suggested edit on What exactly is addition modulo $2^{32}$ in cryptography? |
|
Oct 18 |
awarded | Commentator |
|
Oct 18 |
comment |
Store user passwords in database using Java Application Use this mindrot.org/projects/jBCrypt |
