def generate_RSA_Key_pair(N):
    if N<= 4 or not is_even(N):
        return None
    prime_length = N//2
    n=0
    while n < 2^(N-1) or p == q:
        p = random_prime(2^prime_length, proof=False,lbound=2^(prime_length-1))
        q = random_prime(2^prime_length, proof=False,lbound=2^(prime_length-1))
        n = p*q
    phi = (p-1)*(q-1)
    while true:
        e = ZZ.random_element(2,phi)
        if gcd(e,phi)==1:
            break
    d = inverse_mod(e,phi)
    return (n,e),(n,d)