Finding Large Prime Numbers: A Hardware-Software Codesign System

  • Vaibhav Vaish ,
  • Ashish Kapoor

We describe a fast method to find primes of the form 2p—1, by implementing special circuits to perform modulo 2p—1 arithmetic, where p itself is an input to the circuit. We have followed a codesign approach. The primality verification is implemented in hardware. The software component supplies inputs to the randomized verification algorithm.