Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Algebraic Attacks against Grendel: An Arithmetization-Oriented Primitives with the Legendre Symbol

Version 1 : Received: 20 June 2023 / Approved: 21 June 2023 / Online: 21 June 2023 (08:35:04 CEST)

A peer-reviewed article of this Preprint also exists.

Ni, J.; Zhang, J.; Wang, G.; Li, R.; Shen, Y. Algebraic Attacks against Grendel: An Arithmetization-Oriented Primitive with the Legendre Symbol. Symmetry 2023, 15, 1563. Ni, J.; Zhang, J.; Wang, G.; Li, R.; Shen, Y. Algebraic Attacks against Grendel: An Arithmetization-Oriented Primitive with the Legendre Symbol. Symmetry 2023, 15, 1563.

Abstract

Modern cryptographic protocols such as zero-knowledge proofs and secure multi-party computation have increased the demand for a novel category of symmetric primitives. These primitives are not optimized for traditional platforms such as servers, microcontrollers, and desktop computers but rather for their ability to be implemented in arithmetic circuits. To enable efficient arithmetic operations, they define operations over larger finite fields and use low-degree invertible functions to construct their non-linear layers. Grendel is an arithmetization-oriented permutation that leverages the Legendre Symbol to enhance the growth of algebraic degrees in its non-linear layer. In this paper, we present a preimage attack on the sponge hash function instantiated with the full rounds of the Grendel permutation using algebraic methods. We introduce a technique that allows us to eliminate two full rounds of substitution permutation networks (SPN) in the sponge hash function with minimal or no additional cost. This method can be combined with univariate root-finding techniques and Gröbner basis attacks to break the number of rounds claimed by the designers. By utilizing this strategy, our attack achieves an improvement of two additional rounds compared to the previous state-of-the-art attack. While not breaking its security margin, it allows us to further understand the design and analysis of such cryptographic primitives.

Keywords

Arithmetization-oriented hash functions; Legendre Symbol; Preimage attack; Algebraic cryptanalysis; Gröbner basis; Grendel

Subject

Computer Science and Mathematics, Other

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.