Boolean feedback functions for full-length nonlinear shift registers

Authors

  • Izabela Janicka-Lipska
  • Janusz Stokłosa

DOI:

https://doi.org/10.26636/jtit.2004.4.269

Keywords:

cryptography, shift registers, Boolean functions

Abstract

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

Download data is not yet available.

Downloads

Submitted

2023-04-09

Published

2004-12-30

Issue

No. 4 (2004)

Section

ARTICLES FROM THIS ISSUE

License

Copyright (c) 2004 Journal of Telecommunications and Information Technology

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
I. Janicka-Lipska and J. Stokłosa, “Boolean feedback functions for full-length nonlinear shift registers”, JTIT, vol. 18, no. 4, pp. 28–30, Dec. 2004, doi: 10.26636/jtit.2004.4.269.

Most read articles by the same author(s)