| 
									
										
										
										
											2015-11-12 01:49:07 +01:00
										 |  |  | #include <tommath_private.h>
 | 
					
						
							| 
									
										
										
										
											2005-02-12 08:40:15 +00:00
										 |  |  | #ifdef BN_MP_REDUCE_IS_2K_L_C
 | 
					
						
							|  |  |  | /* LibTomMath, multiple-precision integer library -- Tom St Denis
 | 
					
						
							|  |  |  |  * | 
					
						
							|  |  |  |  * LibTomMath is a library that provides multiple-precision | 
					
						
							|  |  |  |  * integer arithmetic as well as number theoretic functionality. | 
					
						
							|  |  |  |  * | 
					
						
							|  |  |  |  * The library was designed directly after the MPI library by | 
					
						
							|  |  |  |  * Michael Fromberger but has been written from scratch with | 
					
						
							|  |  |  |  * additional optimizations in place. | 
					
						
							|  |  |  |  * | 
					
						
							|  |  |  |  * The library is free for all purposes without any express | 
					
						
							|  |  |  |  * guarantee it works. | 
					
						
							|  |  |  |  * | 
					
						
							| 
									
										
										
										
											2015-10-30 17:55:29 -04:00
										 |  |  |  * Tom St Denis, tstdenis82@gmail.com, http://libtom.org
 | 
					
						
							| 
									
										
										
										
											2005-02-12 08:40:15 +00:00
										 |  |  |  */ | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | /* determines if reduce_2k_l can be used */ | 
					
						
							|  |  |  | int mp_reduce_is_2k_l(mp_int *a) | 
					
						
							|  |  |  | { | 
					
						
							|  |  |  |    int ix, iy; | 
					
						
							| 
									
										
										
										
											2017-08-30 05:51:11 +02:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2005-02-12 08:40:15 +00:00
										 |  |  |    if (a->used == 0) { | 
					
						
							|  |  |  |       return MP_NO; | 
					
						
							|  |  |  |    } else if (a->used == 1) { | 
					
						
							|  |  |  |       return MP_YES; | 
					
						
							|  |  |  |    } else if (a->used > 1) { | 
					
						
							|  |  |  |       /* if more than half of the digits are -1 we're sold */ | 
					
						
							|  |  |  |       for (iy = ix = 0; ix < a->used; ix++) { | 
					
						
							|  |  |  |           if (a->dp[ix] == MP_MASK) { | 
					
						
							|  |  |  |               ++iy; | 
					
						
							|  |  |  |           } | 
					
						
							|  |  |  |       } | 
					
						
							|  |  |  |       return (iy >= (a->used/2)) ? MP_YES : MP_NO; | 
					
						
							| 
									
										
										
										
											2017-08-30 05:51:11 +02:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2005-02-12 08:40:15 +00:00
										 |  |  |    } | 
					
						
							|  |  |  |    return MP_NO; | 
					
						
							|  |  |  | } | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | #endif
 | 
					
						
							| 
									
										
										
										
											2005-08-01 16:37:28 +00:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2017-08-28 16:27:26 +02:00
										 |  |  | /* ref:         $Format:%D$ */ | 
					
						
							|  |  |  | /* git commit:  $Format:%H$ */ | 
					
						
							|  |  |  | /* commit time: $Format:%ai$ */ |