DSpace Repository

A Practical One Way Hash Algorithm based on Matrix Multiplication

Show simple item record

dc.contributor.author Abutaha, Mohammed
dc.contributor.author Farajallah, Mousa
dc.contributor.author Tahboub, Radwan
dc.date.accessioned 2017-01-29T10:35:29Z
dc.date.accessioned 2022-05-22T08:26:31Z
dc.date.available 2017-01-29T10:35:29Z
dc.date.available 2022-05-22T08:26:31Z
dc.date.issued 2011-06-01
dc.identifier.citation 3 en_US
dc.identifier.issn 0975-8887
dc.identifier.uri http://localhost:8080/xmlui/handle/123456789/7752
dc.description.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. en_US
dc.language.iso en en_US
dc.publisher International Journal of Computer Applications en_US
dc.subject Hill cipher technique en_US
dc.subject Non-invertible matrix en_US
dc.subject Hash algorithm en_US
dc.subject One-way hash function en_US
dc.subject plain-text en_US
dc.subject Integrity en_US
dc.title A Practical One Way Hash Algorithm based on Matrix Multiplication en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Browse

My Account