Cryptanalysis of RSA

Research Areas: End System Security

Principal Investigator: Samuel Wagstaff

We study the minimum period of the Bell numbers, which arise in combinatorics, modulo a prime.  It is shown that this period is probably always equal to its maximum possible value.  Interesting new divisibility theorems are proved for possible prime divisors of the maximum possible period.  The conclusion is that these numbers are not suitable for use as RSA public keys.

Personnel

Other PIs: Peter L. Montgomery

Students: Sangil Nahm

Representative Publications

  • Peter L Montgomery, Sangil Nahm and Samuel S Wagstaff Jr., “The period of the Bell numbers modulo a prime,” Math. Comp. v. 79 (2010), pp. 1793--1800.

Keywords: Bell numbers, divisibility theorems, RSA public keys

Coming Up!

Our annual security symposium will take place on April 7th and 8th, 2020.
Purdue University, West Lafayette, IN

More Information