Computer Science – Cryptography and Security
Scientific paper
2006-01-09
Computer Science
Cryptography and Security
submitted to IEEE-IT
Scientific paper
Let $\underline{a}$ be an \textit{l}-sequence generated by a feedback-with-carry shift register with connection integer $q=p^{e}$, where $ p$ is an odd prime and $e\geq 1$. Goresky and Klapper conjectured that when $ p^{e}\notin \{5,9,11,13\}$, all decimations of $\underline{a}$ are cyclically distinct. When $e=1$ and $p>13$, they showed that the set of distinct decimations is large and, in some cases, all deciamtions are distinct. In this article, we further show that when $e\geq 2$ and$ p^{e}\neq 9$, all decimations of $\underline{a}$ are also cyclically distinct.
Qi Wen-Feng
Xu Hong
No associations
LandOfFree
Further Results on the Distinctness of Decimations of l-sequences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Further Results on the Distinctness of Decimations of l-sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Further Results on the Distinctness of Decimations of l-sequences will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-683649