English

Partitioning $\mathbb{Z}_{sp}$ in finite fields and groups of trees and cycles

Cryptography and Security 2025-10-20 v1 Group Theory Number Theory

Abstract

This paper investigates the algebraic and graphical structure of the ring Zsp\mathbb{Z}_{sp}, with a focus on its decomposition into finite fields, kernels, and special subsets. We establish classical isomorphisms between Fs\mathbb{F}_s and pFsp\mathbb{F}_s, as well as pFsp\mathbb{F}_s^{\star} and pFs+1,p\mathbb{F}_s^{+1,\star}. We introduce the notion of arcs and rooted trees to describe the pre-periodic structure of Zsp\mathbb{Z}_{sp}, and prove that trees rooted at elements not divisible by ss or pp can be generated from the tree of unity via multiplication by cyclic arcs. Furthermore, we define and analyze the set Dsp\mathbb{D}_{sp}, consisting of elements that are neither multiples of ss or pp nor "off-by-one" elements, and show that its graph decomposes into cycles and pre-periodic trees. Finally, we demonstrate that every cycle in Zsp\mathbb{Z}_{sp} contains inner cycles that are derived predictably from the cycles of the finite fields pFsp\mathbb{F}_s and sFps\mathbb{F}_p, and we discuss the cryptographic relevance of Dsp\mathbb{D}_{sp}, highlighting its potential for analyzing cyclic attacks and factorization methods.

Keywords

Cite

@article{arxiv.2510.15108,
  title  = {Partitioning $\mathbb{Z}_{sp}$ in finite fields and groups of trees and cycles},
  author = {Nikolaos Verykios and Christos Gogos},
  journal= {arXiv preprint arXiv:2510.15108},
  year   = {2025}
}

Comments

Preprint version of the manuscript submitted for publication in Fundamenta Informaticae (IOS Press)