Home
last modified time | relevance | path

Searched refs:primes (Results 1 – 19 of 19) sorted by relevance

/openbsd-src/lib/libcrypto/bn/
H A Dbn_prime.pl63 my ($i, $num, $p, $s, @primes);
71 push(@primes, 2);
75 while ($#primes < $num - 1) {
79 for ($i = 0; defined($primes[$i]) && $primes[$i] <= $s; $i++) {
80 next loop if $p % $primes[$i] == 0;
83 die "\$primes[$i] is too large: $primes[$i]" if $primes[$i] > 65535;
84 push(@primes, $p);
97 for ($i = 0; $i <= $#primes; $i++) {
98 printf("%s%5d,", $i % 8 == 0 ? "\n\t" : " ", $primes[$i]);
H A Dbn_prime.c286 BN_ULONG mod = BN_mod_word(rnd, primes[i]); in probable_prime()
291 maxdelta = BN_MASK2 - primes[NUMPRIMES - 1]; in probable_prime()
297 if (((mods[i] + delta) % primes[i]) <= 1) { in probable_prime()
342 BN_LONG mod = BN_mod_word(rnd, primes[i]); in probable_prime_dh()
406 BN_ULONG pmod = BN_mod_word(p, primes[i]); in probable_prime_dh_safe()
407 BN_ULONG qmod = BN_mod_word(q, primes[i]); in probable_prime_dh_safe()
H A Dbn_small_primes.c8 const uint16_t primes[NUMPRIMES] = { variable
H A Dbn_prime.h12 extern const uint16_t primes[NUMPRIMES];
H A Dbn_bpsw.c505 if ((mod = BN_mod_word(n, primes[i])) == (BN_ULONG)-1) in bn_is_prime_bpsw()
508 *is_pseudoprime = BN_is_word(n, primes[i]); in bn_is_prime_bpsw()
/openbsd-src/regress/lib/libcrypto/wycheproof/
H A DMakefile12 REGRESS_TARGETS += regress-wycheproof-primes
28 PROGS += wycheproof-primes
37 wycheproof-primes.o: primality_testcases.h
39 regress-wycheproof-primes: wycheproof-primes
40 ./wycheproof-primes
/openbsd-src/games/primes/
H A DMakefile3 PROG= primes
4 SRCS= pattern.c pr_tbl.c primes.c
H A Dprimes.c91 void primes(ubig, ubig);
138 primes(start, stop); in main()
177 primes(ubig start, ubig stop) in primes() function
/openbsd-src/games/factor/
H A DMakefile5 CFLAGS+=-I${.CURDIR}/../primes
7 .PATH: ${.CURDIR}/../primes
/openbsd-src/regress/lib/libcrypto/bn/
H A Dbn_primes.c47 max = primes[NUMPRIMES - 1] + 1; in test_bn_is_prime_fasttest()
57 is_prime = i == primes[j]; in test_bn_is_prime_fasttest()
H A Dbn_test.c1575 unsigned primes[8] = { 2, 3, 5, 7, 11, 13, 17, 19 }; in test_sqrt()
1577 if (!BN_set_word(p, primes[i])) in test_sqrt()
1579 unsigned primes[8] = { 2, 3, 5, 7, 11, 13, 17, 19 }; test_sqrt() local
/openbsd-src/games/
H A DMakefile6 primes quiz rain random robots sail snake tetris trek wargames \
/openbsd-src/gnu/usr.bin/cvs/diff/
H A Dio.c626 static int const primes[] = variable
695 for (i = 0; primes[i] < equivs_alloc / 3; i++)
696 if (! primes[i])
698 nbuckets = primes[i];
/openbsd-src/gnu/usr.bin/perl/t/japh/
H A Dabigail.t75 my @primes = (2, 3, 7, 13, 53, 101, 557, 1429);
78 my %primeness = ((map {$_ => 1} @primes),
/openbsd-src/gnu/usr.bin/perl/cpan/perlfaq/lib/
H A Dperlfaq4.pod1536 my @primes = (2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31);
1538 for (@primes) { $is_tiny_prime[$_] = 1 }
1539 # or simply @istiny_prime[@primes] = (1) x @primes;
/openbsd-src/gnu/usr.bin/perl/cpan/Math-BigInt/t/
H A Dbigintpm.inc604 # found on: http://www.utm.edu/research/primes/notes/by_year.html
/openbsd-src/games/fortune/datfiles/
H A Dfortunes9808 Since the composite numbers are formed from primes, their qualities are
9809 derived from those primes. So, for instance, the number 6 is "odd but
H A Dfortunes2-o10110 Since the composite numbers are formed from primes, their qualities
10111 are derived from those primes. So, for instance, the number 6 is "odd
H A Dfortunes217573 of flesh must prove a luxury of primes;