Basis Rigidity of the AES S-box and Generic Rigidity of Inversion under Affine Transformations

• URL: http://arxiv.org/abs/2609.13644v1
• Date: Sat, 12 Sep 2026 01:47:26 GMT
• Title: Basis Rigidity of the AES S-box and Generic Rigidity of Inversion under Affine Transformations
• Abstract summary: We show that the linear part of the AES S-box affine transformation alone makes the transformed inversion map basis rigid.<n>The existence of a nontrivial linear stabilizer is reduced to a conjugacy problem for semilinear candidates.
• Score: 8.640569733631528
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The AES S-box is constructed from finite field inversion followed by a fixed affine transformation. Since inversion possesses intrinsic Frobenius symmetries among its coordinate realizations, we study how these basis symmetries are altered by outer affine transformations. We first develop a deterministic rigidity criterion for transformed inversion and apply it to the AES S-box. This shows that the linear part of the AES S-box affine transformation alone makes the transformed inversion map basis rigid. We then investigate the corresponding generic problem when the outer invertible linear transformation varies. The existence of a nontrivial linear stabilizer is reduced to a conjugacy problem for semilinear candidates arising from two sided linear equivalences of inversion, which we characterize in terms of relative norms and Frobenius orbits. We also determine the dimensions of the associated centralizer algebras exactly. These structural results imply that, for a uniformly chosen outer linear transformation, the probability that the linear stabilizer is nontrivial is bounded by $2^{-Ω(n^2)}$, with sharper finite dimensional bounds obtained from the exact conjugacy condition. Computational experiments independently verify the AES rigidity result, the conjugacy and centralizer formulas, and the finite dimensional estimates in small dimensions.

Related papers

• Geometric Analysis of Variational Quantum Eigensolver [8.743290038942542]
  Variational Quantum Eigensolver (VQE) is a fundamental algorithm in quantum computing.<n>In this paper, we establish a geometric analysis of VQE in terms of optimization landscape, initialization guarantee, and noise robustness.
  arXiv  Detail & Related papers  (2026-05-27T00:31:18Z)
• Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness [8.113729514518495]
  The Euclidean Distance Matrix Completion problem arises in a broad range of applications, including sensor network localization, molecular robustness, and manifold learning.<n>In this paper, we propose a low-rank matrix completion task over the space of positive semi-definite Gram matrices.<n>The available distance measurements are encoded as expansion coefficients in a non-orthogonal basis, and optimization over the Gram matrix implicitly enforces geometric consistency through nonnegativity and the triangle inequality.
  arXiv  Detail & Related papers  (2025-07-31T18:40:42Z)
• Generalized Linear Mode Connectivity for Transformers [87.32299363530996]
  A striking phenomenon is linear mode connectivity (LMC), where independently trained models can be connected by low- or zero-loss paths.<n>Prior work has predominantly focused on neuron re-ordering through permutations, but such approaches are limited in scope.<n>We introduce a unified framework that captures four symmetry classes: permutations, semi-permutations, transformations, and general invertible maps.<n>This generalization enables, for the first time, the discovery of low- and zero-barrier linear paths between independently trained Vision Transformers and GPT-2 models.
  arXiv  Detail & Related papers  (2025-06-28T01:46:36Z)
• Entropic Mirror Descent for Linear Systems: Polyak's Stepsize and Implicit Bias [55.72269695392027]
  This paper focuses on applying entropic mirror descent to solve linear systems.<n>The main challenge for the convergence analysis stems from the unboundedness of the domain.<n>To overcome this without imposing restrictive assumptions, we introduce a variant of Polyak-type stepsizes.
  arXiv  Detail & Related papers  (2025-05-05T12:33:18Z)
• Information geometry and entanglement under phase-space deformation through nonsymplectic congruence transformation [0.0]
  The geometry of a quantum state can be envisaged through the Fisher-Rao (FR) information matrix.<n>We investigate whether this isometry affects the entanglement in the bipartite system.<n>It turns out that, even a simple choice of a congruence transformation, induces the entanglement in a bipartite Gaussian system.
  arXiv  Detail & Related papers  (2025-05-04T21:52:51Z)
• RLE: A Unified Perspective of Data Augmentation for Cross-Spectral Re-identification [59.5042031913258]
  Non-linear modality discrepancy mainly comes from diverse linear transformations acting on the surface of different materials. We propose a Random Linear Enhancement (RLE) strategy which includes Moderate Random Linear Enhancement (MRLE) and Radical Random Linear Enhancement (RRLE) The experimental results not only demonstrate the superiority and effectiveness of RLE but also confirm its great potential as a general-purpose data augmentation for cross-spectral re-identification.
  arXiv  Detail & Related papers  (2024-11-02T12:13:37Z)
• EqNIO: Subequivariant Neural Inertial Odometry [33.96552018734359]
  We show that IMU data transforms equivariantly, when rotated around the gravity vector and reflected with respect to arbitrary planes parallel to gravity. We then map the IMU data into this frame, thereby achieving an invariant canonicalization that can be directly used with off-the-shelf inertial odometry networks.
  arXiv  Detail & Related papers  (2024-08-12T17:42:46Z)
• $σ$-PCA: a building block for neural learning of identifiable linear transformations [0.0]
  $sigma$-PCA is a method that formulates a unified model for linear and nonlinear PCA. nonlinear PCA can be seen as a method that maximizes both variance and statistical independence.
  arXiv  Detail & Related papers  (2023-11-22T18:34:49Z)
• Ridge Estimation with Nonlinear Transformations [3.1406146587437904]
  We show the inclusion relationship between ridges: $cR(fcirc p)subseteq cR(p)$. We also show that the Hausdorff distance between $cR(fcirc p)$ and its projection onto $cM$ is smaller than the Hausdorff distance between $cR(p)$ and the corresponding projection.
  arXiv  Detail & Related papers  (2023-06-09T07:38:38Z)
• Equivariant Disentangled Transformation for Domain Generalization under Combination Shift [91.38796390449504]
  Combinations of domains and labels are not observed during training but appear in the test environment. We provide a unique formulation of the combination shift problem based on the concepts of homomorphism, equivariance, and a refined definition of disentanglement.
  arXiv  Detail & Related papers  (2022-08-03T12:31:31Z)
• Unified Fourier-based Kernel and Nonlinearity Design for Equivariant Networks on Homogeneous Spaces [52.424621227687894]
  We introduce a unified framework for group equivariant networks on homogeneous spaces. We take advantage of the sparsity of Fourier coefficients of the lifted feature fields. We show that other methods treating features as the Fourier coefficients in the stabilizer subgroup are special cases of our activation.
  arXiv  Detail & Related papers  (2022-06-16T17:59:01Z)
• Inverse Learning of Symmetries [71.62109774068064]
  We learn the symmetry transformation with a model consisting of two latent subspaces. Our approach is based on the deep information bottleneck in combination with a continuous mutual information regulariser. Our model outperforms state-of-the-art methods on artificial and molecular datasets.
  arXiv  Detail & Related papers  (2020-02-07T13:48:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.