{'fraction_non_alphanumeric': 0.019088016967126194, 'fraction_numerical': 0.0, 'mean_word_length': 4.791411042944786, '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}}
A Novel Multicast Key Exchange Algorithm Based on Extended Chebyshev Map

The Chebyshev map is a typical chaotic map which has been widely investigated for cryptography. However, researchers argue that almost all the encryption algorithms based on some chaotic maps are not as secure as they are announced. In this paper, the limitations of some multicast key agreement schemes are discussed. To eliminate those false and remain novelty, we consider how the chaotic maps can be improved to fulfill the cryptographic demands. To achieve this, we extend the domain of Chebyshev maps from real number set to finite field. Based on this extension, this paper proposes a novel multicast key exchange algorithm. By detailed experiments and analysis, we show that this algorithm is secure and efficient. As far as we know, such a multicast key exchange algorithm has not been reported. The results given here, to the best of our knowledge, are novel.