A Maple implementation of the Chor-Rivest cryptosystem is presented. The main problems in this implementation are: to determine discrete logarithms over GF(q h), q ≈ 200 and h ≈ 25, and to use the arithmetic of the finite fields in order to encrypt and decrypt messages. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Encinas, L. H., Masqué, J. M., & Dios, A. Q. (2006). Maple implementation of the chor-rivest cryptosystem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3992 LNCS-II, pp. 438–445). Springer Verlag. https://doi.org/10.1007/11758525_59
Mendeley helps you to discover research relevant for your work.