9,417 reputation
12345
bio website github.com/CodesInChaos
location Frankfurt, Germany
age
visits member for 3 years
seen 9 hours ago

13h
comment AES CTR rekeys rapidly, does this produce patterns?
In your codeproject article you claim that this benerator is better than existing ones. Can you describe any advantages over the generator part of fortuna? It's based on AES-CTR, but is much simpler than yours.
1d
comment AES CTR rekeys rapidly, does this produce patterns?
I guess that NextInt32(2) takes several seconds for each value. That counts as "slow as hell" as far as I'm concerned.
1d
comment AES CTR rekeys rapidly, does this produce patterns?
At minimum, your algorithm is ugly, overly complicated and slow as hell.
1d
comment AES CTR rekeys rapidly, does this produce patterns?
Please include a deacription of your algorithm in your question, it should be able to stand on its own.
2d
awarded  Yearling
Jul
17
comment Are there any reasons for using SSL over IPSec?
I think this fits security.se betterthan crypto. @mikeazo can you talk to the sec.se mods and possibly migrate?
Jul
14
comment Is there any reason for encryption to be as fast as possible?
Is there a reason for encryption to be slow?
Jul
12
comment McEliece and cryptanalysis
I'd expect grover to be applicable to some degree.
Jul
9
comment Is calculating a hash code for a large file in parallel less secure than doing it sequentially?
Note that Merkle-Damgard has a similar loss of second pre-image security, so compared to SHA-2 the security loss is only due to the additional compressions the tree adds, which should account for less than a bit. The workarounds are pretty similar too, either add unique node tagging or use a wide-pipe.
Jul
8
comment What exactly does a key do?
If you have an $b$ bit key, there are $2^b$ possibilities. The base 2 logarithm $\log_2$ is the inverse of the exponential function $2^x$. So with 26 possible keys, you get $\log_2{26} \approx 4.7$ or equivalently $2^{4.7} \approx 26$.
Jul
8
comment What exactly does a key do?
In that sample you could consider "Shift by $x$" the algorithm (Caesar encryption) and $x=2$ the key. This would be a $\log_2{26}\approx4.7$ bit key.
Jul
6
comment Convergent encryption has dictionary attack, but why hash function doesn't?
Sending the hash of the plaintext suffers from the same problems as convergent encryption. The best writeup of the security properties of CE I've seen so far is zooko's Drew Perttula and Attacks on Convergent Encryption
Jul
4
revised Use ElGamal to solve Diffie-Hellman problem
edited tags
Jul
4
comment Use ElGamal to solve Diffie-Hellman problem
AFAIK ElGamal only reduces to the decisional DH problem, not the the computational DH problem. So this proof shouldn't exist
Jul
2
awarded  Nice Question
Jul
2
awarded  Curious
Jul
1
comment Types of cryptography
You should read Structure vs. Combinatorics in Computational Complexity
Jul
1
comment Types of cryptography
The underlying problem is called AES. Typical symmetrical schemes don't reduce to an elegant mathematical problem. They rely on the complexity emerging out of the interaction of many simple operations. In a way RSA/DH etc. are structured whereas AES is unstructured.
Jun
30
revised Combining Random Hashes - avoiding collisions and ensuring randomness
added 579 characters in body
Jun
30
comment Combining Random Hashes - avoiding collisions and ensuring randomness
@Navonod SipHash has been designed with a uniformly random key in mind, so you're not using it as intended. But since your requirements are much weaker than what it's designed to offer, that might still be okay for you.