The Aryabhata Algorithm Using Least Absolute Remainders

Simple item page
dc.creatorVuppala, Sreeram
dc.date2006-04-05
dc.date.accessioned2026-07-07T07:09:19Z
dc.date.available2026-07-07T07:09:19Z
dc.descriptionThis 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.
dc.description9 pages
dc.identifierhttps://arxiv.org/abs/cs/0604012
dc.identifierhttp://arxiv.org/abs/cs/0604012
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/111017
dc.subjectCryptography and Security
dc.titleThe Aryabhata Algorithm Using Least Absolute Remainders
dc.typetext

Files

Collections

arXiv