arne
/
cryptopp
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

OpenMP

pull/2/head
weidai 2007-04-16 00:13:05 +00:00
parent 33e9f55cdb
commit 3f68f7d55c
1 changed files with 30 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

35
nbtheory.cpp
View File

@ -11,6 +11,11 @@
#include <math.h> #include <math.h>
#include <vector> #include <vector>
#ifdef _OPENMP
// needed in MSVC 2005 to generate correct manifest
#include <omp.h>
#endif
NAMESPACE_BEGIN(CryptoPP) NAMESPACE_BEGIN(CryptoPP)
const word s_lastSmallPrime = 32719; const word s_lastSmallPrime = 32719;
@ -647,8 +652,15 @@ bool SolveModularQuadraticEquation(Integer &r1, Integer &r2, const Integer &a, c
Integer ModularRoot(const Integer &a, const Integer &dp, const Integer &dq, Integer ModularRoot(const Integer &a, const Integer &dp, const Integer &dq,
const Integer &p, const Integer &q, const Integer &u) const Integer &p, const Integer &q, const Integer &u)
{ {
Integer p2 = ModularExponentiation((a % p), dp, p); Integer p2, q2;
Integer q2 = ModularExponentiation((a % q), dq, q); #pragma omp parallel
#pragma omp sections
{
#pragma omp section
p2 = ModularExponentiation((a % p), dp, p);
#pragma omp section
q2 = ModularExponentiation((a % q), dq, q);
}
return CRT(p2, p, q2, q, u); return CRT(p2, p, q2, q, u);
} }
@ -992,9 +1004,22 @@ Integer Lucas(const Integer &n, const Integer &P, const Integer &modulus)
Integer InverseLucas(const Integer &e, const Integer &m, const Integer &p, const Integer &q, const Integer &u) Integer InverseLucas(const Integer &e, const Integer &m, const Integer &p, const Integer &q, const Integer &u)
{ {
Integer d = (m*m-4); Integer d = (m*m-4);
Integer p2 = p-Jacobi(d,p); Integer p2, q2;
Integer q2 = q-Jacobi(d,q); #pragma omp parallel
return CRT(Lucas(EuclideanMultiplicativeInverse(e,p2), m, p), p, Lucas(EuclideanMultiplicativeInverse(e,q2), m, q), q, u); #pragma omp sections
{
#pragma omp section
{
p2 = p-Jacobi(d,p);
p2 = Lucas(EuclideanMultiplicativeInverse(e,p2), m, p);
}
#pragma omp section
{
q2 = q-Jacobi(d,q);
q2 = Lucas(EuclideanMultiplicativeInverse(e,q2), m, q);
}
}
return CRT(p2, p, q2, q, u);
} }
Integer InverseLucas(const Integer &e, const Integer &m, const Integer &p, const Integer &q) Integer InverseLucas(const Integer &e, const Integer &m, const Integer &p, const Integer &q)