sl@0: /* crypto/bn/exptest.c */
sl@0: /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
sl@0:  * All rights reserved.
sl@0:  *
sl@0:  * This package is an SSL implementation written
sl@0:  * by Eric Young (eay@cryptsoft.com).
sl@0:  * The implementation was written so as to conform with Netscapes SSL.
sl@0:  * 
sl@0:  * This library is free for commercial and non-commercial use as long as
sl@0:  * the following conditions are aheared to.  The following conditions
sl@0:  * apply to all code found in this distribution, be it the RC4, RSA,
sl@0:  * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
sl@0:  * included with this distribution is covered by the same copyright terms
sl@0:  * except that the holder is Tim Hudson (tjh@cryptsoft.com).
sl@0:  * 
sl@0:  * Copyright remains Eric Young's, and as such any Copyright notices in
sl@0:  * the code are not to be removed.
sl@0:  * If this package is used in a product, Eric Young should be given attribution
sl@0:  * as the author of the parts of the library used.
sl@0:  * This can be in the form of a textual message at program startup or
sl@0:  * in documentation (online or textual) provided with the package.
sl@0:  * 
sl@0:  * Redistribution and use in source and binary forms, with or without
sl@0:  * modification, are permitted provided that the following conditions
sl@0:  * are met:
sl@0:  * 1. Redistributions of source code must retain the copyright
sl@0:  *    notice, this list of conditions and the following disclaimer.
sl@0:  * 2. Redistributions in binary form must reproduce the above copyright
sl@0:  *    notice, this list of conditions and the following disclaimer in the
sl@0:  *    documentation and/or other materials provided with the distribution.
sl@0:  * 3. All advertising materials mentioning features or use of this software
sl@0:  *    must display the following acknowledgement:
sl@0:  *    "This product includes cryptographic software written by
sl@0:  *     Eric Young (eay@cryptsoft.com)"
sl@0:  *    The word 'cryptographic' can be left out if the rouines from the library
sl@0:  *    being used are not cryptographic related :-).
sl@0:  * 4. If you include any Windows specific code (or a derivative thereof) from 
sl@0:  *    the apps directory (application code) you must include an acknowledgement:
sl@0:  *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
sl@0:  * 
sl@0:  * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
sl@0:  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
sl@0:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
sl@0:  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
sl@0:  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
sl@0:  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
sl@0:  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
sl@0:  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
sl@0:  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
sl@0:  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
sl@0:  * SUCH DAMAGE.
sl@0:  * 
sl@0:  * The licence and distribution terms for any publically available version or
sl@0:  * derivative of this code cannot be changed.  i.e. this code cannot simply be
sl@0:  * copied and put under another distribution licence
sl@0:  * [including the GNU Public Licence.]
sl@0:  */
sl@0: /*
sl@0:  © Portions copyright (c) 2006 Nokia Corporation.  All rights reserved.
sl@0:  */
sl@0: #include <stdio.h>
sl@0: #include <stdlib.h>
sl@0: #include <string.h>
sl@0: #ifndef SYMBIAN
sl@0: #include "../e_os.h"
sl@0: #else
sl@0: #include "e_os.h"
sl@0: #endif
sl@0: 
sl@0: #include <openssl/bio.h>
sl@0: #include <openssl/bn.h>
sl@0: #include <openssl/rand.h>
sl@0: #include <openssl/err.h>
sl@0: #ifdef SYMBIAN
sl@0: #ifdef stdin
sl@0: #undef stdin
sl@0: #endif
sl@0: #ifdef stdout
sl@0: #undef stdout
sl@0: #endif
sl@0: #ifdef stderr
sl@0: #undef stderr
sl@0: #endif
sl@0: 
sl@0: #define stdin fp_stdin
sl@0: #define stdout fp_stdout
sl@0: #define stderr fp_stderr
sl@0: 
sl@0: extern FILE *fp_stdout;
sl@0: extern FILE *fp_stderr;
sl@0: #endif
sl@0: 
sl@0: 
sl@0: #define NUM_BITS	(BN_BITS*2)
sl@0: 
sl@0: static const char rnd_seed[] = "string to make the random number generator think it has entropy";
sl@0: #ifndef SYMBIAN
sl@0: int main(int argc, char *argv[])
sl@0: #else
sl@0: int exp_main(int argc, char *argv[])
sl@0: #endif
sl@0: 	{
sl@0: 	BN_CTX *ctx;
sl@0: 	BIO *out=NULL;
sl@0: 	int i,ret;
sl@0: 	unsigned char c;
sl@0: 	BIGNUM *r_mont,*r_mont_const,*r_recp,*r_simple,*a,*b,*m;
sl@0:   
sl@0:     
sl@0: 	RAND_seed(rnd_seed, sizeof rnd_seed); /* or BN_rand may fail, and we don't
sl@0: 	                                       * even check its return value
sl@0: 	                                       * (which we should) */
sl@0:   if(errno==ENOMEM)
sl@0:   {
sl@0: 	  return 1;
sl@0:   }	                                       
sl@0: 
sl@0: 	ERR_load_BN_strings();
sl@0: 	if(errno==ENOMEM)
sl@0:     {
sl@0: 	  return 1;
sl@0: 	}	    
sl@0: 
sl@0: 	ctx=BN_CTX_new();
sl@0: 	if (ctx == NULL)
sl@0: 	{
sl@0: 	 if(errno==ENOMEM)
sl@0:      {
sl@0: 	  return 1;
sl@0: 	 }
sl@0: 	 return 1;	    
sl@0: 	} 
sl@0: 	r_mont=BN_new();
sl@0: 	if(r_mont==NULL&&errno==ENOMEM)
sl@0:     {
sl@0: 	  return 1;
sl@0: 	}	    
sl@0: 	r_mont_const=BN_new();
sl@0: 	if(r_mont_const==NULL&&errno==ENOMEM)
sl@0:   {
sl@0: 	  return 1;
sl@0: 	}	    
sl@0: 
sl@0: 	r_recp=BN_new();
sl@0: 	if(r_recp==NULL&&errno==ENOMEM)
sl@0:    {
sl@0: 	  return 1;
sl@0: 	}	    
sl@0: 
sl@0: 	r_simple=BN_new();
sl@0: 	if(r_simple==NULL&&errno==ENOMEM)
sl@0:   {
sl@0: 	  return 1;
sl@0: 	}	    
sl@0: 
sl@0: 	a=BN_new();
sl@0: 	if(a==NULL&&errno==ENOMEM)
sl@0:   {
sl@0: 	  return 1;
sl@0: 	}	    
sl@0: 
sl@0: 	b=BN_new();
sl@0: 	if(b==NULL&&errno==ENOMEM)
sl@0:   {
sl@0: 	  return 1;
sl@0: 	}	    
sl@0: 	
sl@0: 	m=BN_new();
sl@0: 	if(m==NULL&&errno==ENOMEM)
sl@0:   {
sl@0: 	  return 1;
sl@0: 	}	    
sl@0: 	
sl@0: 	if (	(r_mont == NULL) || (r_recp == NULL) ||
sl@0: 		(a == NULL) || (b == NULL))
sl@0: 		goto err;
sl@0: 
sl@0: 	out=BIO_new(BIO_s_file());
sl@0: 	if(out==NULL&&errno==ENOMEM)
sl@0:   {
sl@0: 	  return 1;
sl@0: 	}	    
sl@0: 	if (out == NULL) 
sl@0: 	return 1;
sl@0: 	BIO_set_fp(out,stdout,BIO_NOCLOSE);
sl@0: 	if(errno==ENOMEM)
sl@0:   {
sl@0: 	  return 1;
sl@0: 	}	    
sl@0: 
sl@0: 	for (i=0; i<200; i++)
sl@0: 		{
sl@0: 		RAND_bytes(&c,1);
sl@0:   	if(errno==ENOMEM)
sl@0:     {
sl@0: 	    return 1;
sl@0: 	  }	    
sl@0: 
sl@0: 		c=(c%BN_BITS)-BN_BITS2;
sl@0: 		BN_rand(a,NUM_BITS+c,0,0);
sl@0: 		if(errno==ENOMEM)
sl@0:     {
sl@0: 	   return 1;
sl@0: 	  }	    
sl@0: 		RAND_bytes(&c,1);
sl@0:   	if(errno==ENOMEM)
sl@0:     {
sl@0: 	    return 1;
sl@0: 	  }	    
sl@0: 		c=(c%BN_BITS)-BN_BITS2;
sl@0: 		BN_rand(b,NUM_BITS+c,0,0);
sl@0:   	if(errno==ENOMEM)
sl@0:     {
sl@0: 	    return 1;
sl@0: 	  }	    
sl@0: 		RAND_bytes(&c,1);
sl@0: 		if(errno==ENOMEM)
sl@0:     {
sl@0: 	   return 1;
sl@0: 	  }	    
sl@0: 
sl@0: 		c=(c%BN_BITS)-BN_BITS2;
sl@0: 		BN_rand(m,NUM_BITS+c,0,1);
sl@0: 		if(errno==ENOMEM)
sl@0:     {
sl@0: 	   return 1;
sl@0: 	  }	    
sl@0: 
sl@0: 		BN_mod(a,a,m,ctx);
sl@0: 		if(errno==ENOMEM)
sl@0:     {
sl@0: 	   return 1;
sl@0: 	  }	    
sl@0: 	
sl@0: 		BN_mod(b,b,m,ctx);
sl@0: 		if(errno==ENOMEM)
sl@0:       {
sl@0: 	   return 1;
sl@0: 	  }	    
sl@0: 
sl@0: 		ret=BN_mod_exp_mont(r_mont,a,b,m,ctx,NULL);
sl@0: 		if (ret <= 0)
sl@0: 			{
sl@0: 			if(errno==ENOMEM)
sl@0:       {
sl@0: 	     return 1;
sl@0: 	    }	    
sl@0: 			fprintf(stdout,"BN_mod_exp_mont() problems\n");
sl@0: 			ERR_print_errors(out);
sl@0:   		if(errno==ENOMEM)
sl@0:       {
sl@0: 	     return 1;
sl@0: 	    }	    
sl@0: 			return 1;
sl@0: 			}
sl@0: 
sl@0: 		ret=BN_mod_exp_recp(r_recp,a,b,m,ctx);
sl@0: 		if (ret <= 0)
sl@0: 			{
sl@0:   		if(errno==ENOMEM)
sl@0:        {
sl@0: 	       return 1;
sl@0: 	     }	    
sl@0: 			fprintf(stdout,"BN_mod_exp_recp() problems\n");
sl@0: 			ERR_print_errors(out);
sl@0: 			if(errno==ENOMEM)
sl@0:       {
sl@0: 	    return 1;
sl@0: 	    }	    
sl@0: 			return 1;
sl@0: 			}
sl@0: 
sl@0: 		ret=BN_mod_exp_simple(r_simple,a,b,m,ctx);
sl@0: 		if (ret <= 0)
sl@0: 			{
sl@0:   		if(errno==ENOMEM)
sl@0:        {
sl@0: 	       return 1;
sl@0: 	     }	    
sl@0: 			fprintf(stdout,"BN_mod_exp_simple() problems\n");
sl@0: 			ERR_print_errors(out);
sl@0:   		if(errno==ENOMEM)
sl@0:        {
sl@0: 	       return 1;
sl@0: 	     }	    
sl@0: 			return 1;
sl@0: 			}
sl@0: 
sl@0: 		ret=BN_mod_exp_mont_consttime(r_mont_const,a,b,m,ctx,NULL);
sl@0: 		if (ret <= 0)
sl@0: 			{
sl@0:   		if(errno==ENOMEM)
sl@0:        {
sl@0: 	       return 1;
sl@0: 	     }	    
sl@0: 			fprintf(stdout,"BN_mod_exp_mont_consttime() problems\n");
sl@0: 			ERR_print_errors(out);
sl@0:   		if(errno==ENOMEM)
sl@0:        {
sl@0: 	       return 1;
sl@0: 	     }	    
sl@0: 			return 1;
sl@0: 			}
sl@0: 
sl@0: 		if (BN_cmp(r_simple, r_mont) == 0
sl@0: 		    && BN_cmp(r_simple,r_recp) == 0
sl@0: 			&& BN_cmp(r_simple,r_mont_const) == 0)
sl@0: 			{
sl@0:   		if(errno==ENOMEM)
sl@0:        {
sl@0: 	       return 1;
sl@0: 	     }	    
sl@0:       fprintf(stdout,".");
sl@0: 			fflush(stdout);
sl@0: 			}
sl@0: 		else
sl@0: 		  	{
sl@0: 			if (BN_cmp(r_simple,r_mont) != 0)
sl@0:        {
sl@0:  	  		if(errno==ENOMEM)
sl@0:         {
sl@0: 	        return 1;
sl@0: 	      }	    
sl@0: 				fprintf(stdout,"\nsimple and mont results differ\n");
sl@0:        }				
sl@0: 			if (BN_cmp(r_simple,r_mont) != 0)
sl@0: 			{
sl@0:  	  		if(errno==ENOMEM)
sl@0:         {
sl@0: 	        return 1;
sl@0: 	      }	    
sl@0: 				fprintf(stdout,"\nsimple and mont const time results differ\n");
sl@0: 			}	
sl@0: 			if (BN_cmp(r_simple,r_recp) != 0)
sl@0: 			{
sl@0:  	  		if(errno==ENOMEM)
sl@0:         {
sl@0: 	        return 1;
sl@0: 	      }	    
sl@0: 				fprintf(stdout,"\nsimple and recp results differ\n");
sl@0:       }
sl@0: 			fprintf(stdout,"a (%3d) = ",BN_num_bits(a));   BN_print(out,a);
sl@0:   		if(errno==ENOMEM)
sl@0:       {
sl@0: 	       return 1;
sl@0:       }	    
sl@0: 			fprintf(stdout,"\nb (%3d) = ",BN_num_bits(b)); BN_print(out,b);
sl@0:  	  	if(errno==ENOMEM)
sl@0:       {
sl@0: 	       return 1;
sl@0:       }	    
sl@0: 			fprintf(stdout,"\nm (%3d) = ",BN_num_bits(m)); BN_print(out,m);
sl@0:  	  	if(errno==ENOMEM)
sl@0:       {
sl@0: 	       return 1;
sl@0:       }	    
sl@0: 			fprintf(stdout,"\nsimple   =");	BN_print(out,r_simple);
sl@0:  	  	if(errno==ENOMEM)
sl@0:       {
sl@0: 	       return 1;
sl@0:       }	    
sl@0: 			fprintf(stdout,"\nrecp     =");	BN_print(out,r_recp);
sl@0:  	  	if(errno==ENOMEM)
sl@0:       {
sl@0: 	       return 1;
sl@0:       }	    
sl@0: 			fprintf(stdout,"\nmont     ="); BN_print(out,r_mont);
sl@0:  	  	if(errno==ENOMEM)
sl@0:       {
sl@0: 	       return 1;
sl@0:       }	    
sl@0: 			fprintf(stdout,"\nmont_ct  ="); BN_print(out,r_mont_const);
sl@0:  	  	if(errno==ENOMEM)
sl@0:       {
sl@0: 	       return 1;
sl@0:       }	    
sl@0: 			fprintf(stdout,"\n");
sl@0: 			return 1;
sl@0: 			}
sl@0: 		}
sl@0: 	BN_free(r_mont);
sl@0: 	BN_free(r_mont_const);
sl@0: 	BN_free(r_recp);
sl@0: 	BN_free(r_simple);
sl@0: 	BN_free(a);
sl@0: 	BN_free(b);
sl@0: 	BN_free(m);
sl@0: 	BN_CTX_free(ctx);
sl@0: 	ERR_remove_state(0);
sl@0: 	if(errno==ENOMEM)
sl@0:   {
sl@0:     return 1;
sl@0:   }	    
sl@0: 	CRYPTO_mem_leaks(out);
sl@0: 	if(errno==ENOMEM)
sl@0:   {
sl@0:     return 1;
sl@0:   }	    
sl@0: 	BIO_free(out);
sl@0: 	if(errno==ENOMEM)
sl@0:    {
sl@0: 	  return 1;
sl@0: 	 }    
sl@0:  
sl@0:     CRYPTO_cleanup_all_ex_data();
sl@0:    if(errno==ENOMEM)
sl@0:    {
sl@0: 	  return 1;
sl@0: 	 }    
sl@0:  
sl@0: 	fprintf(stdout," done\n");
sl@0: 	fprintf(stdout," Test case passed\n");
sl@0: 	return 0;
sl@0: err:
sl@0: 	ERR_load_crypto_strings();
sl@0: 	if(errno==ENOMEM)
sl@0:   {
sl@0:     return 1;
sl@0:   }	    
sl@0: 	
sl@0: 	ERR_print_errors(out);
sl@0: 	if(errno==ENOMEM)
sl@0:   {
sl@0:     return 1;
sl@0:   }	    
sl@0: 	
sl@0: 	
sl@0: #ifdef OPENSSL_SYS_NETWARE
sl@0:     fprintf(stdout,"ERROR\n");
sl@0: #endif
sl@0: 	return(1);
sl@0: 	}
sl@0: