Work

The Method of Joint Execution of the Basic Operations of the Rabin Cryptosystem

Year: 2023
Type: conference-paper
Abstract: The process of performing arithmetic operations of addition, multiplication, and exponentiation, where the operands are multi-bit numbers, is extremely common in applied problems of number theory, computational and discrete mathematics. This applies to methods of pattern recognition, digital signal processing, tamper-proof coding, statistical data processing, etc. However, their most important application is in asymmetric cryptography. In this field, for example, in the Rabin cryptosystem, it is often necessary to simultaneously perform the Euclidean algorithm and multiply two multi-bit numbers. The work presents new methods of finding the greatest common divisor based on the formation of appropriate matrices, which allows parallelization of calculations. Their advantages over the existing ones are indicated, in particular, the possibility of increasing speed. It was established that these methods, in addition to finding the greatest common divisor, make it possible to factorize it simultaneously. In the C+ high-level programming language, a program implementation of the simultaneous execution of the Euclidean algorithm and the multiplication of two multi- bit numbers by the classical Euclidean algorithm and the proposed methods was carried out. Corresponding experimental studies of the time characteristics of this software implementation have been conducted. The proposed method involves the use of intermediate results of the Euclidean algorithm and access to the table of squares stored in the computer's memory. The Rabin encryption scheme based on the proposed method of multiplying multi-bit numbers is given. Numbers of different digits were used for the experiment. It is shown that in the vast majority of cases considered, the proposed method is characterized by a higher speed of processing multi-bit numbers. The average time of operations is reduced by approximately 1.43 times. All calculations were repeated 5000 times to eliminate random influences on the time characteristics of the computer. The proposed method can be effectively used when simultaneous execution of the Euclidean algorithm and multiplication of two multi-bit numbers is required.
Language: English
Open Access status: bronze
OpenAlex ID: W7166345731
FWCI:
Cites: 18
Cited by:
Related to: 10