On the cycle decomposition of the WG-NLFSR

YUjuan Li; Wnehua Shen; Huaifu Wang; Peipei Zhou

Paper 2014/657

On the cycle decomposition of the WG-NLFSR

YUjuan Li, Wnehua Shen, Huaifu Wang, and Peipei Zhou

Abstract

Recently, Kalikinkar Mandal and Guang Gong presented a family of nonlinear pseudorandom number generators using Welch-Gong Transformations in their paper [6]. They also performed the cycle decomposition of the WG-NLFSR recurrence relations over different finite fields by computer simulations where the nonlinear recurrence relation is composed of a characteristic polynomial and a WG permutation. In this paper, we mainly prove that the state transition transformation of the WG-NLFSR is an even permutation. We also prove that the number of the cycles in the cycle decomposition of WG-NLFSR is even. And we apply our results to the filtering WG7-NLFSR to prove that the period of the sequences generated by WG7-NLFSR can not be maximum.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Preprint. MINOR revision.
Contact author(s): liyj @ amss ac cn
History: 2014-08-27: received
Short URL: https://ia.cr/2014/657
License: CC BY

BibTeX

@misc{cryptoeprint:2014/657,
      author = {YUjuan Li and Wnehua Shen and Huaifu Wang and Peipei Zhou},
      title = {On the cycle decomposition of the {WG}-{NLFSR}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2014/657},
      year = {2014},
      url = {https://eprint.iacr.org/2014/657}
}