![new prime number generator algorithm new prime number generator algorithm](https://www.rff.com/software_flowchart_small.png)
- #New prime number generator algorithm mod
- #New prime number generator algorithm trial
- #New prime number generator algorithm crack
Similarly Bob calculates (ra to the power xb) mod p = Final key which is again equivalent to (g to the power(xb * xa)) mod p.Alice calculates ( rb to the power xa) mod p = Final key which is equivalent to (g to the power (xa*xb) ) mod p. Now comes the heart of this algorithm.So eve now has information about g, p, ra and rb.Obviously eve also comes to know about rb.
![new prime number generator algorithm new prime number generator algorithm](https://i1.rgstatic.net/publication/331967146_COMPARISON_AMONG_DIFFERENT_PRIME_GENERATOR_ALGORITHMS/links/5c95cdffa6fdccd4603376cb/largepreview.png)
#New prime number generator algorithm crack
One may argue that this is not that difficult to crack but what if the value of p is a very huge prime number? Well, if this is the case then deducing x (if r is given) becomes almost next to impossible as it would take thousands of years to crack this even with supercomputers.
![new prime number generator algorithm new prime number generator algorithm](https://www.primesdemystified.com/Algorithm_Speed_Program_Results.jpg)
But given r (with g and p known) its difficult to deduce x.
#New prime number generator algorithm trial
Currently, I only have my "Prime Factorization Algorithm" perform trial division on $n$ for primes in the sequence $2,3,5,7,11.,\sqrt$ or about 46,340. What I've learned so far is that determining the primality of a number is very difficult but also that prime factorization is even more difficult (computationally). I've been working on an identical problem.