Algebraic Equivalence Classes in AES Key Space via Weyl Group Action on GF(2^8)

We establish a rigorous algebraic framework for analyzing the AES key space through group actions on GF(2^8). By constructing G = Z_2 x Z_85 x (Z_2)^2 of order 680, we prove GF(2^8) partitions into exactly 2 equivalence classes. This yields a theoretical compression of 112 bits for AES-128 (2^128 to 2^16) and 224 bits for AES-256 (2^256 to 2^32). The compression does not constitute a practical attack without an orbit-membership oracle -- blocked by AES Wide Trail Strategy. Key contributions: (1) First Z_2 x Z_85 x (Z_2)^2 orbit decomposition on GF(2^8). (2) GF(2^8) partitions into exactly 2 non-trivial orbits under G. (3) Tight characterization of gap between compression and practical key recovery. (4) Generator g_85=0x07 links Lo-Shu cardinal encoding to finite field cryptography. Previous work: ZMLA AES-128 CPA (DOI:10.5281/zenodo.20262553).

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-05-27
DOI
https://doi.org/10.5281/zenodo.20418781
Primary Topic
Cryptography and Residue Arithmetic
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Algebraic Equivalence Classes in AES Key Space via Weyl Group Action on GF(2^8)

Yao-Kai Kao
Zenodo (CERN European Organization for Nuclear Research)
Cryptography and Residue Arithmetic
preprint

Algebraic Equivalence Classes in AES Key Space via Weyl Group Action on GF(2^8)

Yao-Kai Kao
preprint en

Abstract

We establish a rigorous algebraic framework for analyzing the AES key space through group actions on GF(2^8). By constructing G = Z_2 x Z_85 x (Z_2)^2 of order 680, we prove GF(2^8) partitions into exactly 2 equivalence classes. This yields a theoretical compression of 112 bits for AES-128 (2^128 to 2^16) and 224 bits for AES-256 (2^256 to 2^32). The compression does not constitute a practical attack without an orbit-membership oracle -- blocked by AES Wide Trail Strategy. Key contributions: (1) First Z_2 x Z_85 x (Z_2)^2 orbit decomposition on GF(2^8). (2) GF(2^8) partitions into exactly 2 non-trivial orbits under G. (3) Tight characterization of gap between compression and practical key recovery. (4) Generator g_85=0x07 links Lo-Shu cardinal encoding to finite field cryptography. Previous work: ZMLA AES-128 CPA (DOI:10.5281/zenodo.20262553).

Zenodo (CERN European Organization for Nuclear Research)
Allen Institute for Brain Science (US)
Cryptography and Residue Arithmetic
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.