Structures of finite fields of primes and the Euclidean square roots of unity in the finite rings

被引:0
|
作者
Verykios, Nikolaos [1 ]
Gogos, Christos [1 ]
机构
[1] Univ Ioannina, Dept Informat & Telecommun, Kostakioi Campus, Epirus 48100, Greece
来源
CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES | 2025年 / 17卷 / 01期
关键词
Arcs and trees; Finite field; Primitive roots of unity; Square roots; Fixed points; Euclidean roots; GRAPH;
D O I
10.1007/s12095-024-00744-9
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This work extends existing knowledge on the graph of square mapping a(2) equivalent to b ( mod s ) on finite fields of primes, and on finite rings, where a, b become vertices and ( a,b ) becomes an edge. Such graphs consist of cycles with binary trees attached to their vertices. The concept of arcs as k connected edges of a cycle is introduced and the product of an arc with a tree that results in a new tree is defined. This reveals another aspect of prime finite fields which is equivalent to the well-known product of the kernel and the image of a function. Next, we present the theorem of Euclidean roots of unity in a ring Z(sp), where s and p are primes. Z(sp) is analysed and partitioned into three sets. Two of them contain multiples of the two primes and the third one has interesting properties that are later described in this paper. A number of new theorems are proved in the process that lay the foundation for the novel ideas presented in this work. The generalized theorem of the Euclidean roots of unity in a finite ring is the basis of this work and it presents a way of calculating all square roots of unity and fixed points in a finite ring under the square mapping.
引用
收藏
页码:41 / 55
页数:15
相关论文
共 29 条
  • [1] On the Computation of Square Roots in Finite Fields
    Siguna Müller
    Designs, Codes and Cryptography, 2004, 31 : 301 - 312
  • [2] On the computation of square roots in finite fields
    Müller, S
    DESIGNS CODES AND CRYPTOGRAPHY, 2004, 31 (03) : 301 - 312
  • [3] Improved Computation of Square Roots in Specific Finite Fields
    Han, Dong-Guk
    Choi, Dooho
    Kim, Howon
    IEEE TRANSACTIONS ON COMPUTERS, 2009, 58 (02) : 188 - 196
  • [4] Improved generalized Atkin algorithm for computing square roots in finite fields
    Kong, FY
    Cai, Z
    Yu, J
    Li, DX
    INFORMATION PROCESSING LETTERS, 2006, 98 (01) : 1 - 5
  • [5] Square root computation in finite fields
    Adiguzel-Goktas, Ebru
    Ozdemir, Enver
    DESIGNS CODES AND CRYPTOGRAPHY, 2024, 92 (07) : 1947 - 1959
  • [6] On Constructing Primitive Roots in Finite Fields With Advice
    Shparlinski, Igor E.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (11) : 7132 - 7136
  • [7] On Hilbert cubes and primitive roots in finite fields
    Ali Alsetri
    Xuancheng Shao
    Archiv der Mathematik, 2022, 118 : 49 - 56
  • [8] Roots of certain polynomials over finite fields
    Ding, Zhiguo
    Zieve, Michael E.
    JOURNAL OF NUMBER THEORY, 2023, 252 : 157 - 176
  • [9] On Hilbert cubes and primitive roots in finite fields
    Alsetri, Ali
    Shao, Xuancheng
    ARCHIV DER MATHEMATIK, 2022, 118 (01) : 49 - 56
  • [10] An Algorithms for Finding the Cube Roots in Finite Fields
    Faisal
    Rojali
    Bin Mohamad, Mohd Sham
    5TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND COMPUTATIONAL INTELLIGENCE 2020, 2021, 179 : 838 - 844