1 #!/usr/local/bin/perl 2 # bn_prime.pl 3 4 $num=2048; 5 $num=$ARGV[0] if ($#ARGV >= 0); 6 7 push(@primes,2); 8 $p=1; 9 loop: while ($#primes < $num-1) 10 { 11 $p+=2; 12 $s=int(sqrt($p)); 13 14 for ($i=0; defined($primes[$i]) && $primes[$i]<=$s; $i++) 15 { 16 next loop if (($p%$primes[$i]) == 0); 17 } 18 push(@primes,$p); 19 } 20 21 # print <<"EOF"; 22 # /* Auto generated by bn_prime.pl */ 23 # /* Copyright (C) 1995-1997 Eric Young (eay\@mincom.oz.au). 24 # * All rights reserved. 25 # * Copyright remains Eric Young's, and as such any Copyright notices in 26 # * the code are not to be removed. 27 # * See the COPYRIGHT file in the SSLeay distribution for more details. 28 # */ 29 # 30 # EOF 31 32 print <<\EOF; 33 /* Auto generated by bn_prime.pl */ 34 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) 35 * All rights reserved. 36 * 37 * This package is an SSL implementation written 38 * by Eric Young (eay@cryptsoft.com). 39 * The implementation was written so as to conform with Netscapes SSL. 40 * 41 * This library is free for commercial and non-commercial use as long as 42 * the following conditions are aheared to. The following conditions 43 * apply to all code found in this distribution, be it the RC4, RSA, 44 * lhash, DES, etc., code; not just the SSL code. The SSL documentation 45 * included with this distribution is covered by the same copyright terms 46 * except that the holder is Tim Hudson (tjh@cryptsoft.com). 47 * 48 * Copyright remains Eric Young's, and as such any Copyright notices in 49 * the code are not to be removed. 50 * If this package is used in a product, Eric Young should be given attribution 51 * as the author of the parts of the library used. 52 * This can be in the form of a textual message at program startup or 53 * in documentation (online or textual) provided with the package. 54 * 55 * Redistribution and use in source and binary forms, with or without 56 * modification, are permitted provided that the following conditions 57 * are met: 58 * 1. Redistributions of source code must retain the copyright 59 * notice, this list of conditions and the following disclaimer. 60 * 2. Redistributions in binary form must reproduce the above copyright 61 * notice, this list of conditions and the following disclaimer in the 62 * documentation and/or other materials provided with the distribution. 63 * 3. All advertising materials mentioning features or use of this software 64 * must display the following acknowledgement: 65 * "This product includes cryptographic software written by 66 * Eric Young (eay (at] cryptsoft.com)" 67 * The word 'cryptographic' can be left out if the rouines from the library 68 * being used are not cryptographic related :-). 69 * 4. If you include any Windows specific code (or a derivative thereof) from 70 * the apps directory (application code) you must include an acknowledgement: 71 * "This product includes software written by Tim Hudson (tjh (at] cryptsoft.com)" 72 * 73 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND 74 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 75 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 76 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 77 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 78 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 79 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 80 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 81 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 82 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 83 * SUCH DAMAGE. 84 * 85 * The licence and distribution terms for any publically available version or 86 * derivative of this code cannot be changed. i.e. this code cannot simply be 87 * copied and put under another distribution licence 88 * [including the GNU Public Licence.] 89 */ 90 91 EOF 92 93 for ($i=0; $i <= $#primes; $i++) 94 { 95 if ($primes[$i] > 256) 96 { 97 $eight=$i; 98 last; 99 } 100 } 101 102 printf "#ifndef EIGHT_BIT\n"; 103 printf "#define NUMPRIMES %d\n",$num; 104 printf "typedef unsigned short prime_t;\n"; 105 printf "#else\n"; 106 printf "#define NUMPRIMES %d\n",$eight; 107 printf "typedef unsigned char prime_t;\n"; 108 printf "#endif\n"; 109 print "static const prime_t primes[NUMPRIMES]=\n\t{\n\t"; 110 $init=0; 111 for ($i=0; $i <= $#primes; $i++) 112 { 113 printf "\n#ifndef EIGHT_BIT\n\t" if ($primes[$i] > 256) && !($init++); 114 printf("\n\t") if (($i%8) == 0) && ($i != 0); 115 printf("%4d,",$primes[$i]); 116 } 117 print "\n#endif\n\t};\n"; 118 119 120
