Show simple item record

dc.contributor.authorSemaev, Igoreng
dc.identifier.citationDesigns, Codes and Cryptography 1-16en_US
dc.description.abstractA system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard problem in the cryptanalysis of modern ciphers. In this paper we study new properties of the Agreeing Algorithm, which was earlier designed to solve such equations. Then we show that mathematical description of the Algorithm is translated straight into the language of electric wires and switches. Applications to the DES and the Triple DES are discussed. The new approach, at least theoretically, allows a faster key-rejecting in brute-force than with COPACOBANA.en_US
dc.rightsAttribution-NonCommercial CC BY-NCeng
dc.subjectSparse Boolean equationseng
dc.subjectEquation grapheng
dc.subjectElectrical circuitseng
dc.titleSparse Boolean equations and circuit latticeseng
dc.typePeer reviewedeng
dc.typeJournal articleeng
dc.subject.nsiVDP::Mathematics and natural science: 400eng
dc.rights.holderCopyright The Author(s) 2010. This article is published with open access at
dc.rights.holderThe Author(s) 2010eng
bora.peerreviewedPeer reviewedeng

Files in this item


This item appears in the following Collection(s)

Show simple item record

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