Fast algorithms are presented for implementing the public key cryptosystem proposed by Rivest,Shamir and Adleman. The fast algorithms are based on the fast integer multiplications scheme due to Schonhage and Strassen and the proposed iterative division algorithm. © 1985, The Institution of Electrical Engineers. All rights reserved.

dc.contributor.authorMohan, S.B.
dc.contributor.authorAdiga, B.S.
dc.date.accessioned2026-02-05T11:00:44Z
dc.date.issuedFast Algorithms For Implementing Rsa Public Key Cryptosystem
dc.description.abstract1985
dc.identifier.citationElectronics Letters, 1985, 21, 17, pp. 761-
dc.identifier.issn135194
dc.identifier.urihttps://doi.org/10.1049/el:19850536
dc.identifier.urihttps://idr.nitk.ac.in/handle/123456789/28129
dc.subjectCOMPUTER PROGRAMMING - Algorithms
dc.subjectFAST ALGORITHMS
dc.subjectRSA PUBLIC KEY CRYPTOSYSTEM
dc.subjectCRYPTOGRAPHY
dc.titleFast algorithms are presented for implementing the public key cryptosystem proposed by Rivest,Shamir and Adleman. The fast algorithms are based on the fast integer multiplications scheme due to Schonhage and Strassen and the proposed iterative division algorithm. © 1985, The Institution of Electrical Engineers. All rights reserved.

Files

Collections