def setparam(self, p, q):
if p == (2 * q) + 1 and isPrime(p) and isPrime(q):
self.p = integer(p)
self.q = integer(q)
return True
else:
print("p and q are not safe primes!")
return False
def setparam(self, p, q):
if p == (2 * q) + 1 and isPrime(p) and isPrime(q):
self.p = integer(p)
self.q = integer(q)
return True
else:
print("p and q are not safe primes!")
return False
def setparam(self, p, q):
if isPrime(p) and isPrime(q) and p != q:
self.p = integer(p)
self.q = integer(q)
self.n = self.p * self.q
return True
else:
print("p and q are not primes!")
return False
def setparam(self, p, q):
if isPrime(p) and isPrime(q) and p != q:
self.p = integer(p)
self.q = integer(q)
self.n = self.p * self.q
return True
else:
print("p and q are not primes!")
return False
def testInteger(self):
count = 5
time_in_ms = 1000
a = integer(10)
self.assertTrue(InitBenchmark())
StartBenchmark(["RealTime", "Exp", "Mul"])
for k in range(count):
r = randomPrime(256)
s = r * (r ** a)
j = r * (r ** a)
EndBenchmark()
msmtDict = GetGeneralBenchmarks()
self.assertTrue(isSaneBenchmark(msmtDict))
self.assertTrue(InitBenchmark())
StartBenchmark(["RealTime", "Exp", "Mul", "Add", "Sub"])
for k in range(count):
r = randomPrime(256)
s = r * (r ** a)
j = r * (r ** a)
u = s + j - j
EndBenchmark()
msmtDict = GetGeneralBenchmarks()
self.assertTrue(isSaneBenchmark(msmtDict))
def testInteger(self):
count = 5
time_in_ms = 1000
a = integer(10)
self.assertTrue(InitBenchmark())
StartBenchmark(["RealTime", "Exp", "Mul"])
for k in range(count):
r = randomPrime(256)
s = r * (r**a)
j = r * (r**a)
EndBenchmark()
msmtDict = GetGeneralBenchmarks()
self.assertTrue(isSaneBenchmark(msmtDict))
self.assertTrue(InitBenchmark())
StartBenchmark(["RealTime", "Exp", "Mul", "Add", "Sub"])
for k in range(count):
r = randomPrime(256)
s = r * (r**a)
j = r * (r**a)
u = s + j - j
EndBenchmark()
msmtDict = GetGeneralBenchmarks()
self.assertTrue(isSaneBenchmark(msmtDict))
