1295367Sdes/* $OpenBSD: moduli.c,v 1.30 2015/01/20 23:14:00 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 42295367Sdes#ifdef WITH_OPENSSL 43295367Sdes 44295367Sdes#include <sys/param.h> /* MAX */ 45162852Sdes#include <sys/types.h> 46162852Sdes 47162852Sdes#include <openssl/bn.h> 48181111Sdes#include <openssl/dh.h> 49162852Sdes 50240075Sdes#include <errno.h> 51162852Sdes#include <stdio.h> 52162852Sdes#include <stdlib.h> 53162852Sdes#include <string.h> 54162852Sdes#include <stdarg.h> 55162852Sdes#include <time.h> 56240075Sdes#include <unistd.h> 57295367Sdes#include <limits.h> 58162852Sdes 59124208Sdes#include "xmalloc.h" 60181111Sdes#include "dh.h" 61124208Sdes#include "log.h" 62262566Sdes#include "misc.h" 63124208Sdes 64221420Sdes#include "openbsd-compat/openssl-compat.h" 65221420Sdes 66124208Sdes/* 67124208Sdes * File output defines 68124208Sdes */ 69124208Sdes 70124208Sdes/* need line long enough for largest moduli plus headers */ 71137015Sdes#define QLINESIZE (100+8192) 72124208Sdes 73126274Sdes/* 74126274Sdes * Size: decimal. 75124208Sdes * Specifies the number of the most significant bit (0 to M). 76126274Sdes * WARNING: internally, usually 1 to N. 77124208Sdes */ 78137015Sdes#define QSIZE_MINIMUM (511) 79124208Sdes 80124208Sdes/* 81124208Sdes * Prime sieving defines 82124208Sdes */ 83124208Sdes 84124208Sdes/* Constant: assuming 8 bit bytes and 32 bit words */ 85137015Sdes#define SHIFT_BIT (3) 86137015Sdes#define SHIFT_BYTE (2) 87137015Sdes#define SHIFT_WORD (SHIFT_BIT+SHIFT_BYTE) 88137015Sdes#define SHIFT_MEGABYTE (20) 89137015Sdes#define SHIFT_MEGAWORD (SHIFT_MEGABYTE-SHIFT_BYTE) 90124208Sdes 91124208Sdes/* 92137015Sdes * Using virtual memory can cause thrashing. This should be the largest 93137015Sdes * number that is supported without a large amount of disk activity -- 94137015Sdes * that would increase the run time from hours to days or weeks! 95137015Sdes */ 96137015Sdes#define LARGE_MINIMUM (8UL) /* megabytes */ 97137015Sdes 98137015Sdes/* 99137015Sdes * Do not increase this number beyond the unsigned integer bit size. 100137015Sdes * Due to a multiple of 4, it must be LESS than 128 (yielding 2**30 bits). 101137015Sdes */ 102137015Sdes#define LARGE_MAXIMUM (127UL) /* megabytes */ 103137015Sdes 104137015Sdes/* 105124208Sdes * Constant: when used with 32-bit integers, the largest sieve prime 106124208Sdes * has to be less than 2**32. 107124208Sdes */ 108137015Sdes#define SMALL_MAXIMUM (0xffffffffUL) 109124208Sdes 110124208Sdes/* Constant: can sieve all primes less than 2**32, as 65537**2 > 2**32-1. */ 111137015Sdes#define TINY_NUMBER (1UL<<16) 112124208Sdes 113124208Sdes/* Ensure enough bit space for testing 2*q. */ 114149749Sdes#define TEST_MAXIMUM (1UL<<16) 115149749Sdes#define TEST_MINIMUM (QSIZE_MINIMUM + 1) 116149749Sdes/* real TEST_MINIMUM (1UL << (SHIFT_WORD - TEST_POWER)) */ 117149749Sdes#define TEST_POWER (3) /* 2**n, n < SHIFT_WORD */ 118124208Sdes 119124208Sdes/* bit operations on 32-bit words */ 120149749Sdes#define BIT_CLEAR(a,n) ((a)[(n)>>SHIFT_WORD] &= ~(1L << ((n) & 31))) 121149749Sdes#define BIT_SET(a,n) ((a)[(n)>>SHIFT_WORD] |= (1L << ((n) & 31))) 122149749Sdes#define BIT_TEST(a,n) ((a)[(n)>>SHIFT_WORD] & (1L << ((n) & 31))) 123124208Sdes 124124208Sdes/* 125124208Sdes * Prime testing defines 126124208Sdes */ 127124208Sdes 128137015Sdes/* Minimum number of primality tests to perform */ 129149749Sdes#define TRIAL_MINIMUM (4) 130137015Sdes 131124208Sdes/* 132124208Sdes * Sieving data (XXX - move to struct) 133124208Sdes */ 134124208Sdes 135124208Sdes/* sieve 2**16 */ 136124208Sdesstatic u_int32_t *TinySieve, tinybits; 137124208Sdes 138124208Sdes/* sieve 2**30 in 2**16 parts */ 139124208Sdesstatic u_int32_t *SmallSieve, smallbits, smallbase; 140124208Sdes 141124208Sdes/* sieve relative to the initial value */ 142124208Sdesstatic u_int32_t *LargeSieve, largewords, largetries, largenumbers; 143124208Sdesstatic u_int32_t largebits, largememory; /* megabytes */ 144124208Sdesstatic BIGNUM *largebase; 145124208Sdes 146149749Sdesint gen_candidates(FILE *, u_int32_t, u_int32_t, BIGNUM *); 147240075Sdesint prime_test(FILE *, FILE *, u_int32_t, u_int32_t, char *, unsigned long, 148240075Sdes unsigned long); 149124208Sdes 150124208Sdes/* 151124208Sdes * print moduli out in consistent form, 152124208Sdes */ 153124208Sdesstatic int 154124208Sdesqfileout(FILE * ofile, u_int32_t otype, u_int32_t otests, u_int32_t otries, 155124208Sdes u_int32_t osize, u_int32_t ogenerator, BIGNUM * omodulus) 156124208Sdes{ 157124208Sdes struct tm *gtm; 158124208Sdes time_t time_now; 159124208Sdes int res; 160124208Sdes 161124208Sdes time(&time_now); 162124208Sdes gtm = gmtime(&time_now); 163126274Sdes 164124208Sdes res = fprintf(ofile, "%04d%02d%02d%02d%02d%02d %u %u %u %u %x ", 165124208Sdes gtm->tm_year + 1900, gtm->tm_mon + 1, gtm->tm_mday, 166124208Sdes gtm->tm_hour, gtm->tm_min, gtm->tm_sec, 167124208Sdes otype, otests, otries, osize, ogenerator); 168124208Sdes 169124208Sdes if (res < 0) 170124208Sdes return (-1); 171124208Sdes 172124208Sdes if (BN_print_fp(ofile, omodulus) < 1) 173124208Sdes return (-1); 174124208Sdes 175124208Sdes res = fprintf(ofile, "\n"); 176124208Sdes fflush(ofile); 177124208Sdes 178124208Sdes return (res > 0 ? 0 : -1); 179124208Sdes} 180124208Sdes 181124208Sdes 182124208Sdes/* 183124208Sdes ** Sieve p's and q's with small factors 184124208Sdes */ 185124208Sdesstatic void 186124208Sdessieve_large(u_int32_t s) 187124208Sdes{ 188124208Sdes u_int32_t r, u; 189124208Sdes 190126274Sdes debug3("sieve_large %u", s); 191124208Sdes largetries++; 192124208Sdes /* r = largebase mod s */ 193124208Sdes r = BN_mod_word(largebase, s); 194124208Sdes if (r == 0) 195124208Sdes u = 0; /* s divides into largebase exactly */ 196124208Sdes else 197124208Sdes u = s - r; /* largebase+u is first entry divisible by s */ 198124208Sdes 199124208Sdes if (u < largebits * 2) { 200124208Sdes /* 201124208Sdes * The sieve omits p's and q's divisible by 2, so ensure that 202124208Sdes * largebase+u is odd. Then, step through the sieve in 203124208Sdes * increments of 2*s 204124208Sdes */ 205124208Sdes if (u & 0x1) 206124208Sdes u += s; /* Make largebase+u odd, and u even */ 207124208Sdes 208124208Sdes /* Mark all multiples of 2*s */ 209124208Sdes for (u /= 2; u < largebits; u += s) 210124208Sdes BIT_SET(LargeSieve, u); 211124208Sdes } 212124208Sdes 213124208Sdes /* r = p mod s */ 214124208Sdes r = (2 * r + 1) % s; 215124208Sdes if (r == 0) 216124208Sdes u = 0; /* s divides p exactly */ 217124208Sdes else 218124208Sdes u = s - r; /* p+u is first entry divisible by s */ 219124208Sdes 220124208Sdes if (u < largebits * 4) { 221124208Sdes /* 222124208Sdes * The sieve omits p's divisible by 4, so ensure that 223124208Sdes * largebase+u is not. Then, step through the sieve in 224124208Sdes * increments of 4*s 225124208Sdes */ 226124208Sdes while (u & 0x3) { 227124208Sdes if (SMALL_MAXIMUM - u < s) 228124208Sdes return; 229124208Sdes u += s; 230124208Sdes } 231124208Sdes 232124208Sdes /* Mark all multiples of 4*s */ 233124208Sdes for (u /= 4; u < largebits; u += s) 234124208Sdes BIT_SET(LargeSieve, u); 235124208Sdes } 236124208Sdes} 237124208Sdes 238124208Sdes/* 239137015Sdes * list candidates for Sophie-Germain primes (where q = (p-1)/2) 240124208Sdes * to standard output. 241124208Sdes * The list is checked against small known primes (less than 2**30). 242124208Sdes */ 243124208Sdesint 244149749Sdesgen_candidates(FILE *out, u_int32_t memory, u_int32_t power, BIGNUM *start) 245124208Sdes{ 246124208Sdes BIGNUM *q; 247124208Sdes u_int32_t j, r, s, t; 248124208Sdes u_int32_t smallwords = TINY_NUMBER >> 6; 249124208Sdes u_int32_t tinywords = TINY_NUMBER >> 6; 250124208Sdes time_t time_start, time_stop; 251149749Sdes u_int32_t i; 252149749Sdes int ret = 0; 253124208Sdes 254124208Sdes largememory = memory; 255124208Sdes 256137015Sdes if (memory != 0 && 257149749Sdes (memory < LARGE_MINIMUM || memory > LARGE_MAXIMUM)) { 258137015Sdes error("Invalid memory amount (min %ld, max %ld)", 259137015Sdes LARGE_MINIMUM, LARGE_MAXIMUM); 260137015Sdes return (-1); 261137015Sdes } 262137015Sdes 263124208Sdes /* 264126274Sdes * Set power to the length in bits of the prime to be generated. 265126274Sdes * This is changed to 1 less than the desired safe prime moduli p. 266126274Sdes */ 267124208Sdes if (power > TEST_MAXIMUM) { 268124208Sdes error("Too many bits: %u > %lu", power, TEST_MAXIMUM); 269124208Sdes return (-1); 270124208Sdes } else if (power < TEST_MINIMUM) { 271124208Sdes error("Too few bits: %u < %u", power, TEST_MINIMUM); 272124208Sdes return (-1); 273124208Sdes } 274124208Sdes power--; /* decrement before squaring */ 275124208Sdes 276124208Sdes /* 277126274Sdes * The density of ordinary primes is on the order of 1/bits, so the 278126274Sdes * density of safe primes should be about (1/bits)**2. Set test range 279126274Sdes * to something well above bits**2 to be reasonably sure (but not 280126274Sdes * guaranteed) of catching at least one safe prime. 281124208Sdes */ 282124208Sdes largewords = ((power * power) >> (SHIFT_WORD - TEST_POWER)); 283124208Sdes 284124208Sdes /* 285126274Sdes * Need idea of how much memory is available. We don't have to use all 286126274Sdes * of it. 287124208Sdes */ 288124208Sdes if (largememory > LARGE_MAXIMUM) { 289124208Sdes logit("Limited memory: %u MB; limit %lu MB", 290124208Sdes largememory, LARGE_MAXIMUM); 291124208Sdes largememory = LARGE_MAXIMUM; 292124208Sdes } 293124208Sdes 294124208Sdes if (largewords <= (largememory << SHIFT_MEGAWORD)) { 295124208Sdes logit("Increased memory: %u MB; need %u bytes", 296124208Sdes largememory, (largewords << SHIFT_BYTE)); 297124208Sdes largewords = (largememory << SHIFT_MEGAWORD); 298124208Sdes } else if (largememory > 0) { 299124208Sdes logit("Decreased memory: %u MB; want %u bytes", 300124208Sdes largememory, (largewords << SHIFT_BYTE)); 301124208Sdes largewords = (largememory << SHIFT_MEGAWORD); 302124208Sdes } 303124208Sdes 304162852Sdes TinySieve = xcalloc(tinywords, sizeof(u_int32_t)); 305124208Sdes tinybits = tinywords << SHIFT_WORD; 306124208Sdes 307162852Sdes SmallSieve = xcalloc(smallwords, sizeof(u_int32_t)); 308124208Sdes smallbits = smallwords << SHIFT_WORD; 309124208Sdes 310124208Sdes /* 311124208Sdes * dynamically determine available memory 312124208Sdes */ 313124208Sdes while ((LargeSieve = calloc(largewords, sizeof(u_int32_t))) == NULL) 314124208Sdes largewords -= (1L << (SHIFT_MEGAWORD - 2)); /* 1/4 MB chunks */ 315124208Sdes 316124208Sdes largebits = largewords << SHIFT_WORD; 317124208Sdes largenumbers = largebits * 2; /* even numbers excluded */ 318124208Sdes 319124208Sdes /* validation check: count the number of primes tried */ 320124208Sdes largetries = 0; 321164146Sdes if ((q = BN_new()) == NULL) 322164146Sdes fatal("BN_new failed"); 323124208Sdes 324124208Sdes /* 325126274Sdes * Generate random starting point for subprime search, or use 326126274Sdes * specified parameter. 327124208Sdes */ 328164146Sdes if ((largebase = BN_new()) == NULL) 329164146Sdes fatal("BN_new failed"); 330164146Sdes if (start == NULL) { 331164146Sdes if (BN_rand(largebase, power, 1, 1) == 0) 332164146Sdes fatal("BN_rand failed"); 333164146Sdes } else { 334164146Sdes if (BN_copy(largebase, start) == NULL) 335164146Sdes fatal("BN_copy: failed"); 336164146Sdes } 337124208Sdes 338124208Sdes /* ensure odd */ 339164146Sdes if (BN_set_bit(largebase, 0) == 0) 340164146Sdes fatal("BN_set_bit: failed"); 341124208Sdes 342124208Sdes time(&time_start); 343124208Sdes 344126274Sdes logit("%.24s Sieve next %u plus %u-bit", ctime(&time_start), 345124208Sdes largenumbers, power); 346124208Sdes debug2("start point: 0x%s", BN_bn2hex(largebase)); 347124208Sdes 348124208Sdes /* 349126274Sdes * TinySieve 350126274Sdes */ 351124208Sdes for (i = 0; i < tinybits; i++) { 352124208Sdes if (BIT_TEST(TinySieve, i)) 353124208Sdes continue; /* 2*i+3 is composite */ 354124208Sdes 355124208Sdes /* The next tiny prime */ 356124208Sdes t = 2 * i + 3; 357124208Sdes 358124208Sdes /* Mark all multiples of t */ 359124208Sdes for (j = i + t; j < tinybits; j += t) 360124208Sdes BIT_SET(TinySieve, j); 361124208Sdes 362124208Sdes sieve_large(t); 363124208Sdes } 364124208Sdes 365124208Sdes /* 366126274Sdes * Start the small block search at the next possible prime. To avoid 367126274Sdes * fencepost errors, the last pass is skipped. 368126274Sdes */ 369124208Sdes for (smallbase = TINY_NUMBER + 3; 370149749Sdes smallbase < (SMALL_MAXIMUM - TINY_NUMBER); 371149749Sdes smallbase += TINY_NUMBER) { 372124208Sdes for (i = 0; i < tinybits; i++) { 373124208Sdes if (BIT_TEST(TinySieve, i)) 374124208Sdes continue; /* 2*i+3 is composite */ 375124208Sdes 376124208Sdes /* The next tiny prime */ 377124208Sdes t = 2 * i + 3; 378124208Sdes r = smallbase % t; 379124208Sdes 380124208Sdes if (r == 0) { 381124208Sdes s = 0; /* t divides into smallbase exactly */ 382124208Sdes } else { 383124208Sdes /* smallbase+s is first entry divisible by t */ 384124208Sdes s = t - r; 385124208Sdes } 386124208Sdes 387124208Sdes /* 388124208Sdes * The sieve omits even numbers, so ensure that 389124208Sdes * smallbase+s is odd. Then, step through the sieve 390124208Sdes * in increments of 2*t 391124208Sdes */ 392124208Sdes if (s & 1) 393124208Sdes s += t; /* Make smallbase+s odd, and s even */ 394124208Sdes 395124208Sdes /* Mark all multiples of 2*t */ 396124208Sdes for (s /= 2; s < smallbits; s += t) 397124208Sdes BIT_SET(SmallSieve, s); 398124208Sdes } 399124208Sdes 400124208Sdes /* 401126274Sdes * SmallSieve 402126274Sdes */ 403124208Sdes for (i = 0; i < smallbits; i++) { 404124208Sdes if (BIT_TEST(SmallSieve, i)) 405124208Sdes continue; /* 2*i+smallbase is composite */ 406124208Sdes 407124208Sdes /* The next small prime */ 408124208Sdes sieve_large((2 * i) + smallbase); 409124208Sdes } 410124208Sdes 411124208Sdes memset(SmallSieve, 0, smallwords << SHIFT_BYTE); 412124208Sdes } 413124208Sdes 414124208Sdes time(&time_stop); 415124208Sdes 416124208Sdes logit("%.24s Sieved with %u small primes in %ld seconds", 417124208Sdes ctime(&time_stop), largetries, (long) (time_stop - time_start)); 418124208Sdes 419124208Sdes for (j = r = 0; j < largebits; j++) { 420124208Sdes if (BIT_TEST(LargeSieve, j)) 421124208Sdes continue; /* Definitely composite, skip */ 422124208Sdes 423124208Sdes debug2("test q = largebase+%u", 2 * j); 424164146Sdes if (BN_set_word(q, 2 * j) == 0) 425164146Sdes fatal("BN_set_word failed"); 426164146Sdes if (BN_add(q, q, largebase) == 0) 427164146Sdes fatal("BN_add failed"); 428181111Sdes if (qfileout(out, MODULI_TYPE_SOPHIE_GERMAIN, 429181111Sdes MODULI_TESTS_SIEVE, largetries, 430181111Sdes (power - 1) /* MSB */, (0), q) == -1) { 431124208Sdes ret = -1; 432124208Sdes break; 433124208Sdes } 434124208Sdes 435124208Sdes r++; /* count q */ 436124208Sdes } 437124208Sdes 438124208Sdes time(&time_stop); 439124208Sdes 440255767Sdes free(LargeSieve); 441255767Sdes free(SmallSieve); 442255767Sdes free(TinySieve); 443124208Sdes 444124208Sdes logit("%.24s Found %u candidates", ctime(&time_stop), r); 445124208Sdes 446124208Sdes return (ret); 447124208Sdes} 448124208Sdes 449240075Sdesstatic void 450240075Sdeswrite_checkpoint(char *cpfile, u_int32_t lineno) 451240075Sdes{ 452240075Sdes FILE *fp; 453295367Sdes char tmp[PATH_MAX]; 454240075Sdes int r; 455240075Sdes 456240075Sdes r = snprintf(tmp, sizeof(tmp), "%s.XXXXXXXXXX", cpfile); 457295367Sdes if (r == -1 || r >= PATH_MAX) { 458240075Sdes logit("write_checkpoint: temp pathname too long"); 459240075Sdes return; 460240075Sdes } 461240075Sdes if ((r = mkstemp(tmp)) == -1) { 462240075Sdes logit("mkstemp(%s): %s", tmp, strerror(errno)); 463240075Sdes return; 464240075Sdes } 465240075Sdes if ((fp = fdopen(r, "w")) == NULL) { 466240075Sdes logit("write_checkpoint: fdopen: %s", strerror(errno)); 467295367Sdes unlink(tmp); 468240075Sdes close(r); 469240075Sdes return; 470240075Sdes } 471240075Sdes if (fprintf(fp, "%lu\n", (unsigned long)lineno) > 0 && fclose(fp) == 0 472240075Sdes && rename(tmp, cpfile) == 0) 473240075Sdes debug3("wrote checkpoint line %lu to '%s'", 474240075Sdes (unsigned long)lineno, cpfile); 475240075Sdes else 476240075Sdes logit("failed to write to checkpoint file '%s': %s", cpfile, 477240075Sdes strerror(errno)); 478240075Sdes} 479240075Sdes 480240075Sdesstatic unsigned long 481240075Sdesread_checkpoint(char *cpfile) 482240075Sdes{ 483240075Sdes FILE *fp; 484240075Sdes unsigned long lineno = 0; 485240075Sdes 486240075Sdes if ((fp = fopen(cpfile, "r")) == NULL) 487240075Sdes return 0; 488240075Sdes if (fscanf(fp, "%lu\n", &lineno) < 1) 489240075Sdes logit("Failed to load checkpoint from '%s'", cpfile); 490240075Sdes else 491240075Sdes logit("Loaded checkpoint from '%s' line %lu", cpfile, lineno); 492240075Sdes fclose(fp); 493240075Sdes return lineno; 494240075Sdes} 495240075Sdes 496262566Sdesstatic unsigned long 497262566Sdescount_lines(FILE *f) 498262566Sdes{ 499262566Sdes unsigned long count = 0; 500262566Sdes char lp[QLINESIZE + 1]; 501262566Sdes 502262566Sdes if (fseek(f, 0, SEEK_SET) != 0) { 503262566Sdes debug("input file is not seekable"); 504262566Sdes return ULONG_MAX; 505262566Sdes } 506262566Sdes while (fgets(lp, QLINESIZE + 1, f) != NULL) 507262566Sdes count++; 508262566Sdes rewind(f); 509262566Sdes debug("input file has %lu lines", count); 510262566Sdes return count; 511262566Sdes} 512262566Sdes 513262566Sdesstatic char * 514262566Sdesfmt_time(time_t seconds) 515262566Sdes{ 516262566Sdes int day, hr, min; 517262566Sdes static char buf[128]; 518262566Sdes 519262566Sdes min = (seconds / 60) % 60; 520262566Sdes hr = (seconds / 60 / 60) % 24; 521262566Sdes day = seconds / 60 / 60 / 24; 522262566Sdes if (day > 0) 523262566Sdes snprintf(buf, sizeof buf, "%dd %d:%02d", day, hr, min); 524262566Sdes else 525262566Sdes snprintf(buf, sizeof buf, "%d:%02d", hr, min); 526262566Sdes return buf; 527262566Sdes} 528262566Sdes 529262566Sdesstatic void 530262566Sdesprint_progress(unsigned long start_lineno, unsigned long current_lineno, 531262566Sdes unsigned long end_lineno) 532262566Sdes{ 533262566Sdes static time_t time_start, time_prev; 534262566Sdes time_t time_now, elapsed; 535262566Sdes unsigned long num_to_process, processed, remaining, percent, eta; 536262566Sdes double time_per_line; 537262566Sdes char *eta_str; 538262566Sdes 539262566Sdes time_now = monotime(); 540262566Sdes if (time_start == 0) { 541262566Sdes time_start = time_prev = time_now; 542262566Sdes return; 543262566Sdes } 544262566Sdes /* print progress after 1m then once per 5m */ 545262566Sdes if (time_now - time_prev < 5 * 60) 546262566Sdes return; 547262566Sdes time_prev = time_now; 548262566Sdes elapsed = time_now - time_start; 549262566Sdes processed = current_lineno - start_lineno; 550262566Sdes remaining = end_lineno - current_lineno; 551262566Sdes num_to_process = end_lineno - start_lineno; 552262566Sdes time_per_line = (double)elapsed / processed; 553262566Sdes /* if we don't know how many we're processing just report count+time */ 554262566Sdes time(&time_now); 555262566Sdes if (end_lineno == ULONG_MAX) { 556262566Sdes logit("%.24s processed %lu in %s", ctime(&time_now), 557262566Sdes processed, fmt_time(elapsed)); 558262566Sdes return; 559262566Sdes } 560262566Sdes percent = 100 * processed / num_to_process; 561262566Sdes eta = time_per_line * remaining; 562262566Sdes eta_str = xstrdup(fmt_time(eta)); 563262566Sdes logit("%.24s processed %lu of %lu (%lu%%) in %s, ETA %s", 564262566Sdes ctime(&time_now), processed, num_to_process, percent, 565262566Sdes fmt_time(elapsed), eta_str); 566262566Sdes free(eta_str); 567262566Sdes} 568262566Sdes 569124208Sdes/* 570124208Sdes * perform a Miller-Rabin primality test 571124208Sdes * on the list of candidates 572124208Sdes * (checking both q and p) 573124208Sdes * The result is a list of so-call "safe" primes 574124208Sdes */ 575124208Sdesint 576240075Sdesprime_test(FILE *in, FILE *out, u_int32_t trials, u_int32_t generator_wanted, 577240075Sdes char *checkpoint_file, unsigned long start_lineno, unsigned long num_lines) 578124208Sdes{ 579124208Sdes BIGNUM *q, *p, *a; 580124208Sdes BN_CTX *ctx; 581124208Sdes char *cp, *lp; 582124208Sdes u_int32_t count_in = 0, count_out = 0, count_possible = 0; 583124208Sdes u_int32_t generator_known, in_tests, in_tries, in_type, in_size; 584240075Sdes unsigned long last_processed = 0, end_lineno; 585124208Sdes time_t time_start, time_stop; 586124208Sdes int res; 587124208Sdes 588137015Sdes if (trials < TRIAL_MINIMUM) { 589137015Sdes error("Minimum primality trials is %d", TRIAL_MINIMUM); 590137015Sdes return (-1); 591137015Sdes } 592137015Sdes 593262566Sdes if (num_lines == 0) 594262566Sdes end_lineno = count_lines(in); 595262566Sdes else 596262566Sdes end_lineno = start_lineno + num_lines; 597262566Sdes 598124208Sdes time(&time_start); 599124208Sdes 600164146Sdes if ((p = BN_new()) == NULL) 601164146Sdes fatal("BN_new failed"); 602164146Sdes if ((q = BN_new()) == NULL) 603164146Sdes fatal("BN_new failed"); 604164146Sdes if ((ctx = BN_CTX_new()) == NULL) 605164146Sdes fatal("BN_CTX_new failed"); 606124208Sdes 607124208Sdes debug2("%.24s Final %u Miller-Rabin trials (%x generator)", 608124208Sdes ctime(&time_start), trials, generator_wanted); 609124208Sdes 610240075Sdes if (checkpoint_file != NULL) 611240075Sdes last_processed = read_checkpoint(checkpoint_file); 612262566Sdes last_processed = start_lineno = MAX(last_processed, start_lineno); 613262566Sdes if (end_lineno == ULONG_MAX) 614262566Sdes debug("process from line %lu from pipe", last_processed); 615240075Sdes else 616262566Sdes debug("process from line %lu to line %lu", last_processed, 617262566Sdes end_lineno); 618240075Sdes 619124208Sdes res = 0; 620124208Sdes lp = xmalloc(QLINESIZE + 1); 621240075Sdes while (fgets(lp, QLINESIZE + 1, in) != NULL && count_in < end_lineno) { 622124208Sdes count_in++; 623262566Sdes if (count_in <= last_processed) { 624262566Sdes debug3("skipping line %u, before checkpoint or " 625262566Sdes "specified start line", count_in); 626262566Sdes continue; 627262566Sdes } 628262566Sdes if (checkpoint_file != NULL) 629240075Sdes write_checkpoint(checkpoint_file, count_in); 630262566Sdes print_progress(start_lineno, count_in, end_lineno); 631181111Sdes if (strlen(lp) < 14 || *lp == '!' || *lp == '#') { 632124208Sdes debug2("%10u: comment or short line", count_in); 633124208Sdes continue; 634124208Sdes } 635124208Sdes 636124208Sdes /* XXX - fragile parser */ 637124208Sdes /* time */ 638124208Sdes cp = &lp[14]; /* (skip) */ 639124208Sdes 640124208Sdes /* type */ 641124208Sdes in_type = strtoul(cp, &cp, 10); 642124208Sdes 643124208Sdes /* tests */ 644124208Sdes in_tests = strtoul(cp, &cp, 10); 645124208Sdes 646181111Sdes if (in_tests & MODULI_TESTS_COMPOSITE) { 647124208Sdes debug2("%10u: known composite", count_in); 648124208Sdes continue; 649124208Sdes } 650126274Sdes 651124208Sdes /* tries */ 652124208Sdes in_tries = strtoul(cp, &cp, 10); 653124208Sdes 654124208Sdes /* size (most significant bit) */ 655124208Sdes in_size = strtoul(cp, &cp, 10); 656124208Sdes 657124208Sdes /* generator (hex) */ 658124208Sdes generator_known = strtoul(cp, &cp, 16); 659124208Sdes 660124208Sdes /* Skip white space */ 661124208Sdes cp += strspn(cp, " "); 662124208Sdes 663124208Sdes /* modulus (hex) */ 664124208Sdes switch (in_type) { 665181111Sdes case MODULI_TYPE_SOPHIE_GERMAIN: 666137015Sdes debug2("%10u: (%u) Sophie-Germain", count_in, in_type); 667124208Sdes a = q; 668164146Sdes if (BN_hex2bn(&a, cp) == 0) 669164146Sdes fatal("BN_hex2bn failed"); 670124208Sdes /* p = 2*q + 1 */ 671164146Sdes if (BN_lshift(p, q, 1) == 0) 672164146Sdes fatal("BN_lshift failed"); 673164146Sdes if (BN_add_word(p, 1) == 0) 674164146Sdes fatal("BN_add_word failed"); 675124208Sdes in_size += 1; 676124208Sdes generator_known = 0; 677124208Sdes break; 678181111Sdes case MODULI_TYPE_UNSTRUCTURED: 679181111Sdes case MODULI_TYPE_SAFE: 680181111Sdes case MODULI_TYPE_SCHNORR: 681181111Sdes case MODULI_TYPE_STRONG: 682181111Sdes case MODULI_TYPE_UNKNOWN: 683124208Sdes debug2("%10u: (%u)", count_in, in_type); 684124208Sdes a = p; 685164146Sdes if (BN_hex2bn(&a, cp) == 0) 686164146Sdes fatal("BN_hex2bn failed"); 687124208Sdes /* q = (p-1) / 2 */ 688164146Sdes if (BN_rshift(q, p, 1) == 0) 689164146Sdes fatal("BN_rshift failed"); 690124208Sdes break; 691126274Sdes default: 692126274Sdes debug2("Unknown prime type"); 693126274Sdes break; 694124208Sdes } 695124208Sdes 696124208Sdes /* 697124208Sdes * due to earlier inconsistencies in interpretation, check 698124208Sdes * the proposed bit size. 699124208Sdes */ 700149749Sdes if ((u_int32_t)BN_num_bits(p) != (in_size + 1)) { 701124208Sdes debug2("%10u: bit size %u mismatch", count_in, in_size); 702124208Sdes continue; 703124208Sdes } 704124208Sdes if (in_size < QSIZE_MINIMUM) { 705124208Sdes debug2("%10u: bit size %u too short", count_in, in_size); 706124208Sdes continue; 707124208Sdes } 708124208Sdes 709181111Sdes if (in_tests & MODULI_TESTS_MILLER_RABIN) 710124208Sdes in_tries += trials; 711124208Sdes else 712124208Sdes in_tries = trials; 713126274Sdes 714124208Sdes /* 715124208Sdes * guess unknown generator 716124208Sdes */ 717124208Sdes if (generator_known == 0) { 718124208Sdes if (BN_mod_word(p, 24) == 11) 719124208Sdes generator_known = 2; 720124208Sdes else if (BN_mod_word(p, 12) == 5) 721124208Sdes generator_known = 3; 722124208Sdes else { 723124208Sdes u_int32_t r = BN_mod_word(p, 10); 724124208Sdes 725126274Sdes if (r == 3 || r == 7) 726124208Sdes generator_known = 5; 727124208Sdes } 728124208Sdes } 729124208Sdes /* 730124208Sdes * skip tests when desired generator doesn't match 731124208Sdes */ 732124208Sdes if (generator_wanted > 0 && 733124208Sdes generator_wanted != generator_known) { 734124208Sdes debug2("%10u: generator %d != %d", 735124208Sdes count_in, generator_known, generator_wanted); 736124208Sdes continue; 737124208Sdes } 738124208Sdes 739126274Sdes /* 740126274Sdes * Primes with no known generator are useless for DH, so 741126274Sdes * skip those. 742126274Sdes */ 743126274Sdes if (generator_known == 0) { 744126274Sdes debug2("%10u: no known generator", count_in); 745126274Sdes continue; 746126274Sdes } 747126274Sdes 748124208Sdes count_possible++; 749124208Sdes 750124208Sdes /* 751126274Sdes * The (1/4)^N performance bound on Miller-Rabin is 752126274Sdes * extremely pessimistic, so don't spend a lot of time 753126274Sdes * really verifying that q is prime until after we know 754126274Sdes * that p is also prime. A single pass will weed out the 755124208Sdes * vast majority of composite q's. 756124208Sdes */ 757221420Sdes if (BN_is_prime_ex(q, 1, ctx, NULL) <= 0) { 758126274Sdes debug("%10u: q failed first possible prime test", 759124208Sdes count_in); 760124208Sdes continue; 761124208Sdes } 762126274Sdes 763124208Sdes /* 764126274Sdes * q is possibly prime, so go ahead and really make sure 765126274Sdes * that p is prime. If it is, then we can go back and do 766126274Sdes * the same for q. If p is composite, chances are that 767124208Sdes * will show up on the first Rabin-Miller iteration so it 768124208Sdes * doesn't hurt to specify a high iteration count. 769124208Sdes */ 770221420Sdes if (!BN_is_prime_ex(p, trials, ctx, NULL)) { 771126274Sdes debug("%10u: p is not prime", count_in); 772124208Sdes continue; 773124208Sdes } 774124208Sdes debug("%10u: p is almost certainly prime", count_in); 775124208Sdes 776124208Sdes /* recheck q more rigorously */ 777221420Sdes if (!BN_is_prime_ex(q, trials - 1, ctx, NULL)) { 778124208Sdes debug("%10u: q is not prime", count_in); 779124208Sdes continue; 780124208Sdes } 781124208Sdes debug("%10u: q is almost certainly prime", count_in); 782124208Sdes 783181111Sdes if (qfileout(out, MODULI_TYPE_SAFE, 784181111Sdes in_tests | MODULI_TESTS_MILLER_RABIN, 785124208Sdes in_tries, in_size, generator_known, p)) { 786124208Sdes res = -1; 787124208Sdes break; 788124208Sdes } 789124208Sdes 790124208Sdes count_out++; 791124208Sdes } 792124208Sdes 793124208Sdes time(&time_stop); 794255767Sdes free(lp); 795124208Sdes BN_free(p); 796124208Sdes BN_free(q); 797124208Sdes BN_CTX_free(ctx); 798124208Sdes 799240075Sdes if (checkpoint_file != NULL) 800240075Sdes unlink(checkpoint_file); 801240075Sdes 802124208Sdes logit("%.24s Found %u safe primes of %u candidates in %ld seconds", 803126274Sdes ctime(&time_stop), count_out, count_possible, 804124208Sdes (long) (time_stop - time_start)); 805124208Sdes 806124208Sdes return (res); 807124208Sdes} 808295367Sdes 809295367Sdes#endif /* WITH_OPENSSL */ 810