Linear complexity of a class of pseudorandom sequences over a general finite field
| Autor: | Jian Shen, Pinhui Ke, Qi Ye |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Pseudorandom number generator
Discrete mathematics business.industry Algebraic structure Pseudorandomness 020206 networking & telecommunications Cryptography 02 engineering and technology Pseudorandom generator Pseudorandom generator theorem Theoretical Computer Science Finite field 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Geometry and Topology business Software Coding (social sciences) Mathematics |
| Zdroj: | Soft Computing. 22:4335-4346 |
| ISSN: | 1433-7479 1432-7643 |
| DOI: | 10.1007/s00500-017-2870-6 |
| Popis: | Due to their nice algebraic structures and pseudorandom features, generalized cyclotomic sequences have wide applications in simulation, coding and cryptography. Based on the Ding–Helleseth sequence, Bai et al. proposed a class of balanced generalized sequences of length pq. Moreover, they showed that this class of sequences has high linear complexity over a finite field of order two. In this paper, we study the linear complexity and the minimal polynomial of this class of sequences over a general finite field. Results indicate the sequence considered possesses high linear complexity over a general finite field. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink