RUS  ENG
Full version
JOURNALS // Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] // Archive

Mat. Vopr. Kriptogr., 2014 Volume 5, Issue 2, Pages 29–35 (Mi mvk114)

Reconstruction of a linear recurrence of maximal period over a Galois ring of characteristic $p^3$ by its highest digital sequence

D. N. Bylkov

LLC "Certification Research Center", Moscow

Abstract: Sequences $w$ over a field $GF(q)$, $q=p^r$, $p>2$, obtained by highest digit sequence of linear recurrent sequences $u$ over a Galois ring $R=GR(q^3,p^3)$ in some digit set are considered. The conditions guaranteeing the uniqueness of reconstruction of $u$ given $w$ is studied.

Key words: linear recurrent sequences, most significant bit sequences, complexity of linear recurrences.

UDC: 511.216+519.719.2

Received 25.IX.2013

Language: English

DOI: 10.4213/mvk114



© Steklov Math. Inst. of RAS, 2024