





'''simple docstring'''

def 						UpperCamelCase    (							_lowerCamelCase : List[str]	):
    for i in range(0						,	lowercase_	):
        for _ in range(0						,	n - i - 1	):  # printing spaces
            print(" "						,	end=""	)
        for _ in range(0						,	i + 1	):  # printing stars
            print("* "						,	end=""	)
        print()





def 						UpperCamelCase    (							_lowerCamelCase : List[Any]	):
    for i in range(lowercase_						,	0						,	-1	):
        for _ in range(lowercase_						,	0						,	-1	):  # printing stars
            print("* "						,	end=""	)
        print()
        for _ in range(n - i + 1						,	0						,	-1	):  # printing spaces
            print(" "						,	end=""	)





def 						UpperCamelCase    (							_lowerCamelCase : List[str]	):
    if n <= 0:
        print("       ...       ....        nothing printing :("	)
        return
    floyd(lowercase_	)  # upper half
    reverse_floyd(lowercase_	)  # lower half


if __name__ == "__main__":
  print(R"| /\ | |- |  |-  |--| |\  /| |-")
  print(R"|/  \| |- |_ |_  |__| | \/ | |_")
  __lowerCAmelCase							:     Any		     =1
  while K:
    __lowerCAmelCase							:     int		     =int(input("enter the number and , and see the magic : "))
    print()
    pretty_print(user_number)
    __lowerCAmelCase							:     int		     =int(input("press 0 to exit... and 1 to continue..."))

  print("Good Bye...")










'''simple docstring'''

import os
import random
import sys

from . import cryptomath_module as cryptoMath  # noqa: N812
from . import rabin_miller as rabinMiller  # noqa: N812





def 						UpperCamelCase    (							):
    print("Making key files..."	)
    make_key_files("rsa"						,	10_24	)
    print("Key files generation successful."	)





def 						UpperCamelCase    (							_lowerCamelCase : int	):
    print("Generating prime p..."	)
    A__    =      rabinMiller.generate_large_prime(_lowerCamelCase	)
    print("Generating prime q..."	)
    A__    =      rabinMiller.generate_large_prime(_lowerCamelCase	)
    A__    =      p * q

    print("Generating e that is relatively prime to (p - 1) * (q - 1)..."	)
    while True:
        A__    =      random.randrange(2 ** (key_size - 1)						,	2 ** (key_size)	)
        if cryptoMath.gcd(_lowerCamelCase						,	(p - 1) * (q - 1)	) == 1:
            break

    print("Calculating d that is mod inverse of e..."	)
    A__    =      cryptoMath.find_mod_inverse(_lowerCamelCase						,	(p - 1) * (q - 1)	)

    A__    =      (n, e)
    A__    =      (n, d)
    return (public_key, private_key)





def 						UpperCamelCase    (							_lowerCamelCase : str						,	_lowerCamelCase : int	):
    if os.path.exists(F"{name}_pubkey.txt"	) or os.path.exists(F"{name}_privkey.txt"	):
        print("\nWARNING:"	)
        print(
            F"\"{name}_pubkey.txt\" or \"{name}_privkey.txt\" already exists. \n"
            "Use a different name or delete these files and re-run this program."	)
        sys.exit()

    A__,     A__    =      generate_key(_lowerCamelCase	)
    print(F"\nWriting public key to file {name}_pubkey.txt..."	)
    with open(F"{name}_pubkey.txt"						,	"w"	) as out_file:
        out_file.write(F"{key_size},{public_key[0]},{public_key[1]}"	)

    print(F"Writing private key to file {name}_privkey.txt..."	)
    with open(F"{name}_privkey.txt"						,	"w"	) as out_file:
        out_file.write(F"{key_size},{private_key[0]},{private_key[1]}"	)


if __name__ == "__main__":
  main()



