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

Mat. Vopr. Kriptogr., 2013 Volume 4, Issue 1, Pages 5–25 (Mi mvk71)

This article is cited in 1 paper

On the solution of some classes of Boolean equations systems of recurrent type

G. V. Balakin

Academy of Cryptography of the Russian Federation, Moscow

Abstract: Systems of Boolean equations of recurrent type are considered. We concentrate mainly on systems generated by the three-term recurrent equation. In particular, a method of noisy recurrent sequence reconstruction is proposed; this method is based on the solution of pseudo-Boolean linear equations and inequalities. Concrete examples are provided.

Key words: Boolean equations, pseudo-Boolean linear equations and inequalities, recurrent sequence.

UDC: 519.212.2

Received 20.IV.2012

DOI: 10.4213/mvk71



© Steklov Math. Inst. of RAS, 2024