Lines Matching refs:primes
211 if(bits < 1536) return 5; // for 512 and 1K primes
327 // This function is used to access the next prime number in the sequence of primes. It requires a pre-
343 // Modifies the input parameter to be a valid value for the number of primes. The adjusted value is either the
370 UINT32 primes // IN: the table length
375 iter->final = AdjustNumberOfPrimes(primes);
384 // This macro sets the default number of primes to the indicated value.
457 UINT32 primes // IN: the number of primes to use
476 primes = AdjustNumberOfPrimes(primes);
507 // Cycle through the primes, clearing bits
509 PrimeInit(7, &iter, primes);
510 // Get the next N primes where N is determined by the mark in the sieveMarks
570 UINT16 primes // IN: number of primes to use.
580 UINT32 primes;
584 primes = BN_num_bits(bnP);
585 if(primes <= 512)
587 primes = AdjustNumberOfPrimes(2048);
590 else if(primes <= 1024)
592 primes = AdjustNumberOfPrimes(4096);
598 primes = AdjustNumberOfPrimes(0); // Set to the maximum
611 ones = PrimeSieve(bnP, fieldSize, field, primes);
685 UINT16 primes
704 if(PrimeSelectWithSieve(bnP, NULL, 0, context, field, primes))
790 ,UINT16 primes, // IN: number of primes to test
835 // primes is composite. Since we don't know which one, set Q to zero and start
836 // over and find a new pair of primes.
875 if(!PrimeSelectWithSieve(bnP, ktxPtr, e, context, fieldSize, primes))
