Reputation
4,255
Top tag
Next privilege 5,000 Rep.
Approve tag wiki edits
Badges
1 16 40
Newest
 Good Answer
Impact
~118k people reached

Feb
6
revised How to prove that a function F isn't a pseudo random function
Edited post to use MathJax; fixed a couple grammatical errors; added primes to the function definitions (I assume this was the intent)
Jan
17
comment Are there any advantages in using proprietary encryption?
@DewiMorgan: This thread is about encryption, not hash functions. Besides, a concatenated "pepper" is better implemented with a real cryptographic construction, whether that's a MAC construction for a hash function (i.e. HMAC), encrypting password digests before storage, or (in newer password hash function designs) using the "pepper" as a server-side secret parameter (if available, e.g. Argon2's $K$ parameter).
Oct
26
awarded  Good Answer
Sep
6
awarded  Enlightened
Sep
6
awarded  Nice Answer
Sep
5
revised Security strength of RSA in relation with the modulus size
Remove irrelevant 3DES/block cipher paragraph; make Mathematica code a little more readable
Jul
6
awarded  Yearling
Jul
5
revised 1 Billion Bit Encryption?
Added note about lack of launch
Jun
26
reviewed No Action Needed Simple protocol for 1-out-of-2 oblivious transfer
Jun
26
reviewed Reviewed Establishing encryption key using shared secret
Jun
25
answered If you have a file and XOR every bit with a random bit, can you extract any information?
Jun
24
awarded  Constituent
Jun
21
wiki
Jun
17
awarded  Caucus
Jun
11
comment Physical entropy source: How many bits entropy per byte is sufficent?
@curiosity: That's correct! As I linked above, there is a case where a malicious, privileged data source can actually decrease the security of a RNG when mixed into it, but this is essentially an edge case.
Jun
9
comment Physical entropy source: How many bits entropy per byte is sufficent?
@curiosity: For example, I just ran ent on a JPEG photo of me at a party. Result was Entropy = 7.970617 bits per byte but I can assure you that the picture is a far from being near truly random.
Jun
8
comment Physical entropy source: How many bits entropy per byte is sufficent?
@curiosity: Passing ent is a necessary but not sufficient condition for a random stream. If your stream fails ent, it (with overwhelming probability) isn't truly random. If your stream passes ent, it may or may not be truly random - but ent cannot determine which. It is a tool that is only useful as a negative indicator.
Jun
7
answered Physical entropy source: How many bits entropy per byte is sufficent?
Jun
7
revised Estimating bits of entropy
reword confusing sentence
May
20
comment Can i get a list of over hard and long RSA keys? i think i have found a vulnerability in RSA Algorithm
Ah, yeah, RSA-2048 would have been a better choice in retrospect. Truth be told, I just completely forgot about it.