265 reputation
18
bio website
location
age
visits member for 1 year, 10 months
seen 2 days ago

Jun
23
awarded  Yearling
Feb
22
awarded  Critic
Feb
19
revised How much plainext could be known without reducting security of RSA?
spelling correction
Feb
19
comment How much plainext could be known without reducting security of RSA?
@fgrieu Thanks, I corrected my statement. Reference imgur.com/a/ozrQo
Feb
19
revised How much plainext could be known without reducting security of RSA?
added 39 characters in body
Feb
19
comment How much plainext could be known without reducting security of RSA?
@DrLecter Yes. Let's account padding as just part of plaintext.
Feb
19
asked How much plainext could be known without reducting security of RSA?
Feb
13
comment Prime factorization of RSA modulus
Knowing private key you will still need bit of brute force, but with high probability (like 50%).
Feb
11
comment How can I simulate and measure brute force hacking using RSA?
Maybe you meant RSA hacking using brute force?
Feb
10
comment Deterministically combine more than one source of entropy
Note of dangers of combining many sources of entropy for cryptography: blog.cr.yp.to/20140205-entropy.html
Feb
7
comment Diffie-Hellman explicit key confirmation
@herrfz man-in-the-middle is always issue.
Jan
27
comment How can I find the prime numbers used in RSA?
Interesting approach, where to read about it? Also, Fermat's factorization method factors this modulus in one step.
Jan
25
revised How can I find the prime numbers used in RSA?
typo
Jan
25
revised How can I find the prime numbers used in RSA?
added 174 characters in body
Jan
25
revised How can I find the prime numbers used in RSA?
added 3 characters in body
Jan
25
answered How can I find the prime numbers used in RSA?
Jan
14
revised Where does the $\varphi(n)$ part of RSA come from?
added 447 characters in body
Jan
14
revised Where does the $\varphi(n)$ part of RSA come from?
added 447 characters in body
Jan
14
revised Where does the $\varphi(n)$ part of RSA come from?
added 402 characters in body
Jan
14
comment Are safe primes $p=2^k \pm s$ with $s$ small less recommandable than others as a discrete log modulus?
I wonder if there is more practical attacks on choosen safe primes.