Show simple item record

dc.contributor.authorSchilling, Thorsten Ernsteng
dc.contributor.authorZajac, Pavoleng
dc.PublishedTatra Mountains Mathematical Publications 45: 93–105eng
dc.description.abstractMany problems, including algebraic cryptanalysis, can be transformed to a problem of solving a (large) system of sparse Boolean equations. In this article we study 2 algorithms that can be used to remove some redundancy from such a system: Agreeing, and Syllogism method. Combined with appropriate guessing strategies, these methods can be used to solve the whole system of equations. We show that a phase transition occurs in the initial reduction of the randomly generated system of equations. When the number of (partial) solutions in each equation of the system is binomially distributed with probability of partial solution p, the number of partial solutions remaining after the initial reduction is very low for p’s below some threshold pt, on the other hand for p > pt the reduction only occurs with a quickly diminishing probability.en_US
dc.publisherVersita Openen_US
dc.rightsAttribution-NonCommercial-NoDerivs CC BY-NC-NDeng
dc.subjectAlgebraic cryptanalysiseng
dc.subjectBoolean equationseng
dc.subjectSAT problemeng
dc.titlePhase Transition in a System of Random Sparse Boolean Equationsen_US
dc.typePeer reviewed
dc.rights.holderCreative Commons Public License.en_US

Files in this item


This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs CC BY-NC-ND
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs CC BY-NC-ND