Back to Search
Start Over
Linear complexity of binary generalized cyclotomic sequences over GF([formula omitted]).
- Source :
-
Journal of Complexity . Oct2015, Vol. 31 Issue 5, p731-740. 10p. - Publication Year :
- 2015
-
Abstract
- Periodic sequences over finite fields have been used as key streams in private-key cryptosystems since the 1950s. Such periodic sequences should have a series of cryptographic properties in order to resist many attack methods. The binary generalized cyclotomic periodic sequences, constructed by the cyclotomic classes over finite fields, have good pseudo-random properties and correlation properties. In this paper, the linear complexity and minimal polynomials of some generalized cyclotomic sequences over GF( q ) have been determined where q = p m and p is an odd prime. Results show that these sequences have high linear complexity over GF( q ) for a large part of odd prime power q , which means they can resist the linear attack method. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 0885064X
- Volume :
- 31
- Issue :
- 5
- Database :
- Academic Search Index
- Journal :
- Journal of Complexity
- Publication Type :
- Academic Journal
- Accession number :
- 108787681
- Full Text :
- https://doi.org/10.1016/j.jco.2015.01.001