{'fraction_non_alphanumeric': 0.012006861063464836, 'fraction_numerical': 0.0, 'mean_word_length': 5.488888888888889, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Simulating entanglement in classical computing for cryptographic applications

ABSTRACT This article shows how quantum entanglement may be simulated in classical computing. The simulated entanglement protocol is implemented using oblivious transfer in the simplest case and other many-to-one mappings in more general cases. For the case where the mapping is of order k, the author proves a theorem that gives the function of the entangled state. A useful generalization beyond this research will be the implementation of quantum states with arbitrary probability amplitude functions.