Modular Matrix Cipher and Its Application in Authentication Protocol

Author

Tran, Bao Ngoc ; Nguyen, Thuc Dinh

Author_Institution

Fac. of Math. & Inf., HCMC Univ. of Pedagogy, Ho Chi Minh City

fYear

2008

fDate

6-8 Aug. 2008

Firstpage

318

Lastpage

323

Abstract

Matrix cryptosystems, like Hill cipher, are resistant to frequency analysis. The key is a non-singular k times k matrix, for example 3 times 3 matrix K. In this paper, we propose simple criteria to generate a modular non-singular key-matrix for matrix ciphers fast. We apply these results to cryptography and computer security. In this paper, we present a mutualauthentication protocol based on Hamiltonian cycle in directed weight graphs and modular matrix algebra.

Keywords

cryptographic protocols; matrix algebra; message authentication; telecommunication security; Hamiltonian cycle; Hill cipher; authentication protocol; computer security; cryptography; cryptosystems; directed weight graphs; modular matrix algebra; modular matrix cipher; Application software; Artificial intelligence; Authentication; Cryptography; Distributed computing; Informatics; Mathematics; Matrices; Protocols; Software engineering; Authentication; Hamiltonian Cycle; Hill Cipher; Matrix Cipher; Modular Matrix Algebra;

fLanguage

English

Publisher

ieee

Conference_Titel

Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2008. SNPD '08. Ninth ACIS International Conference on

Conference_Location

Phuket

Print_ISBN

978-0-7695-3263-9

Type

conf

DOI

10.1109/SNPD.2008.66

Filename

4617390