ospaceteam / outerspace

    return (a, lx, ly)                 #Return only positive values

# Main function: calculate encryption and decryption keys

def calculate_keys(p, q, nbits):

    """Calculates an encryption and a decryption key for p and q, and

    returns them as a tuple (e, d)"""

    n = p * q

    phi_n = (p-1) * (q-1)

    while True:

        # Make sure e has enough bits so we ensure "wrapping" through

        # modulo n

        e = max(65537,getprime(nbits/4))

        if are_relatively_prime(e, n) and are_relatively_prime(e, phi_n): break

    (d, i, j) = extended_gcd(e, phi_n)

    if not d == 1:

        raise Exception("e (%d) and phi_n (%d) are not relatively prime" % (e, phi_n))

    if (i < 0):

        raise Exception("New extended_gcd shouldn't return negative values")

    if not (e * i) % phi_n == 1:

        raise Exception("e (%d) and i (%d) are not mult. inv. modulo phi_n (%d)" % (e, i, phi_n))

    return (e, i)

def gen_keys(nbits):

    return (d, l, k - l*r)

# Main function: calculate encryption and decryption keys

def calculate_keys(p, q, nbits):

    """Calculates an encryption and a decryption key for p and q, and

    returns them as a tuple (e, d)"""

    n = p * q

    phi_n = (p-1) * (q-1)

    while True:

        # Make sure e has enough bits so we ensure "wrapping" through

        # modulo n

        e = getprime(max(8, nbits/2))

        if are_relatively_prime(e, n) and are_relatively_prime(e, phi_n): break

    (d, i, j) = extended_euclid_gcd(e, phi_n)

    if not d == 1:

        raise Exception("e (%d) and phi_n (%d) are not relatively prime" % (e, phi_n))

    if not (e * i) % phi_n == 1:

        raise Exception("e (%d) and i (%d) are not mult. inv. modulo phi_n (%d)" % (e, i, phi_n))

    return (e, i)

def gen_keys(nbits):