A Symmetric-Key Cryptosystem Based on the Burnside Ring of a Compact Lie Group

• URL: http://arxiv.org/abs/2510.10901v1
• Date: Mon, 13 Oct 2025 01:57:22 GMT
• Title: A Symmetric-Key Cryptosystem Based on the Burnside Ring of a Compact Lie Group
• Authors: Ziad Ghanem,
• Abstract summary: We propose a symmetric-key cryptosystem whose linear action takes place instead in the Burnside ring $A(G)$ of a compact Lie group $G$.<n>Messages of arbitrary finite length are encoded as finitely supported elements of $A(G)$ and encrypted via the Burnside product with $k$.<n>We show that any finite set of observations constrains the action only on a finite-rank submodule $W_Lsubset A(O(2))$, and we show information-theoretic non-identifiability of the key from such data.
• Score: 0.0
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: Classical linear ciphers, such as the Hill cipher, operate on fixed, finite-dimensional modules and are therefore vulnerable to straightforward known-plaintext attacks that recover the key as a fully determined linear operator. We propose a symmetric-key cryptosystem whose linear action takes place instead in the Burnside ring $A(G)$ of a compact Lie group $G$, with emphasis on the case $G=O(2)$. The secret key consists of (i) a compact Lie group $G$; (ii) a secret total ordering of the subgroup orbit-basis of $A(G)$; and (iii) a finite set $S$ of indices of irreducible $G$-representations, whose associated basic degrees define an involutory multiplier $k\in A(G)$. Messages of arbitrary finite length are encoded as finitely supported elements of $A(G)$ and encrypted via the Burnside product with $k$. For $G=O(2)$ we prove that encryption preserves plaintext support among the generators $\{(D_1),\dots,(D_L),(SO(2)),(O(2))\}$, avoiding ciphertext expansion and security leakage. We then analyze security in passive models, showing that any finite set of observations constrains the action only on a finite-rank submodule $W_L\subset A(O(2))$, and we show information-theoretic non-identifiability of the key from such data. Finally, we prove the scheme is \emph{not} IND-CPA secure, by presenting a one-query chosen-plaintext distinguisher based on dihedral probes.

Related papers

• Cryptographic transformations over polyadic rings [3.0860863056832826]
  cryptosystems rely on binary operations within groups, rings, or fields.<n>We propose a shift to polyadic rings, which generalize classical rings by allowing operations of higher arity.<n>We present two concrete encryption procedures that leverage this structure.
  arXiv  Detail & Related papers  (2025-12-14T07:15:55Z)
• Group Representational Position Encoding [66.33026480082025]
  We present GRAPE, a unified framework for positional encoding based on group actions.<n>Two families of mechanisms: (i) multiplicative rotations (Multiplicative GRAPE) in $mathrmSO(d)$ and (ii) additive logit biases (Additive GRAPE) arising from unipotent actions in the general linear group $mathrmGL$.
  arXiv  Detail & Related papers  (2025-12-08T18:39:13Z)
• Non-representable quantum measures [55.2480439325792]
  Grade-$d$ measures on a $sigma$-algebra $mathcalAsubseteq 2X$ over a set $X$ are generalizations of measures satisfying one of a hierarchy of weak additivity-type conditions.<n>Every signed polymeasure $lambda$ on $(X,mathcalA)d$ produces a grade-$d$ measure as its diagonal $widetildelambda(A):=lambda(A,cdots,A)$.
  arXiv  Detail & Related papers  (2025-08-20T00:47:24Z)
• Compact Lattice-Coded (Multi-Recipient) Kyber without CLT Independence Assumption [4.317605401561789]
  This work presents a joint design of encoding and encryption procedures for public key encryptions (PKEs) and key encapsulation mechanism (KEMs) such as Kyber.<n>Our design features two techniques: ciphertext packing and lattice packing.<n>Both DFR and CER are greatly decreased thanks to ciphertext packing and lattice packing.
  arXiv  Detail & Related papers  (2025-04-24T01:39:36Z)
