Solving Multiple Right Hand Sides linear equations

Authors:
Håvard Raddum;Igor Semaev
Affiliations:
Department of Informatics, University of Bergen, Bergen, Norway;Department of Informatics, University of Bergen, Bergen, Norway
Venue:
Designs, Codes and Cryptography
Year:
2008

Citing 7
Cited 6

The Design of Rijndael

The Design of Rijndael
The Security of Hidden Field Equations (HFE)

CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Cryptanalysis of Block Ciphers with Overdefined Systems of Equations

ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
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
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
Algebraic attacks on stream ciphers with linear feedback

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Small scale variants of the AES

FSE'05 Proceedings of the 12th international conference on Fast Software Encryption

Solving equation systems by agreeing and learning

WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
Sparse Boolean equations and circuit lattices

Designs, Codes and Cryptography
PET SNAKE: a special purpose architecture to implement an algebraic attack in hardware

Transactions on computational science X
Analysis of trivium using compressed right hand side equations

ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
Solving compressed right hand side equation systems with linear absorption

SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications
ElimLin algorithm revisited

FSE'12 Proceedings of the 19th international conference on Fast Software Encryption

Quantified Score

Hi-index	0.03

Visualization

Abstract

A new method for solving algebraic equation systems common in cryptanalysis is proposed. Our method differs from the others in that the equations are not represented as multivariate polynomials, but as a system of Multiple Right Hand Sides linear equations. The method was tested on scaled versions of the AES. The results overcome significantly what was previously achieved with Gröbner Basis related algorithms.