Short: Extended Euclidian algorithm to solve ax mod v=1 Uploader: Maciej Plewa (maciejplewa hotmail com) Type: dev/e Version: 7.07.98 Architecture: m68k-amigaos Procedure to solve ax mod v=1 , where x is unknown WARNING! This procedure may return negative values! This algorithm has been taken from Bruce Schneier's "Applied Cryptography: Protocols, Algorithms and Source Code in C" and translated to E 3.3a by Maciej Plewa (maciejplewa@hotmail.com) Please send my your comments, propositions or bug-reports.