1*f9fbec18Smcpowers /*
2*f9fbec18Smcpowers * mpprime.c
3*f9fbec18Smcpowers *
4*f9fbec18Smcpowers * Utilities for finding and working with prime and pseudo-prime
5*f9fbec18Smcpowers * integers
6*f9fbec18Smcpowers *
7*f9fbec18Smcpowers * ***** BEGIN LICENSE BLOCK *****
8*f9fbec18Smcpowers * Version: MPL 1.1/GPL 2.0/LGPL 2.1
9*f9fbec18Smcpowers *
10*f9fbec18Smcpowers * The contents of this file are subject to the Mozilla Public License Version
11*f9fbec18Smcpowers * 1.1 (the "License"); you may not use this file except in compliance with
12*f9fbec18Smcpowers * the License. You may obtain a copy of the License at
13*f9fbec18Smcpowers * http://www.mozilla.org/MPL/
14*f9fbec18Smcpowers *
15*f9fbec18Smcpowers * Software distributed under the License is distributed on an "AS IS" basis,
16*f9fbec18Smcpowers * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
17*f9fbec18Smcpowers * for the specific language governing rights and limitations under the
18*f9fbec18Smcpowers * License.
19*f9fbec18Smcpowers *
20*f9fbec18Smcpowers * The Original Code is the MPI Arbitrary Precision Integer Arithmetic library.
21*f9fbec18Smcpowers *
22*f9fbec18Smcpowers * The Initial Developer of the Original Code is
23*f9fbec18Smcpowers * Michael J. Fromberger.
24*f9fbec18Smcpowers * Portions created by the Initial Developer are Copyright (C) 1997
25*f9fbec18Smcpowers * the Initial Developer. All Rights Reserved.
26*f9fbec18Smcpowers *
27*f9fbec18Smcpowers * Contributor(s):
28*f9fbec18Smcpowers * Netscape Communications Corporation
29*f9fbec18Smcpowers *
30*f9fbec18Smcpowers * Alternatively, the contents of this file may be used under the terms of
31*f9fbec18Smcpowers * either the GNU General Public License Version 2 or later (the "GPL"), or
32*f9fbec18Smcpowers * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
33*f9fbec18Smcpowers * in which case the provisions of the GPL or the LGPL are applicable instead
34*f9fbec18Smcpowers * of those above. If you wish to allow use of your version of this file only
35*f9fbec18Smcpowers * under the terms of either the GPL or the LGPL, and not to allow others to
36*f9fbec18Smcpowers * use your version of this file under the terms of the MPL, indicate your
37*f9fbec18Smcpowers * decision by deleting the provisions above and replace them with the notice
38*f9fbec18Smcpowers * and other provisions required by the GPL or the LGPL. If you do not delete
39*f9fbec18Smcpowers * the provisions above, a recipient may use your version of this file under
40*f9fbec18Smcpowers * the terms of any one of the MPL, the GPL or the LGPL.
41*f9fbec18Smcpowers *
42*f9fbec18Smcpowers * ***** END LICENSE BLOCK ***** */
43*f9fbec18Smcpowers /*
44*f9fbec18Smcpowers * Copyright 2007 Sun Microsystems, Inc. All rights reserved.
45*f9fbec18Smcpowers * Use is subject to license terms.
46*f9fbec18Smcpowers *
47*f9fbec18Smcpowers * Sun elects to use this software under the MPL license.
48*f9fbec18Smcpowers */
49*f9fbec18Smcpowers
50*f9fbec18Smcpowers #include "mpi-priv.h"
51*f9fbec18Smcpowers #include "mpprime.h"
52*f9fbec18Smcpowers #include "mplogic.h"
53*f9fbec18Smcpowers #ifndef _KERNEL
54*f9fbec18Smcpowers #include <stdlib.h>
55*f9fbec18Smcpowers #include <string.h>
56*f9fbec18Smcpowers #else
57*f9fbec18Smcpowers #include <sys/random.h>
58*f9fbec18Smcpowers #endif
59*f9fbec18Smcpowers
60*f9fbec18Smcpowers #define SMALL_TABLE 0 /* determines size of hard-wired prime table */
61*f9fbec18Smcpowers
62*f9fbec18Smcpowers #ifndef _KERNEL
63*f9fbec18Smcpowers #define RANDOM() rand()
64*f9fbec18Smcpowers #else
65*f9fbec18Smcpowers #define RANDOM() foo_rand()
66*f9fbec18Smcpowers
67*f9fbec18Smcpowers static int
foo_rand()68*f9fbec18Smcpowers foo_rand()
69*f9fbec18Smcpowers {
70*f9fbec18Smcpowers int r;
71*f9fbec18Smcpowers random_get_pseudo_bytes((uchar_t *)&r, sizeof (r));
72*f9fbec18Smcpowers return (r);
73*f9fbec18Smcpowers }
74*f9fbec18Smcpowers #endif
75*f9fbec18Smcpowers
76*f9fbec18Smcpowers /*
77*f9fbec18Smcpowers mpp_random(a)
78*f9fbec18Smcpowers
79*f9fbec18Smcpowers Assigns a random value to a. This value is generated using the
80*f9fbec18Smcpowers standard C library's rand() function, so it should not be used for
81*f9fbec18Smcpowers cryptographic purposes, but it should be fine for primality testing,
82*f9fbec18Smcpowers since all we really care about there is good statistical properties.
83*f9fbec18Smcpowers
84*f9fbec18Smcpowers As many digits as a currently has are filled with random digits.
85*f9fbec18Smcpowers */
86*f9fbec18Smcpowers
mpp_random(mp_int * a)87*f9fbec18Smcpowers mp_err mpp_random(mp_int *a)
88*f9fbec18Smcpowers
89*f9fbec18Smcpowers {
90*f9fbec18Smcpowers mp_digit next = 0;
91*f9fbec18Smcpowers unsigned int ix, jx;
92*f9fbec18Smcpowers
93*f9fbec18Smcpowers ARGCHK(a != NULL, MP_BADARG);
94*f9fbec18Smcpowers
95*f9fbec18Smcpowers for(ix = 0; ix < USED(a); ix++) {
96*f9fbec18Smcpowers for(jx = 0; jx < sizeof(mp_digit); jx++) {
97*f9fbec18Smcpowers next = (next << CHAR_BIT) | (RANDOM() & UCHAR_MAX);
98*f9fbec18Smcpowers }
99*f9fbec18Smcpowers DIGIT(a, ix) = next;
100*f9fbec18Smcpowers }
101*f9fbec18Smcpowers
102*f9fbec18Smcpowers return MP_OKAY;
103*f9fbec18Smcpowers
104*f9fbec18Smcpowers } /* end mpp_random() */
105*f9fbec18Smcpowers
106*f9fbec18Smcpowers /* }}} */
107*f9fbec18Smcpowers
108*f9fbec18Smcpowers /* {{{ mpp_random_size(a, prec) */
109*f9fbec18Smcpowers
mpp_random_size(mp_int * a,mp_size prec)110*f9fbec18Smcpowers mp_err mpp_random_size(mp_int *a, mp_size prec)
111*f9fbec18Smcpowers {
112*f9fbec18Smcpowers mp_err res;
113*f9fbec18Smcpowers
114*f9fbec18Smcpowers ARGCHK(a != NULL && prec > 0, MP_BADARG);
115*f9fbec18Smcpowers
116*f9fbec18Smcpowers if((res = s_mp_pad(a, prec)) != MP_OKAY)
117*f9fbec18Smcpowers return res;
118*f9fbec18Smcpowers
119*f9fbec18Smcpowers return mpp_random(a);
120*f9fbec18Smcpowers
121*f9fbec18Smcpowers } /* end mpp_random_size() */
122