SearcharxivSearch

arXiv · 2603.11833

An Introduction to Torsors in Mathematics with a View Toward $\Sigma$-Protocols in Cryptography

Abstract

This paper provides a preparatory introduction to torsors, written with a view toward later applications in the author's work. Rather than aiming at a comprehensive survey, the exposition focuses on those aspects of torsors that are most useful for understanding torsor-based reasoning: group actions, orbits, free transitive actions, the absence of a canonically chosen origin, and the interpretation of group elements as transports between points. After developing the basic definition and several elementary examples, we emphasize a central theme: torsors are not only characterized abstractly by free transitive group actions, but also arise naturally as objects obtained by gluing local trivial pieces by means of transition data satisfying cocycle conditions. A brief optional section indicates a sheaf- and topos-theoretic perspective. In the final part, we explain how these ideas prepare the ground for later conceptual applications, including aspects of $\Sigma$-protocols.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Takao Inoué. 2026-03-12. An Introduction to Torsors in Mathematics with a View Toward $\Sigma$-Protocols in Cryptography. https://arxiv.org/abs/2603.11833

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR