Oracle-Based Multistep Strategy for Solving Polynomial Systems Over Finite Fields and Algebraic Cryptanalysis of the Aradi Cipher

TL;DR

This paper introduces an oracle-based multistep strategy for solving polynomial systems over finite fields, enhancing algebraic cryptanalysis techniques and successfully attacking the Aradi cipher.

Contribution

It presents a new depth-first search formulation, a unified oracle function concept, and applies these to cryptanalyze the Aradi cipher.

Findings

Effective algebraic attack on Aradi cipher

Unification of multistep strategies via oracle functions

Novel complexity analysis using tree structures

Abstract

The multistep solving strategy consists in a divide-and-conquer approach: when a multivariate polynomial system is computationally infeasible to solve directly, one variable is assigned over the elements of the base finite field, and the procedure is recursively applied to the resulting simplified systems. In a previous work by the same authors (among others), this approach proved effective in the algebraic cryptanalysis of the Trivium cipher. In this paper, we present a new formulation of the corresponding algorithm based on a Depth-First Search strategy, along with a novel complexity analysis leveraging tree structures. We also introduce the notion of an ``oracle function'', which is intended to determine whether evaluating a new variable is required to simplify the current polynomial system. This notion allows us to unify all previously proposed variants of the multistep strategy, including the classical hybrid approach, by appropriately selecting the oracle function. Finally, we employ the multistep solving strategy in the cryptanalysis of the NSA's recently introduced low-latency block cipher Aradi, achieving a first full-round algebraic attack that exposes structural features in its symbolic model.