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

Review of Security in Manets Using Cryptographic Techniques

Ad hoc on demand distance vector (AODV) is a routing protocol for Mobile Ad hoc networks. An ad hoc network is a collection of moveable nodes which works without the need of any centralized base station or any infrastruc...

Transition Bandwidth Analysis of Infinite Impulse Response Filters

Infinite impulse response (IIR) is a property applying to many linear time-invariant systems. Digital filters are the common example of linear time invariant systems. Systems with this property are called IIR systems or...

Computer Aided Music Generation Using Genetic Algorithm and Its Potential Applications

Music speaks what cannot be expressed, soothes the mind and gives it rest, heals the heart and makes is whole. Not everyone is gifted with a good voice but almost everyone has good ears when it comes to pleasant music. T...

Moodle Based LMS and Open Source Software (OSS) Efficiency in e-Learning

This paper describes the designing and real time implementation of web based Learning Management Systems (LMSs) based on Moodle open source. We are giving attention to Moodle based LMS system implementation in our colleg...

Computational Morphology and Natural Language Parsing for Indian Languages: A Literature Survey

Computational Morphology and Natural Language Parsing are the two important as well as essential tasks required for a number of natural language processing application including machine translation. Developing well fledg...

Download PDF file
  • EP ID EP140492
  • DOI -
  • Views 94
  • 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