Academic
Publications
High-Speed Algorithms for RSA Cryptograms

High-Speed Algorithms for RSA Cryptograms,Yasushi Fuwa

High-Speed Algorithms for RSA Cryptograms   (Citations: 4)
BibTex | RIS | RefWorks Download
Summary. In this article, we propose a new high-speed processing method for en- coding and decoding the RSA cryptogram that is a kind of public-key cryptogram. This cryp- togram is not only used for encrypting data, but also for such purposes as authentication. However, the encoding and decoding processes take a long time because they require a great deal of calculations. As a result, this cryptogram is not suited for practical use. Until now, we proposed a high-speed algorithm of addition using radix-2k signed-digit numbers and clarified correctness of it ((6)). In this article, we defined two new operations for a high-speed cod- ing and encoding processes on public-key cryptograms based on radix-2k signed-digit (SD) numbers. One is calculation of (a b) mod c (a, b, c are natural numbers). Another one is cal- culation of (ab) mod c (a, b, c are natural numbers). Their calculations are realized repetition of addition. We propose a high-speed algorithm of their calculations using proposed addition algorithm and clarify the correctness of them. In the first section, we prepared some useful theorems for natural numbers and integers and so on. In the second section, we proved some properties of addition operation using a radix-2 k SD numbers. In the third section, we defined some functions on the relation between a finite sequence of k-SD and a finite sequence of N and proved some properties about them. In the fourth section, algorithm of calculation of (a b) mod c based on radix-2k SD numbers is proposed and its correctness is clarified. In the last section, algorithm of calculation of (ab) mod c based on radix-2k SD numbers is proposed and we clarified its correctness.
Cumulative Annual
Sort by: