Skip to content

Cryptanalysis of 7-Round AES via the Algebraic Structure of its S-box

· 0 citations · 14 references

TL;DR

Improvements are presented that reduce the time required to calculate the invert-then-affine-transform structure of the AES S-box and reduce the number of key guesses required, something that was particularly important because these improvements were discovered autonomously via a large language model fully end to end.

View source

Similar papers

Peeling Nonlinear Layers: Algebraic Cryptanalysis of Full-Round Iasta

This work presents the first third-party cryptanalysis of the full-round Iasta -3 and Iasta -4 instances and further extend the approach to Iasta -5, exploiting the restricted randomness and structured construction of the nonce-dependent affine-layer matrices.

Chandan Dey, Abul Kalam, SantanuSarkar · 0 citations
Open access Sep 2026

A two-stage algebraic framework for designing cryptographically strong S-boxes for secure image encryption

The security of modern block ciphers heavily relies on the cryptographic strength of Substitution boxes (S-boxes), which introduce non-linearity and confusion. While numerous methods for S-box generation exist, there is a continuous pursuit of designs that offer a superior and balanced profile against various cryptanal...

A. Razzaque, Hafiza Zara Mustafa, Dilshad Alghazzawi et al. · 0 citations
Open access Aug 2026

An AES-inspired Construction of a Cryptographically Strong 8×8 S-box Using Modified Algebraic and Affine Parameters

Substitution boxes (S-boxes) are essential nonlinear components in symmetric-key block ciphers and play a central role in providing resistance against linear and differential cryptanalytic attacks. In this paper, a new 8×8 S-box is proposed based on an AES-inspired inverse-affine construction. Unlike the standard AES...

J. Abdurazzokov · 0 citations
Open access Sep 2026

Cryptanalysis of a Reduced-Round IDEA Cipher Using Z3 Solver

We formulate key recovery for the International Data Encryption Algorithm (IDEA) as a quantifier-free bit-vector satisfiability problem. The IDEA is a 64-bit block cipher with a 128-bit key whose round function combines multiplication modulo 2^16+1, addition modulo 2^16, and XOR. The model includes the 25-bit cyclic ke...

Praveen Kumar Gundaram · 0 citations
Preprint Sep 2026

Compressed Permutation Oracles Revisited

The compressed permutation oracle has been used to analyze the quantum security of a number of cryptographic constructions which resisted prior techniques. However, these analyses were fundamentally limited by the poor soundness of the method: the technique was proven sound only up to $O(N^{1/12})$ queries to permutati...

Joseph Carolan, Christian Majenz · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.