Open AccessEffective computations of module inverses with the Approximating k-ary GDD Algorithm by Ishmukhametov
Author(s) -
Müslüm Arkan
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1530/1/012153
Subject(s) - greatest common divisor , algorithm , euclidean algorithm , cryptography , encryption , digital signature , computer science , computation , finite field , euclidean geometry , extension (predicate logic) , field (mathematics) , mathematics , theoretical computer science , discrete mathematics , hash function , geometry , computer security , pure mathematics , programming language , operating system
Finite field calculations are used in modern cryptographic protocols for generating keys, encrypting and decrypting data, and building an electronic digital signature. The module inversing is necessary part of these calculations based on the extended Euclidean algorithm. Ishmukhametov developed a new algorithm for calculating the greatest common divisor of natural numbers called the approximat-ing algorithm which is a variant of the k-ary GCD Algorithm by J. Sorenson. In this paper we develop an extension version of this algorithm.