On the keyspace of the hill cipher

Cryptologia

Volumn 29, Issue 1, 2005, Pages 59-72

  Overbey, Jeffrey ^a   Traves, William ^b   Wojdylo, Jerzy ^a  

^a SOUTHEAST MISSOURI STATE UNIVERSITY   (United States)

^b UNITED STATES NAVAL ACADEMY   (United States)

Author keywords

General linear group; Hill cipher; Invertible matrices; Involutory matrices; Keyspace

Indexed keywords

EID: 85015582598     PISSN: 01611194     EISSN: 15581586     Source Type: Journal    
DOI: 10.1080/0161-110591893771     Document Type: Article

References (10)

1. n = B over Finite Fields. Internat. J. Math. Math. Sci. 16(3): 537-544.
2. Hill, L. S. 1929. Cryptography in an Algebraic Alphabet. Am. Math. Mon. 36: 306-312.
3. Hill, L.S. 1931. Concerning Certain Linear Transformation Apparatus of Cryptography. Am. Math. Mon. 38: 135-154.
4. 2 — I = 0 over a Finite Field. Am. Math. Mon. 65: 518-520.
5. Itô, K. 1987. Iwanami Sugaku Jiten (Encyclopedic Dictionary of Mathematics). The MIT Press.
6. Levine, J., and R. R. Korfhage. 1964. Automorphisms of Abelian Groups Induced by Involutory Matrices, General Modulus. Duke Math J. 31: 631-654.
7. Levine, J., and H. M. Nahikian. 1962. On the Construction of Involutory Matrices. Am. Math. Mon. 69: 267-272.
8. a). Am. Math. Mon. 67: 773-775.
9. Rotman, J. 1965. The Theory of Groups. Boston: Allyn and Bacon.
10. Stinson, D.R. 2002. Cryptography: Theory and Practice. 2nd ed. Boca Raton: Chapman & Hall/CRC Press.