Tagged Questions
0
votes
0answers
59 views
Why is it impractical to generate a semiprime dictionary? [duplicate]
This might be a very simple question. However, I am just learning the concept, so just excuse me.
I am wondering why there is not any attempt to generate all semiprime numbers? (as an dict. attack to ...
2
votes
1answer
114 views
Choosing good parameter for Lenstra's elliptic curve factorization
In Wikipedia, there is an article explaining Lenstra's factorization algorithm. As far as I got it, we choose some $e \in \mathbb{N}$ and a point $P$ on the curve and then calculate $eP$. While ...
1
vote
2answers
241 views
Is there an algorithm for factoring N, which is just as simple as this one, but faster?
I found a simple algorithm for factoring semiprime numbers, you can read about it in Factoring Semiprimes and Possible Implications for RSA.
It basically works like this:
You reverse the digits in ...
9
votes
5answers
456 views
Is it feasible to build an index of prime factors?
Would it be possible to break an RSA key, in for example 1 week of time, if the cracker have already spent X number of years building an index of primes by performing every permutation of existing ...
