Reputation
877
Top tag
Next privilege 1,000 Rep.
Edit questions and answers
Badges
4 26
Impact
~25k people reached

Jul
11
comment Combatting traffic shape analysis with spurious packets
That pretty much sums up what I thought. Glad to see I came up with the same idea as the IPSec guys independantly! :D
Jul
11
comment Order of cascaded ciphers
Interesting. Assuming DPA is a risk, are there any analyses of common implementations of popular block ciphers in various modes? Also, is there any published analysis of DPA attacks on CPU-specific cryptographic extensions, such as Intel's AES instructions? I've only scan-read the paper you linked (I'll take a proper look later) so I my apologies if these questions are answered in it.
Jul
11
comment Hash function from narrower block cipher operated in CBC-encryption mode?
Normally my advice is "never roll your own", but... Holy crap!
Jul
11
asked Combatting traffic shape analysis with spurious packets
Jul
11
asked Padding methods for block ciphers - PKCS7 vs ANSI X.923
Jul
10
awarded  Organizer
Jul
10
revised Untraceable communication protocol
Deniable encryption tag.
Jul
10
revised Untraceable communication protocol
link
Jul
10
awarded  Promoter
Jul
10
accepted Hash decrypts key, key decrypts cipher… why?
Jul
10
answered Untraceable communication protocol
Jul
10
suggested approved edit on Untraceable communication protocol
Jul
10
comment KDF with low-entropy salts
@CodeInChaos In terms of theory, I'd agree with you. In practice, however, forcing the attacker to wait until he has breached the database is useful. It gives you time to respond to an incident.
Jul
10
comment Entropy of system data - use all and hash, or trim least significant bits?
@CodeInChaos That's the part I don't really understand. The Wikipedia article is a little vague.
Jul
10
comment KDF with low-entropy salts
@CodeInChaos If the salt is predictable (e.g. user ID from database auto-increment) an attacker could trivially generate small rainbow tables for each user.
Jul
10
answered KDF with low-entropy salts
Jul
10
comment Entropy of system data - use all and hash, or trim least significant bits?
@CodeInChaos I'd never heard of it. So I use hash(entropy) as the key and compute AES(counter, key) where the hash is the key? Not really sure I understand the rest of the protocol.
Jul
10
revised Entropy of system data - use all and hash, or trim least significant bits?
better explanation
Jul
10
asked Entropy of system data - use all and hash, or trim least significant bits?
Jun
6
comment Is there a simple hash function that one can compute without a computer?
You can improve your chance of picking a prime by using the 6k±1 rule. Note that this rule only applies one way - all primes fit the rule, but not all numbers that fit the rule are primes.