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

3h
reviewed Looks OK How hard is it to find plaintexts whose hashes satisfy $h(a)\oplus h(b)=h(c)$?
3h
reviewed Looks OK Is there any existing cipher capable of scaling from a 1 bit key up to a one-time-pad?
3h
reviewed Looks OK How to use GCM mode and associated-data properly
3h
reviewed Looks OK Negative exponents in Shoup's threshold RSA?
3h
reviewed Reviewed Why should the RSA private exponent have the same size as the modulus?
3h
reviewed Reviewed State of the art RSA key generation
3h
reviewed Leave Open Merkle hash tree updates
Jan
16
reviewed No Action Needed Exploration of Blum Micali Security By Seed Size
Jan
15
reviewed Leave Open Entropy in relation to computer security
Jan
15
reviewed Reviewed Simplifying the zero-knowledge proof example?
Jan
15
reviewed Reviewed Unbreakable code and mathematical impossibility
Jan
4
reviewed Leave Open Why are there no MACs inspired by block cipher modes other than CBC and CFB?
Jan
3
reviewed Close can anyone give the java code to encrypt files using paillier
Jan
3
reviewed Close How will Cryptography be changed by Quantum Computing?
Dec
4
reviewed Edit Point decompression on an elliptic curve
Nov
3
reviewed Approve Showing that $2^{N-1}\equiv1\pmod N$ when $N=2^p-1$ for prime $p$
Oct
6
reviewed No Action Needed advantages of hashing over elliptic curve signatures for a proof of work protocol
Oct
2
reviewed Approve Strength of MD5 in finding duplicate files
Sep
18
reviewed Satisfactory MAC using a modified CBC mode of operation
Sep
18
reviewed Excellent Elliptic Curve Cryptography