mirror of
https://github.com/yuzu-emu/mbedtls.git
synced 2024-11-30 05:44:20 +01:00
128 lines
3.3 KiB
C
128 lines
3.3 KiB
C
/*
|
|
* 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
|
|
|
|
#include <stdio.h>
|
|
|
|
#include "polarssl/bignum.h"
|
|
#include "polarssl/config.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"
|
|
|
|
int 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 );
|
|
}
|