Abstract
A new matrix extension of the RSA algorithm is proposed which is based on the Cayley-Hamilton theorem and a one-way function. The security of this algorithm rests upon both that of the RSA algorithm and the one-way function. The computational efficiency of the new algorithm depends on the dimension of the matrix. The most efficient implementation is the 2×2 case in which both encryption and decryption use a single modulo arithmetic multiplication and single evaluation of the one-way function.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
C.C. Chuang, Matrix Extension of the RSA Algorithm, Ph. D. Dissertation, SMU, Dallas, Texas, 1990.
J. Gordon, “Strong primes are easy to find,” Proceedings of Crypto’87, pp. 216–223.
R. A. Horn, and C. A. Johnson, Matrix Analysis, Cambridge University Press, NY, 1985.
D. E. Knuth, The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, Addison-Wesley, Reading, 2nd ed., 1981.
R.F. Rieden, J.B. Snyder, R.J. Widman, and W.J. Barnard, “A two-chip implementation of the RSA public-key encryption algorithm,” GOMAC (Government Microcircuit Applications Conference), (Orlando, FL), pp. 24–27 Nov. 1982.
R.L. Rivest, “A description of a single-chip implementation of the RSA cipher,” Lambda, vol.1, no. 3, pp. 14–18, Fall 1980.
R.L. Rivest, “RSA chips (past/present/future),” Eurocrypt’84, pp. 159–165.
R.L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Comm. ACM, vol. 21, pp. 120–126, 1978.
G.J Simmons, “High speed arithmetic utilizing redundant number systems,” National Telecommunications Conf. (Houston, TX), pp. 49.3.1–2, Nov.30–Dec. 4, 1980.
V. Varadharajan, and R. Odoni, “Extension of RSA cryptosystems to matrix rings,” Cryptologia, vol. 9, no. 2, pp. 140–153, April, 1985.
K. Yiu and K. Peterson, “A single-chip VLSI implementation of the discrete exponential public key distribution system,” GOMAC (Government Microcircuit Applications Conference), (Orlando, FL), pp. 18–23, Nov. 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chuang, CC., Dunham, J.G. (1991). Matrix Extensions of the RSA Algorithm. In: Menezes, A.J., Vanstone, S.A. (eds) Advances in Cryptology-CRYPTO’ 90. CRYPTO 1990. Lecture Notes in Computer Science, vol 537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-38424-3_10
Download citation
DOI: https://doi.org/10.1007/3-540-38424-3_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54508-8
Online ISBN: 978-3-540-38424-3
eBook Packages: Springer Book Archive