The Aryabhata Algorithm Using Least Absolute Remainders

2006/04/05 by Sreeram Vuppala, Vuppala, Sreeram
Computer Science · #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #cs.CR

paper · pdf · doi:10.48550/arxiv.cs/0604012

9 pages

arxiv created 2006/04/05 · arxiv updated 2009/12/01

Abstract

This paper presents an introduction to the Aryabhata algorithm for finding multiplicative inverses and solving linear congruences, both of which have applications in cryptography. We do so by the use of the least absolute remainders. The exposition of the Aryabhata algorithm provided here can have performance that could exceed what was described recently by Rao and Yang.

Related

• Aryabhata's Mathematics
• The SAT solving method as applied to cryptographic analysis of asymmetric ciphers
• On the Algorithmic Significance and Analysis of the Method of DaYan Deriving One
• Modular Inverses and Chinese Remainder Algorithm
• A New Approximate Min-Max Theorem with Applications in Cryptography