






'''simple docstring'''



import string

import numpy



def    __UpperCAmelCase	(				SCREAMING_SNAKE_CASE__:	int,					SCREAMING_SNAKE_CASE__:	int    )  ->			int:

   """simple docstring"""
   return b if a == 0 else greatest_common_divisor(b % a,					SCREAMING_SNAKE_CASE__    )
class 							__SCREAMING_SNAKE_CASE       :
      __a  					=string.ascii_uppercase + string.digits
      # This cipher takes alphanumerics into account
      # i.e. a total of 36 characters

      # take x and return x % len(key_string)
      __a  					=numpy.vectorize(lambda _lowerCAmelCase     : x % 36     )

      __a  					=numpy.vectorize(_lowerCAmelCase     )




      def __init__(  self ,   lowerCamelCase      )							->None:



         '''simple docstring'''
         __a				     =    self.modulus(lowerCamelCase      )  # mod36 calc's on the encrypt key
         self.check_determinant()  # validate the determinant of the encryption key
         __a				     =    encrypt_key.shape[0]




      def  __UpperCamelCase							(  self ,   lowerCamelCase      )							->int:



         '''simple docstring'''
         return self.key_string.index(lowerCamelCase      )




      def  __UpperCamelCase							(  self ,   lowerCamelCase      )							->str:



         '''simple docstring'''
         return self.key_string[round(lowerCamelCase      )]




      def  __UpperCamelCase							(  self      )							->None:



         '''simple docstring'''
         __a				     =    round(numpy.linalg.det(self.encrypt_key      )      )

         if det < 0:
            __a				     =    det % len(self.key_string      )

         __a				     =    len(self.key_string      )
         if greatest_common_divisor(lowerCamelCase ,   len(self.key_string      )      ) != 1:
            __a				     =    (
                F"""determinant modular {req_l} of encryption key({det}) """
                F"""is not co prime w.r.t {req_l}.\nTry another key."""
            )
            raise ValueError(lowerCamelCase      )




      def  __UpperCamelCase							(  self ,   lowerCamelCase      )							->str:



         '''simple docstring'''
         __a				     =    [char for char in text.upper() if char in self.key_string]

         __a				     =    chars[-1]
         while len(lowerCamelCase      ) % self.break_key != 0:
            chars.append(lowerCamelCase      )

         return "".join(lowerCamelCase      )




      def  __UpperCamelCase							(  self ,   lowerCamelCase      )							->str:



         '''simple docstring'''
         __a				     =    self.process_text(text.upper()      )
         __a				     =    ''

         for i in range(0 ,   len(lowerCamelCase      ) - self.break_key + 1 ,   self.break_key      ):
            __a				     =    text[i : i + self.break_key]
            __a				     =    [self.replace_letters(lowerCamelCase      ) for char in batch]
            __a				     =    numpy.array([vec]      ).T
            __a				     =    self.modulus(self.encrypt_key.dot(lowerCamelCase      )      ).T.tolist()[
                0
            ]
            __a				     =    ''.join(
                self.replace_digits(lowerCamelCase      ) for num in batch_encrypted      )
            encrypted += encrypted_batch

         return encrypted




      def  __UpperCamelCase							(  self      )							->numpy.ndarray:



         '''simple docstring'''
         __a				     =    round(numpy.linalg.det(self.encrypt_key      )      )

         if det < 0:
            __a				     =    det % len(self.key_string      )
         __a				     =    None
         for i in range(len(self.key_string      )      ):
            if (det * i) % len(self.key_string      ) == 1:
               __a				     =    i
               break

         __a				     =    (
             det_inv
             * numpy.linalg.det(self.encrypt_key      )
             * numpy.linalg.inv(self.encrypt_key      )
         )

         return self.to_int(self.modulus(lowerCamelCase      )      )






      def  __UpperCamelCase							(  self ,   lowerCamelCase      )							->str:



         '''simple docstring'''
         __a				     =    self.make_decrypt_key()
         __a				     =    self.process_text(text.upper()      )
         __a				     =    ''

         for i in range(0 ,   len(lowerCamelCase      ) - self.break_key + 1 ,   self.break_key      ):
            __a				     =    text[i : i + self.break_key]
            __a				     =    [self.replace_letters(lowerCamelCase      ) for char in batch]
            __a				     =    numpy.array([vec]      ).T
            __a				     =    self.modulus(decrypt_key.dot(lowerCamelCase      )      ).T.tolist()[0]
            __a				     =    ''.join(
                self.replace_digits(lowerCamelCase      ) for num in batch_decrypted      )
            decrypted += decrypted_batch

         return decrypted







