tommath/bn_mp_prime_frobenius_underwood.c

200 lines
5.2 KiB
C
Raw Normal View History

2018-05-03 18:01:45 -04:00
#include "tommath_private.h"
#ifdef BN_MP_PRIME_FROBENIUS_UNDERWOOD_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.
*/
/*
* See file bn_mp_prime_is_prime.c or the documentation in doc/bn.tex for the details
*/
#ifndef LTM_USE_FIPS_ONLY
2018-05-03 18:01:45 -04:00
#ifdef MP_8BIT
/*
* floor of positive solution of
* (2^16)-1 = (a+4)*(2*a+5)
* TODO: Both values are smaller than N^(1/4), would have to use a bigint
* for a instead but any a biger than about 120 are already so rare that
* it is possible to ignore them and still get enough pseudoprimes.
* But it is still a restriction of the set of available pseudoprimes
* which makes this implementation less secure if used stand-alone.
*/
2018-05-04 09:15:13 -04:00
#define LTM_FROBENIUS_UNDERWOOD_A 177
#else
2018-05-03 18:01:45 -04:00
#define LTM_FROBENIUS_UNDERWOOD_A 32764
2018-05-04 09:15:13 -04:00
#endif
2018-05-03 18:01:45 -04:00
int mp_prime_frobenius_underwood(const mp_int *N, int *result)
{
2018-12-26 02:47:47 -05:00
mp_int T1z, T2z, Np1z, sz, tz;
2018-05-03 18:01:45 -04:00
int a, ap2, length, i, j, isset;
2018-12-26 02:06:23 -05:00
int e;
2018-05-03 18:01:45 -04:00
*result = MP_NO;
2018-12-26 02:47:47 -05:00
if ((e = mp_init_multi(&T1z, &T2z, &Np1z, &sz, &tz, NULL)) != MP_OKAY) {
2018-12-25 10:38:51 -05:00
return e;
2018-05-03 18:01:45 -04:00
}
for (a = 0; a < LTM_FROBENIUS_UNDERWOOD_A; a++) {
/* TODO: That's ugly! No, really, it is! */
2018-12-26 02:33:43 -05:00
if ((a==2) || (a==4) || (a==7) || (a==8) || (a==10) ||
(a==14) || (a==18) || (a==23) || (a==26) || (a==28)) {
2018-05-03 18:01:45 -04:00
continue;
}
/* (32764^2 - 4) < 2^31, no bigint for >MP_8BIT needed) */
2018-12-26 02:47:47 -05:00
if ((e = mp_set_long(&T1z, (unsigned long)a)) != MP_OKAY) {
2018-05-03 18:01:45 -04:00
goto LBL_FU_ERR;
}
2018-12-26 02:47:47 -05:00
if ((e = mp_sqr(&T1z, &T1z)) != MP_OKAY) {
2018-05-03 18:01:45 -04:00
goto LBL_FU_ERR;
}
2018-12-26 02:21:51 -05:00
if ((e = mp_sub_d(&T1z, 4uL, &T1z)) != MP_OKAY) {
2018-05-03 18:01:45 -04:00
goto LBL_FU_ERR;
}
if ((e = mp_kronecker(&T1z, N, &j)) != MP_OKAY) {
goto LBL_FU_ERR;
}
if (j == -1) {
break;
}
if (j == 0) {
/* composite */
2018-05-03 18:01:45 -04:00
goto LBL_FU_ERR;
}
}
/* Tell it a composite and set return value accordingly */
2018-05-03 18:01:45 -04:00
if (a >= LTM_FROBENIUS_UNDERWOOD_A) {
e = MP_ITER;
2018-05-03 18:01:45 -04:00
goto LBL_FU_ERR;
}
/* Composite if N and (a+4)*(2*a+5) are not coprime */
2018-12-26 02:33:43 -05:00
if ((e = mp_set_long(&T1z, (unsigned long)((a+4)*((2*a)+5)))) != MP_OKAY) {
2018-05-03 18:01:45 -04:00
goto LBL_FU_ERR;
}
2018-12-26 02:47:47 -05:00
if ((e = mp_gcd(N, &T1z, &T1z)) != MP_OKAY) {
2018-05-03 18:01:45 -04:00
goto LBL_FU_ERR;
}
2018-12-26 02:33:43 -05:00
if (!((T1z.used == 1) && (T1z.dp[0] == 1u))) {
2018-05-03 18:01:45 -04:00
goto LBL_FU_ERR;
}
ap2 = a + 2;
2018-12-26 02:21:51 -05:00
if ((e = mp_add_d(N, 1uL, &Np1z)) != MP_OKAY) {
2018-05-03 18:01:45 -04:00
goto LBL_FU_ERR;
}
2018-12-26 02:21:51 -05:00
mp_set(&sz, 1uL);
mp_set(&tz, 2uL);
2018-05-03 18:01:45 -04:00
length = mp_count_bits(&Np1z);
for (i = length - 2; i >= 0; i--) {
/*
* temp = (sz*(a*sz+2*tz))%N;
* tz = ((tz-sz)*(tz+sz))%N;
* sz = temp;
2018-05-03 18:01:45 -04:00
*/
2018-12-26 02:47:47 -05:00
if ((e = mp_mul_2(&tz, &T2z)) != MP_OKAY) {
2018-05-03 18:01:45 -04:00
goto LBL_FU_ERR;
}
/* a = 0 at about 50% of the cases (non-square and odd input) */
2018-05-03 18:01:45 -04:00
if (a != 0) {
2018-12-26 02:47:47 -05:00
if ((e = mp_mul_d(&sz, (mp_digit)a, &T1z)) != MP_OKAY) {
2018-05-03 18:01:45 -04:00
goto LBL_FU_ERR;
}
2018-12-26 02:47:47 -05:00
if ((e = mp_add(&T1z, &T2z, &T2z)) != MP_OKAY) {
2018-05-03 18:01:45 -04:00
goto LBL_FU_ERR;
}
}
2018-05-03 18:01:45 -04:00
if ((e = mp_mul(&T2z, &sz, &T1z)) != MP_OKAY) {
goto LBL_FU_ERR;
}
if ((e = mp_sub(&tz, &sz, &T2z)) != MP_OKAY) {
goto LBL_FU_ERR;
}
if ((e = mp_add(&sz, &tz, &sz)) != MP_OKAY) {
goto LBL_FU_ERR;
}
if ((e = mp_mul(&sz, &T2z, &tz)) != MP_OKAY) {
goto LBL_FU_ERR;
}
if ((e = mp_mod(&tz, N, &tz)) != MP_OKAY) {
goto LBL_FU_ERR;
}
if ((e = mp_mod(&T1z, N, &sz)) != MP_OKAY) {
goto LBL_FU_ERR;
}
2018-12-26 02:47:47 -05:00
if ((isset = mp_get_bit(&Np1z, i)) == MP_VAL) {
2018-05-03 18:01:45 -04:00
e = isset;
goto LBL_FU_ERR;
}
if (isset == MP_YES) {
/*
* temp = (a+2) * sz + tz
* tz = 2 * tz - sz
* sz = temp
2018-05-03 18:01:45 -04:00
*/
if (a == 0) {
2018-12-26 02:47:47 -05:00
if ((e = mp_mul_2(&sz, &T1z)) != MP_OKAY) {
goto LBL_FU_ERR;
}
2018-05-03 18:01:45 -04:00
} else {
2018-12-26 02:47:47 -05:00
if ((e = mp_mul_d(&sz, (mp_digit)ap2, &T1z)) != MP_OKAY) {
2018-05-03 18:01:45 -04:00
goto LBL_FU_ERR;
}
}
if ((e = mp_add(&T1z, &tz, &T1z)) != MP_OKAY) {
goto LBL_FU_ERR;
}
if ((e = mp_mul_2(&tz, &T2z)) != MP_OKAY) {
goto LBL_FU_ERR;
}
if ((e = mp_sub(&T2z, &sz, &tz)) != MP_OKAY) {
goto LBL_FU_ERR;
}
2018-12-26 02:47:47 -05:00
mp_exch(&sz, &T1z);
2018-05-03 18:01:45 -04:00
}
}
2018-12-26 02:33:43 -05:00
if ((e = mp_set_long(&T1z, (unsigned long)((2 * a) + 5))) != MP_OKAY) {
2018-05-03 18:01:45 -04:00
goto LBL_FU_ERR;
}
2018-12-26 02:47:47 -05:00
if ((e = mp_mod(&T1z, N, &T1z)) != MP_OKAY) {
2018-05-03 18:01:45 -04:00
goto LBL_FU_ERR;
}
2018-12-26 02:24:49 -05:00
if ((mp_iszero(&sz) != MP_NO) && (mp_cmp(&tz, &T1z) == MP_EQ)) {
2018-05-03 18:01:45 -04:00
*result = MP_YES;
goto LBL_FU_ERR;
}
LBL_FU_ERR:
2018-12-26 02:47:47 -05:00
mp_clear_multi(&tz, &sz, &Np1z, &T2z, &T1z, NULL);
2018-05-03 18:01:45 -04:00
return e;
}
#endif
#endif
/* ref: $Format:%D$ */
/* git commit: $Format:%H$ */
/* commit time: $Format:%ai$ */