{'fraction_non_alphanumeric': 0.018641810918774968, 'fraction_numerical': 0.0013315579227696406, 'mean_word_length': 4.529411764705882, '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}}
Strengthening of a graph-based cryptanalysis method

BDD is an efficient data structure that in last few years has been used effectively in computer science and engineering. BDD-based attack in key stream cryptanalysis is supposed to be one of the best forms of attack in its kind. In this paper, we propose a new key stream attack which is based on ZDD(a variant of BDD). We show how our ZDD-based key stream attack can be used against the E0 type of the Bluetooth security mechanism. We implemented our algorithm using CUDD package. The experimental results witness the superiority of our method. We have also derived a mathematical proof for the algorithm, which shows that its behavior even under the worst circumstances is better than BDD attack.