An Improved Montgomery’s Method Over Public-Key Cryptosystem

Abstract

This paper deals with improving Montgomery’s algorithm. We improve mongomery’s algorithm such that modular multiplications can be executed two times faster. Each iteration in our algorithm requires only one addition, while that in Montgomery’s requires two additions. We then propose a cellular array to implement modular exponentiation for the Rivest–Shamir–Adleman cryptosystem. It has approximately 2n cells, where n is the word length. The cell contains one full-adder and some controlling logic. The time to calculate a modular exponentiation is about 2n2 clock cycles.

Authors and Affiliations

GVS Raj Kumar , Lagadapati Maanasa , K. Naveen Kumar , P. Chandra Sekhar , Mahesh Kasula

Keywords

Related Articles

Comparative evaluation of Recursive Dimensional Cutting Packet Classification, DimCut, with Analysis

an infinitely expanding number of network appliances are utilising packet classifiers to fulfil Quality of Service, security, and traffic engineering tasks. Packet classification is an important role of firewalls and rou...

Evaluation of Classifiers to Enhance Model Selection

The various tasks like classification, clustering and association rule deriving are performed in the data-mining for the pattern extraction. The performance evaluation measures make each task distinct and meaningful. The...

An Efficient Baugh-WooleyArchitecture forBothSigned & Unsigned Multiplication

This project presents an efficient implementation of a high speed multiplier using the shift and adds method of Baugh-Wooley Multiplier. This parallel multiplier useslesser adders and lesser iterative steps. As a result...

Secure Data Sharing using Decoy Technology

Cloud computing is a virtualized compute power and storage delivered via platform-agnostic infrastructures of abstracted hardware and software accessed over the Internet. Data sharing is an important functionality in clo...

“MOBILE MALWARE DETECTION TECHNIQUES”

The malware threat for mobile phones is expected to increase with the functionality enhancement of mobile phones. This threat is exacerbated with the surge in population of smart phones instilled with stable Internet acc...

Download PDF file
  • EP ID EP140492
  • DOI -
  • Views 101
  • Downloads 0

How To Cite

GVS Raj Kumar, Lagadapati Maanasa, K. Naveen Kumar, P. Chandra Sekhar, Mahesh Kasula (2011). An Improved Montgomery’s Method Over Public-Key Cryptosystem. International Journal of Computer Science & Engineering Technology, 2(1), 12-19. https://europub.co.uk./articles/-A-140492