



'''simple docstring'''



import argparse
import struct
import unittest





class _UpperCamelCase		:





				'''simple docstring'''





				def __init__(							self  :  List[Any]  ,       _lowerCAmelCase  :  bytes):







											'''simple docstring'''

											__lowercase       	=data

											# Initialize hash values
											__lowercase       	=[
											    0X6_a_0_9_e_6_6_7,
											    0Xb_b_6_7_a_e_8_5,
											    0X3_c_6_e_f_3_7_2,
											    0Xa_5_4_f_f_5_3_a,
											    0X5_1_0_e_5_2_7_f,
											    0X9_b_0_5_6_8_8_c,
											    0X1_f_8_3_d_9_a_b,
											    0X5_b_e_0_c_d_1_9,
											]

											# Initialize round constants
											__lowercase       	=[
											    0X4_2_8_a_2_f_9_8,
											    0X7_1_3_7_4_4_9_1,
											    0Xb_5_c_0_f_b_c_f,
											    0Xe_9_b_5_d_b_a_5,
											    0X3_9_5_6_c_2_5_b,
											    0X5_9_f_1_1_1_f_1,
											    0X9_2_3_f_8_2_a_4,
											    0Xa_b_1_c_5_e_d_5,
											    0Xd_8_0_7_a_a_9_8,
											    0X1_2_8_3_5_b_0_1,
											    0X2_4_3_1_8_5_b_e,
											    0X5_5_0_c_7_d_c_3,
											    0X7_2_b_e_5_d_7_4,
											    0X8_0_d_e_b_1_f_e,
											    0X9_b_d_c_0_6_a_7,
											    0Xc_1_9_b_f_1_7_4,
											    0Xe_4_9_b_6_9_c_1,
											    0Xe_f_b_e_4_7_8_6,
											    0X0_f_c_1_9_d_c_6,
											    0X2_4_0_c_a_1_c_c,
											    0X2_d_e_9_2_c_6_f,
											    0X4_a_7_4_8_4_a_a,
											    0X5_c_b_0_a_9_d_c,
											    0X7_6_f_9_8_8_d_a,
											    0X9_8_3_e_5_1_5_2,
											    0Xa_8_3_1_c_6_6_d,
											    0Xb_0_0_3_2_7_c_8,
											    0Xb_f_5_9_7_f_c_7,
											    0Xc_6_e_0_0_b_f_3,
											    0Xd_5_a_7_9_1_4_7,
											    0X0_6_c_a_6_3_5_1,
											    0X1_4_2_9_2_9_6_7,
											    0X2_7_b_7_0_a_8_5,
											    0X2_e_1_b_2_1_3_8,
											    0X4_d_2_c_6_d_f_c,
											    0X5_3_3_8_0_d_1_3,
											    0X6_5_0_a_7_3_5_4,
											    0X7_6_6_a_0_a_b_b,
											    0X8_1_c_2_c_9_2_e,
											    0X9_2_7_2_2_c_8_5,
											    0Xa_2_b_f_e_8_a_1,
											    0Xa_8_1_a_6_6_4_b,
											    0Xc_2_4_b_8_b_7_0,
											    0Xc_7_6_c_5_1_a_3,
											    0Xd_1_9_2_e_8_1_9,
											    0Xd_6_9_9_0_6_2_4,
											    0Xf_4_0_e_3_5_8_5,
											    0X1_0_6_a_a_0_7_0,
											    0X1_9_a_4_c_1_1_6,
											    0X1_e_3_7_6_c_0_8,
											    0X2_7_4_8_7_7_4_c,
											    0X3_4_b_0_b_c_b_5,
											    0X3_9_1_c_0_c_b_3,
											    0X4_e_d_8_a_a_4_a,
											    0X5_b_9_c_c_a_4_f,
											    0X6_8_2_e_6_f_f_3,
											    0X7_4_8_f_8_2_e_e,
											    0X7_8_a_5_6_3_6_f,
											    0X8_4_c_8_7_8_1_4,
											    0X8_c_c_7_0_2_0_8,
											    0X9_0_b_e_f_f_f_a,
											    0Xa_4_5_0_6_c_e_b,
											    0Xb_e_f_9_a_3_f_7,
											    0Xc_6_7_1_7_8_f_2,
											]

											__lowercase       	=self.preprocessing(self.data)
											self.final_hash()

				@staticmethod
				def 				__lowerCamelCase     (							_lowerCAmelCase  :  bytes):







											'''simple docstring'''

											__lowercase       	=B'\x80' + (B'\x00' * (6_3 - (len(_lowerCAmelCase) + 8) % 6_4))
											__lowercase       	=struct.pack('>Q'  ,       (len(_lowerCAmelCase) * 8))
											return data + padding + big_endian_integer

				def 				__lowerCamelCase     (							self  :  str):







											'''simple docstring'''

											__lowercase       	=[
											    self.preprocessed_data[x : x + 6_4]
											    for x in range(0  ,       len(self.preprocessed_data)  ,       6_4)
											]

											for block in self.blocks:
																		# Convert the given block into a list of 4 byte integers
																		__lowercase       	=list(struct.unpack('>16L'  ,       _lowerCAmelCase))
																		# add 48 0-ed integers
																		words += [0] * 4_8

																		__lowercase	,				__lowercase	,				__lowercase	,				__lowercase	,				__lowercase	,				__lowercase	,				__lowercase	,				__lowercase       	=self.hashes

																		for index in range(0  ,       6_4):
																									if index > 1_5:
																																# modify the zero-ed indexes at the end of the array
																																__lowercase       	=(
																																    self.ror(words[index - 1_5]  ,       7)
																																    ^ self.ror(words[index - 1_5]  ,       1_8)
																																    ^ (words[index - 1_5] >> 3)
																																)
																																__lowercase       	=(
																																    self.ror(words[index - 2]  ,       1_7)
																																    ^ self.ror(words[index - 2]  ,       1_9)
																																    ^ (words[index - 2] >> 1_0)
																																)

																																__lowercase       	=(
																																    words[index - 1_6] + sa + words[index - 7] + sa
																																) % 0X1_0_0_0_0_0_0_0_0

																									# Compression
																									__lowercase       	=self.ror(_lowerCAmelCase  ,       6) ^ self.ror(_lowerCAmelCase  ,       1_1) ^ self.ror(_lowerCAmelCase  ,       2_5)
																									__lowercase       	=(e & f) ^ ((~e & 0Xf_f_f_f_f_f_f_f) & g)
																									__lowercase       	=(
																									    h + sa + ch + self.round_constants[index] + words[index]
																									) % 0X1_0_0_0_0_0_0_0_0
																									__lowercase       	=self.ror(_lowerCAmelCase  ,       2) ^ self.ror(_lowerCAmelCase  ,       1_3) ^ self.ror(_lowerCAmelCase  ,       2_2)
																									__lowercase       	=(a & b) ^ (a & c) ^ (b & c)
																									__lowercase       	=(sa + maj) % 0X1_0_0_0_0_0_0_0_0

																									__lowercase	,				__lowercase	,				__lowercase	,				__lowercase	,				__lowercase	,				__lowercase	,				__lowercase	,				__lowercase       	=(
																									    g,
																									    f,
																									    e,
																									    ((d + tempa) % 0X1_0_0_0_0_0_0_0_0),
																									    c,
																									    b,
																									    a,
																									    ((tempa + tempa) % 0X1_0_0_0_0_0_0_0_0),
																									)

																		__lowercase       	=[a, b, c, d, e, f, g, h]

																		# Modify final values
																		__lowercase       	=[
																		    ((element + mutated_hash_values[index]) % 0X1_0_0_0_0_0_0_0_0)
																		    for index, element in enumerate(self.hashes)
																		]

											__lowercase       	=''.join([hex(_lowerCAmelCase)[2:].zfill(8) for value in self.hashes])

				def 				__lowerCamelCase     (							self  :  List[str]  ,       _lowerCAmelCase  :  int  ,       _lowerCAmelCase  :  int):







											'''simple docstring'''

											return 0Xf_f_f_f_f_f_f_f & (value << (3_2 - rotations)) | (value >> rotations)





class _UpperCamelCase		(     unittest.TestCase		):





				'''simple docstring'''





				def 				__lowerCamelCase     (							self  :  Optional[Any]):







											'''simple docstring'''

											import hashlib

											__lowercase       	=bytes('Test String'  ,       'utf-8')
											self.assertEqual(SHAaaa(_lowerCAmelCase).hash  ,       hashlib.shaaaa(_lowerCAmelCase).hexdigest())



def   _A       (   ):



							"""simple docstring"""



							import doctest

							doctest.testmod()

							__lowercase       	=argparse.ArgumentParser()
							parser.add_argument(
							    '-s'  ,   '--string'  ,   dest='input_string'  ,   default='Hello World!! Welcome to Cryptography'  ,   help='Hash the string'  ,   )
							parser.add_argument(
							    '-f'  ,   '--file'  ,   dest='input_file'  ,   help='Hash contents of a file'					)

							__lowercase       	=parser.parse_args()

							__lowercase       	=args.input_string

							# hash input should be a bytestring
							if args.input_file:
														with open(args.input_file  ,   'rb'					) as f:
																					__lowercase       	=f.read()
							else:
														__lowercase       	=bytes(_lowerCAmelCase  ,   'utf-8'					)

							print(SHAaaa(_lowerCAmelCase					).hash					)


if __name__ == "__main__":
		main()








'''simple docstring'''



from __future__ import annotations



def   _A       (   _lowerCAmelCase  ,   _lowerCAmelCase = None  ,   _lowerCAmelCase = None  ,   _lowerCAmelCase = False  ,   ):



							"""simple docstring"""



							__lowercase       	=cipher_alphabet or [chr(_lowerCAmelCase					) for i in range(97  ,   123					)]

							# If the argument is None or the user provided an empty dictionary
							if not frequencies_dict:
														# Frequencies of letters in the english language (how much they show up)
														__lowercase       	={
														    'a': 0.0_84_97,
														    'b': 0.0_14_92,
														    'c': 0.0_22_02,
														    'd': 0.0_42_53,
														    'e': 0.1_11_62,
														    'f': 0.0_22_28,
														    'g': 0.0_20_15,
														    'h': 0.0_60_94,
														    'i': 0.0_75_46,
														    'j': 0.0_01_53,
														    'k': 0.0_12_92,
														    'l': 0.0_40_25,
														    'm': 0.0_24_06,
														    'n': 0.0_67_49,
														    'o': 0.0_75_07,
														    'p': 0.0_19_29,
														    'q': 0.0_00_95,
														    'r': 0.0_75_87,
														    's': 0.0_63_27,
														    't': 0.0_93_56,
														    'u': 0.0_27_58,
														    'v': 0.0_09_78,
														    'w': 0.0_25_60,
														    'x': 0.0_01_50,
														    'y': 0.0_19_94,
														    'z': 0.0_00_77,
														}
							else:
														# Custom frequencies dictionary
														__lowercase       	=frequencies_dict

							if not case_sensitive:
														__lowercase       	=ciphertext.lower()

							# Chi squared statistic values
							__lowercase       	={}

							# cycle through all of the shifts
							for shift in range(len(_lowerCAmelCase					)					):
														__lowercase       	=''

														# decrypt the message with the shift
														for letter in ciphertext:
																					try:
																												# Try to index the letter in the alphabet
																												__lowercase       	=(alphabet_letters.index(letter.lower()					) - shift) % len(
																												    _lowerCAmelCase					)
																												decrypted_with_shift += (
																												    alphabet_letters[new_key].upper()
																												    if case_sensitive and letter.isupper()
																												    else alphabet_letters[new_key]
																												)
																					except ValueError:
																												# Append the character if it isn't in the alphabet
																												decrypted_with_shift += letter

														__lowercase       	=0.0

														# Loop through each letter in the decoded message with the shift
														for letter in decrypted_with_shift:
																					if case_sensitive:
																												__lowercase       	=letter.lower()
																												if letter in frequencies:
																																			# Get the amount of times the letter occurs in the message
																																			__lowercase       	=decrypted_with_shift.lower().count(_lowerCAmelCase					)

																																			# Get the excepcted amount of times the letter should appear based
																																			# on letter frequencies
																																			__lowercase       	=frequencies[letter] * occurrences

																																			# Complete the chi squared statistic formula
																																			__lowercase       	=((occurrences - expected) ** 2) / expected

																																			# Add the margin of error to the total chi squared statistic
																																			chi_squared_statistic += chi_letter_value
																					else:
																												if letter.lower() in frequencies:
																																			# Get the amount of times the letter occurs in the message
																																			__lowercase       	=decrypted_with_shift.count(_lowerCAmelCase					)

																																			# Get the excepcted amount of times the letter should appear based
																																			# on letter frequencies
																																			__lowercase       	=frequencies[letter] * occurrences

																																			# Complete the chi squared statistic formula
																																			__lowercase       	=((occurrences - expected) ** 2) / expected

																																			# Add the margin of error to the total chi squared statistic
																																			chi_squared_statistic += chi_letter_value

        # Add the data to the chi_squared_statistic_values dictionary
														__lowercase       	=(
														    chi_squared_statistic,
														    decrypted_with_shift,
														)

							# Get the most likely cipher by finding the cipher with the smallest chi squared
							# statistic
							def chi_squared_statistic_values_sorting_key(_lowerCAmelCase					) -> tuple[float, str]:
														return chi_squared_statistic_values[key]

							__lowercase       	=min(
							    _lowerCAmelCase  ,   key=_lowerCAmelCase  ,   )

							# Get all the data from the most likely cipher (key, decoded message)
							(
							    (
							    __lowercase
							)	,				(
							    __lowercase
							)	,				
							)       	=chi_squared_statistic_values[most_likely_cipher]

							# Return the data on the most likely shift
							return (
							    most_likely_cipher,
							    most_likely_cipher_chi_squared_value,
							    decoded_most_likely_cipher,
							)



