| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143 | /* *  Diffie-Hellman-Merkle key exchange (prime generation) * *  Copyright (C) 2006-2010, Brainspark B.V. * *  This file is part of PolarSSL (http://www.polarssl.org) *  Lead Maintainer: Paul Bakker <polarssl_maintainer at polarssl.org> * *  All rights reserved. * *  This program is free software; you can redistribute it and/or modify *  it under the terms of the GNU General Public License as published by *  the Free Software Foundation; either version 2 of the License, or *  (at your option) any later version. * *  This program is distributed in the hope that it will be useful, *  but WITHOUT ANY WARRANTY; without even the implied warranty of *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the *  GNU General Public License for more details. * *  You should have received a copy of the GNU General Public License along *  with this program; if not, write to the Free Software Foundation, Inc., *  51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. */#ifndef _CRT_SECURE_NO_DEPRECATE#define _CRT_SECURE_NO_DEPRECATE 1#endif#ifdef PRINTF_STDLIB#include <stdio.h>#endif#ifdef PRINTF_CUSTOM#include "tinystdio.h"#endif#include "polarssl/config.h"#include "polarssl/bignum.h"#include "polarssl/havege.h"/* * Note: G = 4 is always a quadratic residue mod P, * so it is a generator of order Q (with P = 2*Q+1). */#define DH_P_SIZE 1024#define GENERATOR "4"#if !defined(POLARSSL_BIGNUM_C) || !defined(POLARSSL_HAVEGE_C) ||   \    !defined(POLARSSL_FS_IO)int main( void ){    printf("POLARSSL_BIGNUM_C and/or POLARSSL_HAVEGE_C and/or "           "POLARSSL_FS_IO not defined.\n");    return( 0 );}#elseint main( void ){    int ret = 1;#if defined(POLARSSL_GENPRIME)    mpi G, P, Q;    havege_state hs;    FILE *fout;    mpi_init( &G ); mpi_init( &P ); mpi_init( &Q );    mpi_read_string( &G, 10, GENERATOR );    printf( "\n  . Seeding the random number generator..." );    fflush( stdout );    havege_init( &hs );    printf( " ok\n  . Generating the modulus, please wait..." );    fflush( stdout );    /*     * This can take a long time...     */    if( ( ret = mpi_gen_prime( &P, DH_P_SIZE, 1,                               havege_rand, &hs ) ) != 0 )    {        printf( " failed\n  ! mpi_gen_prime returned %d\n\n", ret );        goto exit;    }    printf( " ok\n  . Verifying that Q = (P-1)/2 is prime..." );    fflush( stdout );    if( ( ret = mpi_sub_int( &Q, &P, 1 ) ) != 0 )    {        printf( " failed\n  ! mpi_sub_int returned %d\n\n", ret );        goto exit;    }    if( ( ret = mpi_div_int( &Q, NULL, &Q, 2 ) ) != 0 )    {        printf( " failed\n  ! mpi_div_int returned %d\n\n", ret );        goto exit;    }    if( ( ret = mpi_is_prime( &Q, havege_rand, &hs ) ) != 0 )    {        printf( " failed\n  ! mpi_is_prime returned %d\n\n", ret );        goto exit;    }    printf( " ok\n  . Exporting the value in dh_prime.txt..." );    fflush( stdout );    if( ( fout = fopen( "dh_prime.txt", "wb+" ) ) == NULL )    {        ret = 1;        printf( " failed\n  ! Could not create dh_prime.txt\n\n" );        goto exit;    }    if( ( ret = mpi_write_file( "P = ", &P, 16, fout ) != 0 ) ||        ( ret = mpi_write_file( "G = ", &G, 16, fout ) != 0 ) )    {        printf( " failed\n  ! mpi_write_file returned %d\n\n", ret );        goto exit;    }    printf( " ok\n\n" );    fclose( fout );exit:    mpi_free( &G ); mpi_free( &P ); mpi_free( &Q );#else    printf( "\n  ! Prime-number generation is not available.\n\n" );#endif#ifdef WIN32    printf( "  Press Enter to exit this program.\n" );    fflush( stdout ); getchar();#endif    return( ret );}#endif /* POLARSSL_BIGNUM_C && POLARSSL_HAVEGE_C && POLARSSL_FS_IO */
 |