Constructing a Ternary FCSR with a Given Connection Integer

Lin Zhiqiang; Pei Dingyi

Paper 2011/358

Constructing a Ternary FCSR with a Given Connection Integer

Lin Zhiqiang and Pei Dingyi

Abstract

FCSRs have been proposed as an alternative to LFSRs for the design of stream ciphers. In 2009, a new "ring" representation of FCSRs was presented. This new representation preserves the statistical properties and circumvents the weaknesses of the Fibonacci and the Galois FCSRs. Moreover an extension of the ring FCSRs called ternary FCSRs has been proposed. They are suitable for hardware and software implementations of FCSRs. In this paper, we show a method of constructing a ternary FCSR with a given connection integer for hardware implementation. The construction is simple and convenient. And the ternary FCSRs we get are able to meet the hardware criteria.

Metadata

Available format(s): PDF
Publication info: Published elsewhere. Unknown where it was published
Keywords: stream cipher 2-adic integer FCSRs ring FCSRs $l$-sequences
Contact author(s): linzhiqiang0824 @ yahoo cn
History: 2012-05-10: revised; 2011-07-04: received; See all versions
Short URL: https://ia.cr/2011/358
License: CC BY

BibTeX

@misc{cryptoeprint:2011/358,
      author = {Lin Zhiqiang and Pei Dingyi},
      title = {Constructing a Ternary {FCSR} with a Given Connection Integer},
      howpublished = {Cryptology {ePrint} Archive, Paper 2011/358},
      year = {2011},
      url = {https://eprint.iacr.org/2011/358}
}