The study focuses on Gröbner basis attacks on cryptographic polynomial systems, particularly iterated polynomial systems, which are standard models for symmetric ciphers and hash functions. The author extends an established measure of complexity, the solving degree, to these systems, proving bounds for attacks on various designs. The study also reveals that under certain conditions, the solving degree can never surpass a certain threshold, a desirable property for cryptographic polynomial systems.
Publication date: 5 Oct 2023
Project Page: https://arxiv.org/abs/2310.03637v1
Paper: https://arxiv.org/pdf/2310.03637