def    __UpperCAmelCase	(				)  ->			None:

   """simple docstring"""
   __a				     =    int(input('Enter the order of the encryption key: '    )    )
   __a				     =    []

   print('Enter each row of the encryption key with space separated integers'    )
   for _ in range(SCREAMING_SNAKE_CASE__    ):
      __a				     =    [int(SCREAMING_SNAKE_CASE__    ) for x in input().split()]
      hill_matrix.append(SCREAMING_SNAKE_CASE__    )

   __a				     =    HillCipher(numpy.array(SCREAMING_SNAKE_CASE__    )    )

   print('Would you like to encrypt or decrypt some text? (1 or 2)'    )
   __a				     =    input('\n1. Encrypt\n2. Decrypt\n'    )
   if option == "1":
      __a				     =    input('What text would you like to encrypt?: '    )
      print('Your encrypted text is:'    )
      print(hc.encrypt(SCREAMING_SNAKE_CASE__    )    )
   elif option == "2":
      __a				     =    input('What text would you like to decrypt?: '    )
      print('Your decrypted text is:'    )
      print(hc.decrypt(SCREAMING_SNAKE_CASE__    )    )


if __name__ == "__main__":
 import doctest

 doctest.testmod()

 main()







'''simple docstring'''



def    __UpperCAmelCase	(				SCREAMING_SNAKE_CASE__:	int,					SCREAMING_SNAKE_CASE__:	bool = False    )  ->			bool:

   """simple docstring"""
   if n == 2:
      return True
   if not n % 2 or n < 2:
      return False
   if n > 5 and n % 10 not in (1, 3, 7, 9):  # can quickly check last digit
      return False
   if n > 3317044064679887385961981 and not allow_probable:
      raise ValueError(
          'Warning: upper bound of deterministic test is exceeded. '
          'Pass allow_probable=True to allow probabilistic test. '
          'A return value of True indicates a probable prime.'    )
   # array bounds provided by analysis
   __a				     =    [
       2047,
       1373653,
       25326001,
       3215031751,
       2152302898747,
       3474749660383,
       341550071728321,
       1,
       3825123056546413051,
       1,
       1,
       318665857834031151167461,
       3317044064679887385961981,
   ]

   __a				     =    [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41]
   for idx, _p in enumerate(SCREAMING_SNAKE_CASE__,					1    ):
      if n < _p:
         # then we have our last prime to check
         __a				     =    primes[:idx]
         break
   __a     ,			__a				     =    n - 1, 0
   # break up n -1 into a power of 2 (s) and
   # remaining odd component
   # essentially, solve for d * 2 ** s == n - 1
   while d % 2 == 0:
      d //= 2
      s += 1
   for prime in plist:
      __a				     =    False
      for r in range(SCREAMING_SNAKE_CASE__    ):
         __a				     =    pow(SCREAMING_SNAKE_CASE__,					d * 2**r,					SCREAMING_SNAKE_CASE__    )
         # see article for analysis explanation for m
         if (r == 0 and m == 1) or ((m + 1) % n == 0):
            __a				     =    True
            # this loop will not determine compositeness
            break
      if pr:
         continue
      # if pr is False, then the above loop never evaluated to true,
      # and the n MUST be composite
      return False
   return True



def    __UpperCAmelCase	(				)  ->			None:

   """simple docstring"""
   assert not miller_rabin(561    )
   assert miller_rabin(563    )
   # 2047

   assert not miller_rabin(838201    )
   assert miller_rabin(838207    )
   # 1_373_653

   assert not miller_rabin(17316001    )
   assert miller_rabin(17316017    )
   # 25_326_001

   assert not miller_rabin(3078386641    )
   assert miller_rabin(3078386653    )
   # 3_215_031_751

   assert not miller_rabin(1713045574801    )
   assert miller_rabin(1713045574819    )
   # 2_152_302_898_747

   assert not miller_rabin(2779799728307    )
   assert miller_rabin(2779799728327    )
   # 3_474_749_660_383

   assert not miller_rabin(113850023909441    )
   assert miller_rabin(113850023909527    )
   # 341_550_071_728_321

   assert not miller_rabin(1275041018848804351    )
   assert miller_rabin(1275041018848804391    )
   # 3_825_123_056_546_413_051

   assert not miller_rabin(79666464458507787791867    )
   assert miller_rabin(79666464458507787791951    )
   # 318_665_857_834_031_151_167_461

   assert not miller_rabin(552840677446647897660333    )
   assert miller_rabin(552840677446647897660359    )
   # 3_317_044_064_679_887_385_961_981
   # upper limit for probabilistic test


if __name__ == "__main__":
 test_miller_rabin()