num_primes/
lib.rs

1#![no_std]
2#![forbid(unsafe_code)]
3
4extern crate num;
5extern crate rand;
6extern crate num_bigint as bigint;
7
8
9
10use core::ops::Sub;
11use num::Integer;
12pub use bigint::{BigUint,RandBigInt};
13use num_traits::{Zero, One};
14use num_traits::*;
15
16use log::debug;
17use log::error;
18use log::info;
19
20// Settings
21// NIST recomends 5 rounds for miller rabin. This implementation does 8. Apple uses 16. Three iterations has a probability of 2^80 of failing
22const MILLER_RABIN_ROUNDS: usize = 8usize;
23
24
25/// # Generator
26/// This is the most commonly used struct. It is used to generate:
27/// - Large Unsigned Integers
28/// - Composite Numbers
29/// - Prime Numbers
30/// - Safe Primes
31/// 
32/// ```
33/// 
34/// use num_primes::{Generator,Verification};
35/// 
36/// fn main(){
37///     let prime = Generator::new_prime(512);
38///     let _uint = Generator::new_uint(1024);
39/// 
40///     // p = 2q + 1 || where p is safe prime
41///     let _safe_prime = Generator::safe_prime(64);
42/// 
43///     let _ver: bool = Verification::is_prime(&prime);
44/// }
45/// ```
46pub struct Generator;
47/// # Prime Verification
48/// This struct is used to verify whether integers are prime, safe prime, or composite.
49/// 
50/// ```
51/// use num_primes::{Generator,Verification};
52/// 
53/// fn main(){
54///     let prime = Generator::new_prime(1024);
55///     let safe = Generator::safe_prime(128);
56/// 
57///     let is_prime: bool = Verification::is_prime(&prime);
58///     let is_safe_prime: bool = Verification::is_safe_prime(&safe);
59/// 
60///     assert_eq!(is_prime, true);
61///     assert_eq!(is_safe_prime, true);
62/// }
63/// ```
64pub struct Verification;
65/// # Prime Factorization
66/// This struct is used to factor large numbers and return their largest prime factor
67/// ```
68/// use num_primes::{Generator,Factorization};
69/// 
70/// fn main() {
71///     // Generates New Unsighed Integer of 64 bits
72///     let uint = Generator::new_uint(64);
73///     // Prime Factorization    
74///     let prime_factor = Factorization::prime_factor(uint);
75/// 
76///     match prime_factor {
77///         Some(x) => println!("Largest Prime Factor: {}",x),
78///         None => println!("No Prime Factors Found"),
79///     }
80/// }
81/// ```
82pub struct Factorization;
83
84impl Generator {
85    /// # Generate Large Composite Numbers
86    /// This function guarantees the returned value is a composite number and is not prime.
87    /// ```
88    /// use num_primes::Generator;
89    /// 
90    /// fn main(){
91    ///     // Generate Composite Number of 1024 bits
92    ///     let composite = Generator::new_composite(1024);
93    /// 
94    ///     // Print Out Composite Number
95    ///     println!("Composite Number: {}",composite);
96    /// }
97    /// ```
98    pub fn new_composite(n: usize) -> BigUint {
99        let mut rng = rand::thread_rng();
100        loop {
101            // Make mutable and set LSB and MSB
102            let candidate: BigUint = rng.gen_biguint(n);
103            //candidate.set_bit(0, true);
104            //candidate.set_bit((n-1) as u32, true);
105            if is_prime(&candidate) == false { 
106                return candidate;
107            }
108        }
109    }
110    /// # Generate Large Unsigned Integer
111    /// This function takes an input (n) for the number of bits the unsigned    integer should be
112    /// 
113    /// ```
114    /// use num_primes::Generator;
115    ///
116    /// fn main() {
117    ///     // Generate Large Random Unsigned Integer of 1024 bits
118    ///     let x = Generator::new_uint(1024);
119    /// 
120    ///     // Print Integer
121    ///     println!("Large Unsigned Integer: {}",x);
122    /// }
123    /// ```
124    pub fn new_uint(n: usize) -> BigUint {
125        let mut rng = rand::thread_rng();
126        return rng.gen_biguint(n);
127    }
128
129    /// # Generate Prime Number
130    /// This function generates a prime number of n-bits using three primality  tests.
131    /// 
132    /// ```
133    /// use num_primes::Generator;
134    /// 
135    /// fn main(){
136    ///     // Generate Two Primes (p,q) of 512 bits
137    ///     let p = Generator::new_prime(512);
138    ///     let q = Generator::new_prime(512);
139    /// 
140    ///     // Multiply p and q and return n
141    ///     let n = p * q;
142    /// 
143    ///     // Print n
144    ///     println!("n: {}",n);
145    /// }
146    /// ```
147    pub fn new_prime(n: usize) -> BigUint {
148        let mut rng = rand::thread_rng();
149        
150        loop {
151            // Make mutable and set LSB and MSB
152            let candidate: BigUint = rng.gen_biguint(n);
153            
154            //candidate.set_bit(0, true);
155            //candidate.set_bit((n-1) as u32, true);
156            
157            if is_prime(&candidate) == true { 
158                return candidate;
159            }
160        }
161    }
162
163    /// # Generate Safe Primes
164    /// This function will generate safe prime numbers, or numbers of the form p = 2q + 1 where p is the safe prime.
165    /// ```
166    /// use num_primes::Generator;
167    /// 
168    /// fn main(){
169    ///     // p = 2q + 1 where p is the safe prime. This generates a number of 64 bits.
170    ///     let safe_prime = Generator::safe_prime(64);
171    /// }
172    /// ```
173    pub fn safe_prime(n: usize) -> BigUint {
174        let mut rng = rand::thread_rng();
175        loop {
176            // Make mutable and set LSB and MSB
177            let candidate: BigUint = rng.gen_biguint(n);
178            //candidate.set_bit(0, true);
179            //candidate.set_bit((n-1) as u32, true);
180            if is_prime(&candidate) == true {
181                if is_safe_prime(&candidate) == true {
182                    // checks with (p-1/n)
183                    return candidate
184                }
185            }
186        }
187    }
188}
189
190impl Verification {
191    pub fn is_prime(n: &BigUint) -> bool {
192        return is_prime(n);
193    }
194    pub fn is_composite(n: &BigUint) -> bool {
195        let x: bool = is_prime(n);
196        
197        if x == true {
198            return false
199        }
200        else if x == false {
201            return true
202        }
203        else {
204            panic!("An Error Has Occured On Checking Composite Number");
205        }
206    }
207    pub fn is_safe_prime(n: &BigUint) -> bool {
208        return is_safe_prime(n);
209    }
210    /// # Very Smooth Number
211    /// This Function Is Deprecated And Should Rarely Be Used
212    /// ```
213    /// use num_traits::FromPrimitive;
214    /// use num_bigint::BigUint;
215    /// use num_primes::Verification;
216    /// 
217    /// fn main(){
218    ///     // Set BigUint To 7
219    ///     let x: BigUint = BigUint::from_u64(7u64).unwrap();
220    /// 
221    ///     // Verify Its A Smooth Number
222    ///     let result: bool = Verification::is_smooth_number(&x,31.0,5);
223    /// 
224    ///     println!("Is A {} Smooth Number: {}",x,result);
225    /// }
226    /// ```
227    pub fn is_very_smooth_number(m: &BigUint, n: f64, c: u32) -> bool {
228        return vsn(m,n,c);
229    }
230}
231
232impl Factorization {
233    /// # Prime Factorization
234    /// This is a method of factoring the largest prime factors of large numbers. It is slow and should not be relied on. It can easily factor 32-bit numbers and sometimes 64-bit.
235    /// 
236    /// It returns as a `Option<BigUint>` type
237    /// 
238    /// ```
239    /// use num_primes::{Generator,Factorization};
240    /// 
241    /// fn main() {
242    ///     // Generates New Unsighed Integer of 32 bits
243    ///     let uint = Generator::new_uint(32);
244    ///     // Prime Factorization    
245    ///     let factor = Factorization::prime_factor(uint);
246    /// 
247    ///     match factor {
248    ///         Some(factor) => println!("Largest Prime Factor: {}",factor),
249    ///         None => println!("No Prime Factors Found"),
250    ///     }
251    /// }
252    /// ```
253    pub fn prime_factor(mut n: BigUint) -> Option<BigUint> {
254        // Check Primality and if prime, returns prime
255        if is_prime(&n) {
256            return Some(n)
257        }
258
259        let one = BigUint::one();
260        let two = &one + &one;
261        
262        // STEP 1 | n divided by 2
263        while n.is_even() {
264            n = n / &two;
265        }
266        
267        // STEP 2 | 3..sqrt(n) | Divide i by n. On failure, add 2 to i
268        let n_sqrt = n.sqrt().to_usize().unwrap();
269        
270        for mut i in 3..n_sqrt {
271            while n.divides(&BigUint::from(i)) {
272                n = n / BigUint::from(i);
273            }
274            i = i + 2usize;
275        }
276
277        // Step 3
278        if n > two {
279            return Some(n)
280        }
281        else {
282            return None
283        }
284
285
286    }
287}
288
289// if true, then is not prime
290// if false, then maybe prime
291fn div_small_primes(numb: &BigUint) -> bool {
292    let zero: BigUint = Zero::zero();
293    let one: BigUint = One::one();
294
295    
296    static SMALL_PRIMES: [u32; 2048] = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997,1009,1013,1019,1021,1031,1033,1039,1049,1051,1061,1063,1069,1087,1091,1093,1097,1103,1109,1117,1123,1129,1151,1153,1163,1171,1181,1187,1193,1201,1213,1217,1223,1229,1231,1237,1249,1259,1277,1279,1283,1289,1291,1297,1301,1303,1307,1319,1321,1327,1361,1367,1373,1381,1399,1409,1423,1427,1429,1433,1439,1447,1451,1453,1459,1471,1481,1483,1487,1489,1493,1499,1511,1523,1531,1543,1549,1553,1559,1567,1571,1579,1583,1597,1601,1607,1609,1613,1619,1621,1627,1637,1657,1663,1667,1669,1693,1697,1699,1709,1721,1723,1733,1741,1747,1753,1759,1777,1783,1787,1789,1801,1811,1823,1831,1847,1861,1867,1871,1873,1877,1879,1889,1901,1907,1913,1931,1933,1949,1951,1973,1979,1987,1993,1997,1999,2003,2011,2017,2027,2029,2039,2053,2063,2069,2081,2083,2087,2089,2099,2111,2113,2129,2131,2137,2141,2143,2153,2161,2179,2203,2207,2213,2221,2237,2239,2243,2251,2267,2269,2273,2281,2287,2293,2297,2309,2311,2333,2339,2341,2347,2351,2357,2371,2377,2381,2383,2389,2393,2399,2411,2417,2423,2437,2441,2447,2459,2467,2473,2477,2503,2521,2531,2539,2543,2549,2551,2557,2579,2591,2593,2609,2617,2621,2633,2647,2657,2659,2663,2671,2677,2683,2687,2689,2693,2699,2707,2711,2713,2719,2729,2731,2741,2749,2753,2767,2777,2789,2791,2797,2801,2803,2819,2833,2837,2843,2851,2857,2861,2879,2887,2897,2903,2909,2917,2927,2939,2953,2957,2963,2969,2971,2999,3001,3011,3019,3023,3037,3041,3049,3061,3067,3079,3083,3089,3109,3119,3121,3137,3163,3167,3169,3181,3187,3191,3203,3209,3217,3221,3229,3251,3253,3257,3259,3271,3299,3301,3307,3313,3319,3323,3329,3331,3343,3347,3359,3361,3371,3373,3389,3391,3407,3413,3433,3449,3457,3461,3463,3467,3469,3491,3499,3511,3517,3527,3529,3533,3539,3541,3547,3557,3559,3571,3581,3583,3593,3607,3613,3617,3623,3631,3637,3643,3659,3671,3673,3677,3691,3697,3701,3709,3719,3727,3733,3739,3761,3767,3769,3779,3793,3797,3803,3821,3823,3833,3847,3851,3853,3863,3877,3881,3889,3907,3911,3917,3919,3923,3929,3931,3943,3947,3967,3989,4001,4003,4007,4013,4019,4021,4027,4049,4051,4057,4073,4079,4091,4093,4099,4111,4127,4129,4133,4139,4153,4157,4159,4177,4201,4211,4217,4219,4229,4231,4241,4243,4253,4259,4261,4271,4273,4283,4289,4297,4327,4337,4339,4349,4357,4363,4373,4391,4397,4409,4421,4423,4441,4447,4451,4457,4463,4481,4483,4493,4507,4513,4517,4519,4523,4547,4549,4561,4567,4583,4591,4597,4603,4621,4637,4639,4643,4649,4651,4657,4663,4673,4679,4691,4703,4721,4723,4729,4733,4751,4759,4783,4787,4789,4793,4799,4801,4813,4817,4831,4861,4871,4877,4889,4903,4909,4919,4931,4933,4937,4943,4951,4957,4967,4969,4973,4987,4993,4999,5003,5009,5011,5021,5023,5039,5051,5059,5077,5081,5087,5099,5101,5107,5113,5119,5147,5153,5167,5171,5179,5189,5197,5209,5227,5231,5233,5237,5261,5273,5279,5281,5297,5303,5309,5323,5333,5347,5351,5381,5387,5393,5399,5407,5413,5417,5419,5431,5437,5441,5443,5449,5471,5477,5479,5483,5501,5503,5507,5519,5521,5527,5531,5557,5563,5569,5573,5581,5591,5623,5639,5641,5647,5651,5653,5657,5659,5669,5683,5689,5693,5701,5711,5717,5737,5741,5743,5749,5779,5783,5791,5801,5807,5813,5821,5827,5839,5843,5849,5851,5857,5861,5867,5869,5879,5881,5897,5903,5923,5927,5939,5953,5981,5987,6007,6011,6029,6037,6043,6047,6053,6067,6073,6079,6089,6091,6101,6113,6121,6131,6133,6143,6151,6163,6173,6197,6199,6203,6211,6217,6221,6229,6247,6257,6263,6269,6271,6277,6287,6299,6301,6311,6317,6323,6329,6337,6343,6353,6359,6361,6367,6373,6379,6389,6397,6421,6427,6449,6451,6469,6473,6481,6491,6521,6529,6547,6551,6553,6563,6569,6571,6577,6581,6599,6607,6619,6637,6653,6659,6661,6673,6679,6689,6691,6701,6703,6709,6719,6733,6737,6761,6763,6779,6781,6791,6793,6803,6823,6827,6829,6833,6841,6857,6863,6869,6871,6883,6899,6907,6911,6917,6947,6949,6959,6961,6967,6971,6977,6983,6991,6997,7001,7013,7019,7027,7039,7043,7057,7069,7079,7103,7109,7121,7127,7129,7151,7159,7177,7187,7193,7207,7211,7213,7219,7229,7237,7243,7247,7253,7283,7297,7307,7309,7321,7331,7333,7349,7351,7369,7393,7411,7417,7433,7451,7457,7459,7477,7481,7487,7489,7499,7507,7517,7523,7529,7537,7541,7547,7549,7559,7561,7573,7577,7583,7589,7591,7603,7607,7621,7639,7643,7649,7669,7673,7681,7687,7691,7699,7703,7717,7723,7727,7741,7753,7757,7759,7789,7793,7817,7823,7829,7841,7853,7867,7873,7877,7879,7883,7901,7907,7919,7927,7933,7937,7949,7951,7963,7993,8009,8011,8017,8039,8053,8059,8069,8081,8087,8089,8093,8101,8111,8117,8123,8147,8161,8167,8171,8179,8191,8209,8219,8221,8231,8233,8237,8243,8263,8269,8273,8287,8291,8293,8297,8311,8317,8329,8353,8363,8369,8377,8387,8389,8419,8423,8429,8431,8443,8447,8461,8467,8501,8513,8521,8527,8537,8539,8543,8563,8573,8581,8597,8599,8609,8623,8627,8629,8641,8647,8663,8669,8677,8681,8689,8693,8699,8707,8713,8719,8731,8737,8741,8747,8753,8761,8779,8783,8803,8807,8819,8821,8831,8837,8839,8849,8861,8863,8867,8887,8893,8923,8929,8933,8941,8951,8963,8969,8971,8999,9001,9007,9011,9013,9029,9041,9043,9049,9059,9067,9091,9103,9109,9127,9133,9137,9151,9157,9161,9173,9181,9187,9199,9203,9209,9221,9227,9239,9241,9257,9277,9281,9283,9293,9311,9319,9323,9337,9341,9343,9349,9371,9377,9391,9397,9403,9413,9419,9421,9431,9433,9437,9439,9461,9463,9467,9473,9479,9491,9497,9511,9521,9533,9539,9547,9551,9587,9601,9613,9619,9623,9629,9631,9643,9649,9661,9677,9679,9689,9697,9719,9721,9733,9739,9743,9749,9767,9769,9781,9787,9791,9803,9811,9817,9829,9833,9839,9851,9857,9859,9871,9883,9887,9901,9907,9923,9929,9931,9941,9949,9967,9973,10007,10009,10037,10039,10061,10067,10069,10079,10091,10093,10099,10103,10111,10133,10139,10141,10151,10159,10163,10169,10177,10181,10193,10211,10223,10243,10247,10253,10259,10267,10271,10273,10289,10301,10303,10313,10321,10331,10333,10337,10343,10357,10369,10391,10399,10427,10429,10433,10453,10457,10459,10463,10477,10487,10499,10501,10513,10529,10531,10559,10567,10589,10597,10601,10607,10613,10627,10631,10639,10651,10657,10663,10667,10687,10691,10709,10711,10723,10729,10733,10739,10753,10771,10781,10789,10799,10831,10837,10847,10853,10859,10861,10867,10883,10889,10891,10903,10909,10937,10939,10949,10957,10973,10979,10987,10993,11003,11027,11047,11057,11059,11069,11071,11083,11087,11093,11113,11117,11119,11131,11149,11159,11161,11171,11173,11177,11197,11213,11239,11243,11251,11257,11261,11273,11279,11287,11299,11311,11317,11321,11329,11351,11353,11369,11383,11393,11399,11411,11423,11437,11443,11447,11467,11471,11483,11489,11491,11497,11503,11519,11527,11549,11551,11579,11587,11593,11597,11617,11621,11633,11657,11677,11681,11689,11699,11701,11717,11719,11731,11743,11777,11779,11783,11789,11801,11807,11813,11821,11827,11831,11833,11839,11863,11867,11887,11897,11903,11909,11923,11927,11933,11939,11941,11953,11959,11969,11971,11981,11987,12007,12011,12037,12041,12043,12049,12071,12073,12097,12101,12107,12109,12113,12119,12143,12149,12157,12161,12163,12197,12203,12211,12227,12239,12241,12251,12253,12263,12269,12277,12281,12289,12301,12323,12329,12343,12347,12373,12377,12379,12391,12401,12409,12413,12421,12433,12437,12451,12457,12473,12479,12487,12491,12497,12503,12511,12517,12527,12539,12541,12547,12553,12569,12577,12583,12589,12601,12611,12613,12619,12637,12641,12647,12653,12659,12671,12689,12697,12703,12713,12721,12739,12743,12757,12763,12781,12791,12799,12809,12821,12823,12829,12841,12853,12889,12893,12899,12907,12911,12917,12919,12923,12941,12953,12959,12967,12973,12979,12983,13001,13003,13007,13009,13033,13037,13043,13049,13063,13093,13099,13103,13109,13121,13127,13147,13151,13159,13163,13171,13177,13183,13187,13217,13219,13229,13241,13249,13259,13267,13291,13297,13309,13313,13327,13331,13337,13339,13367,13381,13397,13399,13411,13417,13421,13441,13451,13457,13463,13469,13477,13487,13499,13513,13523,13537,13553,13567,13577,13591,13597,13613,13619,13627,13633,13649,13669,13679,13681,13687,13691,13693,13697,13709,13711,13721,13723,13729,13751,13757,13759,13763,13781,13789,13799,13807,13829,13831,13841,13859,13873,13877,13879,13883,13901,13903,13907,13913,13921,13931,13933,13963,13967,13997,13999,14009,14011,14029,14033,14051,14057,14071,14081,14083,14087,14107,14143,14149,14153,14159,14173,14177,14197,14207,14221,14243,14249,14251,14281,14293,14303,14321,14323,14327,14341,14347,14369,14387,14389,14401,14407,14411,14419,14423,14431,14437,14447,14449,14461,14479,14489,14503,14519,14533,14537,14543,14549,14551,14557,14561,14563,14591,14593,14621,14627,14629,14633,14639,14653,14657,14669,14683,14699,14713,14717,14723,14731,14737,14741,14747,14753,14759,14767,14771,14779,14783,14797,14813,14821,14827,14831,14843,14851,14867,14869,14879,14887,14891,14897,14923,14929,14939,14947,14951,14957,14969,14983,15013,15017,15031,15053,15061,15073,15077,15083,15091,15101,15107,15121,15131,15137,15139,15149,15161,15173,15187,15193,15199,15217,15227,15233,15241,15259,15263,15269,15271,15277,15287,15289,15299,15307,15313,15319,15329,15331,15349,15359,15361,15373,15377,15383,15391,15401,15413,15427,15439,15443,15451,15461,15467,15473,15493,15497,15511,15527,15541,15551,15559,15569,15581,15583,15601,15607,15619,15629,15641,15643,15647,15649,15661,15667,15671,15679,15683,15727,15731,15733,15737,15739,15749,15761,15767,15773,15787,15791,15797,15803,15809,15817,15823,15859,15877,15881,15887,15889,15901,15907,15913,15919,15923,15937,15959,15971,15973,15991,16001,16007,16033,16057,16061,16063,16067,16069,16073,16087,16091,16097,16103,16111,16127,16139,16141,16183,16187,16189,16193,16217,16223,16229,16231,16249,16253,16267,16273,16301,16319,16333,16339,16349,16361,16363,16369,16381,16411,16417,16421,16427,16433,16447,16451,16453,16477,16481,16487,16493,16519,16529,16547,16553,16561,16567,16573,16603,16607,16619,16631,16633,16649,16651,16657,16661,16673,16691,16693,16699,16703,16729,16741,16747,16759,16763,16787,16811,16823,16829,16831,16843,16871,16879,16883,16889,16901,16903,16921,16927,16931,16937,16943,16963,16979,16981,16987,16993,17011,17021,17027,17029,17033,17041,17047,17053,17077,17093,17099,17107,17117,17123,17137,17159,17167,17183,17189,17191,17203,17207,17209,17231,17239,17257,17291,17293,17299,17317,17321,17327,17333,17341,17351,17359,17377,17383,17387,17389,17393,17401,17417,17419,17431,17443,17449,17467,17471,17477,17483,17489,17491,17497,17509,17519,17539,17551,17569,17573,17579,17581,17597,17599,17609,17623,17627,17657,17659,17669,17681,17683,17707,17713,17729,17737,17747,17749,17761,17783,17789,17791,17807,17827,17837,17839,17851,17863];
297    
298    for p in SMALL_PRIMES.iter() {
299        if numb % &BigUint::from(*p) == zero {
300            return false
301        }
302        // Fixes part of Issue 1 but may slow down generation | https://github.com/AtropineTearz/num-primes/issues/1
303        if numb / &BigUint::from(*p) == one {
304            return true
305        }
306    }
307    return true
308}
309
310
311
312fn fermat(candidate: &BigUint) -> bool {
313    let mut rng = rand::thread_rng();
314    let random: BigUint = rng.gen_biguint_below(candidate);
315    
316    // p - 1
317    let exponent: BigUint = candidate.sub(BigUint::one());
318    
319    let result = random.modpow(&(exponent), candidate);
320
321    //let result = random.pow_mod(&(candidate - One::one()), candidate);
322    result == One::one()
323}
324
325fn miller_rabin(candidate: &BigUint, limit: usize) -> bool {    
326    // One and Two in ramp::Int form
327    let zero: BigUint = Zero::zero();
328    let one = BigUint::one();
329    let two: BigUint = &one + &one;
330    let two_2 = num_bigint::ToBigUint::to_biguint(&2).unwrap();
331
332    // Check Whether Candidate Is 2 (which is prime)
333    if candidate == &two_2 {
334        return true
335    }
336
337    // Check Whether Candidate Is Even
338    /*
339    if candidate.mod(two) {
340        return false
341    }
342    */
343    
344    let (d,s) = rewrite(&candidate);
345    let step = s.sub(&one).to_usize().unwrap();
346
347    let mut rng = rand::thread_rng();
348
349    for _i in 0..limit {
350        // Generate Random Number between [2,n-1) | Exclusive End Range; Uses (n-1), not (n-2)
351        let a = rng.gen_biguint_range(&two, &(candidate-&one));
352        
353        // Reference Implementation
354        // Pretty sure `sample_range()` has an inclusive end
355        //let basis = Int::sample_range(&two, &(candidate-&two));
356        
357        // (a^d mod n)
358        let mut x = a.modpow(&d, &candidate);
359
360        // Reference Implementation
361        //let mut y = Int::modpow(&basis, &d, candidate);
362
363        if x == one || x == (candidate - &one) {
364            continue
365            // return true
366        }
367        else {
368            // Convert To Usizes For Loop
369            // step = (s - 1)
370            let one_usize = one.to_usize().unwrap();
371            let zero_usize = zero.to_usize().unwrap();
372            
373            let mut break_early = false;
374            // Issue #1 | Changed one_usize to zero_usize; step (s-1) was equal to iterations-1 and therefore needed an extra iteration
375            for _ in zero_usize..step {
376                x = x.modpow(&two,candidate);
377
378                // Reference Implementation
379                //y = Int::modpow(&y, &two, candidate);
380                
381                if x == one {
382                    return false
383                } 
384                else if x == (candidate - BigUint::one()) {
385                    break_early = true;
386                    break;
387                }
388                
389            }
390
391            if !break_early {
392                return false
393            }
394        }
395    }
396    return true
397}
398
399// Rewrite for Miller-Rabin
400fn rewrite(n: &BigUint) -> (BigUint,BigUint) {
401    let one: BigUint = BigUint::one();
402    let two: BigUint = BigUint::one() + BigUint::one();
403    let mut s: BigUint = BigUint::zero();
404    
405    
406    
407
408    // (n-1) becomes even number
409    let mut d: BigUint = n - &one;
410
411    // The Main Loop That Checks Whether The Number is even and then divides by 2 and stores a counter 
412    
413    while d.is_even() == true {
414        d = d.div_floor(&two);
415        s += &one;
416    }
417
418    return (d.clone(),s)
419}
420
421// true = probably prime
422// false = not prime (composite)
423fn is_prime(candidate: &BigUint) -> bool {
424    let zero: BigUint = Zero::zero();
425    let one: BigUint = One::one();
426    let two: BigUint = &one + &one;
427
428    if candidate == &zero {
429        return false
430    }
431    
432    if candidate.is_even() && candidate != &two {
433        return false
434    }
435    
436    // First, simple trial divide
437    if div_small_primes(candidate) == false {
438        return false
439    }
440
441     // Second, Fermat's little theo test on the candidate
442    if fermat(candidate) == false {
443        return false;
444    }
445
446    // Finally, Miller-Rabin test
447    if miller_rabin(candidate, MILLER_RABIN_ROUNDS) == false {
448        return false
449    }
450    else {
451        return true
452    }
453    return true
454}
455
456// p = 2q + 1
457#[deprecated]
458fn is_safe_prime_add(number: &BigUint) -> bool {    
459    // number == q
460    
461    let one = BigUint::one();
462    let two = &one + &one;
463
464    let x = number * two;
465    
466    // p
467    let p = x + one;
468    
469    if is_prime(&p) {
470        return true;
471    }
472    else {
473        return false;
474    }
475}
476
477// (p - 1)/2
478fn is_safe_prime(number: &BigUint) -> bool {
479    let one = BigUint::one();
480    let two = &one + &one;
481
482    let result = (number - one) / two;
483
484    if is_prime(&result) {
485        return true
486    }
487    else {
488        return false
489    }
490}
491
492// TODO FIX ME
493fn vsn(m: &BigUint,n: f64, c: u32) -> bool {
494    // c: fixed constant
495
496    // if m's greatest prime factor < log(n)^c
497    let result = n.log10().powi(c as i32).ceil();
498
499    let factor = Factorization::prime_factor(m.clone()).unwrap();
500
501    if factor <= BigUint::from_f64(result).unwrap() {
502        return true
503    }
504    else if factor > BigUint::from_f64(result).unwrap() {
505        return false
506    }
507    else {
508        panic!("The Very Smooth Function Is Deprecated And Should Not Be Used")
509    }
510}
511
512fn pollard_rho(mut n: BigUint) {
513    // Initialize Random Number Generator
514    let mut rng = rand::thread_rng();
515    
516    // Set one and two
517    let zero: BigUint = Zero::zero();
518    let one: BigUint = One::one();
519    let two: BigUint = &one + &one;
520
521    // x
522    let x = &two;
523    let mut y = &zero;
524
525    let mut i: usize = 0usize;
526    let mut counter: usize = 10usize;
527    //let x = rng.gen_biguint_range(&zero,&(&two % (n - two));
528
529}
530
531
532#[cfg(test)]
533#[test]
534fn generate(){
535    let _x = Generator::new_prime(512);
536}
537
538#[cfg(test)]
539#[test]
540fn generate_safe_prime(){
541    // p = 2q + 1 where p is safe prime
542    let _p = Generator::safe_prime(64);
543}
544
545#[test]
546fn prime_factor(){
547    let x = Generator::new_uint(16);
548    let _prime_factor = Factorization::prime_factor(x);
549}
num_primes/lib.rs

num_primes/
lib.rs
