1255767Sdes/* $OpenBSD: moduli.c,v 1.27 2013/05/17 00:13:13 djm Exp $ */ 2124208Sdes/* 3124208Sdes * Copyright 1994 Phil Karn <karn@qualcomm.com> 4124208Sdes * Copyright 1996-1998, 2003 William Allen Simpson <wsimpson@greendragon.com> 5124208Sdes * Copyright 2000 Niels Provos <provos@citi.umich.edu> 6124208Sdes * All rights reserved. 7124208Sdes * 8124208Sdes * Redistribution and use in source and binary forms, with or without 9124208Sdes * modification, are permitted provided that the following conditions 10124208Sdes * are met: 11124208Sdes * 1. Redistributions of source code must retain the above copyright 12124208Sdes * notice, this list of conditions and the following disclaimer. 13124208Sdes * 2. Redistributions in binary form must reproduce the above copyright 14124208Sdes * notice, this list of conditions and the following disclaimer in the 15124208Sdes * documentation and/or other materials provided with the distribution. 16124208Sdes * 17124208Sdes * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 18124208Sdes * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 19124208Sdes * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 20124208Sdes * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 21124208Sdes * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 22124208Sdes * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 23124208Sdes * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 24124208Sdes * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 25124208Sdes * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 26124208Sdes * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 27124208Sdes */ 28124208Sdes 29124208Sdes/* 30124208Sdes * Two-step process to generate safe primes for DHGEX 31124208Sdes * 32124208Sdes * Sieve candidates for "safe" primes, 33124208Sdes * suitable for use as Diffie-Hellman moduli; 34124208Sdes * that is, where q = (p-1)/2 is also prime. 35124208Sdes * 36124208Sdes * First step: generate candidate primes (memory intensive) 37124208Sdes * Second step: test primes' safety (processor intensive) 38124208Sdes */ 39124208Sdes 40124208Sdes#include "includes.h" 41162852Sdes 42240075Sdes#include <sys/param.h> 43162852Sdes#include <sys/types.h> 44162852Sdes 45162852Sdes#include <openssl/bn.h> 46181111Sdes#include <openssl/dh.h> 47162852Sdes 48240075Sdes#include <errno.h> 49162852Sdes#include <stdio.h> 50162852Sdes#include <stdlib.h> 51162852Sdes#include <string.h> 52162852Sdes#include <stdarg.h> 53162852Sdes#include <time.h> 54240075Sdes#include <unistd.h> 55162852Sdes 56124208Sdes#include "xmalloc.h" 57181111Sdes#include "dh.h" 58124208Sdes#include "log.h" 59124208Sdes 60221420Sdes#include "openbsd-compat/openssl-compat.h" 61221420Sdes 62124208Sdes/* 63124208Sdes * File output defines 64124208Sdes */ 65124208Sdes 66124208Sdes/* need line long enough for largest moduli plus headers */ 67137015Sdes#define QLINESIZE (100+8192) 68124208Sdes 69126274Sdes/* 70126274Sdes * Size: decimal. 71124208Sdes * Specifies the number of the most significant bit (0 to M). 72126274Sdes * WARNING: internally, usually 1 to N. 73124208Sdes */ 74137015Sdes#define QSIZE_MINIMUM (511) 75124208Sdes 76124208Sdes/* 77124208Sdes * Prime sieving defines 78124208Sdes */ 79124208Sdes 80124208Sdes/* Constant: assuming 8 bit bytes and 32 bit words */ 81137015Sdes#define SHIFT_BIT (3) 82137015Sdes#define SHIFT_BYTE (2) 83137015Sdes#define SHIFT_WORD (SHIFT_BIT+SHIFT_BYTE) 84137015Sdes#define SHIFT_MEGABYTE (20) 85137015Sdes#define SHIFT_MEGAWORD (SHIFT_MEGABYTE-SHIFT_BYTE) 86124208Sdes 87124208Sdes/* 88137015Sdes * Using virtual memory can cause thrashing. This should be the largest 89137015Sdes * number that is supported without a large amount of disk activity -- 90137015Sdes * that would increase the run time from hours to days or weeks! 91137015Sdes */ 92137015Sdes#define LARGE_MINIMUM (8UL) /* megabytes */ 93137015Sdes 94137015Sdes/* 95137015Sdes * Do not increase this number beyond the unsigned integer bit size. 96137015Sdes * Due to a multiple of 4, it must be LESS than 128 (yielding 2**30 bits). 97137015Sdes */ 98137015Sdes#define LARGE_MAXIMUM (127UL) /* megabytes */ 99137015Sdes 100137015Sdes/* 101124208Sdes * Constant: when used with 32-bit integers, the largest sieve prime 102124208Sdes * has to be less than 2**32. 103124208Sdes */ 104137015Sdes#define SMALL_MAXIMUM (0xffffffffUL) 105124208Sdes 106124208Sdes/* Constant: can sieve all primes less than 2**32, as 65537**2 > 2**32-1. */ 107137015Sdes#define TINY_NUMBER (1UL<<16) 108124208Sdes 109124208Sdes/* Ensure enough bit space for testing 2*q. */ 110149749Sdes#define TEST_MAXIMUM (1UL<<16) 111149749Sdes#define TEST_MINIMUM (QSIZE_MINIMUM + 1) 112149749Sdes/* real TEST_MINIMUM (1UL << (SHIFT_WORD - TEST_POWER)) */ 113149749Sdes#define TEST_POWER (3) /* 2**n, n < SHIFT_WORD */ 114124208Sdes 115124208Sdes/* bit operations on 32-bit words */ 116149749Sdes#define BIT_CLEAR(a,n) ((a)[(n)>>SHIFT_WORD] &= ~(1L << ((n) & 31))) 117149749Sdes#define BIT_SET(a,n) ((a)[(n)>>SHIFT_WORD] |= (1L << ((n) & 31))) 118149749Sdes#define BIT_TEST(a,n) ((a)[(n)>>SHIFT_WORD] & (1L << ((n) & 31))) 119124208Sdes 120124208Sdes/* 121124208Sdes * Prime testing defines 122124208Sdes */ 123124208Sdes 124137015Sdes/* Minimum number of primality tests to perform */ 125149749Sdes#define TRIAL_MINIMUM (4) 126137015Sdes 127124208Sdes/* 128124208Sdes * Sieving data (XXX - move to struct) 129124208Sdes */ 130124208Sdes 131124208Sdes/* sieve 2**16 */ 132124208Sdesstatic u_int32_t *TinySieve, tinybits; 133124208Sdes 134124208Sdes/* sieve 2**30 in 2**16 parts */ 135124208Sdesstatic u_int32_t *SmallSieve, smallbits, smallbase; 136124208Sdes 137124208Sdes/* sieve relative to the initial value */ 138124208Sdesstatic u_int32_t *LargeSieve, largewords, largetries, largenumbers; 139124208Sdesstatic u_int32_t largebits, largememory; /* megabytes */ 140124208Sdesstatic BIGNUM *largebase; 141124208Sdes 142149749Sdesint gen_candidates(FILE *, u_int32_t, u_int32_t, BIGNUM *); 143240075Sdesint prime_test(FILE *, FILE *, u_int32_t, u_int32_t, char *, unsigned long, 144240075Sdes unsigned long); 145124208Sdes 146124208Sdes/* 147124208Sdes * print moduli out in consistent form, 148124208Sdes */ 149124208Sdesstatic int 150124208Sdesqfileout(FILE * ofile, u_int32_t otype, u_int32_t otests, u_int32_t otries, 151124208Sdes u_int32_t osize, u_int32_t ogenerator, BIGNUM * omodulus) 152124208Sdes{ 153124208Sdes struct tm *gtm; 154124208Sdes time_t time_now; 155124208Sdes int res; 156124208Sdes 157124208Sdes time(&time_now); 158124208Sdes gtm = gmtime(&time_now); 159126274Sdes 160124208Sdes res = fprintf(ofile, "%04d%02d%02d%02d%02d%02d %u %u %u %u %x ", 161124208Sdes gtm->tm_year + 1900, gtm->tm_mon + 1, gtm->tm_mday, 162124208Sdes gtm->tm_hour, gtm->tm_min, gtm->tm_sec, 163124208Sdes otype, otests, otries, osize, ogenerator); 164124208Sdes 165124208Sdes if (res < 0) 166124208Sdes return (-1); 167124208Sdes 168124208Sdes if (BN_print_fp(ofile, omodulus) < 1) 169124208Sdes return (-1); 170124208Sdes 171124208Sdes res = fprintf(ofile, "\n"); 172124208Sdes fflush(ofile); 173124208Sdes 174124208Sdes return (res > 0 ? 0 : -1); 175124208Sdes} 176124208Sdes 177124208Sdes 178124208Sdes/* 179124208Sdes ** Sieve p's and q's with small factors 180124208Sdes */ 181124208Sdesstatic void 182124208Sdessieve_large(u_int32_t s) 183124208Sdes{ 184124208Sdes u_int32_t r, u; 185124208Sdes 186126274Sdes debug3("sieve_large %u", s); 187124208Sdes largetries++; 188124208Sdes /* r = largebase mod s */ 189124208Sdes r = BN_mod_word(largebase, s); 190124208Sdes if (r == 0) 191124208Sdes u = 0; /* s divides into largebase exactly */ 192124208Sdes else 193124208Sdes u = s - r; /* largebase+u is first entry divisible by s */ 194124208Sdes 195124208Sdes if (u < largebits * 2) { 196124208Sdes /* 197124208Sdes * The sieve omits p's and q's divisible by 2, so ensure that 198124208Sdes * largebase+u is odd. Then, step through the sieve in 199124208Sdes * increments of 2*s 200124208Sdes */ 201124208Sdes if (u & 0x1) 202124208Sdes u += s; /* Make largebase+u odd, and u even */ 203124208Sdes 204124208Sdes /* Mark all multiples of 2*s */ 205124208Sdes for (u /= 2; u < largebits; u += s) 206124208Sdes BIT_SET(LargeSieve, u); 207124208Sdes } 208124208Sdes 209124208Sdes /* r = p mod s */ 210124208Sdes r = (2 * r + 1) % s; 211124208Sdes if (r == 0) 212124208Sdes u = 0; /* s divides p exactly */ 213124208Sdes else 214124208Sdes u = s - r; /* p+u is first entry divisible by s */ 215124208Sdes 216124208Sdes if (u < largebits * 4) { 217124208Sdes /* 218124208Sdes * The sieve omits p's divisible by 4, so ensure that 219124208Sdes * largebase+u is not. Then, step through the sieve in 220124208Sdes * increments of 4*s 221124208Sdes */ 222124208Sdes while (u & 0x3) { 223124208Sdes if (SMALL_MAXIMUM - u < s) 224124208Sdes return; 225124208Sdes u += s; 226124208Sdes } 227124208Sdes 228124208Sdes /* Mark all multiples of 4*s */ 229124208Sdes for (u /= 4; u < largebits; u += s) 230124208Sdes BIT_SET(LargeSieve, u); 231124208Sdes } 232124208Sdes} 233124208Sdes 234124208Sdes/* 235137015Sdes * list candidates for Sophie-Germain primes (where q = (p-1)/2) 236124208Sdes * to standard output. 237124208Sdes * The list is checked against small known primes (less than 2**30). 238124208Sdes */ 239124208Sdesint 240149749Sdesgen_candidates(FILE *out, u_int32_t memory, u_int32_t power, BIGNUM *start) 241124208Sdes{ 242124208Sdes BIGNUM *q; 243124208Sdes u_int32_t j, r, s, t; 244124208Sdes u_int32_t smallwords = TINY_NUMBER >> 6; 245124208Sdes u_int32_t tinywords = TINY_NUMBER >> 6; 246124208Sdes time_t time_start, time_stop; 247149749Sdes u_int32_t i; 248149749Sdes int ret = 0; 249124208Sdes 250124208Sdes largememory = memory; 251124208Sdes 252137015Sdes if (memory != 0 && 253149749Sdes (memory < LARGE_MINIMUM || memory > LARGE_MAXIMUM)) { 254137015Sdes error("Invalid memory amount (min %ld, max %ld)", 255137015Sdes LARGE_MINIMUM, LARGE_MAXIMUM); 256137015Sdes return (-1); 257137015Sdes } 258137015Sdes 259124208Sdes /* 260126274Sdes * Set power to the length in bits of the prime to be generated. 261126274Sdes * This is changed to 1 less than the desired safe prime moduli p. 262126274Sdes */ 263124208Sdes if (power > TEST_MAXIMUM) { 264124208Sdes error("Too many bits: %u > %lu", power, TEST_MAXIMUM); 265124208Sdes return (-1); 266124208Sdes } else if (power < TEST_MINIMUM) { 267124208Sdes error("Too few bits: %u < %u", power, TEST_MINIMUM); 268124208Sdes return (-1); 269124208Sdes } 270124208Sdes power--; /* decrement before squaring */ 271124208Sdes 272124208Sdes /* 273126274Sdes * The density of ordinary primes is on the order of 1/bits, so the 274126274Sdes * density of safe primes should be about (1/bits)**2. Set test range 275126274Sdes * to something well above bits**2 to be reasonably sure (but not 276126274Sdes * guaranteed) of catching at least one safe prime. 277124208Sdes */ 278124208Sdes largewords = ((power * power) >> (SHIFT_WORD - TEST_POWER)); 279124208Sdes 280124208Sdes /* 281126274Sdes * Need idea of how much memory is available. We don't have to use all 282126274Sdes * of it. 283124208Sdes */ 284124208Sdes if (largememory > LARGE_MAXIMUM) { 285124208Sdes logit("Limited memory: %u MB; limit %lu MB", 286124208Sdes largememory, LARGE_MAXIMUM); 287124208Sdes largememory = LARGE_MAXIMUM; 288124208Sdes } 289124208Sdes 290124208Sdes if (largewords <= (largememory << SHIFT_MEGAWORD)) { 291124208Sdes logit("Increased memory: %u MB; need %u bytes", 292124208Sdes largememory, (largewords << SHIFT_BYTE)); 293124208Sdes largewords = (largememory << SHIFT_MEGAWORD); 294124208Sdes } else if (largememory > 0) { 295124208Sdes logit("Decreased memory: %u MB; want %u bytes", 296124208Sdes largememory, (largewords << SHIFT_BYTE)); 297124208Sdes largewords = (largememory << SHIFT_MEGAWORD); 298124208Sdes } 299124208Sdes 300162852Sdes TinySieve = xcalloc(tinywords, sizeof(u_int32_t)); 301124208Sdes tinybits = tinywords << SHIFT_WORD; 302124208Sdes 303162852Sdes SmallSieve = xcalloc(smallwords, sizeof(u_int32_t)); 304124208Sdes smallbits = smallwords << SHIFT_WORD; 305124208Sdes 306124208Sdes /* 307124208Sdes * dynamically determine available memory 308124208Sdes */ 309124208Sdes while ((LargeSieve = calloc(largewords, sizeof(u_int32_t))) == NULL) 310124208Sdes largewords -= (1L << (SHIFT_MEGAWORD - 2)); /* 1/4 MB chunks */ 311124208Sdes 312124208Sdes largebits = largewords << SHIFT_WORD; 313124208Sdes largenumbers = largebits * 2; /* even numbers excluded */ 314124208Sdes 315124208Sdes /* validation check: count the number of primes tried */ 316124208Sdes largetries = 0; 317164146Sdes if ((q = BN_new()) == NULL) 318164146Sdes fatal("BN_new failed"); 319124208Sdes 320124208Sdes /* 321126274Sdes * Generate random starting point for subprime search, or use 322126274Sdes * specified parameter. 323124208Sdes */ 324164146Sdes if ((largebase = BN_new()) == NULL) 325164146Sdes fatal("BN_new failed"); 326164146Sdes if (start == NULL) { 327164146Sdes if (BN_rand(largebase, power, 1, 1) == 0) 328164146Sdes fatal("BN_rand failed"); 329164146Sdes } else { 330164146Sdes if (BN_copy(largebase, start) == NULL) 331164146Sdes fatal("BN_copy: failed"); 332164146Sdes } 333124208Sdes 334124208Sdes /* ensure odd */ 335164146Sdes if (BN_set_bit(largebase, 0) == 0) 336164146Sdes fatal("BN_set_bit: failed"); 337124208Sdes 338124208Sdes time(&time_start); 339124208Sdes 340126274Sdes logit("%.24s Sieve next %u plus %u-bit", ctime(&time_start), 341124208Sdes largenumbers, power); 342124208Sdes debug2("start point: 0x%s", BN_bn2hex(largebase)); 343124208Sdes 344124208Sdes /* 345126274Sdes * TinySieve 346126274Sdes */ 347124208Sdes for (i = 0; i < tinybits; i++) { 348124208Sdes if (BIT_TEST(TinySieve, i)) 349124208Sdes continue; /* 2*i+3 is composite */ 350124208Sdes 351124208Sdes /* The next tiny prime */ 352124208Sdes t = 2 * i + 3; 353124208Sdes 354124208Sdes /* Mark all multiples of t */ 355124208Sdes for (j = i + t; j < tinybits; j += t) 356124208Sdes BIT_SET(TinySieve, j); 357124208Sdes 358124208Sdes sieve_large(t); 359124208Sdes } 360124208Sdes 361124208Sdes /* 362126274Sdes * Start the small block search at the next possible prime. To avoid 363126274Sdes * fencepost errors, the last pass is skipped. 364126274Sdes */ 365124208Sdes for (smallbase = TINY_NUMBER + 3; 366149749Sdes smallbase < (SMALL_MAXIMUM - TINY_NUMBER); 367149749Sdes smallbase += TINY_NUMBER) { 368124208Sdes for (i = 0; i < tinybits; i++) { 369124208Sdes if (BIT_TEST(TinySieve, i)) 370124208Sdes continue; /* 2*i+3 is composite */ 371124208Sdes 372124208Sdes /* The next tiny prime */ 373124208Sdes t = 2 * i + 3; 374124208Sdes r = smallbase % t; 375124208Sdes 376124208Sdes if (r == 0) { 377124208Sdes s = 0; /* t divides into smallbase exactly */ 378124208Sdes } else { 379124208Sdes /* smallbase+s is first entry divisible by t */ 380124208Sdes s = t - r; 381124208Sdes } 382124208Sdes 383124208Sdes /* 384124208Sdes * The sieve omits even numbers, so ensure that 385124208Sdes * smallbase+s is odd. Then, step through the sieve 386124208Sdes * in increments of 2*t 387124208Sdes */ 388124208Sdes if (s & 1) 389124208Sdes s += t; /* Make smallbase+s odd, and s even */ 390124208Sdes 391124208Sdes /* Mark all multiples of 2*t */ 392124208Sdes for (s /= 2; s < smallbits; s += t) 393124208Sdes BIT_SET(SmallSieve, s); 394124208Sdes } 395124208Sdes 396124208Sdes /* 397126274Sdes * SmallSieve 398126274Sdes */ 399124208Sdes for (i = 0; i < smallbits; i++) { 400124208Sdes if (BIT_TEST(SmallSieve, i)) 401124208Sdes continue; /* 2*i+smallbase is composite */ 402124208Sdes 403124208Sdes /* The next small prime */ 404124208Sdes sieve_large((2 * i) + smallbase); 405124208Sdes } 406124208Sdes 407124208Sdes memset(SmallSieve, 0, smallwords << SHIFT_BYTE); 408124208Sdes } 409124208Sdes 410124208Sdes time(&time_stop); 411124208Sdes 412124208Sdes logit("%.24s Sieved with %u small primes in %ld seconds", 413124208Sdes ctime(&time_stop), largetries, (long) (time_stop - time_start)); 414124208Sdes 415124208Sdes for (j = r = 0; j < largebits; j++) { 416124208Sdes if (BIT_TEST(LargeSieve, j)) 417124208Sdes continue; /* Definitely composite, skip */ 418124208Sdes 419124208Sdes debug2("test q = largebase+%u", 2 * j); 420164146Sdes if (BN_set_word(q, 2 * j) == 0) 421164146Sdes fatal("BN_set_word failed"); 422164146Sdes if (BN_add(q, q, largebase) == 0) 423164146Sdes fatal("BN_add failed"); 424181111Sdes if (qfileout(out, MODULI_TYPE_SOPHIE_GERMAIN, 425181111Sdes MODULI_TESTS_SIEVE, largetries, 426181111Sdes (power - 1) /* MSB */, (0), q) == -1) { 427124208Sdes ret = -1; 428124208Sdes break; 429124208Sdes } 430124208Sdes 431124208Sdes r++; /* count q */ 432124208Sdes } 433124208Sdes 434124208Sdes time(&time_stop); 435124208Sdes 436255767Sdes free(LargeSieve); 437255767Sdes free(SmallSieve); 438255767Sdes free(TinySieve); 439124208Sdes 440124208Sdes logit("%.24s Found %u candidates", ctime(&time_stop), r); 441124208Sdes 442124208Sdes return (ret); 443124208Sdes} 444124208Sdes 445240075Sdesstatic void 446240075Sdeswrite_checkpoint(char *cpfile, u_int32_t lineno) 447240075Sdes{ 448240075Sdes FILE *fp; 449240075Sdes char tmp[MAXPATHLEN]; 450240075Sdes int r; 451240075Sdes 452240075Sdes r = snprintf(tmp, sizeof(tmp), "%s.XXXXXXXXXX", cpfile); 453240075Sdes if (r == -1 || r >= MAXPATHLEN) { 454240075Sdes logit("write_checkpoint: temp pathname too long"); 455240075Sdes return; 456240075Sdes } 457240075Sdes if ((r = mkstemp(tmp)) == -1) { 458240075Sdes logit("mkstemp(%s): %s", tmp, strerror(errno)); 459240075Sdes return; 460240075Sdes } 461240075Sdes if ((fp = fdopen(r, "w")) == NULL) { 462240075Sdes logit("write_checkpoint: fdopen: %s", strerror(errno)); 463240075Sdes close(r); 464240075Sdes return; 465240075Sdes } 466240075Sdes if (fprintf(fp, "%lu\n", (unsigned long)lineno) > 0 && fclose(fp) == 0 467240075Sdes && rename(tmp, cpfile) == 0) 468240075Sdes debug3("wrote checkpoint line %lu to '%s'", 469240075Sdes (unsigned long)lineno, cpfile); 470240075Sdes else 471240075Sdes logit("failed to write to checkpoint file '%s': %s", cpfile, 472240075Sdes strerror(errno)); 473240075Sdes} 474240075Sdes 475240075Sdesstatic unsigned long 476240075Sdesread_checkpoint(char *cpfile) 477240075Sdes{ 478240075Sdes FILE *fp; 479240075Sdes unsigned long lineno = 0; 480240075Sdes 481240075Sdes if ((fp = fopen(cpfile, "r")) == NULL) 482240075Sdes return 0; 483240075Sdes if (fscanf(fp, "%lu\n", &lineno) < 1) 484240075Sdes logit("Failed to load checkpoint from '%s'", cpfile); 485240075Sdes else 486240075Sdes logit("Loaded checkpoint from '%s' line %lu", cpfile, lineno); 487240075Sdes fclose(fp); 488240075Sdes return lineno; 489240075Sdes} 490240075Sdes 491124208Sdes/* 492124208Sdes * perform a Miller-Rabin primality test 493124208Sdes * on the list of candidates 494124208Sdes * (checking both q and p) 495124208Sdes * The result is a list of so-call "safe" primes 496124208Sdes */ 497124208Sdesint 498240075Sdesprime_test(FILE *in, FILE *out, u_int32_t trials, u_int32_t generator_wanted, 499240075Sdes char *checkpoint_file, unsigned long start_lineno, unsigned long num_lines) 500124208Sdes{ 501124208Sdes BIGNUM *q, *p, *a; 502124208Sdes BN_CTX *ctx; 503124208Sdes char *cp, *lp; 504124208Sdes u_int32_t count_in = 0, count_out = 0, count_possible = 0; 505124208Sdes u_int32_t generator_known, in_tests, in_tries, in_type, in_size; 506240075Sdes unsigned long last_processed = 0, end_lineno; 507124208Sdes time_t time_start, time_stop; 508124208Sdes int res; 509124208Sdes 510137015Sdes if (trials < TRIAL_MINIMUM) { 511137015Sdes error("Minimum primality trials is %d", TRIAL_MINIMUM); 512137015Sdes return (-1); 513137015Sdes } 514137015Sdes 515124208Sdes time(&time_start); 516124208Sdes 517164146Sdes if ((p = BN_new()) == NULL) 518164146Sdes fatal("BN_new failed"); 519164146Sdes if ((q = BN_new()) == NULL) 520164146Sdes fatal("BN_new failed"); 521164146Sdes if ((ctx = BN_CTX_new()) == NULL) 522164146Sdes fatal("BN_CTX_new failed"); 523124208Sdes 524124208Sdes debug2("%.24s Final %u Miller-Rabin trials (%x generator)", 525124208Sdes ctime(&time_start), trials, generator_wanted); 526124208Sdes 527240075Sdes if (checkpoint_file != NULL) 528240075Sdes last_processed = read_checkpoint(checkpoint_file); 529240075Sdes if (start_lineno > last_processed) 530240075Sdes last_processed = start_lineno; 531240075Sdes if (num_lines == 0) 532240075Sdes end_lineno = ULONG_MAX; 533240075Sdes else 534240075Sdes end_lineno = last_processed + num_lines; 535240075Sdes debug2("process line %lu to line %lu", last_processed, end_lineno); 536240075Sdes 537124208Sdes res = 0; 538124208Sdes lp = xmalloc(QLINESIZE + 1); 539240075Sdes while (fgets(lp, QLINESIZE + 1, in) != NULL && count_in < end_lineno) { 540124208Sdes count_in++; 541240075Sdes if (checkpoint_file != NULL) { 542240075Sdes if (count_in <= last_processed) { 543240075Sdes debug3("skipping line %u, before checkpoint", 544240075Sdes count_in); 545240075Sdes continue; 546240075Sdes } 547240075Sdes write_checkpoint(checkpoint_file, count_in); 548240075Sdes } 549181111Sdes if (strlen(lp) < 14 || *lp == '!' || *lp == '#') { 550124208Sdes debug2("%10u: comment or short line", count_in); 551124208Sdes continue; 552124208Sdes } 553124208Sdes 554124208Sdes /* XXX - fragile parser */ 555124208Sdes /* time */ 556124208Sdes cp = &lp[14]; /* (skip) */ 557124208Sdes 558124208Sdes /* type */ 559124208Sdes in_type = strtoul(cp, &cp, 10); 560124208Sdes 561124208Sdes /* tests */ 562124208Sdes in_tests = strtoul(cp, &cp, 10); 563124208Sdes 564181111Sdes if (in_tests & MODULI_TESTS_COMPOSITE) { 565124208Sdes debug2("%10u: known composite", count_in); 566124208Sdes continue; 567124208Sdes } 568126274Sdes 569124208Sdes /* tries */ 570124208Sdes in_tries = strtoul(cp, &cp, 10); 571124208Sdes 572124208Sdes /* size (most significant bit) */ 573124208Sdes in_size = strtoul(cp, &cp, 10); 574124208Sdes 575124208Sdes /* generator (hex) */ 576124208Sdes generator_known = strtoul(cp, &cp, 16); 577124208Sdes 578124208Sdes /* Skip white space */ 579124208Sdes cp += strspn(cp, " "); 580124208Sdes 581124208Sdes /* modulus (hex) */ 582124208Sdes switch (in_type) { 583181111Sdes case MODULI_TYPE_SOPHIE_GERMAIN: 584137015Sdes debug2("%10u: (%u) Sophie-Germain", count_in, in_type); 585124208Sdes a = q; 586164146Sdes if (BN_hex2bn(&a, cp) == 0) 587164146Sdes fatal("BN_hex2bn failed"); 588124208Sdes /* p = 2*q + 1 */ 589164146Sdes if (BN_lshift(p, q, 1) == 0) 590164146Sdes fatal("BN_lshift failed"); 591164146Sdes if (BN_add_word(p, 1) == 0) 592164146Sdes fatal("BN_add_word failed"); 593124208Sdes in_size += 1; 594124208Sdes generator_known = 0; 595124208Sdes break; 596181111Sdes case MODULI_TYPE_UNSTRUCTURED: 597181111Sdes case MODULI_TYPE_SAFE: 598181111Sdes case MODULI_TYPE_SCHNORR: 599181111Sdes case MODULI_TYPE_STRONG: 600181111Sdes case MODULI_TYPE_UNKNOWN: 601124208Sdes debug2("%10u: (%u)", count_in, in_type); 602124208Sdes a = p; 603164146Sdes if (BN_hex2bn(&a, cp) == 0) 604164146Sdes fatal("BN_hex2bn failed"); 605124208Sdes /* q = (p-1) / 2 */ 606164146Sdes if (BN_rshift(q, p, 1) == 0) 607164146Sdes fatal("BN_rshift failed"); 608124208Sdes break; 609126274Sdes default: 610126274Sdes debug2("Unknown prime type"); 611126274Sdes break; 612124208Sdes } 613124208Sdes 614124208Sdes /* 615124208Sdes * due to earlier inconsistencies in interpretation, check 616124208Sdes * the proposed bit size. 617124208Sdes */ 618149749Sdes if ((u_int32_t)BN_num_bits(p) != (in_size + 1)) { 619124208Sdes debug2("%10u: bit size %u mismatch", count_in, in_size); 620124208Sdes continue; 621124208Sdes } 622124208Sdes if (in_size < QSIZE_MINIMUM) { 623124208Sdes debug2("%10u: bit size %u too short", count_in, in_size); 624124208Sdes continue; 625124208Sdes } 626124208Sdes 627181111Sdes if (in_tests & MODULI_TESTS_MILLER_RABIN) 628124208Sdes in_tries += trials; 629124208Sdes else 630124208Sdes in_tries = trials; 631126274Sdes 632124208Sdes /* 633124208Sdes * guess unknown generator 634124208Sdes */ 635124208Sdes if (generator_known == 0) { 636124208Sdes if (BN_mod_word(p, 24) == 11) 637124208Sdes generator_known = 2; 638124208Sdes else if (BN_mod_word(p, 12) == 5) 639124208Sdes generator_known = 3; 640124208Sdes else { 641124208Sdes u_int32_t r = BN_mod_word(p, 10); 642124208Sdes 643126274Sdes if (r == 3 || r == 7) 644124208Sdes generator_known = 5; 645124208Sdes } 646124208Sdes } 647124208Sdes /* 648124208Sdes * skip tests when desired generator doesn't match 649124208Sdes */ 650124208Sdes if (generator_wanted > 0 && 651124208Sdes generator_wanted != generator_known) { 652124208Sdes debug2("%10u: generator %d != %d", 653124208Sdes count_in, generator_known, generator_wanted); 654124208Sdes continue; 655124208Sdes } 656124208Sdes 657126274Sdes /* 658126274Sdes * Primes with no known generator are useless for DH, so 659126274Sdes * skip those. 660126274Sdes */ 661126274Sdes if (generator_known == 0) { 662126274Sdes debug2("%10u: no known generator", count_in); 663126274Sdes continue; 664126274Sdes } 665126274Sdes 666124208Sdes count_possible++; 667124208Sdes 668124208Sdes /* 669126274Sdes * The (1/4)^N performance bound on Miller-Rabin is 670126274Sdes * extremely pessimistic, so don't spend a lot of time 671126274Sdes * really verifying that q is prime until after we know 672126274Sdes * that p is also prime. A single pass will weed out the 673124208Sdes * vast majority of composite q's. 674124208Sdes */ 675221420Sdes if (BN_is_prime_ex(q, 1, ctx, NULL) <= 0) { 676126274Sdes debug("%10u: q failed first possible prime test", 677124208Sdes count_in); 678124208Sdes continue; 679124208Sdes } 680126274Sdes 681124208Sdes /* 682126274Sdes * q is possibly prime, so go ahead and really make sure 683126274Sdes * that p is prime. If it is, then we can go back and do 684126274Sdes * the same for q. If p is composite, chances are that 685124208Sdes * will show up on the first Rabin-Miller iteration so it 686124208Sdes * doesn't hurt to specify a high iteration count. 687124208Sdes */ 688221420Sdes if (!BN_is_prime_ex(p, trials, ctx, NULL)) { 689126274Sdes debug("%10u: p is not prime", count_in); 690124208Sdes continue; 691124208Sdes } 692124208Sdes debug("%10u: p is almost certainly prime", count_in); 693124208Sdes 694124208Sdes /* recheck q more rigorously */ 695221420Sdes if (!BN_is_prime_ex(q, trials - 1, ctx, NULL)) { 696124208Sdes debug("%10u: q is not prime", count_in); 697124208Sdes continue; 698124208Sdes } 699124208Sdes debug("%10u: q is almost certainly prime", count_in); 700124208Sdes 701181111Sdes if (qfileout(out, MODULI_TYPE_SAFE, 702181111Sdes in_tests | MODULI_TESTS_MILLER_RABIN, 703124208Sdes in_tries, in_size, generator_known, p)) { 704124208Sdes res = -1; 705124208Sdes break; 706124208Sdes } 707124208Sdes 708124208Sdes count_out++; 709124208Sdes } 710124208Sdes 711124208Sdes time(&time_stop); 712255767Sdes free(lp); 713124208Sdes BN_free(p); 714124208Sdes BN_free(q); 715124208Sdes BN_CTX_free(ctx); 716124208Sdes 717240075Sdes if (checkpoint_file != NULL) 718240075Sdes unlink(checkpoint_file); 719240075Sdes 720124208Sdes logit("%.24s Found %u safe primes of %u candidates in %ld seconds", 721126274Sdes ctime(&time_stop), count_out, count_possible, 722124208Sdes (long) (time_stop - time_start)); 723124208Sdes 724124208Sdes return (res); 725124208Sdes} 726