Dec 28, 2009 · In this paper, it is shown that for a binary m -sequence, its 2-adic complexity attains the maximum, which implies that no feedback with carry ...
scholar.google.com › citations
Abstract—Although 2-adic complexity was proposed more than ten years ago, even for m-sequences which are thought of as the most important linear recurring ...
In 2010, Tian and Qi determined 2-adic complexity of m sequences, which is the first class of ideal two level autocorrelation sequences whose 2-adic complexity ...
In this paper, it is shown that for a binary m-sequence, its 2-adic complexity attains the maximum, which implies that no feedback with carry shift registers ( ...
2-adic Complexity of Binary M-sequences | Semantic Scholar
www.semanticscholar.org › paper › 2-adi...
It is shown that for a binary m-sequence, its 2-adic complexity attains the maximum, which implies that no feedback with carry shift registers (FCSRs) with ...
Joint 2-adic complexity is a new important index of the cryptographic security for multisequences. In this paper, we extend the usual Fourier transform to the ...
Symmetric 2-adic complexity is a better measure for assessing the strength of a periodic binary sequence against the rational approximation attack. We study the ...
Nov 24, 2020 · Our results show that the 2-adic complexity of such sequences is large enough to resist the attack of the rational approximation algorithm.
lcm(q1,q2,...,qm) is called the joint 2-adic complexity of the m sequences S1,S2,...,Sm, and is denoted by λ2(S1,S2,...,Sm). Definition 2.3. For k = 0, 1,...,L ...
In this paper, we derive the expected value of the joint 2-adic complexity of periodic binary multisequences. A nontrivial lower bound for the expected value of ...