Boolean feedback functions for full-length nonlinear shift registers
DOI:
https://doi.org/10.26636/jtit.2004.4.269Keywords:
cryptography, shift registers, Boolean functionsAbstract
In the paper a heuristic algorithm for a random generation of feedback functions for Boolean full-length shift register sequences is presented. With the help of the algorithm one can generate n-stage Boolean full-length shift register sequences for (potentially) arbitrary n ≥ 6. Some properties of the generated feedback functions are presented.
Downloads
References
[1] T. Etzion and A. Lempel, "Algorithms for the generation of full-length shift register sequences", IEEE Trans. Inform. Theory, vol. IT-30, no. 3, pp. 480-484, 1984.
View in Google Scholar
[2] H. Fredricksen, "A survey of full-length nonlinear shift registers cycle algorithms", SIAM Rev., vol. 24, no. 2, pp. 195-221, 1982.
View in Google Scholar
[3] T. Gajewski, I. Janicka-Lipska, and J. Stokłosa, "The FSR-255 family of hash functions with variable length of hash result", in Artificial Intelligence and Security in Computing Systems, J. Sołdek and L. Drobiazgiewicz, Eds. Boston: Kluwer, 2003, pp. 239-248.
View in Google Scholar
[4] W. Meier and O. Staffelbach, "Nonlinearity criteria for cryptographic functions", in Advances in Cryptology - EUROCRYPT'89, J.-J. Quisquater and J. Vandewalle, Eds., LNCS. Berlin: Springer, 1990, vol. 434, pp. 549-562.
View in Google Scholar
Downloads
Submitted
Published
Issue
Section
License
Copyright (c) 2004 Journal of Telecommunications and Information Technology
This work is licensed under a Creative Commons Attribution 4.0 International License.
