9,586 reputation
12347
bio website github.com/CodesInChaos
location Frankfurt, Germany
age
visits member for 3 years, 1 month
seen 20 mins ago

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.
Jul
14
revised How does NaCL Poly1305 implementation do modular multiplication?
added 74 characters in body
Jul
14
revised How does NaCL Poly1305 implementation do modular multiplication?
added 74 characters in body
Jul
14
answered How does NaCL Poly1305 implementation do modular multiplication?
Jul
14
awarded  Enlightened
Jul
14
awarded  Nice Answer
Jul
14
awarded  Custodian
Jul
14
reviewed Leave Open Efficient Incremental Updates to Large Merkle Tree
Jul
14
comment Technical feasibility of decrypting https by replacing the computer's PRNG
@Thomas I heard that Linux uses RdRand directly in some places instead of just mixing it into the pool. In that case you don't need to poison the entropy pool.