From caf9e032e6b4ccb114a74a3936c916bcfaba262d Mon Sep 17 00:00:00 2001
From: weidai <weidai@57ff6487-cd31-0410-9ec3-f628ee90f5f0>
Date: Mon, 2 Mar 2009 02:39:17 +0000
Subject: changes for 5.6:     - added AuthenticatedSymmetricCipher interface
 class and Filter wrappers     - added CCM, GCM (with SSE2 assembly), CMAC,
 and SEED     - improved AES speed on x86 and x64     - removed
 WORD64_AVAILABLE; compiler 64-bit int support is now required

git-svn-id: svn://svn.code.sf.net/p/cryptopp/code/trunk/c5@433 57ff6487-cd31-0410-9ec3-f628ee90f5f0
---
 xtr.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

(limited to 'xtr.cpp')

diff --git a/xtr.cpp b/xtr.cpp
index cdb3fc8..6739070 100644
--- a/xtr.cpp
+++ b/xtr.cpp
@@ -30,7 +30,7 @@ void XTR_FindPrimesAndGenerator(RandomNumberGenerator &rng, Integer &p, Integer
 		assert(qFound);
 		bool solutionsExist = SolveModularQuadraticEquation(r1, r2, 1, -1, 1, q);
 		assert(solutionsExist);
-	} while (!p.Randomize(rng, minP, maxP, Integer::PRIME, CRT(rng.GenerateBit()?r1:r2, q, 2, 3), 3*q));
+	} while (!p.Randomize(rng, minP, maxP, Integer::PRIME, CRT(rng.GenerateBit()?r1:r2, q, 2, 3, EuclideanMultiplicativeInverse(p, 3)), 3*q));
 	assert(((p.Squared() - p + 1) % q).IsZero());
 
 	GFP2_ONB<ModularArithmetic> gfp2(p);
-- 
cgit v1.2.1