1262566Sdes/* $OpenBSD: moduli.c,v 1.28 2013/10/24 00:49:49 dtucker 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" 59262566Sdes#include "misc.h" 60124208Sdes 61221420Sdes#include "openbsd-compat/openssl-compat.h" 62221420Sdes 63124208Sdes/* 64124208Sdes * File output defines 65124208Sdes */ 66124208Sdes 67124208Sdes/* need line long enough for largest moduli plus headers */ 68137015Sdes#define QLINESIZE (100+8192) 69124208Sdes 70126274Sdes/* 71126274Sdes * Size: decimal. 72124208Sdes * Specifies the number of the most significant bit (0 to M). 73126274Sdes * WARNING: internally, usually 1 to N. 74124208Sdes */ 75137015Sdes#define QSIZE_MINIMUM (511) 76124208Sdes 77124208Sdes/* 78124208Sdes * Prime sieving defines 79124208Sdes */ 80124208Sdes 81124208Sdes/* Constant: assuming 8 bit bytes and 32 bit words */ 82137015Sdes#define SHIFT_BIT (3) 83137015Sdes#define SHIFT_BYTE (2) 84137015Sdes#define SHIFT_WORD (SHIFT_BIT+SHIFT_BYTE) 85137015Sdes#define SHIFT_MEGABYTE (20) 86137015Sdes#define SHIFT_MEGAWORD (SHIFT_MEGABYTE-SHIFT_BYTE) 87124208Sdes 88124208Sdes/* 89137015Sdes * Using virtual memory can cause thrashing. This should be the largest 90137015Sdes * number that is supported without a large amount of disk activity -- 91137015Sdes * that would increase the run time from hours to days or weeks! 92137015Sdes */ 93137015Sdes#define LARGE_MINIMUM (8UL) /* megabytes */ 94137015Sdes 95137015Sdes/* 96137015Sdes * Do not increase this number beyond the unsigned integer bit size. 97137015Sdes * Due to a multiple of 4, it must be LESS than 128 (yielding 2**30 bits). 98137015Sdes */ 99137015Sdes#define LARGE_MAXIMUM (127UL) /* megabytes */ 100137015Sdes 101137015Sdes/* 102124208Sdes * Constant: when used with 32-bit integers, the largest sieve prime 103124208Sdes * has to be less than 2**32. 104124208Sdes */ 105137015Sdes#define SMALL_MAXIMUM (0xffffffffUL) 106124208Sdes 107124208Sdes/* Constant: can sieve all primes less than 2**32, as 65537**2 > 2**32-1. */ 108137015Sdes#define TINY_NUMBER (1UL<<16) 109124208Sdes 110124208Sdes/* Ensure enough bit space for testing 2*q. */ 111149749Sdes#define TEST_MAXIMUM (1UL<<16) 112149749Sdes#define TEST_MINIMUM (QSIZE_MINIMUM + 1) 113149749Sdes/* real TEST_MINIMUM (1UL << (SHIFT_WORD - TEST_POWER)) */ 114149749Sdes#define TEST_POWER (3) /* 2**n, n < SHIFT_WORD */ 115124208Sdes 116124208Sdes/* bit operations on 32-bit words */ 117149749Sdes#define BIT_CLEAR(a,n) ((a)[(n)>>SHIFT_WORD] &= ~(1L << ((n) & 31))) 118149749Sdes#define BIT_SET(a,n) ((a)[(n)>>SHIFT_WORD] |= (1L << ((n) & 31))) 119149749Sdes#define BIT_TEST(a,n) ((a)[(n)>>SHIFT_WORD] & (1L << ((n) & 31))) 120124208Sdes 121124208Sdes/* 122124208Sdes * Prime testing defines 123124208Sdes */ 124124208Sdes 125137015Sdes/* Minimum number of primality tests to perform */ 126149749Sdes#define TRIAL_MINIMUM (4) 127137015Sdes 128124208Sdes/* 129124208Sdes * Sieving data (XXX - move to struct) 130124208Sdes */ 131124208Sdes 132124208Sdes/* sieve 2**16 */ 133124208Sdesstatic u_int32_t *TinySieve, tinybits; 134124208Sdes 135124208Sdes/* sieve 2**30 in 2**16 parts */ 136124208Sdesstatic u_int32_t *SmallSieve, smallbits, smallbase; 137124208Sdes 138124208Sdes/* sieve relative to the initial value */ 139124208Sdesstatic u_int32_t *LargeSieve, largewords, largetries, largenumbers; 140124208Sdesstatic u_int32_t largebits, largememory; /* megabytes */ 141124208Sdesstatic BIGNUM *largebase; 142124208Sdes 143149749Sdesint gen_candidates(FILE *, u_int32_t, u_int32_t, BIGNUM *); 144240075Sdesint prime_test(FILE *, FILE *, u_int32_t, u_int32_t, char *, unsigned long, 145240075Sdes unsigned long); 146124208Sdes 147124208Sdes/* 148124208Sdes * print moduli out in consistent form, 149124208Sdes */ 150124208Sdesstatic int 151124208Sdesqfileout(FILE * ofile, u_int32_t otype, u_int32_t otests, u_int32_t otries, 152124208Sdes u_int32_t osize, u_int32_t ogenerator, BIGNUM * omodulus) 153124208Sdes{ 154124208Sdes struct tm *gtm; 155124208Sdes time_t time_now; 156124208Sdes int res; 157124208Sdes 158124208Sdes time(&time_now); 159124208Sdes gtm = gmtime(&time_now); 160126274Sdes 161124208Sdes res = fprintf(ofile, "%04d%02d%02d%02d%02d%02d %u %u %u %u %x ", 162124208Sdes gtm->tm_year + 1900, gtm->tm_mon + 1, gtm->tm_mday, 163124208Sdes gtm->tm_hour, gtm->tm_min, gtm->tm_sec, 164124208Sdes otype, otests, otries, osize, ogenerator); 165124208Sdes 166124208Sdes if (res < 0) 167124208Sdes return (-1); 168124208Sdes 169124208Sdes if (BN_print_fp(ofile, omodulus) < 1) 170124208Sdes return (-1); 171124208Sdes 172124208Sdes res = fprintf(ofile, "\n"); 173124208Sdes fflush(ofile); 174124208Sdes 175124208Sdes return (res > 0 ? 0 : -1); 176124208Sdes} 177124208Sdes 178124208Sdes 179124208Sdes/* 180124208Sdes ** Sieve p's and q's with small factors 181124208Sdes */ 182124208Sdesstatic void 183124208Sdessieve_large(u_int32_t s) 184124208Sdes{ 185124208Sdes u_int32_t r, u; 186124208Sdes 187126274Sdes debug3("sieve_large %u", s); 188124208Sdes largetries++; 189124208Sdes /* r = largebase mod s */ 190124208Sdes r = BN_mod_word(largebase, s); 191124208Sdes if (r == 0) 192124208Sdes u = 0; /* s divides into largebase exactly */ 193124208Sdes else 194124208Sdes u = s - r; /* largebase+u is first entry divisible by s */ 195124208Sdes 196124208Sdes if (u < largebits * 2) { 197124208Sdes /* 198124208Sdes * The sieve omits p's and q's divisible by 2, so ensure that 199124208Sdes * largebase+u is odd. Then, step through the sieve in 200124208Sdes * increments of 2*s 201124208Sdes */ 202124208Sdes if (u & 0x1) 203124208Sdes u += s; /* Make largebase+u odd, and u even */ 204124208Sdes 205124208Sdes /* Mark all multiples of 2*s */ 206124208Sdes for (u /= 2; u < largebits; u += s) 207124208Sdes BIT_SET(LargeSieve, u); 208124208Sdes } 209124208Sdes 210124208Sdes /* r = p mod s */ 211124208Sdes r = (2 * r + 1) % s; 212124208Sdes if (r == 0) 213124208Sdes u = 0; /* s divides p exactly */ 214124208Sdes else 215124208Sdes u = s - r; /* p+u is first entry divisible by s */ 216124208Sdes 217124208Sdes if (u < largebits * 4) { 218124208Sdes /* 219124208Sdes * The sieve omits p's divisible by 4, so ensure that 220124208Sdes * largebase+u is not. Then, step through the sieve in 221124208Sdes * increments of 4*s 222124208Sdes */ 223124208Sdes while (u & 0x3) { 224124208Sdes if (SMALL_MAXIMUM - u < s) 225124208Sdes return; 226124208Sdes u += s; 227124208Sdes } 228124208Sdes 229124208Sdes /* Mark all multiples of 4*s */ 230124208Sdes for (u /= 4; u < largebits; u += s) 231124208Sdes BIT_SET(LargeSieve, u); 232124208Sdes } 233124208Sdes} 234124208Sdes 235124208Sdes/* 236137015Sdes * list candidates for Sophie-Germain primes (where q = (p-1)/2) 237124208Sdes * to standard output. 238124208Sdes * The list is checked against small known primes (less than 2**30). 239124208Sdes */ 240124208Sdesint 241149749Sdesgen_candidates(FILE *out, u_int32_t memory, u_int32_t power, BIGNUM *start) 242124208Sdes{ 243124208Sdes BIGNUM *q; 244124208Sdes u_int32_t j, r, s, t; 245124208Sdes u_int32_t smallwords = TINY_NUMBER >> 6; 246124208Sdes u_int32_t tinywords = TINY_NUMBER >> 6; 247124208Sdes time_t time_start, time_stop; 248149749Sdes u_int32_t i; 249149749Sdes int ret = 0; 250124208Sdes 251124208Sdes largememory = memory; 252124208Sdes 253137015Sdes if (memory != 0 && 254149749Sdes (memory < LARGE_MINIMUM || memory > LARGE_MAXIMUM)) { 255137015Sdes error("Invalid memory amount (min %ld, max %ld)", 256137015Sdes LARGE_MINIMUM, LARGE_MAXIMUM); 257137015Sdes return (-1); 258137015Sdes } 259137015Sdes 260124208Sdes /* 261126274Sdes * Set power to the length in bits of the prime to be generated. 262126274Sdes * This is changed to 1 less than the desired safe prime moduli p. 263126274Sdes */ 264124208Sdes if (power > TEST_MAXIMUM) { 265124208Sdes error("Too many bits: %u > %lu", power, TEST_MAXIMUM); 266124208Sdes return (-1); 267124208Sdes } else if (power < TEST_MINIMUM) { 268124208Sdes error("Too few bits: %u < %u", power, TEST_MINIMUM); 269124208Sdes return (-1); 270124208Sdes } 271124208Sdes power--; /* decrement before squaring */ 272124208Sdes 273124208Sdes /* 274126274Sdes * The density of ordinary primes is on the order of 1/bits, so the 275126274Sdes * density of safe primes should be about (1/bits)**2. Set test range 276126274Sdes * to something well above bits**2 to be reasonably sure (but not 277126274Sdes * guaranteed) of catching at least one safe prime. 278124208Sdes */ 279124208Sdes largewords = ((power * power) >> (SHIFT_WORD - TEST_POWER)); 280124208Sdes 281124208Sdes /* 282126274Sdes * Need idea of how much memory is available. We don't have to use all 283126274Sdes * of it. 284124208Sdes */ 285124208Sdes if (largememory > LARGE_MAXIMUM) { 286124208Sdes logit("Limited memory: %u MB; limit %lu MB", 287124208Sdes largememory, LARGE_MAXIMUM); 288124208Sdes largememory = LARGE_MAXIMUM; 289124208Sdes } 290124208Sdes 291124208Sdes if (largewords <= (largememory << SHIFT_MEGAWORD)) { 292124208Sdes logit("Increased memory: %u MB; need %u bytes", 293124208Sdes largememory, (largewords << SHIFT_BYTE)); 294124208Sdes largewords = (largememory << SHIFT_MEGAWORD); 295124208Sdes } else if (largememory > 0) { 296124208Sdes logit("Decreased memory: %u MB; want %u bytes", 297124208Sdes largememory, (largewords << SHIFT_BYTE)); 298124208Sdes largewords = (largememory << SHIFT_MEGAWORD); 299124208Sdes } 300124208Sdes 301162852Sdes TinySieve = xcalloc(tinywords, sizeof(u_int32_t)); 302124208Sdes tinybits = tinywords << SHIFT_WORD; 303124208Sdes 304162852Sdes SmallSieve = xcalloc(smallwords, sizeof(u_int32_t)); 305124208Sdes smallbits = smallwords << SHIFT_WORD; 306124208Sdes 307124208Sdes /* 308124208Sdes * dynamically determine available memory 309124208Sdes */ 310124208Sdes while ((LargeSieve = calloc(largewords, sizeof(u_int32_t))) == NULL) 311124208Sdes largewords -= (1L << (SHIFT_MEGAWORD - 2)); /* 1/4 MB chunks */ 312124208Sdes 313124208Sdes largebits = largewords << SHIFT_WORD; 314124208Sdes largenumbers = largebits * 2; /* even numbers excluded */ 315124208Sdes 316124208Sdes /* validation check: count the number of primes tried */ 317124208Sdes largetries = 0; 318164146Sdes if ((q = BN_new()) == NULL) 319164146Sdes fatal("BN_new failed"); 320124208Sdes 321124208Sdes /* 322126274Sdes * Generate random starting point for subprime search, or use 323126274Sdes * specified parameter. 324124208Sdes */ 325164146Sdes if ((largebase = BN_new()) == NULL) 326164146Sdes fatal("BN_new failed"); 327164146Sdes if (start == NULL) { 328164146Sdes if (BN_rand(largebase, power, 1, 1) == 0) 329164146Sdes fatal("BN_rand failed"); 330164146Sdes } else { 331164146Sdes if (BN_copy(largebase, start) == NULL) 332164146Sdes fatal("BN_copy: failed"); 333164146Sdes } 334124208Sdes 335124208Sdes /* ensure odd */ 336164146Sdes if (BN_set_bit(largebase, 0) == 0) 337164146Sdes fatal("BN_set_bit: failed"); 338124208Sdes 339124208Sdes time(&time_start); 340124208Sdes 341126274Sdes logit("%.24s Sieve next %u plus %u-bit", ctime(&time_start), 342124208Sdes largenumbers, power); 343124208Sdes debug2("start point: 0x%s", BN_bn2hex(largebase)); 344124208Sdes 345124208Sdes /* 346126274Sdes * TinySieve 347126274Sdes */ 348124208Sdes for (i = 0; i < tinybits; i++) { 349124208Sdes if (BIT_TEST(TinySieve, i)) 350124208Sdes continue; /* 2*i+3 is composite */ 351124208Sdes 352124208Sdes /* The next tiny prime */ 353124208Sdes t = 2 * i + 3; 354124208Sdes 355124208Sdes /* Mark all multiples of t */ 356124208Sdes for (j = i + t; j < tinybits; j += t) 357124208Sdes BIT_SET(TinySieve, j); 358124208Sdes 359124208Sdes sieve_large(t); 360124208Sdes } 361124208Sdes 362124208Sdes /* 363126274Sdes * Start the small block search at the next possible prime. To avoid 364126274Sdes * fencepost errors, the last pass is skipped. 365126274Sdes */ 366124208Sdes for (smallbase = TINY_NUMBER + 3; 367149749Sdes smallbase < (SMALL_MAXIMUM - TINY_NUMBER); 368149749Sdes smallbase += TINY_NUMBER) { 369124208Sdes for (i = 0; i < tinybits; i++) { 370124208Sdes if (BIT_TEST(TinySieve, i)) 371124208Sdes continue; /* 2*i+3 is composite */ 372124208Sdes 373124208Sdes /* The next tiny prime */ 374124208Sdes t = 2 * i + 3; 375124208Sdes r = smallbase % t; 376124208Sdes 377124208Sdes if (r == 0) { 378124208Sdes s = 0; /* t divides into smallbase exactly */ 379124208Sdes } else { 380124208Sdes /* smallbase+s is first entry divisible by t */ 381124208Sdes s = t - r; 382124208Sdes } 383124208Sdes 384124208Sdes /* 385124208Sdes * The sieve omits even numbers, so ensure that 386124208Sdes * smallbase+s is odd. Then, step through the sieve 387124208Sdes * in increments of 2*t 388124208Sdes */ 389124208Sdes if (s & 1) 390124208Sdes s += t; /* Make smallbase+s odd, and s even */ 391124208Sdes 392124208Sdes /* Mark all multiples of 2*t */ 393124208Sdes for (s /= 2; s < smallbits; s += t) 394124208Sdes BIT_SET(SmallSieve, s); 395124208Sdes } 396124208Sdes 397124208Sdes /* 398126274Sdes * SmallSieve 399126274Sdes */ 400124208Sdes for (i = 0; i < smallbits; i++) { 401124208Sdes if (BIT_TEST(SmallSieve, i)) 402124208Sdes continue; /* 2*i+smallbase is composite */ 403124208Sdes 404124208Sdes /* The next small prime */ 405124208Sdes sieve_large((2 * i) + smallbase); 406124208Sdes } 407124208Sdes 408124208Sdes memset(SmallSieve, 0, smallwords << SHIFT_BYTE); 409124208Sdes } 410124208Sdes 411124208Sdes time(&time_stop); 412124208Sdes 413124208Sdes logit("%.24s Sieved with %u small primes in %ld seconds", 414124208Sdes ctime(&time_stop), largetries, (long) (time_stop - time_start)); 415124208Sdes 416124208Sdes for (j = r = 0; j < largebits; j++) { 417124208Sdes if (BIT_TEST(LargeSieve, j)) 418124208Sdes continue; /* Definitely composite, skip */ 419124208Sdes 420124208Sdes debug2("test q = largebase+%u", 2 * j); 421164146Sdes if (BN_set_word(q, 2 * j) == 0) 422164146Sdes fatal("BN_set_word failed"); 423164146Sdes if (BN_add(q, q, largebase) == 0) 424164146Sdes fatal("BN_add failed"); 425181111Sdes if (qfileout(out, MODULI_TYPE_SOPHIE_GERMAIN, 426181111Sdes MODULI_TESTS_SIEVE, largetries, 427181111Sdes (power - 1) /* MSB */, (0), q) == -1) { 428124208Sdes ret = -1; 429124208Sdes break; 430124208Sdes } 431124208Sdes 432124208Sdes r++; /* count q */ 433124208Sdes } 434124208Sdes 435124208Sdes time(&time_stop); 436124208Sdes 437255767Sdes free(LargeSieve); 438255767Sdes free(SmallSieve); 439255767Sdes free(TinySieve); 440124208Sdes 441124208Sdes logit("%.24s Found %u candidates", ctime(&time_stop), r); 442124208Sdes 443124208Sdes return (ret); 444124208Sdes} 445124208Sdes 446240075Sdesstatic void 447240075Sdeswrite_checkpoint(char *cpfile, u_int32_t lineno) 448240075Sdes{ 449240075Sdes FILE *fp; 450240075Sdes char tmp[MAXPATHLEN]; 451240075Sdes int r; 452240075Sdes 453240075Sdes r = snprintf(tmp, sizeof(tmp), "%s.XXXXXXXXXX", cpfile); 454240075Sdes if (r == -1 || r >= MAXPATHLEN) { 455240075Sdes logit("write_checkpoint: temp pathname too long"); 456240075Sdes return; 457240075Sdes } 458240075Sdes if ((r = mkstemp(tmp)) == -1) { 459240075Sdes logit("mkstemp(%s): %s", tmp, strerror(errno)); 460240075Sdes return; 461240075Sdes } 462240075Sdes if ((fp = fdopen(r, "w")) == NULL) { 463240075Sdes logit("write_checkpoint: fdopen: %s", strerror(errno)); 464240075Sdes close(r); 465240075Sdes return; 466240075Sdes } 467240075Sdes if (fprintf(fp, "%lu\n", (unsigned long)lineno) > 0 && fclose(fp) == 0 468240075Sdes && rename(tmp, cpfile) == 0) 469240075Sdes debug3("wrote checkpoint line %lu to '%s'", 470240075Sdes (unsigned long)lineno, cpfile); 471240075Sdes else 472240075Sdes logit("failed to write to checkpoint file '%s': %s", cpfile, 473240075Sdes strerror(errno)); 474240075Sdes} 475240075Sdes 476240075Sdesstatic unsigned long 477240075Sdesread_checkpoint(char *cpfile) 478240075Sdes{ 479240075Sdes FILE *fp; 480240075Sdes unsigned long lineno = 0; 481240075Sdes 482240075Sdes if ((fp = fopen(cpfile, "r")) == NULL) 483240075Sdes return 0; 484240075Sdes if (fscanf(fp, "%lu\n", &lineno) < 1) 485240075Sdes logit("Failed to load checkpoint from '%s'", cpfile); 486240075Sdes else 487240075Sdes logit("Loaded checkpoint from '%s' line %lu", cpfile, lineno); 488240075Sdes fclose(fp); 489240075Sdes return lineno; 490240075Sdes} 491240075Sdes 492262566Sdesstatic unsigned long 493262566Sdescount_lines(FILE *f) 494262566Sdes{ 495262566Sdes unsigned long count = 0; 496262566Sdes char lp[QLINESIZE + 1]; 497262566Sdes 498262566Sdes if (fseek(f, 0, SEEK_SET) != 0) { 499262566Sdes debug("input file is not seekable"); 500262566Sdes return ULONG_MAX; 501262566Sdes } 502262566Sdes while (fgets(lp, QLINESIZE + 1, f) != NULL) 503262566Sdes count++; 504262566Sdes rewind(f); 505262566Sdes debug("input file has %lu lines", count); 506262566Sdes return count; 507262566Sdes} 508262566Sdes 509262566Sdesstatic char * 510262566Sdesfmt_time(time_t seconds) 511262566Sdes{ 512262566Sdes int day, hr, min; 513262566Sdes static char buf[128]; 514262566Sdes 515262566Sdes min = (seconds / 60) % 60; 516262566Sdes hr = (seconds / 60 / 60) % 24; 517262566Sdes day = seconds / 60 / 60 / 24; 518262566Sdes if (day > 0) 519262566Sdes snprintf(buf, sizeof buf, "%dd %d:%02d", day, hr, min); 520262566Sdes else 521262566Sdes snprintf(buf, sizeof buf, "%d:%02d", hr, min); 522262566Sdes return buf; 523262566Sdes} 524262566Sdes 525262566Sdesstatic void 526262566Sdesprint_progress(unsigned long start_lineno, unsigned long current_lineno, 527262566Sdes unsigned long end_lineno) 528262566Sdes{ 529262566Sdes static time_t time_start, time_prev; 530262566Sdes time_t time_now, elapsed; 531262566Sdes unsigned long num_to_process, processed, remaining, percent, eta; 532262566Sdes double time_per_line; 533262566Sdes char *eta_str; 534262566Sdes 535262566Sdes time_now = monotime(); 536262566Sdes if (time_start == 0) { 537262566Sdes time_start = time_prev = time_now; 538262566Sdes return; 539262566Sdes } 540262566Sdes /* print progress after 1m then once per 5m */ 541262566Sdes if (time_now - time_prev < 5 * 60) 542262566Sdes return; 543262566Sdes time_prev = time_now; 544262566Sdes elapsed = time_now - time_start; 545262566Sdes processed = current_lineno - start_lineno; 546262566Sdes remaining = end_lineno - current_lineno; 547262566Sdes num_to_process = end_lineno - start_lineno; 548262566Sdes time_per_line = (double)elapsed / processed; 549262566Sdes /* if we don't know how many we're processing just report count+time */ 550262566Sdes time(&time_now); 551262566Sdes if (end_lineno == ULONG_MAX) { 552262566Sdes logit("%.24s processed %lu in %s", ctime(&time_now), 553262566Sdes processed, fmt_time(elapsed)); 554262566Sdes return; 555262566Sdes } 556262566Sdes percent = 100 * processed / num_to_process; 557262566Sdes eta = time_per_line * remaining; 558262566Sdes eta_str = xstrdup(fmt_time(eta)); 559262566Sdes logit("%.24s processed %lu of %lu (%lu%%) in %s, ETA %s", 560262566Sdes ctime(&time_now), processed, num_to_process, percent, 561262566Sdes fmt_time(elapsed), eta_str); 562262566Sdes free(eta_str); 563262566Sdes} 564262566Sdes 565124208Sdes/* 566124208Sdes * perform a Miller-Rabin primality test 567124208Sdes * on the list of candidates 568124208Sdes * (checking both q and p) 569124208Sdes * The result is a list of so-call "safe" primes 570124208Sdes */ 571124208Sdesint 572240075Sdesprime_test(FILE *in, FILE *out, u_int32_t trials, u_int32_t generator_wanted, 573240075Sdes char *checkpoint_file, unsigned long start_lineno, unsigned long num_lines) 574124208Sdes{ 575124208Sdes BIGNUM *q, *p, *a; 576124208Sdes BN_CTX *ctx; 577124208Sdes char *cp, *lp; 578124208Sdes u_int32_t count_in = 0, count_out = 0, count_possible = 0; 579124208Sdes u_int32_t generator_known, in_tests, in_tries, in_type, in_size; 580240075Sdes unsigned long last_processed = 0, end_lineno; 581124208Sdes time_t time_start, time_stop; 582124208Sdes int res; 583124208Sdes 584137015Sdes if (trials < TRIAL_MINIMUM) { 585137015Sdes error("Minimum primality trials is %d", TRIAL_MINIMUM); 586137015Sdes return (-1); 587137015Sdes } 588137015Sdes 589262566Sdes if (num_lines == 0) 590262566Sdes end_lineno = count_lines(in); 591262566Sdes else 592262566Sdes end_lineno = start_lineno + num_lines; 593262566Sdes 594124208Sdes time(&time_start); 595124208Sdes 596164146Sdes if ((p = BN_new()) == NULL) 597164146Sdes fatal("BN_new failed"); 598164146Sdes if ((q = BN_new()) == NULL) 599164146Sdes fatal("BN_new failed"); 600164146Sdes if ((ctx = BN_CTX_new()) == NULL) 601164146Sdes fatal("BN_CTX_new failed"); 602124208Sdes 603124208Sdes debug2("%.24s Final %u Miller-Rabin trials (%x generator)", 604124208Sdes ctime(&time_start), trials, generator_wanted); 605124208Sdes 606240075Sdes if (checkpoint_file != NULL) 607240075Sdes last_processed = read_checkpoint(checkpoint_file); 608262566Sdes last_processed = start_lineno = MAX(last_processed, start_lineno); 609262566Sdes if (end_lineno == ULONG_MAX) 610262566Sdes debug("process from line %lu from pipe", last_processed); 611240075Sdes else 612262566Sdes debug("process from line %lu to line %lu", last_processed, 613262566Sdes end_lineno); 614240075Sdes 615124208Sdes res = 0; 616124208Sdes lp = xmalloc(QLINESIZE + 1); 617240075Sdes while (fgets(lp, QLINESIZE + 1, in) != NULL && count_in < end_lineno) { 618124208Sdes count_in++; 619262566Sdes if (count_in <= last_processed) { 620262566Sdes debug3("skipping line %u, before checkpoint or " 621262566Sdes "specified start line", count_in); 622262566Sdes continue; 623262566Sdes } 624262566Sdes if (checkpoint_file != NULL) 625240075Sdes write_checkpoint(checkpoint_file, count_in); 626262566Sdes print_progress(start_lineno, count_in, end_lineno); 627181111Sdes if (strlen(lp) < 14 || *lp == '!' || *lp == '#') { 628124208Sdes debug2("%10u: comment or short line", count_in); 629124208Sdes continue; 630124208Sdes } 631124208Sdes 632124208Sdes /* XXX - fragile parser */ 633124208Sdes /* time */ 634124208Sdes cp = &lp[14]; /* (skip) */ 635124208Sdes 636124208Sdes /* type */ 637124208Sdes in_type = strtoul(cp, &cp, 10); 638124208Sdes 639124208Sdes /* tests */ 640124208Sdes in_tests = strtoul(cp, &cp, 10); 641124208Sdes 642181111Sdes if (in_tests & MODULI_TESTS_COMPOSITE) { 643124208Sdes debug2("%10u: known composite", count_in); 644124208Sdes continue; 645124208Sdes } 646126274Sdes 647124208Sdes /* tries */ 648124208Sdes in_tries = strtoul(cp, &cp, 10); 649124208Sdes 650124208Sdes /* size (most significant bit) */ 651124208Sdes in_size = strtoul(cp, &cp, 10); 652124208Sdes 653124208Sdes /* generator (hex) */ 654124208Sdes generator_known = strtoul(cp, &cp, 16); 655124208Sdes 656124208Sdes /* Skip white space */ 657124208Sdes cp += strspn(cp, " "); 658124208Sdes 659124208Sdes /* modulus (hex) */ 660124208Sdes switch (in_type) { 661181111Sdes case MODULI_TYPE_SOPHIE_GERMAIN: 662137015Sdes debug2("%10u: (%u) Sophie-Germain", count_in, in_type); 663124208Sdes a = q; 664164146Sdes if (BN_hex2bn(&a, cp) == 0) 665164146Sdes fatal("BN_hex2bn failed"); 666124208Sdes /* p = 2*q + 1 */ 667164146Sdes if (BN_lshift(p, q, 1) == 0) 668164146Sdes fatal("BN_lshift failed"); 669164146Sdes if (BN_add_word(p, 1) == 0) 670164146Sdes fatal("BN_add_word failed"); 671124208Sdes in_size += 1; 672124208Sdes generator_known = 0; 673124208Sdes break; 674181111Sdes case MODULI_TYPE_UNSTRUCTURED: 675181111Sdes case MODULI_TYPE_SAFE: 676181111Sdes case MODULI_TYPE_SCHNORR: 677181111Sdes case MODULI_TYPE_STRONG: 678181111Sdes case MODULI_TYPE_UNKNOWN: 679124208Sdes debug2("%10u: (%u)", count_in, in_type); 680124208Sdes a = p; 681164146Sdes if (BN_hex2bn(&a, cp) == 0) 682164146Sdes fatal("BN_hex2bn failed"); 683124208Sdes /* q = (p-1) / 2 */ 684164146Sdes if (BN_rshift(q, p, 1) == 0) 685164146Sdes fatal("BN_rshift failed"); 686124208Sdes break; 687126274Sdes default: 688126274Sdes debug2("Unknown prime type"); 689126274Sdes break; 690124208Sdes } 691124208Sdes 692124208Sdes /* 693124208Sdes * due to earlier inconsistencies in interpretation, check 694124208Sdes * the proposed bit size. 695124208Sdes */ 696149749Sdes if ((u_int32_t)BN_num_bits(p) != (in_size + 1)) { 697124208Sdes debug2("%10u: bit size %u mismatch", count_in, in_size); 698124208Sdes continue; 699124208Sdes } 700124208Sdes if (in_size < QSIZE_MINIMUM) { 701124208Sdes debug2("%10u: bit size %u too short", count_in, in_size); 702124208Sdes continue; 703124208Sdes } 704124208Sdes 705181111Sdes if (in_tests & MODULI_TESTS_MILLER_RABIN) 706124208Sdes in_tries += trials; 707124208Sdes else 708124208Sdes in_tries = trials; 709126274Sdes 710124208Sdes /* 711124208Sdes * guess unknown generator 712124208Sdes */ 713124208Sdes if (generator_known == 0) { 714124208Sdes if (BN_mod_word(p, 24) == 11) 715124208Sdes generator_known = 2; 716124208Sdes else if (BN_mod_word(p, 12) == 5) 717124208Sdes generator_known = 3; 718124208Sdes else { 719124208Sdes u_int32_t r = BN_mod_word(p, 10); 720124208Sdes 721126274Sdes if (r == 3 || r == 7) 722124208Sdes generator_known = 5; 723124208Sdes } 724124208Sdes } 725124208Sdes /* 726124208Sdes * skip tests when desired generator doesn't match 727124208Sdes */ 728124208Sdes if (generator_wanted > 0 && 729124208Sdes generator_wanted != generator_known) { 730124208Sdes debug2("%10u: generator %d != %d", 731124208Sdes count_in, generator_known, generator_wanted); 732124208Sdes continue; 733124208Sdes } 734124208Sdes 735126274Sdes /* 736126274Sdes * Primes with no known generator are useless for DH, so 737126274Sdes * skip those. 738126274Sdes */ 739126274Sdes if (generator_known == 0) { 740126274Sdes debug2("%10u: no known generator", count_in); 741126274Sdes continue; 742126274Sdes } 743126274Sdes 744124208Sdes count_possible++; 745124208Sdes 746124208Sdes /* 747126274Sdes * The (1/4)^N performance bound on Miller-Rabin is 748126274Sdes * extremely pessimistic, so don't spend a lot of time 749126274Sdes * really verifying that q is prime until after we know 750126274Sdes * that p is also prime. A single pass will weed out the 751124208Sdes * vast majority of composite q's. 752124208Sdes */ 753221420Sdes if (BN_is_prime_ex(q, 1, ctx, NULL) <= 0) { 754126274Sdes debug("%10u: q failed first possible prime test", 755124208Sdes count_in); 756124208Sdes continue; 757124208Sdes } 758126274Sdes 759124208Sdes /* 760126274Sdes * q is possibly prime, so go ahead and really make sure 761126274Sdes * that p is prime. If it is, then we can go back and do 762126274Sdes * the same for q. If p is composite, chances are that 763124208Sdes * will show up on the first Rabin-Miller iteration so it 764124208Sdes * doesn't hurt to specify a high iteration count. 765124208Sdes */ 766221420Sdes if (!BN_is_prime_ex(p, trials, ctx, NULL)) { 767126274Sdes debug("%10u: p is not prime", count_in); 768124208Sdes continue; 769124208Sdes } 770124208Sdes debug("%10u: p is almost certainly prime", count_in); 771124208Sdes 772124208Sdes /* recheck q more rigorously */ 773221420Sdes if (!BN_is_prime_ex(q, trials - 1, ctx, NULL)) { 774124208Sdes debug("%10u: q is not prime", count_in); 775124208Sdes continue; 776124208Sdes } 777124208Sdes debug("%10u: q is almost certainly prime", count_in); 778124208Sdes 779181111Sdes if (qfileout(out, MODULI_TYPE_SAFE, 780181111Sdes in_tests | MODULI_TESTS_MILLER_RABIN, 781124208Sdes in_tries, in_size, generator_known, p)) { 782124208Sdes res = -1; 783124208Sdes break; 784124208Sdes } 785124208Sdes 786124208Sdes count_out++; 787124208Sdes } 788124208Sdes 789124208Sdes time(&time_stop); 790255767Sdes free(lp); 791124208Sdes BN_free(p); 792124208Sdes BN_free(q); 793124208Sdes BN_CTX_free(ctx); 794124208Sdes 795240075Sdes if (checkpoint_file != NULL) 796240075Sdes unlink(checkpoint_file); 797240075Sdes 798124208Sdes logit("%.24s Found %u safe primes of %u candidates in %ld seconds", 799126274Sdes ctime(&time_stop), count_out, count_possible, 800124208Sdes (long) (time_stop - time_start)); 801124208Sdes 802124208Sdes return (res); 803124208Sdes} 804