Welcome to the resource topic for 2016/936
Title:
Linear Complexity of Designs based on Coordinate Sequences of LRS and on Digital Sequences of Matrix/Skew LRS Coordinate Sequences over Galois Ring
Authors: Vadim N. Tsypyschev
Abstract:This article continues investigation of ways to obtain pseudo-random sequences over Galois field via generating LRS over Galois ring and complication it. Previous work is available at Low Linear Complexity Estimates for Coordinate Sequences of Linear Recurrences of Maximal Period over Galois Ring In this work we provide low rank estimations for sequences generated by two different designs based on coordinate sequences of linear recurrent sequences (LRS) of maximal period (MP) over Galois ring R=GR(p^n,r), p\ge 5, r\ge2, with numbers s such that s=kr+2, k\in \mathbb{N}_0, and based on digital sequences of coordinate sequences of matrix/skew MP LRS over such Galois rings.
ePrint: https://eprint.iacr.org/2016/936
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .