The hardest part for me to follow was right at the beginning in the p-1 factoring algorithm. I couldn't understand why we were being putting a to the B! power. It took me a second read through to understand we are trying to find a bound where B! is divisible by p-1.
The most interesting fact for me was to find out why when generating strong primes we first need to assure that the (prime - 1 / 2) is also a prime. When I implemented RSA I had this requirnment and was not completly sure why, but now I see. It gives us a large prime factor for p-1, which makes it resistant to the p-1 factoring algorithm.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment