






'''simple docstring'''




import argparse
import logging
import pickle
from collections import Counter


logging.basicConfig(
    format='%(asctime)s - %(levelname)s - %(name)s - %(message)s', datefmt='%m/%d/%Y %H:%M:%S', level=logging.INFO
)
lowerCAmelCase__          =						logging.getLogger(__name__)

if __name__ == "__main__":
		lowerCAmelCase__          =						argparse.ArgumentParser(
		    description='Token Counts for smoothing the masking probabilities in MLM (cf XLM/word2vec)'
		)
		parser.add_argument(
		    '--data_file', type=str, default='data/dump.bert-base-uncased.pickle', help='The binarized dataset.'
		)
		parser.add_argument(
		    '--token_counts_dump', type=str, default='data/token_counts.bert-base-uncased.pickle', help='The dump file.'
		)
		parser.add_argument('--vocab_size', default=3_0522, type=int)
		lowerCAmelCase__          =						parser.parse_args()

		logger.info(f'''Loading data from {args.data_file}''')
		with open(args.data_file, 'rb') as fp:
				lowerCAmelCase__          =						pickle.load(fp)

		logger.info('Counting occurrences for MLM.')
		lowerCAmelCase__          =						Counter()
		for tk_ids in data:
				counter.update(tk_ids)
		lowerCAmelCase__          =						[0] * args.vocab_size
		for k, v in counter.items():
				lowerCAmelCase__          =						v

		logger.info(f'''Dump to {args.token_counts_dump}''')
		with open(args.token_counts_dump, 'wb') as handle:
				pickle.dump(counts, handle, protocol=pickle.HIGHEST_PROTOCOL)












'''simple docstring'''




import os
import random
import sys

from . import cryptomath_module as cryptomath
from . import rabin_miller

lowerCAmelCase__          =						3







def       __UpperCAmelCase						(  lowerCamelCase_)							->     int:
		print('Generating primitive root of p')
		while True:
				UpperCamelCase__				:					Any					=					random.randrange(3     ,      lowerCamelCase_)
				if pow(lowerCamelCase_     ,      2     ,      lowerCamelCase_) == 1:
						continue
				if pow(lowerCamelCase_     ,      lowerCamelCase_     ,      lowerCamelCase_) == 1:
						continue
				return g







def       __UpperCAmelCase						(  lowerCamelCase_)							->     tuple[tuple[int, int, int, int], tuple[int, int]]:
		print('Generating prime p...')
		UpperCamelCase__				:					List[str]					=					rabin_miller.generate_large_prime(lowerCamelCase_)  # select large prime number.
		UpperCamelCase__				:					Any					=					primitive_root(lowerCamelCase_)  # one primitive root on modulo p.
		UpperCamelCase__				:					Union[str, Any]					=					random.randrange(3     ,      lowerCamelCase_)  # private_key -> have to be greater than 2 for safety.
		UpperCamelCase__				:					Dict					=					cryptomath.find_mod_inverse(pow(lowerCamelCase_     ,      lowerCamelCase_     ,      lowerCamelCase_)     ,      lowerCamelCase_)

		UpperCamelCase__				:					List[Any]					=					(key_size, e_a, e_a, p)
		UpperCamelCase__				:					Optional[Any]					=					(key_size, d)

		return public_key, private_key







def       __UpperCAmelCase						(  lowerCamelCase_     ,      lowerCamelCase_)							->     None:
		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__				:					Union[str, Any]					=					generate_key(lowerCamelCase_)
		print(f'\nWriting public key to file {name}_pubkey.txt...')
		with open(f'{name}_pubkey.txt'     ,      'w') as fo:
				fo.write(f'{public_key[0]},{public_key[1]},{public_key[2]},{public_key[3]}')

		print(f'Writing private key to file {name}_privkey.txt...')
		with open(f'{name}_privkey.txt'     ,      'w') as fo:
				fo.write(f'{private_key[0]},{private_key[1]}')







def       __UpperCAmelCase						(  )							->     None:
		print('Making key files...')
		make_key_files('elgamal'     ,      2_048)
		print('Key files generation successful')


if __name__ == "__main__":
		main()




