10,054 reputation
12451
bio website github.com/CodesInChaos
location Frankfurt, Germany
age
visits member for 3 years, 4 months
seen 6 hours ago

Jul
19
comment Generating a secure random number in javascript
Using strong crypto in the RNG is the easy part. The real problem is entropy gathering. Which sources to use, and how to estimate the entropy. One really common issue is allowing consumers to read from the PRNG before enough initial entropy has been gathered.
Jul
19
comment Jumblar: Using map locations as passwords
The entropy contained in a single location is pretty low, so the generated password might be weak.
Jul
18
revised What is meant by $\tilde\Omega(\lambda^4)$?
deleted 191 characters in body; edited tags; edited title; edited tags
Jul
17
comment AES 256 Encryption - Is it really easy to decrypt if you have the key?
@bhs Then get out a time machine and travel back a few centuries. It is a core principle of modern crypto that it must be secure if the attacker knows everything about the scheme, except the key.
Jul
17
comment How can scrypt be improved to counter GPU mining
One can simply adjust the memory use parameter of scrypt. Litecoin chose a really small amount of memory. It's also possible to design a new scheme that doesn't allow certain time-memory trade-offs the GPU implementation takes advantage of.
Jul
16
comment Birthday Attack
That 2H looks weird. Shouldn't that be in the denominator?
Jul
16
reviewed Approve suggested edit on Birthday Attack
Jul
16
comment Generating a secure random number in javascript
Your approach is certainly much worse than hashing all the raw entropy with SHA-2 and then expanding it to the desired size.
Jul
16
comment Generating a secure random number in javascript
See Generate cryptographically strong pseudorandom numbers in Javascript? on security.SE
Jul
16
reviewed Approve suggested edit on why public key cryptography (RSA) is use in sites like Google, facebook (what is the need to ecode data in these sites)?
Jul
15
revised Technical feasibility of decrypting https by replacing the computer's PRNG
added 2 characters in body
Jul
15
comment How can Alice prove that a message has not been tampered with?
What do you mean by privileges? Can Bob use the message to claim some privileges from Carol? In that case a simple digital signature should do the trick. Bob can modify the message, but carol won't accept it.
Jul
15
comment Primality testing (deterministic vs. non-deterministic)
On real hardware all algorithms are probabilistic and something like $2^{-200}$ is certainly smaller than the probability of your hardware messing up the computation. So deterministic algorithms don't really offer a practical advantage.
Jul
15
comment Primality testing (deterministic vs. non-deterministic)
It'd be useful to add a column that states the probability of being wrong.
Jul
15
revised security amplification
added 9 characters in body
Jul
14
comment How does NaCL Poly1305 implementation do modular multiplication?
When you reduce $x \cdot 2^{130}$ modulo $2^{130}-5$ you get $5\cdot x$. When you reduce $x \cdot 2^{136} = x \cdot {256}^{17}$ modulo $2^{130}-5$ you get $320\cdot x$.
Jul
14
answered Building a hard to factor number without knowing its factorization
Jul
14
comment How does NaCL Poly1305 implementation do modular multiplication?
There are Floodyberry's implementations. The poly1305-donna-unrolled variant can be easily ported to other languages. I'm working on one as well, but I'm not finished yet.
Jul
14
revised How does NaCL Poly1305 implementation do modular multiplication?
added 74 characters in body
Jul
14
comment How does NaCL Poly1305 implementation do modular multiplication?
It's funny that this implementation is used so often, given its bad performance.