Paper 2006/251 Original: eprint.iacr.org/2006/251 ↗
Accelerating Cryptanalysis with the Method of Four Russians
Abstract
Solving a dense linear system of boolean equations is the final step of several cryptanalytic attacks. Examples include stream cipher cryptanalysis via XL and related algorithms, integer factorization, and attacks on the HFE public-key cryptosystem. While both Gaussian Elimination and Strassen’s Algorithm have been proposed as methods, this paper specifies an algorithm that is much faster than both in practice. Performance is formally modeled, and experimental running times are provided, including for the optimal setting of the algorithm’s parameter. The consequences for published attacks on systems are also provided. The algorithm is named Method of Four Russians for Inversion (M4RI), in honor of the matrix multiplication algorithm from which it emerged, the Method of Four Russians Multiplication (M4RM).
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2006-07-24: last updated
- 2006-07-24: published
- Short URL
- https://ia.cr/2006/251
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2006/251,
author = {Gregory V. Bard},
title = {Accelerating Cryptanalysis with the Method of Four Russians},
howpublished = {Cryptology {ePrint} Archive, Paper 2006/251},
year = {2006},
url = {https://eprint.iacr.org/2006/251}
}