Cryptology ePrint Archive: Report 2009/252

Sparse Boolean equations and circuit lattices

Igor Semaev

Abstract: A 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.

Category / Keywords: sparse Boolean equations, equations graph, electrical circuits, switches

Publication Info: modified version of the paper was presented at WCC09

Date: received 31 May 2009, last revised 27 Jul 2009

Contact author: igor at ii uib no

Available format(s): PDF | BibTeX Citation

Note: a reference has been added

Version: 20090727:143643 (All versions of this report)

Short URL: ia.cr/2009/252

Discussion forum: Show discussion | Start new discussion