Fast Fraction-Integer Method for Computing Multiplicative Inverse

Details Fast Fraction-Integer Method for Computing Multiplicative Inverse Fast Fraction-Integer Method for Computing Multiplicative Inverse

2009-12-20

arxiv.org/abs/0912.3963v1

Journal of Computing, Volume 1, Issue 1, pp 131-135, December 2009

Computer Science

Data Structures and Algorithms

Scientific paper

Multiplicative inverse is a crucial operation in public key cryptography, and been widely used in cryptography. Public key cryptography has given rise to such a need, in which we need to generate a related public and private pair of numbers, each of which is the inverse of the other. The basic method to find multiplicative inverses is Extended-Euclidean method. In this paper we will propose a new algorithm for computing the inverse, based on continues subtract fraction from integer and divide by fraction to obtain integer that will be used to compute the inverse d. The authors claim that the proposed method more efficient and faster than the existed methods.

Affiliated with

Also associated with

No associations

Rating

Fast Fraction-Integer Method for Computing Multiplicative Inverse does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast Fraction-Integer Method for Computing Multiplicative Inverse, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast Fraction-Integer Method for Computing Multiplicative Inverse will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-62186