{'fraction_non_alphanumeric': 0.02200825309491059, 'fraction_numerical': 0.0068775790921595595, 'mean_word_length': 5.066666666666666, '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}}
Linear complexity and autocorrelation of a new class of binary generalized cyclotomic sequences of order two and length pqr

Cyclotomic sequences have good cryptographic properties and are closely related to difference sets. This paper proposes a new class of binary generalized cyclotomic sequences of order two and length pqr. Its linear complexity, minimal polynomial, and autocorrelation are investigated. The results show that these sequences have a large linear complexity when 2 ∈ D1, which means they can resist the Berlekamp-Massey attack. Furthermore, the autocorrelation values are close to 0 with a probability of approximately 1 − 1/r. Therefore, when r is a big prime, the new sequence has a good autocorrelation.