Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of period of twin prime products
arXiv:1912.06134v18 citations
Originality Synthesis-oriented
AI Analysis
This work addresses security concerns in cryptography by analyzing sequences used in pseudorandom number generation, but it is incremental as it builds on existing generalized cyclotomic sequence classes.
The paper tackled the problem of computing the 2-adic complexity for two classes of Ding-Helleseth generalized cyclotomic sequences, finding that the complexity is sufficiently high to resist attacks from rational approximation algorithms.
This paper contributes to compute 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences. Results show that 2-adic complexity of these sequences is good enough to resist the attack by the rational approximation algorithm.