{'fraction_non_alphanumeric': 0.014492753623188406, 'fraction_numerical': 0.0, 'mean_word_length': 5.22, '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}}
New Algorithm for Public Key Cryptosystems Based on Lucas Sequences

A novel algorithm for the computation of Lucas sequences is proposed to improve the efficiency of cryptosystems based on it. By the introduction of pre-computation, the original Characteristic polynomial algorithm is modified to reduce the number of multiplication operations. The influence of window size on efficiency of the algorithm is also analyzed, and a optimization scheme is presented. In circumstances that more than one values of Lucas sequence need to be calculated, the new algorithm is more efficient than the existing Yen-Laih algorithm.