• Towards a Sharp Analysis of Offline Policy Learning for $f$-Divergence-Regularized Contextual Bandits [49.96531901205305]
  We analyze $f$-divergence-regularized offline policy learning.<n>For reverse Kullback-Leibler (KL) divergence, we give the first $tildeO(epsilon-1)$ sample complexity under single-policy concentrability.<n>We extend our analysis to dueling bandits, and we believe these results take a significant step toward a comprehensive understanding of $f$-divergence-regularized policy learning.
  arXiv  Detail & Related papers  (2025-02-09T22:14:45Z)
• Optimal Computational Secret Sharing [51.599517747577266]
  In $(t, n)$-threshold secret sharing, a secret $S$ is distributed among $n$ participants.<n>We present a construction achieving a share size of $tfrac|S|t + |K|t$.
  arXiv  Detail & Related papers  (2025-02-04T23:37:16Z)
• A Construction of Evolving $k$-threshold Secret Sharing Scheme over A Polynomial Ring [55.17220687298207]
  The threshold secret sharing scheme allows the dealer to distribute the share to every participant that the secret is correctly recovered from a certain amount of shares. We propose a brand-new construction of evolving $k$-threshold secret sharing scheme for an $ell$-bit secret over a ring, with correctness and perfect security.
  arXiv  Detail & Related papers  (2024-02-02T05:04:01Z)
• Efficient quantum algorithms for some instances of the semidirect discrete logarithm problem [2.90985742774369]
  We show that the SDLP is even easier in some important special cases. We show that SPDH-Sign and similar cryptosystems whose security assumption is based on the presumed hardness of the SDLP are insecure against quantum attacks.
  arXiv  Detail & Related papers  (2023-12-21T16:58:59Z)
• Quantum forgery attacks against OTR structures based on Simon's algorithm [3.845166861382186]
  A quantum forgery attack on OTR structure using Simon's algorithm is proposed. A variant of OTR structure (Pr/ost-OTR-Even-Mansour structure) is proposed. It is easy to generate the correct tag of any given message if attacker is allowed to change a single block in it.
  arXiv  Detail & Related papers  (2023-10-01T15:16:43Z)
• Online Learning with Adversaries: A Differential-Inclusion Analysis [52.43460995467893]
  We introduce an observation-matrix-based framework for fully asynchronous online Federated Learning with adversaries. Our main result is that the proposed algorithm almost surely converges to the desired mean $mu.$ We derive this convergence using a novel differential-inclusion-based two-timescale analysis.
  arXiv  Detail & Related papers  (2023-04-04T04:32:29Z)
• Publicly-Verifiable Deletion via Target-Collapsing Functions [81.13800728941818]
  We show that targetcollapsing enables publiclyverifiable deletion (PVD) We build on this framework to obtain a variety of primitives supporting publiclyverifiable deletion from weak cryptographic assumptions.
  arXiv  Detail & Related papers  (2023-03-15T15:00:20Z)
• Formation of Exceptional Points in pseudo-Hermitian Systems [0.0]
  We study the emergency of singularities called Exceptional Points ($textitEP$s) in the eigenspectrum of pseudo-Hermitian Hamiltonian as the strength of Hermiticity-breaking terms turns on. Our analysis is accompanied by a detailed study of $textitEP$s appearance in an exemplary $mathcalPmathcalT$-symmetric pseudo-Hermitian system.
  arXiv  Detail & Related papers  (2023-02-28T15:35:35Z)
• On Compression Functions over Groups with Applications to Homomorphic Encryption [0.43512163406552007]
  Homomorphic encryption (FHE) enables an entity to perform arbitrary computation without decrypting encrypted data.<n>We show that such a function does not exist over any solvable group $G$.<n>We also construct such a function over the alternating group $G = A_5$ that has a shortest possible expression.
  arXiv  Detail & Related papers  (2022-08-04T05:29:40Z)

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.