Call for Paper - August 2022 Edition
IJCA solicits original research papers for the August 2022 Edition. Last date of manuscript submission is July 20, 2022. Read More

A Class of Non Invertible Matrices in GF(2) for Practical One Way Hash Algorithm

Print
PDF
International Journal of Computer Applications
© 2012 by IJCA Journal
Volume 54 - Number 18
Year of Publication: 2012
Authors:
Artan Berisha
Behar Baxhaku
Artan Alidema
10.5120/8667-2574

Artan Berisha, Behar Baxhaku and Artan Alidema. Article: A Class of Non Invertible Matrices in GF(2) for Practical One Way Hash Algorithm. International Journal of Computer Applications 54(18):19-20, September 2012. Full text available. BibTeX

@article{key:article,
	author = {Artan Berisha and Behar Baxhaku and Artan Alidema},
	title = {Article: A Class of Non Invertible Matrices in GF(2) for Practical One Way Hash Algorithm},
	journal = {International Journal of Computer Applications},
	year = {2012},
	volume = {54},
	number = {18},
	pages = {19-20},
	month = {September},
	note = {Full text available}
}

Abstract

In this paper, we describe non invertible matrix in GF(2) which can be used as multiplication matrix in Hill Cipher technique for one way hash algorithm. The matrices proposed are permutation matrices with exactly one entry 1 in each row and each column and 0 elsewhere. Such matrices represent a permutation of m elements. Since the invention, Hill cipher algorithm was used for symmetric encryption, where the multiplication matrix is the key. The Hill cipher requires the inverse of the matrix to recover the plaintext from cipher text. We propose a class of matrices in GF(2) which are non invertible and easy to generate.

References

  • Zhang, Fuzhen. Matrix Theory. s. l. : Springer, 2011.
  • Thoma H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein. Introduction To Algorithms. s. l. : MIT Press, 2001.
  • Knuth, Donald. The Art Of Computer Programming. Boston : Addison-Wesley, 1998. 0-201-89684.
  • Fisher, R. A, Yates, F. Statistical tables for biological, agricultural and medical research. London : Oliver&Boyd, 1938. 0-02-844720-4.
  • A Practical One Way Hash Algorithm based on Matrix Multiplication. Mohammed Abu Taha, Mousa Farajallah, Radwan Tahboub. s. l. : International Journal of Computer Applications, June, 2011, Vol. e 23-No. 2. 0975-8887.
  • Shuffle an array or a list - Algorithm in Java. [Web site] 2009. http://www. vogella. com/articles/JavaAlgorithmsShuffle/article. html.
  • Bishop, Davis. Intoduction to Cryptography with Java Applets. Sudbury : Jones and Bartlett, 2003. 0-7637-2207-3.
  • History of Cryptography. [Web site] http://en. wikipedia. org/wiki/History_of_cryptography.
  • Schneir, Bruce. Applied Cryptography Protocols, Algorithms and Source code in C. s. l. : John Wiley & Sons, 1996. 0471128457.
  • Forouzan, Behrouz. Cryptography and Network Security. s. l. : McGraw Hill, 2008.
  • One-Way Encryption and Message Authentication. Mittmann, Johannes. 2005.
  • Hill Ciphers and Modular Linear Algebra. Eisenberg, Murray. 1999.
  • A Composition Theorem for Universal One-Way Hash Functions. Shoup, Victor. s. l. : IBM Zurich Research Lab.
  • Cryptography and Network Security Principles and Practices. Stallings, William. s. l. : Prentice Hall, 2006. 0-13-187316-4.
  • RSA Laboratories. Hash Functions. [Web site] August 2012. http://www. rsa. com/rsalabs/node. asp?id=2176.
  • Some Class of Invertible Matrices in GF(2). James S. Plank, Adam L. Buchsbaum. s. l. : University of Tennessee, 2007.
  • Design of a robust cryptosystem algorithm for non invertible matrices based on Hill cipher. Rushdi A. Hamamreh, Mousa Farajallah. 05, s. l. : International Journal of Computer Science and Network Security, 2009, Vol. i 9.