We extend a result of Ding and Helleseth on the autocorrelation of a cyclotomic generator in several ways. We define and analyze cyclotomic generators of arbitrary orders and over arbitrary finite fields, and we consider two, in general, different definitions of autocorrelation. Cyclotomic generators are closely related to the discrete logarithm. Hence, the results of this paper do not only describe interesting cryptographic properties of cyclotomic generators and their generalizations but also desirable features of the discrete logarithm. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Meidl, W., & Winterhof, A. (2004). On the autocorrelation of cyclotomic generators. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2948, 1–11. https://doi.org/10.1007/978-3-540-24633-6_1
Mendeley helps you to discover research relevant for your work.