Andrzej Chmielowiec

  • Citations Per Year
Learn More
This article presents a primality test known as APR (Adleman, Pomerance and Rumely) which was invented in 1980. It was later simplified and improved by Cohen and Lenstra. It can be used to prove primality of numbers with thousands of bits in a reasonable amount of time. The running time of this algorithm for number N is O((lnN)C ln ln lnN) for some constant(More)
  • 1