Create a tool that will analyze the primes of your RSA secret key (private key): count the number of consecutive composites before and after each prime, and report how unusual (perhaps a p-value) that count is compared to what one would expect by the Poisson distribution and Prime Number Theorem. This should be easy.
If primes were found by testing consecutive numbers (e.g., GnuPG) then these numbers will be aberrantly high.
No comments :
Post a Comment