Rating: 0

Writeup...

kataryniarz – Oct. 15, 2017, 2:26 a.m.

If you wanted to really speed encryption, here are some hints:

- dwfregrgre(n, m) returns a list of primes between n and m
- swsdwdwdwa(n) returns dwfregrgre(1, n)
- code
g = None
for i in range(n + 1, n * n):
if ((i % p) == 0) or ((i % q) == 0) or ((i % n) == 0):
continue

g = i
break
is equivalent to

g = n + 1