1323134Sdes/* $OpenBSD: moduli.c,v 1.31 2016/09/12 01:22:38 deraadt 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 42294332Sdes#ifdef WITH_OPENSSL 43294332Sdes 44162852Sdes#include <sys/types.h> 45162852Sdes 46162852Sdes#include <openssl/bn.h> 47181111Sdes#include <openssl/dh.h> 48162852Sdes 49240075Sdes#include <errno.h> 50162852Sdes#include <stdio.h> 51162852Sdes#include <stdlib.h> 52162852Sdes#include <string.h> 53162852Sdes#include <stdarg.h> 54162852Sdes#include <time.h> 55240075Sdes#include <unistd.h> 56294332Sdes#include <limits.h> 57162852Sdes 58124208Sdes#include "xmalloc.h" 59181111Sdes#include "dh.h" 60124208Sdes#include "log.h" 61261320Sdes#include "misc.h" 62124208Sdes 63221420Sdes#include "openbsd-compat/openssl-compat.h" 64221420Sdes 65124208Sdes/* 66124208Sdes * File output defines 67124208Sdes */ 68124208Sdes 69124208Sdes/* need line long enough for largest moduli plus headers */ 70137015Sdes#define QLINESIZE (100+8192) 71124208Sdes 72126274Sdes/* 73126274Sdes * Size: decimal. 74124208Sdes * Specifies the number of the most significant bit (0 to M). 75126274Sdes * WARNING: internally, usually 1 to N. 76124208Sdes */ 77137015Sdes#define QSIZE_MINIMUM (511) 78124208Sdes 79124208Sdes/* 80124208Sdes * Prime sieving defines 81124208Sdes */ 82124208Sdes 83124208Sdes/* Constant: assuming 8 bit bytes and 32 bit words */ 84137015Sdes#define SHIFT_BIT (3) 85137015Sdes#define SHIFT_BYTE (2) 86137015Sdes#define SHIFT_WORD (SHIFT_BIT+SHIFT_BYTE) 87137015Sdes#define SHIFT_MEGABYTE (20) 88137015Sdes#define SHIFT_MEGAWORD (SHIFT_MEGABYTE-SHIFT_BYTE) 89124208Sdes 90124208Sdes/* 91137015Sdes * Using virtual memory can cause thrashing. This should be the largest 92137015Sdes * number that is supported without a large amount of disk activity -- 93137015Sdes * that would increase the run time from hours to days or weeks! 94137015Sdes */ 95137015Sdes#define LARGE_MINIMUM (8UL) /* megabytes */ 96137015Sdes 97137015Sdes/* 98137015Sdes * Do not increase this number beyond the unsigned integer bit size. 99137015Sdes * Due to a multiple of 4, it must be LESS than 128 (yielding 2**30 bits). 100137015Sdes */ 101137015Sdes#define LARGE_MAXIMUM (127UL) /* megabytes */ 102137015Sdes 103137015Sdes/* 104124208Sdes * Constant: when used with 32-bit integers, the largest sieve prime 105124208Sdes * has to be less than 2**32. 106124208Sdes */ 107137015Sdes#define SMALL_MAXIMUM (0xffffffffUL) 108124208Sdes 109124208Sdes/* Constant: can sieve all primes less than 2**32, as 65537**2 > 2**32-1. */ 110137015Sdes#define TINY_NUMBER (1UL<<16) 111124208Sdes 112124208Sdes/* Ensure enough bit space for testing 2*q. */ 113149749Sdes#define TEST_MAXIMUM (1UL<<16) 114149749Sdes#define TEST_MINIMUM (QSIZE_MINIMUM + 1) 115149749Sdes/* real TEST_MINIMUM (1UL << (SHIFT_WORD - TEST_POWER)) */ 116149749Sdes#define TEST_POWER (3) /* 2**n, n < SHIFT_WORD */ 117124208Sdes 118124208Sdes/* bit operations on 32-bit words */ 119149749Sdes#define BIT_CLEAR(a,n) ((a)[(n)>>SHIFT_WORD] &= ~(1L << ((n) & 31))) 120149749Sdes#define BIT_SET(a,n) ((a)[(n)>>SHIFT_WORD] |= (1L << ((n) & 31))) 121149749Sdes#define BIT_TEST(a,n) ((a)[(n)>>SHIFT_WORD] & (1L << ((n) & 31))) 122124208Sdes 123124208Sdes/* 124124208Sdes * Prime testing defines 125124208Sdes */ 126124208Sdes 127137015Sdes/* Minimum number of primality tests to perform */ 128149749Sdes#define TRIAL_MINIMUM (4) 129137015Sdes 130124208Sdes/* 131124208Sdes * Sieving data (XXX - move to struct) 132124208Sdes */ 133124208Sdes 134124208Sdes/* sieve 2**16 */ 135124208Sdesstatic u_int32_t *TinySieve, tinybits; 136124208Sdes 137124208Sdes/* sieve 2**30 in 2**16 parts */ 138124208Sdesstatic u_int32_t *SmallSieve, smallbits, smallbase; 139124208Sdes 140124208Sdes/* sieve relative to the initial value */ 141124208Sdesstatic u_int32_t *LargeSieve, largewords, largetries, largenumbers; 142124208Sdesstatic u_int32_t largebits, largememory; /* megabytes */ 143124208Sdesstatic BIGNUM *largebase; 144124208Sdes 145149749Sdesint gen_candidates(FILE *, u_int32_t, u_int32_t, BIGNUM *); 146240075Sdesint prime_test(FILE *, FILE *, u_int32_t, u_int32_t, char *, unsigned long, 147240075Sdes unsigned long); 148124208Sdes 149124208Sdes/* 150124208Sdes * print moduli out in consistent form, 151124208Sdes */ 152124208Sdesstatic int 153124208Sdesqfileout(FILE * ofile, u_int32_t otype, u_int32_t otests, u_int32_t otries, 154124208Sdes u_int32_t osize, u_int32_t ogenerator, BIGNUM * omodulus) 155124208Sdes{ 156124208Sdes struct tm *gtm; 157124208Sdes time_t time_now; 158124208Sdes int res; 159124208Sdes 160124208Sdes time(&time_now); 161124208Sdes gtm = gmtime(&time_now); 162126274Sdes 163124208Sdes res = fprintf(ofile, "%04d%02d%02d%02d%02d%02d %u %u %u %u %x ", 164124208Sdes gtm->tm_year + 1900, gtm->tm_mon + 1, gtm->tm_mday, 165124208Sdes gtm->tm_hour, gtm->tm_min, gtm->tm_sec, 166124208Sdes otype, otests, otries, osize, ogenerator); 167124208Sdes 168124208Sdes if (res < 0) 169124208Sdes return (-1); 170124208Sdes 171124208Sdes if (BN_print_fp(ofile, omodulus) < 1) 172124208Sdes return (-1); 173124208Sdes 174124208Sdes res = fprintf(ofile, "\n"); 175124208Sdes fflush(ofile); 176124208Sdes 177124208Sdes return (res > 0 ? 0 : -1); 178124208Sdes} 179124208Sdes 180124208Sdes 181124208Sdes/* 182124208Sdes ** Sieve p's and q's with small factors 183124208Sdes */ 184124208Sdesstatic void 185124208Sdessieve_large(u_int32_t s) 186124208Sdes{ 187124208Sdes u_int32_t r, u; 188124208Sdes 189126274Sdes debug3("sieve_large %u", s); 190124208Sdes largetries++; 191124208Sdes /* r = largebase mod s */ 192124208Sdes r = BN_mod_word(largebase, s); 193124208Sdes if (r == 0) 194124208Sdes u = 0; /* s divides into largebase exactly */ 195124208Sdes else 196124208Sdes u = s - r; /* largebase+u is first entry divisible by s */ 197124208Sdes 198124208Sdes if (u < largebits * 2) { 199124208Sdes /* 200124208Sdes * The sieve omits p's and q's divisible by 2, so ensure that 201124208Sdes * largebase+u is odd. Then, step through the sieve in 202124208Sdes * increments of 2*s 203124208Sdes */ 204124208Sdes if (u & 0x1) 205124208Sdes u += s; /* Make largebase+u odd, and u even */ 206124208Sdes 207124208Sdes /* Mark all multiples of 2*s */ 208124208Sdes for (u /= 2; u < largebits; u += s) 209124208Sdes BIT_SET(LargeSieve, u); 210124208Sdes } 211124208Sdes 212124208Sdes /* r = p mod s */ 213124208Sdes r = (2 * r + 1) % s; 214124208Sdes if (r == 0) 215124208Sdes u = 0; /* s divides p exactly */ 216124208Sdes else 217124208Sdes u = s - r; /* p+u is first entry divisible by s */ 218124208Sdes 219124208Sdes if (u < largebits * 4) { 220124208Sdes /* 221124208Sdes * The sieve omits p's divisible by 4, so ensure that 222124208Sdes * largebase+u is not. Then, step through the sieve in 223124208Sdes * increments of 4*s 224124208Sdes */ 225124208Sdes while (u & 0x3) { 226124208Sdes if (SMALL_MAXIMUM - u < s) 227124208Sdes return; 228124208Sdes u += s; 229124208Sdes } 230124208Sdes 231124208Sdes /* Mark all multiples of 4*s */ 232124208Sdes for (u /= 4; u < largebits; u += s) 233124208Sdes BIT_SET(LargeSieve, u); 234124208Sdes } 235124208Sdes} 236124208Sdes 237124208Sdes/* 238137015Sdes * list candidates for Sophie-Germain primes (where q = (p-1)/2) 239124208Sdes * to standard output. 240124208Sdes * The list is checked against small known primes (less than 2**30). 241124208Sdes */ 242124208Sdesint 243149749Sdesgen_candidates(FILE *out, u_int32_t memory, u_int32_t power, BIGNUM *start) 244124208Sdes{ 245124208Sdes BIGNUM *q; 246124208Sdes u_int32_t j, r, s, t; 247124208Sdes u_int32_t smallwords = TINY_NUMBER >> 6; 248124208Sdes u_int32_t tinywords = TINY_NUMBER >> 6; 249124208Sdes time_t time_start, time_stop; 250149749Sdes u_int32_t i; 251149749Sdes int ret = 0; 252124208Sdes 253124208Sdes largememory = memory; 254124208Sdes 255137015Sdes if (memory != 0 && 256149749Sdes (memory < LARGE_MINIMUM || memory > LARGE_MAXIMUM)) { 257137015Sdes error("Invalid memory amount (min %ld, max %ld)", 258137015Sdes LARGE_MINIMUM, LARGE_MAXIMUM); 259137015Sdes return (-1); 260137015Sdes } 261137015Sdes 262124208Sdes /* 263126274Sdes * Set power to the length in bits of the prime to be generated. 264126274Sdes * This is changed to 1 less than the desired safe prime moduli p. 265126274Sdes */ 266124208Sdes if (power > TEST_MAXIMUM) { 267124208Sdes error("Too many bits: %u > %lu", power, TEST_MAXIMUM); 268124208Sdes return (-1); 269124208Sdes } else if (power < TEST_MINIMUM) { 270124208Sdes error("Too few bits: %u < %u", power, TEST_MINIMUM); 271124208Sdes return (-1); 272124208Sdes } 273124208Sdes power--; /* decrement before squaring */ 274124208Sdes 275124208Sdes /* 276126274Sdes * The density of ordinary primes is on the order of 1/bits, so the 277126274Sdes * density of safe primes should be about (1/bits)**2. Set test range 278126274Sdes * to something well above bits**2 to be reasonably sure (but not 279126274Sdes * guaranteed) of catching at least one safe prime. 280124208Sdes */ 281124208Sdes largewords = ((power * power) >> (SHIFT_WORD - TEST_POWER)); 282124208Sdes 283124208Sdes /* 284126274Sdes * Need idea of how much memory is available. We don't have to use all 285126274Sdes * of it. 286124208Sdes */ 287124208Sdes if (largememory > LARGE_MAXIMUM) { 288124208Sdes logit("Limited memory: %u MB; limit %lu MB", 289124208Sdes largememory, LARGE_MAXIMUM); 290124208Sdes largememory = LARGE_MAXIMUM; 291124208Sdes } 292124208Sdes 293124208Sdes if (largewords <= (largememory << SHIFT_MEGAWORD)) { 294124208Sdes logit("Increased memory: %u MB; need %u bytes", 295124208Sdes largememory, (largewords << SHIFT_BYTE)); 296124208Sdes largewords = (largememory << SHIFT_MEGAWORD); 297124208Sdes } else if (largememory > 0) { 298124208Sdes logit("Decreased memory: %u MB; want %u bytes", 299124208Sdes largememory, (largewords << SHIFT_BYTE)); 300124208Sdes largewords = (largememory << SHIFT_MEGAWORD); 301124208Sdes } 302124208Sdes 303162852Sdes TinySieve = xcalloc(tinywords, sizeof(u_int32_t)); 304124208Sdes tinybits = tinywords << SHIFT_WORD; 305124208Sdes 306162852Sdes SmallSieve = xcalloc(smallwords, sizeof(u_int32_t)); 307124208Sdes smallbits = smallwords << SHIFT_WORD; 308124208Sdes 309124208Sdes /* 310124208Sdes * dynamically determine available memory 311124208Sdes */ 312124208Sdes while ((LargeSieve = calloc(largewords, sizeof(u_int32_t))) == NULL) 313124208Sdes largewords -= (1L << (SHIFT_MEGAWORD - 2)); /* 1/4 MB chunks */ 314124208Sdes 315124208Sdes largebits = largewords << SHIFT_WORD; 316124208Sdes largenumbers = largebits * 2; /* even numbers excluded */ 317124208Sdes 318124208Sdes /* validation check: count the number of primes tried */ 319124208Sdes largetries = 0; 320164146Sdes if ((q = BN_new()) == NULL) 321164146Sdes fatal("BN_new failed"); 322124208Sdes 323124208Sdes /* 324126274Sdes * Generate random starting point for subprime search, or use 325126274Sdes * specified parameter. 326124208Sdes */ 327164146Sdes if ((largebase = BN_new()) == NULL) 328164146Sdes fatal("BN_new failed"); 329164146Sdes if (start == NULL) { 330164146Sdes if (BN_rand(largebase, power, 1, 1) == 0) 331164146Sdes fatal("BN_rand failed"); 332164146Sdes } else { 333164146Sdes if (BN_copy(largebase, start) == NULL) 334164146Sdes fatal("BN_copy: failed"); 335164146Sdes } 336124208Sdes 337124208Sdes /* ensure odd */ 338164146Sdes if (BN_set_bit(largebase, 0) == 0) 339164146Sdes fatal("BN_set_bit: failed"); 340124208Sdes 341124208Sdes time(&time_start); 342124208Sdes 343126274Sdes logit("%.24s Sieve next %u plus %u-bit", ctime(&time_start), 344124208Sdes largenumbers, power); 345124208Sdes debug2("start point: 0x%s", BN_bn2hex(largebase)); 346124208Sdes 347124208Sdes /* 348126274Sdes * TinySieve 349126274Sdes */ 350124208Sdes for (i = 0; i < tinybits; i++) { 351124208Sdes if (BIT_TEST(TinySieve, i)) 352124208Sdes continue; /* 2*i+3 is composite */ 353124208Sdes 354124208Sdes /* The next tiny prime */ 355124208Sdes t = 2 * i + 3; 356124208Sdes 357124208Sdes /* Mark all multiples of t */ 358124208Sdes for (j = i + t; j < tinybits; j += t) 359124208Sdes BIT_SET(TinySieve, j); 360124208Sdes 361124208Sdes sieve_large(t); 362124208Sdes } 363124208Sdes 364124208Sdes /* 365126274Sdes * Start the small block search at the next possible prime. To avoid 366126274Sdes * fencepost errors, the last pass is skipped. 367126274Sdes */ 368124208Sdes for (smallbase = TINY_NUMBER + 3; 369149749Sdes smallbase < (SMALL_MAXIMUM - TINY_NUMBER); 370149749Sdes smallbase += TINY_NUMBER) { 371124208Sdes for (i = 0; i < tinybits; i++) { 372124208Sdes if (BIT_TEST(TinySieve, i)) 373124208Sdes continue; /* 2*i+3 is composite */ 374124208Sdes 375124208Sdes /* The next tiny prime */ 376124208Sdes t = 2 * i + 3; 377124208Sdes r = smallbase % t; 378124208Sdes 379124208Sdes if (r == 0) { 380124208Sdes s = 0; /* t divides into smallbase exactly */ 381124208Sdes } else { 382124208Sdes /* smallbase+s is first entry divisible by t */ 383124208Sdes s = t - r; 384124208Sdes } 385124208Sdes 386124208Sdes /* 387124208Sdes * The sieve omits even numbers, so ensure that 388124208Sdes * smallbase+s is odd. Then, step through the sieve 389124208Sdes * in increments of 2*t 390124208Sdes */ 391124208Sdes if (s & 1) 392124208Sdes s += t; /* Make smallbase+s odd, and s even */ 393124208Sdes 394124208Sdes /* Mark all multiples of 2*t */ 395124208Sdes for (s /= 2; s < smallbits; s += t) 396124208Sdes BIT_SET(SmallSieve, s); 397124208Sdes } 398124208Sdes 399124208Sdes /* 400126274Sdes * SmallSieve 401126274Sdes */ 402124208Sdes for (i = 0; i < smallbits; i++) { 403124208Sdes if (BIT_TEST(SmallSieve, i)) 404124208Sdes continue; /* 2*i+smallbase is composite */ 405124208Sdes 406124208Sdes /* The next small prime */ 407124208Sdes sieve_large((2 * i) + smallbase); 408124208Sdes } 409124208Sdes 410124208Sdes memset(SmallSieve, 0, smallwords << SHIFT_BYTE); 411124208Sdes } 412124208Sdes 413124208Sdes time(&time_stop); 414124208Sdes 415124208Sdes logit("%.24s Sieved with %u small primes in %ld seconds", 416124208Sdes ctime(&time_stop), largetries, (long) (time_stop - time_start)); 417124208Sdes 418124208Sdes for (j = r = 0; j < largebits; j++) { 419124208Sdes if (BIT_TEST(LargeSieve, j)) 420124208Sdes continue; /* Definitely composite, skip */ 421124208Sdes 422124208Sdes debug2("test q = largebase+%u", 2 * j); 423164146Sdes if (BN_set_word(q, 2 * j) == 0) 424164146Sdes fatal("BN_set_word failed"); 425164146Sdes if (BN_add(q, q, largebase) == 0) 426164146Sdes fatal("BN_add failed"); 427181111Sdes if (qfileout(out, MODULI_TYPE_SOPHIE_GERMAIN, 428181111Sdes MODULI_TESTS_SIEVE, largetries, 429181111Sdes (power - 1) /* MSB */, (0), q) == -1) { 430124208Sdes ret = -1; 431124208Sdes break; 432124208Sdes } 433124208Sdes 434124208Sdes r++; /* count q */ 435124208Sdes } 436124208Sdes 437124208Sdes time(&time_stop); 438124208Sdes 439255767Sdes free(LargeSieve); 440255767Sdes free(SmallSieve); 441255767Sdes free(TinySieve); 442124208Sdes 443124208Sdes logit("%.24s Found %u candidates", ctime(&time_stop), r); 444124208Sdes 445124208Sdes return (ret); 446124208Sdes} 447124208Sdes 448240075Sdesstatic void 449240075Sdeswrite_checkpoint(char *cpfile, u_int32_t lineno) 450240075Sdes{ 451240075Sdes FILE *fp; 452294332Sdes char tmp[PATH_MAX]; 453240075Sdes int r; 454240075Sdes 455240075Sdes r = snprintf(tmp, sizeof(tmp), "%s.XXXXXXXXXX", cpfile); 456294332Sdes if (r == -1 || r >= PATH_MAX) { 457240075Sdes logit("write_checkpoint: temp pathname too long"); 458240075Sdes return; 459240075Sdes } 460240075Sdes if ((r = mkstemp(tmp)) == -1) { 461240075Sdes logit("mkstemp(%s): %s", tmp, strerror(errno)); 462240075Sdes return; 463240075Sdes } 464240075Sdes if ((fp = fdopen(r, "w")) == NULL) { 465240075Sdes logit("write_checkpoint: fdopen: %s", strerror(errno)); 466294332Sdes unlink(tmp); 467240075Sdes close(r); 468240075Sdes return; 469240075Sdes } 470240075Sdes if (fprintf(fp, "%lu\n", (unsigned long)lineno) > 0 && fclose(fp) == 0 471240075Sdes && rename(tmp, cpfile) == 0) 472240075Sdes debug3("wrote checkpoint line %lu to '%s'", 473240075Sdes (unsigned long)lineno, cpfile); 474240075Sdes else 475240075Sdes logit("failed to write to checkpoint file '%s': %s", cpfile, 476240075Sdes strerror(errno)); 477240075Sdes} 478240075Sdes 479240075Sdesstatic unsigned long 480240075Sdesread_checkpoint(char *cpfile) 481240075Sdes{ 482240075Sdes FILE *fp; 483240075Sdes unsigned long lineno = 0; 484240075Sdes 485240075Sdes if ((fp = fopen(cpfile, "r")) == NULL) 486240075Sdes return 0; 487240075Sdes if (fscanf(fp, "%lu\n", &lineno) < 1) 488240075Sdes logit("Failed to load checkpoint from '%s'", cpfile); 489240075Sdes else 490240075Sdes logit("Loaded checkpoint from '%s' line %lu", cpfile, lineno); 491240075Sdes fclose(fp); 492240075Sdes return lineno; 493240075Sdes} 494240075Sdes 495261320Sdesstatic unsigned long 496261320Sdescount_lines(FILE *f) 497261320Sdes{ 498261320Sdes unsigned long count = 0; 499261320Sdes char lp[QLINESIZE + 1]; 500261320Sdes 501261320Sdes if (fseek(f, 0, SEEK_SET) != 0) { 502261320Sdes debug("input file is not seekable"); 503261320Sdes return ULONG_MAX; 504261320Sdes } 505261320Sdes while (fgets(lp, QLINESIZE + 1, f) != NULL) 506261320Sdes count++; 507261320Sdes rewind(f); 508261320Sdes debug("input file has %lu lines", count); 509261320Sdes return count; 510261320Sdes} 511261320Sdes 512261320Sdesstatic char * 513261320Sdesfmt_time(time_t seconds) 514261320Sdes{ 515261320Sdes int day, hr, min; 516261320Sdes static char buf[128]; 517261320Sdes 518261320Sdes min = (seconds / 60) % 60; 519261320Sdes hr = (seconds / 60 / 60) % 24; 520261320Sdes day = seconds / 60 / 60 / 24; 521261320Sdes if (day > 0) 522261320Sdes snprintf(buf, sizeof buf, "%dd %d:%02d", day, hr, min); 523261320Sdes else 524261320Sdes snprintf(buf, sizeof buf, "%d:%02d", hr, min); 525261320Sdes return buf; 526261320Sdes} 527261320Sdes 528261320Sdesstatic void 529261320Sdesprint_progress(unsigned long start_lineno, unsigned long current_lineno, 530261320Sdes unsigned long end_lineno) 531261320Sdes{ 532261320Sdes static time_t time_start, time_prev; 533261320Sdes time_t time_now, elapsed; 534261320Sdes unsigned long num_to_process, processed, remaining, percent, eta; 535261320Sdes double time_per_line; 536261320Sdes char *eta_str; 537261320Sdes 538261320Sdes time_now = monotime(); 539261320Sdes if (time_start == 0) { 540261320Sdes time_start = time_prev = time_now; 541261320Sdes return; 542261320Sdes } 543261320Sdes /* print progress after 1m then once per 5m */ 544261320Sdes if (time_now - time_prev < 5 * 60) 545261320Sdes return; 546261320Sdes time_prev = time_now; 547261320Sdes elapsed = time_now - time_start; 548261320Sdes processed = current_lineno - start_lineno; 549261320Sdes remaining = end_lineno - current_lineno; 550261320Sdes num_to_process = end_lineno - start_lineno; 551261320Sdes time_per_line = (double)elapsed / processed; 552261320Sdes /* if we don't know how many we're processing just report count+time */ 553261320Sdes time(&time_now); 554261320Sdes if (end_lineno == ULONG_MAX) { 555261320Sdes logit("%.24s processed %lu in %s", ctime(&time_now), 556261320Sdes processed, fmt_time(elapsed)); 557261320Sdes return; 558261320Sdes } 559261320Sdes percent = 100 * processed / num_to_process; 560261320Sdes eta = time_per_line * remaining; 561261320Sdes eta_str = xstrdup(fmt_time(eta)); 562261320Sdes logit("%.24s processed %lu of %lu (%lu%%) in %s, ETA %s", 563261320Sdes ctime(&time_now), processed, num_to_process, percent, 564261320Sdes fmt_time(elapsed), eta_str); 565261320Sdes free(eta_str); 566261320Sdes} 567261320Sdes 568124208Sdes/* 569124208Sdes * perform a Miller-Rabin primality test 570124208Sdes * on the list of candidates 571124208Sdes * (checking both q and p) 572124208Sdes * The result is a list of so-call "safe" primes 573124208Sdes */ 574124208Sdesint 575240075Sdesprime_test(FILE *in, FILE *out, u_int32_t trials, u_int32_t generator_wanted, 576240075Sdes char *checkpoint_file, unsigned long start_lineno, unsigned long num_lines) 577124208Sdes{ 578124208Sdes BIGNUM *q, *p, *a; 579124208Sdes BN_CTX *ctx; 580124208Sdes char *cp, *lp; 581124208Sdes u_int32_t count_in = 0, count_out = 0, count_possible = 0; 582124208Sdes u_int32_t generator_known, in_tests, in_tries, in_type, in_size; 583240075Sdes unsigned long last_processed = 0, end_lineno; 584124208Sdes time_t time_start, time_stop; 585124208Sdes int res; 586124208Sdes 587137015Sdes if (trials < TRIAL_MINIMUM) { 588137015Sdes error("Minimum primality trials is %d", TRIAL_MINIMUM); 589137015Sdes return (-1); 590137015Sdes } 591137015Sdes 592261320Sdes if (num_lines == 0) 593261320Sdes end_lineno = count_lines(in); 594261320Sdes else 595261320Sdes end_lineno = start_lineno + num_lines; 596261320Sdes 597124208Sdes time(&time_start); 598124208Sdes 599164146Sdes if ((p = BN_new()) == NULL) 600164146Sdes fatal("BN_new failed"); 601164146Sdes if ((q = BN_new()) == NULL) 602164146Sdes fatal("BN_new failed"); 603164146Sdes if ((ctx = BN_CTX_new()) == NULL) 604164146Sdes fatal("BN_CTX_new failed"); 605124208Sdes 606124208Sdes debug2("%.24s Final %u Miller-Rabin trials (%x generator)", 607124208Sdes ctime(&time_start), trials, generator_wanted); 608124208Sdes 609240075Sdes if (checkpoint_file != NULL) 610240075Sdes last_processed = read_checkpoint(checkpoint_file); 611323134Sdes last_processed = start_lineno = MAXIMUM(last_processed, start_lineno); 612261320Sdes if (end_lineno == ULONG_MAX) 613261320Sdes debug("process from line %lu from pipe", last_processed); 614240075Sdes else 615261320Sdes debug("process from line %lu to line %lu", last_processed, 616261320Sdes end_lineno); 617240075Sdes 618124208Sdes res = 0; 619124208Sdes lp = xmalloc(QLINESIZE + 1); 620240075Sdes while (fgets(lp, QLINESIZE + 1, in) != NULL && count_in < end_lineno) { 621124208Sdes count_in++; 622261320Sdes if (count_in <= last_processed) { 623261320Sdes debug3("skipping line %u, before checkpoint or " 624261320Sdes "specified start line", count_in); 625261320Sdes continue; 626261320Sdes } 627261320Sdes if (checkpoint_file != NULL) 628240075Sdes write_checkpoint(checkpoint_file, count_in); 629261320Sdes print_progress(start_lineno, count_in, end_lineno); 630181111Sdes if (strlen(lp) < 14 || *lp == '!' || *lp == '#') { 631124208Sdes debug2("%10u: comment or short line", count_in); 632124208Sdes continue; 633124208Sdes } 634124208Sdes 635124208Sdes /* XXX - fragile parser */ 636124208Sdes /* time */ 637124208Sdes cp = &lp[14]; /* (skip) */ 638124208Sdes 639124208Sdes /* type */ 640124208Sdes in_type = strtoul(cp, &cp, 10); 641124208Sdes 642124208Sdes /* tests */ 643124208Sdes in_tests = strtoul(cp, &cp, 10); 644124208Sdes 645181111Sdes if (in_tests & MODULI_TESTS_COMPOSITE) { 646124208Sdes debug2("%10u: known composite", count_in); 647124208Sdes continue; 648124208Sdes } 649126274Sdes 650124208Sdes /* tries */ 651124208Sdes in_tries = strtoul(cp, &cp, 10); 652124208Sdes 653124208Sdes /* size (most significant bit) */ 654124208Sdes in_size = strtoul(cp, &cp, 10); 655124208Sdes 656124208Sdes /* generator (hex) */ 657124208Sdes generator_known = strtoul(cp, &cp, 16); 658124208Sdes 659124208Sdes /* Skip white space */ 660124208Sdes cp += strspn(cp, " "); 661124208Sdes 662124208Sdes /* modulus (hex) */ 663124208Sdes switch (in_type) { 664181111Sdes case MODULI_TYPE_SOPHIE_GERMAIN: 665137015Sdes debug2("%10u: (%u) Sophie-Germain", count_in, in_type); 666124208Sdes a = q; 667164146Sdes if (BN_hex2bn(&a, cp) == 0) 668164146Sdes fatal("BN_hex2bn failed"); 669124208Sdes /* p = 2*q + 1 */ 670164146Sdes if (BN_lshift(p, q, 1) == 0) 671164146Sdes fatal("BN_lshift failed"); 672164146Sdes if (BN_add_word(p, 1) == 0) 673164146Sdes fatal("BN_add_word failed"); 674124208Sdes in_size += 1; 675124208Sdes generator_known = 0; 676124208Sdes break; 677181111Sdes case MODULI_TYPE_UNSTRUCTURED: 678181111Sdes case MODULI_TYPE_SAFE: 679181111Sdes case MODULI_TYPE_SCHNORR: 680181111Sdes case MODULI_TYPE_STRONG: 681181111Sdes case MODULI_TYPE_UNKNOWN: 682124208Sdes debug2("%10u: (%u)", count_in, in_type); 683124208Sdes a = p; 684164146Sdes if (BN_hex2bn(&a, cp) == 0) 685164146Sdes fatal("BN_hex2bn failed"); 686124208Sdes /* q = (p-1) / 2 */ 687164146Sdes if (BN_rshift(q, p, 1) == 0) 688164146Sdes fatal("BN_rshift failed"); 689124208Sdes break; 690126274Sdes default: 691126274Sdes debug2("Unknown prime type"); 692126274Sdes break; 693124208Sdes } 694124208Sdes 695124208Sdes /* 696124208Sdes * due to earlier inconsistencies in interpretation, check 697124208Sdes * the proposed bit size. 698124208Sdes */ 699149749Sdes if ((u_int32_t)BN_num_bits(p) != (in_size + 1)) { 700124208Sdes debug2("%10u: bit size %u mismatch", count_in, in_size); 701124208Sdes continue; 702124208Sdes } 703124208Sdes if (in_size < QSIZE_MINIMUM) { 704124208Sdes debug2("%10u: bit size %u too short", count_in, in_size); 705124208Sdes continue; 706124208Sdes } 707124208Sdes 708181111Sdes if (in_tests & MODULI_TESTS_MILLER_RABIN) 709124208Sdes in_tries += trials; 710124208Sdes else 711124208Sdes in_tries = trials; 712126274Sdes 713124208Sdes /* 714124208Sdes * guess unknown generator 715124208Sdes */ 716124208Sdes if (generator_known == 0) { 717124208Sdes if (BN_mod_word(p, 24) == 11) 718124208Sdes generator_known = 2; 719124208Sdes else if (BN_mod_word(p, 12) == 5) 720124208Sdes generator_known = 3; 721124208Sdes else { 722124208Sdes u_int32_t r = BN_mod_word(p, 10); 723124208Sdes 724126274Sdes if (r == 3 || r == 7) 725124208Sdes generator_known = 5; 726124208Sdes } 727124208Sdes } 728124208Sdes /* 729124208Sdes * skip tests when desired generator doesn't match 730124208Sdes */ 731124208Sdes if (generator_wanted > 0 && 732124208Sdes generator_wanted != generator_known) { 733124208Sdes debug2("%10u: generator %d != %d", 734124208Sdes count_in, generator_known, generator_wanted); 735124208Sdes continue; 736124208Sdes } 737124208Sdes 738126274Sdes /* 739126274Sdes * Primes with no known generator are useless for DH, so 740126274Sdes * skip those. 741126274Sdes */ 742126274Sdes if (generator_known == 0) { 743126274Sdes debug2("%10u: no known generator", count_in); 744126274Sdes continue; 745126274Sdes } 746126274Sdes 747124208Sdes count_possible++; 748124208Sdes 749124208Sdes /* 750126274Sdes * The (1/4)^N performance bound on Miller-Rabin is 751126274Sdes * extremely pessimistic, so don't spend a lot of time 752126274Sdes * really verifying that q is prime until after we know 753126274Sdes * that p is also prime. A single pass will weed out the 754124208Sdes * vast majority of composite q's. 755124208Sdes */ 756221420Sdes if (BN_is_prime_ex(q, 1, ctx, NULL) <= 0) { 757126274Sdes debug("%10u: q failed first possible prime test", 758124208Sdes count_in); 759124208Sdes continue; 760124208Sdes } 761126274Sdes 762124208Sdes /* 763126274Sdes * q is possibly prime, so go ahead and really make sure 764126274Sdes * that p is prime. If it is, then we can go back and do 765126274Sdes * the same for q. If p is composite, chances are that 766124208Sdes * will show up on the first Rabin-Miller iteration so it 767124208Sdes * doesn't hurt to specify a high iteration count. 768124208Sdes */ 769221420Sdes if (!BN_is_prime_ex(p, trials, ctx, NULL)) { 770126274Sdes debug("%10u: p is not prime", count_in); 771124208Sdes continue; 772124208Sdes } 773124208Sdes debug("%10u: p is almost certainly prime", count_in); 774124208Sdes 775124208Sdes /* recheck q more rigorously */ 776221420Sdes if (!BN_is_prime_ex(q, trials - 1, ctx, NULL)) { 777124208Sdes debug("%10u: q is not prime", count_in); 778124208Sdes continue; 779124208Sdes } 780124208Sdes debug("%10u: q is almost certainly prime", count_in); 781124208Sdes 782181111Sdes if (qfileout(out, MODULI_TYPE_SAFE, 783181111Sdes in_tests | MODULI_TESTS_MILLER_RABIN, 784124208Sdes in_tries, in_size, generator_known, p)) { 785124208Sdes res = -1; 786124208Sdes break; 787124208Sdes } 788124208Sdes 789124208Sdes count_out++; 790124208Sdes } 791124208Sdes 792124208Sdes time(&time_stop); 793255767Sdes free(lp); 794124208Sdes BN_free(p); 795124208Sdes BN_free(q); 796124208Sdes BN_CTX_free(ctx); 797124208Sdes 798240075Sdes if (checkpoint_file != NULL) 799240075Sdes unlink(checkpoint_file); 800240075Sdes 801124208Sdes logit("%.24s Found %u safe primes of %u candidates in %ld seconds", 802126274Sdes ctime(&time_stop), count_out, count_possible, 803124208Sdes (long) (time_stop - time_start)); 804124208Sdes 805124208Sdes return (res); 806124208Sdes} 807294332Sdes 808294332Sdes#endif /* WITH_OPENSSL */ 809