Linear Complexity of Designs based on  Coordinate Sequences of LRS  and  on Digital Sequences of  Matrix/Skew LRS  Coordinate Sequences  over Galois Ring

Vadim N.  Tsypyschev

Paper 2016/936 Original: eprint.iacr.org/2016/936 ↗

Linear Complexity of Designs based on Coordinate Sequences of LRS and on Digital Sequences of Matrix/Skew LRS Coordinate Sequences over Galois Ring

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 http://eprint.iacr.org/2016/212 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.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Preprint.
History: 2016-09-29: last updated; 2016-09-29: published
Short URL: https://ia.cr/2016/936
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2016/936,
      author = {Vadim N.  Tsypyschev},
      title = {Linear Complexity of Designs based on  Coordinate Sequences of LRS  and  on Digital Sequences of  Matrix/Skew LRS  Coordinate Sequences  over Galois Ring},
      howpublished = {Cryptology {ePrint} Archive, Paper 2016/936},
      year = {2016},
      url = {https://eprint.iacr.org/2016/936}
}