CodesInChaos

less info
meta site favicon meta user | stack exchange network profile network profile
5,964 reputation
1927
bio website github.com/CodesInChaos
location Munich, Germany
age
visits member for 1 year, 10 months
seen 12 hours ago
stats profile views 109

1,109 Actions

suggestions reviews revisions comments badges posts accepts all
May
20
 asked Why do new versions of TLS use an explicit IV for CBC suites?
May
20
 awarded  Excavator
May
20
 revised Can you create a strong blockcipher with small blocksize, given a strong blockcipher of conventional blocksize?
texified some formulas
May
20
 suggested suggested edit on Can you create a strong blockcipher with small blocksize, given a strong blockcipher of conventional blocksize?
May
13
 answered Can A PRNG Be Used To Generate Multiple Private Keys for ECDSA?
May
13
 revised Is a random length-extension worth the effort?
added 13 characters in body
May
13
 answered Is a random length-extension worth the effort?
May
12
 comment Is using slow password hashing on the client side easier attackable than on the server side?
Is there a reason why you salt the second cheap hash?
May
11
 comment How were the AES key and block length subsets of Rijndael selected?
I guess 128 because it's the standard level of what's considered secure, and the other two because it's more than that, at reasonable steps.
May
11
 comment Is it fair to assume that SHA1 collisions won't occur on a set of <100k strings
2^51 sounds computationally feasible. Why haven't we seen any collisions yet?
May
11
 comment Why DSA cannot be used for encryption?
@jug That scheme is certainly not asymmetric encryption. It's not even real encryption, it's just a way to transmit secret information without using "real" encryption.
May
11
 comment Does NTRU decrypt correctly now?
A failure rate of 2^-256 is small enough, since hardware failures are certainly more likely than that. But I imagine convincing people that it doesn't matter isn't easy. In my experience many programmers have an irrational fear of probabilistic algorithms.
May
11
 answered Is it fair to assume that SHA1 collisions won't occur on a set of <100k strings
May
11
 comment Why DSA cannot be used for encryption?
@LunarMushrooms That's a nonsensical question. It's a signature algorithm. You can't use RSA signature algorithms for encryptions either. You'd need to ask if the mathematical structure underlying DSA can be used for encryption. AFAIK it can't, but it can be used for key-exchange, which is very similar to encryption.
May
11
 comment Why DSA cannot be used for encryption?
You can sue Diffie-Hellman keyexchange to achieve something similar to encryption.
May
9
 comment Encryption with “constant” initialization vector considered harmful
"you are not supposed to change your secret (the key) often, because this needs to be shared with the other party" Many protocols, including TLS, use a new symmetric key for each connection. Only the asymmetric keys used for authentication need to be fixed.
May
9
 comment How can we find Public key have only 8 or 16bits? How many messages does Eve need to know the Public key in RSA?
RSA below 512 bits is ridiculously broken, and RSA below 1024 bits is still pretty weak. If you want small keys/blocks, go with elliptic curves, but even they become weak below 160 bits.
May
9
 comment How can we find Public key have only 8 or 16bits? How many messages does Eve need to know the Public key in RSA?
One can't even apply padding to 16 bit RSA. So do you want to use textbook RSA?
May
8
 comment How can disk encryption systems (like Truecrypt) resist frequency analysis when they allow random access?
"However, things change when an attacker can take multiple looks at the volume at different points in time." That's why the TrueCrypt authors discourage backing up a volume by copying the container.
May
6
 revised How many RSA keys before a collision?
added 477 characters in body
1 … 46 47 48 49 50 … 56