Answer by Thomas Pornin for Trial divisions before Miller-Rabin checks?
The table from the Handbook of Applied Cryptography is computed for candidate primes taken as odd integers. This is equivalent to using trial division by $2$ only. Note that section 4.48 specifies...
View Article
Image may be NSFW.
Clik here to view.
Clik here to view.
Answer by fgrieu for Trial divisions before Miller-Rabin checks?
Update: the formula actually on page 165 in chapter 4 of the HAC is: $t=\lceil{1\over2}\cdot\lg n\rceil$, where $\lg$ is the base-2 logarithm; that is $t=\lceil{1\over2}\cdot k\rceil$; and that crude...
View ArticleTrial divisions before Miller-Rabin checks?
I'm trying to understand prime number generation (more correctly, the primality checking) as described in Handbook of Applied Cryptography.The context is circa pages 145 - 150, and specifically Table...
View Article
More Pages to Explore .....
