Cryptology ePrint Archive: Report 2016/212

Low Linear Complexity Estimates for Coordinate Sequences of Linear Recurrences of Maximal Period over Galois Ring

Vadim N.Tsypyschev

Abstract: In this work we provide low rank estimations for 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$.

Category / Keywords: secret-key cryptography / linear recurrent sequence, linear complexity/rank estimations, pseudo-random sequences.

Date: received 26 Feb 2016

Contact author: tsypyschev at yandex ru

Available format(s): PDF | BibTeX Citation

Note: This work follows up previous one available at IACR e-print Archive, 2015/1040

Version: 20160229:212956 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]