Paper 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.

Note: 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

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
linear recurrent sequencelinear complexityrank estimationspseudo-random sequencesmatrix linear recurrent sequencematrix linear congruent generatorskew linear recurrent sequence
Contact author(s)
tsypyschev @ yandex ru
History
2016-09-29: received
Short URL
https://ia.cr/2016/936
License
Creative Commons Attribution
CC BY

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},
      note = {\url{https://eprint.iacr.org/2016/936}},
      url = {https://eprint.iacr.org/2016/936}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.