


from math import asin, atan, cos, radians, sin, sqrt, tan

lowerCAmelCase			=				6_3_7_8_1_3_7.0
lowerCAmelCase			=				6_3_5_6_7_5_2.3_1_4_2_4_5
lowerCAmelCase			=				637_8137
def      _a					( SCREAMING_SNAKE_CASE		,							SCREAMING_SNAKE_CASE		,							SCREAMING_SNAKE_CASE		,							SCREAMING_SNAKE_CASE	):


		"""simple docstring"""




		lowercase__				= (AXIS_A - AXIS_B) / AXIS_A
		lowercase__				= atan((1 - flattening) * tan(radians(SCREAMING_SNAKE_CASE	)	)	)
		lowercase__				= atan((1 - flattening) * tan(radians(SCREAMING_SNAKE_CASE	)	)	)
		lowercase__				= radians(SCREAMING_SNAKE_CASE	)
		lowercase__				= radians(SCREAMING_SNAKE_CASE	)
		# Equation
		lowercase__				= sin((phi_a - phi_a) / 2	)
		lowercase__				= sin((lambda_a - lambda_a) / 2	)
		# Square both values
		sin_sq_phi *= sin_sq_phi
		sin_sq_lambda *= sin_sq_lambda
		lowercase__				= sqrt(sin_sq_phi + (cos(SCREAMING_SNAKE_CASE	) * cos(SCREAMING_SNAKE_CASE	) * sin_sq_lambda)	)
		return 2 * RADIUS * asin(SCREAMING_SNAKE_CASE	)


if __name__ == "__main__":
			import doctest

			doctest.testmod()



import os
import random
import sys

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






def     lowerCAmelCase_			(   ):
						print("""Making key files..."""			)
						make_key_files("""rsa"""		, 1024			)
						print("""Key files generation successful."""			)






def     lowerCAmelCase_			(   _SCREAMING_SNAKE_CASE     :				int			):
						print("""Generating prime p..."""			)
						UpperCamelCase_		:							Tuple  =		rabinMiller.generate_large_prime(_SCREAMING_SNAKE_CASE			)
						print("""Generating prime q..."""			)
						UpperCamelCase_		:							List[Any]  =		rabinMiller.generate_large_prime(_SCREAMING_SNAKE_CASE			)
						UpperCamelCase_		:							List[str]  =		p * q

						print("""Generating e that is relatively prime to (p - 1) * (q - 1)..."""			)
						while True:
												UpperCamelCase_		:							Union[str, Any]  =		random.randrange(2 ** (key_size - 1)		, 2 ** (key_size)			)
												if cryptoMath.gcd(_SCREAMING_SNAKE_CASE		, (p - 1) * (q - 1)			) == 1:
																		break

						print("""Calculating d that is mod inverse of e..."""			)
						UpperCamelCase_		:							Tuple  =		cryptoMath.find_mod_inverse(_SCREAMING_SNAKE_CASE		, (p - 1) * (q - 1)			)

						UpperCamelCase_		:							Tuple  =		(n, e)
						UpperCamelCase_		:							int  =		(n, d)
						return (public_key, private_key)






def     lowerCAmelCase_			(   _SCREAMING_SNAKE_CASE     :				str		, _SCREAMING_SNAKE_CASE     :				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()

						UpperCamelCase_,UpperCamelCase_		:							str  =		generate_key(_SCREAMING_SNAKE_CASE			)
						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()






