Reputation
Next tag badge:
64/100 score
26/20 answers
Badges
2 12 42
Impact
~122k people reached

22h
comment Authenticated EC key exchange without a signing/signature scheme?
Yeah, I guess, the trick is just that it doesn't leak the identity before authentication.
1d
comment Compacting a substitution cipher key
OK, now it is a random permutation from ${\{0,1\}}^3$ to ${\{0,1\}}^3$, helped you a bit with the edit. I presume any random permutation is allowed.
1d
revised Compacting a substitution cipher key
added 76 characters in body
1d
comment Compacting a substitution cipher key
That's not a key, that's a permutation from ${\{0,1}\}^3$ to ${\{0,1\}}^3$. And it is identical to performing XOR with 1 for each bit, also known as a bit complement.
1d
revised Would this method allow fast authenticated encryption using only a single encryption operation per block?
rolled back to a previous revision
1d
revised Why is Bcrypt called a Key Derivation Function?
added 8 characters in body
1d
revised Why is Bcrypt called a Key Derivation Function?
added 318 characters in body
1d
answered Why is Bcrypt called a Key Derivation Function?
1d
comment Authenticated EC key exchange without a signing/signature scheme?
If you change PAKE to read PACE then you've got another one - though I haven't compared them yet :)
1d
revised Why does TLS do Authenticate-then-Encrypt instead of Encrypt-then-Authenticate?
added 58 characters in body
1d
revised Why do we truncate the hash when using DSA?
added 191 characters in body
1d
answered Why do we truncate the hash when using DSA?
2d
comment Hardening of random number generators
That's true, but usually the internal state is pretty large. I'm not sure about the precise implementation though. Never hurts to reseed it a bit of course, maybe between calls.
2d
comment Hardening of random number generators
If the RNG does provide entropy then it may be more sensible generate a lot of data and to use a KBKDF such as HKDF or to feed the entropy in into a random number generator (just to bring it back to a previous problem, maybe I'm a mathematician after all :) )
2d
comment Hardening of random number generators
Seems to me that if the RNG is broken in the sense that it is predictable (by someone) that performing PBKDF2 won't do much good. The salt will be predictable as well. If the RNG doesn't generate enough entropy then this technique seems to add a bit of security. Basically, if the attacker has to guess than it may add a layer of security. How much depends on how much the attacker has to guess (if only 2 random values are possible then having the attacker do 2 PBKDF2 calculations won't do much).
2d
comment HKDF entropy extraction
In your solution you are using a key derivation method as key generator. DRBG's, KDF's and key generators are closely related, but they differ on the details. As it seems that your issue is with the random generator, it seems more logical to replace that. Changed the answer a bit to reflect this.
2d
revised HKDF entropy extraction
added 182 characters in body
2d
comment HKDF entropy extraction
@Paya I didn't know that that answer existed, but it is nice to know that I'm being backed up by Thomas :) Your idea isn't bad or anything, but if you want to have more random numbers than just for the key (and you usually do) then a PRNG makes a bit more sense.
May
22
answered HKDF entropy extraction
May
22
comment Hash length extension attack - SHA256 to 512 - impossible, correct?
Just out of curiosity, would the different initial values be enough to thwart a length extension attack?