ScholarLens Back to search
2010•Unpublished venueRequires access

Extended Euclid algorithm and its application in RSA

Jianqin Zhou, Jun Hu, Ping Chen

Open publisher page 13 citations

Abstract

RSA, which based on the great difficulty of integer factorization, is the most widely-used public-key cryptosystem used in electronic commerce. Euclid algorithm and extended Euclid algorithm are the best algorithms to solve the public key and private key in RSA. Extended Euclid algorithm in IEEE P1363 is improved by eliminating the negative integer operation, which reduces the computing resources occupied by RSA, hence has an important application value.

About this research paper

What this paper is about

RSA, which based on the great difficulty of integer factorization, is the most widely-used public-key cryptosystem used in electronic commerce. Euclid algorithm and extended Euclid algorithm are the best algorithms to solve the public key and private key in RSA. Extended Euclid algorithm in IEEE P1363 is improved by eliminating the negative integer operation, which reduces the computing resources occupied by RSA, hence has an important application value.

Why it matters

OpenAlex reports 13 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

RSA, which based on the great difficulty of integer factorization, is the most widely-used public-key cryptosystem used in electronic commerce. Euclid algorithm and extended Euclid algorithm are the best algorithms to solve the public key and private key in RSA. Extended Euclid algorithm in IEEE P1363 is improved by eliminating the negative integer operation, which reduces the computing resources occupied by RSA, hence has an important application value.

Key concepts: Integer factorization, Cryptosystem, Public-key cryptography, Key (lock), Computer science, Integer (computer science), Algorithm, Factorization

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Extended Euclid algorithm and its application in RSA — Research Paper | ScholarLens