Why RSA? A Pedagogical Comment

Authors

Pedro Barragan Olague, The University of Texas at El PasoFollow
Olga Kosheleva, The University of Texas at El PasoFollow
Vladik Kreinovich, The University of Texas at El PasoFollow

Publication Date

12-2016

Comments

Technical Report: UTEP-CS-16-97

Published in Journal of Innovative Technology and Education, 2017, Vol. 1, No. 1, pp. 19-24.

Abstract

One of the most widely used cryptographic algorithms is the RSA algorithm in which a message m encoded as the remainder c of m^e modulo n, where n and e are given numbers -- forming a public code. A similar transformation c^d mod n$, for an appropriate secret code d, enables us to reconstruct the original message. In this paper, we provide a pedagogical explanation for this algorithm.