From cbeb0b26e4c7caa8d1b47de791a7418dc20a4567 Mon Sep 17 00:00:00 2001 From: rsc Date: Sat, 1 Apr 2006 19:24:03 +0000 Subject: Use gcc -ansi -pedantic in 9c. Fix many non-C89-isms. --- src/libsec/port/gensafeprime.c | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) (limited to 'src/libsec/port/gensafeprime.c') diff --git a/src/libsec/port/gensafeprime.c b/src/libsec/port/gensafeprime.c index e95c94c9..0a069b45 100644 --- a/src/libsec/port/gensafeprime.c +++ b/src/libsec/port/gensafeprime.c @@ -2,8 +2,8 @@ #include #include -// find a prime p of length n and a generator alpha of Z^*_p -// Alg 4.86 Menezes et al () Handbook, p.164 +/* find a prime p of length n and a generator alpha of Z^*_p */ +/* Alg 4.86 Menezes et al () Handbook, p.164 */ void gensafeprime(mpint *p, mpint *alpha, int n, int accuracy) { @@ -13,12 +13,12 @@ gensafeprime(mpint *p, mpint *alpha, int n, int accuracy) while(1){ genprime(q, n-1, accuracy); mpleft(q, 1, p); - mpadd(p, mpone, p); // p = 2*q+1 + mpadd(p, mpone, p); /* p = 2*q+1 */ if(probably_prime(p, accuracy)) break; } - // now find a generator alpha of the multiplicative - // group Z*_p of order p-1=2q + /* now find a generator alpha of the multiplicative */ + /* group Z*_p of order p-1=2q */ b = mpnew(0); while(1){ mprand(n, genrandom, alpha); -- cgit v1.2.3