Example #1
0
File: RSA.py Project: Recybery/RSA
def findCoprime(K): 
    n=findCoHelp(K,K,Pow.pow(10,100,10))
    while(gcd(n,K)!=1 or n==0):
        n-=1
    return n