Computing square root of a large Positive Integer
Clicks: 124
ID: 13840
2016
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
62.9
/100
124 views
104 readers
Trending
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #137 of 148 articles by views in adbu journal of engineering technology
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 148 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
Dealing in large number is of interest in asymmetric key cryptography using RSA. The security of RSA is solely based on difficulty of factorization of a large number. Factoring a number requires finding all divisible primes less than or equal to the square root of the number. Proposed here is a new algorithm to compute the square root of large positive integer. The algorithm is based on the implementation of long division method also known as manual method we usually use to find the square root of a number. To implement the long division method, the given number is first represented in a radix-10 representa and then Bino’s Model of Multiplication is used to systematically implement the long division method. A representa is a special array to represent a number in the form of an array so as to enable us to treat the representas in the same way as we treat numbers. This simplifies the difficulty of dealing large numbers in a computer. The proposed algorithm is applied to the RSA–challenge numbers for factorization. The square roots of the challenge numbers can be computed easily in less than a second. The square roots of first few challenge number and last few challenge number are also provided, which may be used for factorization of corresponding challenge number. Key words: Asymmetric key cryptogra phy, Bino’s Model of Multiplication, Large number manipulation, Long division method, Prime factorization, RSA challenge numbers, Representa, Square root computation
| Reference Key |
singh2016computingadbu
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | Yumnam Kirani Singh; |
| Journal | adbu journal of engineering technology |
| Year | 2016 |
| DOI |
DOI not found
|
| URL | |
| Keywords | Keywords not found |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.