The week's pick
Reseach Article
Article:A Practical One Way Hash Algorithm based on Matrix Multiplication
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 23 - Number 2 |
| Year of Publication: 2011 |
| Authors: Mohammed Abu Taha, Mousa Farajalla, Radwan Tahboub |
10.5120/2859-3677
|
Mohammed Abu Taha, Mousa Farajalla, Radwan Tahboub . Article:A Practical One Way Hash Algorithm based on Matrix Multiplication. International Journal of Computer Applications. 23, 2 ( June 2011), 33-37. DOI=10.5120/2859-3677
Abstract
It is well known that Hash algorithm works in one way, and it cannot be reversed. We can build a new algorithm by using Hill cipher technique .Since its invention in 1929, Hill cipher algorithm which is one of the most famous symmetric cryptosystems .Hill cipher requires the inverse of the key matrix for decryption. This inverse not always exists, so we can use non-invertible matrices to propose a model for our new hash algorithm, and we proof the four requirements that needed to design a practical one way hash algorithm.
References
- Bibhudendra. A, and et al, (2006): " Novel Methods Of Generating Self-Invertible Matrix For Hill Cipher Algorithm ". International Journal of Security, Vol (1), pp:14-21.
- Charlie, O, and Behzad, S, (2007): “A Parallel Algorithm for determining the inverse of a matrix for use in block cipher encryption/decryption“. The Journal of Supercomputing, Vol (39), pp: 113-130.
- Chu-Hsing, L, and et al, (2004): “ Comments On Saeednia's Improved Scheme For The Hill Cipher“. Journal of the Chinese Institute of Engineering, Vol (27), pp: 743- 746.
- DaniloGligoroski†, Smile Markovski†† and Svein J. Knapskog†(2006):”A Secure Hash Algorithm with only 8 Folded SHA-1 Steps”, IJCSNS International Journal of 194 Computer Science and Network Security, VOL.6 No.10
- Farajallah. M and Hamamreh. R (2009) " Self Generating Multi Keys Cryptosystem Model for Non-Invertible Matrices based on Hill Cipher ", Security and Management 2009, IET SAM09 Conference, Las Vegas, Nevada, USA, 665-672.
- Forouzan – Behrouz (2008) .A “Cryptography and Network Security”,McGraw Hill..
- Hill S. L, (1929): “Cryptography in an algebraic alphabet“. American Math. Monthly, Vol (36), pp: 306-312.
- Ismail, I. A, and et al, (2006): “ How to repair the Hill cipher“. Journal of Zhejiang University SCIENCE, copublished with Springer-Verlag GmbH, Vol (7), pp: 2022- 2030.
- Jeffrey, O, and et al, (January, 2005): “On the Keyspace of the Hill Cipher“. Cryptologia, Vol (29), pp: 59-72.
- Johannes Mittmann, (may ,2005): “One-Way Encryption and Message Authentication“.
- KimmoJrvinen, MattiTommiska and JormaSkytt (2005): “Hardware Implementation Analysis of the MD5 Hash Algorithm“, Proceedings of the 38th Hawaii International Conference on System Sciences.
- Menezes. A. J and et al, (2001): “Handbook of Applied Cryptography-Discrete Mathematics and Its Applications“, Fifth Edition. CRC Press, New York, Inc. USA.
- Murray Eisenber ( 1999): “Hill Ciphers and Modular Linear Algebra“.
- Rushdi A. Hamamreh, Mousa Farajallah( 2009), “Design of a Robust Cryptosystem Algorithm for Non-Invertible Matrices Based on Hill Cipher”, International Journal of Computer Science and Network Security; pp 11-16.
- Victor Shoup, (2000): " A Composition Theorem for Universal One-WayHash Functions".
- William Stallings (2006.), “Cryptography and Network Security Principles and Practices”, Prentice Hall.
- Yi-Shiung. Y, and et al, (1991): “A New Cryptosystem Using Matrix Transformation“. Proceedings of IEEE International Canahan Conference on Security Technology, 1-3 – October – 2008, Taipei, Taiwan pp: 131-138.
- Yi-Shiung. Y, and et al, (1993): “ HAVAL — A One-Way Hashing Algorithm with Variable Length of Output“. Appeared in “Advances in Cryptology — AUSCRYPT’92,” Lecture Notes Computer Science, Vol.718, pp.83-104, Springer-Verlag
Index Terms
Keywords