Efficient Implementation of RSA Algorithm with MKE

Sami A.  Nagar; Dr.  Saad Alshamma

Paper 2012/539

Efficient Implementation of RSA Algorithm with MKE

Sami A. Nagar and Dr. Saad Alshamma

Abstract

The aim of this paper is to improve the implementation of RSA algorithm in some certain situations. This improvement is based on the ideas of H. Ren-Junn, S. Feng-Fu, Y. Yi-Shiung and C. Chia-Yao and allows us to speed up the transmission of data between various nodes in networks. We realized our idea in the C{\#} language and in the database that was created by SQL Server 2008 R2. Identical database must be used in all networks gateways. The special protocol (RSA Handshake Database Protocol) was designed for controlling the creation of this database. Each gateway, that runs a RSA-Key Generations Offline procedure, is controlled according to specific issues and necessaries. This stage is called RSA-Key Generations Offline. We propose the new method for exchanging values of the keys among gateways. Roughly speaking gateways exchange indexes (Indexes Exchange) that refer to fields that contain the values of public and private keys.

Metadata

Available format(s): PDF
Category: Implementation
Publication info: Published elsewhere. Unknown where it was published
Keywords: RSA RSA Handshake Database Protocol RSA-Key Generations Offline
Contact author(s): saaddaoud2005 @ gmail com
History: 2012-09-20: received
Short URL: https://ia.cr/2012/539
License: CC BY

BibTeX

@misc{cryptoeprint:2012/539,
      author = {Sami A.  Nagar and Dr.  Saad Alshamma},
      title = {Efficient Implementation of {RSA} Algorithm with {MKE}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2012/539},
      year = {2012},
      url = {https://eprint.iacr.org/2012/539}
}