


def 							__lowercase   ( __lowerCAmelCase							:				str					,    __lowerCAmelCase							:				str   ):
							a__             =     len(__lowerCAmelCase   ) + 1
							a__             =     len(__lowerCAmelCase   ) + 1

							# dp is a 2d matrix where dp[i][j] denotes whether prefix string of
							# length i of input_string matches with prefix string of length j of
							# given pattern.
							# "dp" stands for dynamic programming.
							a__             =     [[0 for i in range(__lowerCAmelCase   )] for j in range(__lowerCAmelCase   )]

							# since string of zero length match pattern of zero length
							a__             =     1

							# since pattern of zero length will never match with string of non-zero length
							for i in range(1					,    __lowerCAmelCase   ):
														a__             =     0

							# since string of zero length will match with pattern where there
							# is at least one * alternatively
							for j in range(1					,    __lowerCAmelCase   ):
														a__             =     dp[0][j - 2] if pattern[j - 1] == '*' else 0

							# now using bottom-up approach to find for all remaining lengths
							for i in range(1					,    __lowerCAmelCase   ):
														for j in range(1					,    __lowerCAmelCase   ):
																					if input_string[i - 1] == pattern[j - 1] or pattern[j - 1] == ".":
																												a__             =     dp[i - 1][j - 1]

																					elif pattern[j - 1] == "*":
																												if dp[i][j - 2] == 1:
																																			a__             =     1
																												elif pattern[j - 2] in (input_string[i - 1], "."):
																																			a__             =     dp[i - 1][j]
																												else:
																																			a__             =     0
																					else:
																												a__             =     0

							return bool(dp[-1][-1]   )


if __name__ == "__main__":
						import doctest

						doctest.testmod()
						# inputing the strings
						# input_string = input("input a string :")
						# pattern = input("input a pattern :")

						snake_case							:       Optional[Any]     			=      '''aab'''
						snake_case							:       str     			=      '''c*a*b'''

						# using function to check whether given string matches the given pattern
						if match_pattern(input_string, pattern):
												print(f"""{input_string} matches the given pattern {pattern}""")
						else:
												print(f"""{input_string} does not match with the given pattern {pattern}""")








import os
import random
import sys

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






def 							__lowercase   ( ):
							print('Making key files...'   )
							make_key_files('rsa'					,    1_0_2_4   )
							print('Key files generation successful.'   )






def 							__lowercase   ( __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 							__lowercase   ( __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()




