Paper 2024/992 Original: eprint.iacr.org/2024/992 ↗
An analysis of the Crossbred Algorithm for the MQ Problem
Abstract
The Crossbred algorithm is currently the state-of-the-art method for solving overdetermined multivariate polynomial systems over $\mathbb{F}_2$. Since its publication in 2015, several record breaking implementations have been proposed and demonstrate the power of this hybrid approach. Despite these practical results, the complexity of this algorithm and the choice of optimal parameters for it are difficult open questions. In this paper, we prove a bivariate generating series for potentially admissible parameters of the Crossbred algorithm.
Metadata
- Available format(s)
PDF- Category
- Attacks and cryptanalysis
- Publication info
- Preprint.
- History
- 2024-10-10: last updated
- 2024-06-19: published
- Short URL
- https://ia.cr/2024/992
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2024/992,
author = {Damien Vidal and Sorina Ionica and Claire Delaplace},
title = {An analysis of the Crossbred Algorithm for the MQ Problem},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/992},
year = {2024},
url = {https://eprint.iacr.org/2024/992}
}