perfect square
Methods of finding n-th roots of integers and their connection with Cryptography
Aryabhata in his Ganitapada written in 499 AD, gives a systematic method of finding square root and cube root of a given perfect square or a perfect cube. This method is amenable to generalization to finding n-th root. The Indian Human Computer Shakuntaladevi, while finding 23rd root of a 201-digit number apparently used a method which relates to modular arithmetic used in RSA-Cryptography. We shall discuss these methods in the talk.