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 2020-12-09T09:22:57Z
dc.date.accessioned 2022-05-22T08:52:23Z
dc.date.available 2020-12-09T09:22:57Z
dc.date.available 2022-05-22T08:52:23Z
dc.date.issued 2011
dc.identifier.uri http://localhost:8080/xmlui/handle/123456789/8096
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.
dc.publisher International Journal of Computer Applications
dc.title A practical one way hash algorithm based on matrix multiplication


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Browse

My Account