Reputation
12,178
Next tag badge:
89/100 score
20/20 answers
Badges
1 30 60
Newest
 Yearling
Impact
~204k people reached

Feb
17
comment Pseudorandom number generators based on hard problems in mathematics
@poncho There's also "The RSA problem is hard and the hash function used to create the padding is a random oracle".
Feb
17
comment Pseudorandom number generators based on hard problems in mathematics
There is Blum-Blum-Shub, which is related to factoring. But the security proof isn't very tight.
Feb
17
comment Anonymous Gravatar Problem
@fgrieu The idea behind gravatar is associating an image with an email address. So it needs long term email addresses to function properly. A couple of years ago I recovered about 20% of email addresses on stackoverflow by guessing. Others have achieved closer to 50% using a GPU hasher, but on a different dataset.
Feb
16
reviewed Reviewed Decryption of message in IBE without random oracle using bilinear pairing registration?
Feb
16
revised Decryption of message in IBE without random oracle using bilinear pairing registration?
deleted 16 characters in body
Feb
15
comment SHA-512 Length Field - What is it?
Yes, it's the length of the message in bits (without padding).
Feb
15
comment Alternative sources of random numbers
1) You need something secret to seed a CSPRNG. 2) How would you obtain that data? If you download it, and you even trust the source to keep the data secret, you still need enough random data beforehand to initiate a TLS connection. But if you already have a good random seed, why bother with that stuff?
Feb
14
answered Anonymous Gravatar Problem
Feb
14
comment Factoring two RSA modulus with known $|p_1 - p_2| < \ell $
if $p_1=p_2$ you can simply compute the greatest-common-divisor of $N_1$ and $N_2$ to factor them.
Feb
13
comment Which characters to take into account when calculating unicity distance?
You can get much lower if you use dictionaries containing English words.
Feb
13
comment Malicious DH groups
AFAIK Miller-Rabin rejects non primes with probability of at least 3/4, so after 40 passes even maliciously constructed prime candidates should only pass with probabiility <$2^{-80}$.
Feb
12
comment Java RSA Padding: no libraries used
For signatures you could use full-domain-hash (FDH). For encryption you could use hybrid encryption based on RSA-KEM.
Feb
12
reviewed Leave Open Is the SILC protocol still used?
Feb
12
reviewed Looks OK Is the SILC protocol still used?
Feb
12
comment Analogue encryption algorithms
From the wikipedia article you linked, it sounds like the signal is digital, not analog.
Feb
12
comment Analogue encryption algorithms
Frequency hopping isn't really encryption. It's main purpose is not even confidentiality of the message content, but avoiding jamming (DoS attack) and might make it harder to find the position of the sender.
Feb
12
revised Is symmetric encryption no longer necessary?
edited title
Feb
12
revised Why does the recommended key size between symmetric and asymmetric encryption differ greatly?
edited title
Feb
11
comment AES encryption takes more time to decrypt than encrypt
Can you include a link to the library you're using?
Feb
11
reviewed Edit AES encryption takes more time to decrypt than encrypt