loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing
Modular Matrix Cipher and Its Application in Authentication Protocol
August 06-August 08
ISBN: 978-0-7695-3263-9
Matrix cryptosystems, like Hill cipher, are resistant to frequency analysis. The key is a non-singular k?k matrix, for example 3?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.
Index Terms:
Modular Matrix Algebra, Matrix Cipher, Hill Cipher, Authentication, Hamiltonian Cycle
Citation:
Bao Ngoc Tran, Thuc Dinh Nguyen, "Modular Matrix Cipher and Its Application in Authentication Protocol," snpd, pp.318-323, 2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2008
Usage of this product signifies your acceptance of the Terms of Use.