Fast Verification, Testing, and Generation of Large Primes


Abs&&. We present a prime certification method which permits shorter certificates of primality than the method analyzed by Pratt. We analyze the expected time required by a stochastic method for showing that n is prime, given a factorization of n 1. We use this method, together with Rabin’s stochastic m.c;hOd for verifying COmpOSiteneSs, to obtain an… (More)
DOI: 10.1016/0304-3975(79)90002-1


  • Presentations referencing similar topics