Back to Search
Start Over
Linear Complexity of r-Ary Sequences Derived from Euler Quotient Modulo pq.
- Source :
-
International Journal of Foundations of Computer Science . Jun2024, p1-18. 18p. - Publication Year :
- 2024
-
Abstract
- In this paper, we present a generic construction of r-ary sequences with period pq2 based on the Euler quotient modulo pq, where p and q are odd primes satisfying that p divides q − 1 and r is any prime less than q. The minimal polynomial and the linear complexity of the proposed sequences are determined in most cases under the assumption that rq−1≢1 (mod q2). The result shows that each of the sequences has large linear complexity. [ABSTRACT FROM AUTHOR]
- Subjects :
- *SHIFT registers
*POLYNOMIALS
*EULER polynomials
Subjects
Details
- Language :
- English
- ISSN :
- 01290541
- Database :
- Academic Search Index
- Journal :
- International Journal of Foundations of Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 177983336
- Full Text :
- https://doi.org/10.1142/s0129054124500072