Loading…
Matrix parametrized shift registers
High speed pseudorandom sequence generators have played roles in an array of applications in communications, cryptography, and computing. At the heart of many of these generators are shift registers of various types. Researchers have studied linear feedback shift registers (LFSRs), feedback with car...
Saved in:
Published in: | Cryptography and communications 2018-03, Vol.10 (2), p.369-382 |
---|---|
Main Author: | |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | High speed pseudorandom sequence generators have played roles in an array of applications in communications, cryptography, and computing. At the heart of many of these generators are shift registers of various types. Researchers have studied linear feedback shift registers (LFSRs), feedback with carry shift registers (FCSRs), and various generalizations such as ring FCSRS and algebraic feedback shift registers. The analysis of these sequence generators typically proceeds by defining an algebraic structure on the set of infinite output sequences, based on a choice of uniformizing parameter (e.g., power series for LFSRs,
N
-adic numbers for FCSRs). In this paper we introduce a new generalization of FCSRs in which the uniformizing parameter
N
∈
ℤ
is replaced by a square matrix,
T
, resulting in what we call
T-generators
. We describe an algebraic structure, the
T
-adic numbers, and use it to study the periodicity of
T
-generators. |
---|---|
ISSN: | 1936-2447 1936-2455 |
DOI: | 10.1007/s12095-017-0226-9 |