meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 6 months |
| seen | May 4 at 3:03 | |
| stats | profile views | 1 |
|
Jan 7 |
comment |
Break double encryption If you can't fit a full table, why not try using a smaller table? |
|
Dec 10 |
comment |
RSA Key generation Public exponent too big But if e is too small, and you don't pad correctly, it will be insecure. |
|
Dec 10 |
comment |
Factorize RSA knowing several N and E Why do you care if the factors are prime? RSA is always done using a product of two (probable) primes, so any nontrivial factor will be prime. |
|
Dec 4 |
awarded | Necromancer |
|
Nov 24 |
comment |
Questions about William's p+1 It can find anything with $B_2$ less than say, 10,000 in minutes. 20 bits would take around 42 hours. |
|
Nov 24 |
comment |
Questions about William's p+1 At the current rate, it will take my script 10-20 years to solve that, assuming that you used 32 bit factors. But that is unoptimized python running on a five year old laptop. I guess I need to find a more optimized implementation. Or you could use smaller factors. |
|
Nov 24 |
comment |
Questions about William's p+1 @fgrieu Whenever I try to copy your number, I get a bunch of nonascii junk mixed in. Are you sure you pasted it correctly? |
|
Nov 23 |
comment |
Questions about William's p+1 @fgrieu I'd be really interested to try that challenge. Is there anyway for you to send me the numbers? I don't think SO's comment system is really suitable for that. |
|
Nov 23 |
comment |
Questions about William's p+1 @fgrieu But William's p+1 will also find factors such that p-1 is smooth, since you'll get quadratic residues half the time. |
|
Nov 22 |
awarded | Student |
|
Nov 21 |
comment |
Is it safer to encrypt twice with RSA? It isn't necessarily true that double encryption is useless. It could help against meet in the middle attacks. |
|
Nov 21 |
asked | Questions about William's p+1 |
|
Nov 18 |
awarded | Teacher |
|
Nov 18 |
answered | Is Wiener's attack on RSA extendable to larger keys with low hamming weight? |
|
Nov 18 |
awarded | Supporter |
