Sparse Boolean equations and circuit lattices

Authors:
Igor Semaev
Affiliations:
Department of Informatics, University of Bergen, Bergen, Norway
Venue:
Designs, Codes and Cryptography
Year:
2011

Citing 10
Cited 0

Cracking DES: Secrets of Encryption Research, Wiretap Politics and Chip Design

Cracking DES: Secrets of Encryption Research, Wiretap Politics and Chip Design
Design strategies and modified descriptions to optimize cipher FPGA implementations: fast and compact results for DES and triple-DES

FPGA '03 Proceedings of the 2003 ACM/SIGDA eleventh international symposium on Field programmable gate arrays
Experience Using a Low-Cost FPGA Design to Crack DES Keys

CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
A new efficient algorithm for computing Gröbner bases without reduction to zero (F5)

Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard

Computer
Solving Multiple Right Hand Sides linear equations

Designs, Codes and Cryptography
On solving sparse algebraic equations over finite fields

Designs, Codes and Cryptography
Sparse Algebraic Equations over Finite Fields

SIAM Journal on Computing
Efficient algorithms for solving overdefined systems of multivariate polynomial equations

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Breaking ciphers with COPACOBANA –a cost-optimized parallel code breaker

CHES'06 Proceedings of the 8th international conference on Cryptographic Hardware and Embedded Systems

Quantified Score

Hi-index	0.00

Visualization

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.