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

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.

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

A new, two-step approach to the construction of highly nonlinear S-boxes, with group-theoretic underpinnings, and is incorporated into a multi-round grayscale image-encryption scheme based on fixed S-box substitution, key- and nonce-dependent position permutation, SHA-256-based keystream whitening, and a final bidirect...

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

The proposed 8×8 S-box is proposed based on an AES-inspired inverse-affine construction that simultaneously modifies the irreducible polynomial, the nonsingular affine matrix, and the constant vector to generate a different substitution table over GF.

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...

A Quasidifferential Analysis of the Wrong-Key Randomization Hypothesis

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...