DocumentCode
1178191
Title
Some notes on the two-prime generator of order 2
Author
Brandstätter, Nina ; Winterhof, Arne
Author_Institution
Johann Radon Inst. for Comput. & Appl. Math., Linz, Austria
Volume
51
Issue
10
fYear
2005
Firstpage
3654
Lastpage
3657
Abstract
The two-prime generator of order 2 has several desirable randomness properties if the two primes are chosen properly. In particular, Ding deduced exact formulas for the (periodic) autocorrelation and the linear complexity of these sequences. In this note, we analyze parts of the period of the two-prime generator of order 2 and obtain bounds on the aperiodic autocorrelation and linear complexity profile.
Keywords
Legendre polynomials; binary sequences; computational complexity; correlation theory; random sequences; Legendre symbol; aperiodic autocorrelation; binary sequence; finite field; linear complexity; randomness property; two-prime generator; Autocorrelation; Binary sequences; Cryptography; Galois fields; Mathematics; Random sequences; Security; Upper bound; (Aperiodic) autocorrelation; binary sequences; finite fields; generalized cyclotomic sequence; linear complexity profile; sums of Legendre symbols; two-prime generator;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2005.855615
Filename
1512436
Link To Document