{'fraction_non_alphanumeric': 0.007334963325183374, 'fraction_numerical': 0.0, 'mean_word_length': 5.119402985074627, '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}}
Stability of the public key cryptosystem based on Boolean product of matrices

A quantitative analysis of the public key cryptosystem stability based on Boolean product of matrices is given. It is shown that the stability of such cryptosystem is based on the difficulty of decomposing the Boolean product of large matrices. The resistibility of cryptosystem is analyzed against the main categories of attacks.