Please use this identifier to cite or link to this item:
|Title:||On the autocorrelation of cyclotomic generators||Authors:||Meidl, W.
|Issue Date:||2004||Citation:||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. ScholarBank@NUS Repository.||Abstract:||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.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/132769||ISSN:||03029743|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Apr 19, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.