Please use this identifier to cite or link to this item:
http://148.72.244.84:8080/xmlui/handle/xmlui/8686Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Mohammed Jassim Reza | - |
| dc.date.accessioned | 2023-11-09T06:47:06Z | - |
| dc.date.available | 2023-11-09T06:47:06Z | - |
| dc.date.issued | 2013-01-01 | - |
| dc.identifier.issn | 2222-8373 | - |
| dc.identifier.uri | http://148.72.244.84:8080/xmlui/handle/xmlui/8686 | - |
| dc.description.abstract | This paper describes the (MD5) message-digest algorithm. The algorithm takes as input a message of arbitrary length and produces an output of 128-bit as "message digest" of the input . It is conjectured that it is computationally infeasible to produce two messages having the same message digest, or to produce any message having a given prespecified target message digest. The MD5 algorithm is intended for digital signature applications, where large file must be "compressed" in a secure manner before being encrypted with a private (secret) key under a public-key cryptosystem such as RSA. This algorithm is fast on 32-bit machines, and does not require large substitution tables. | en_US |
| dc.description.sponsorship | https://djps.uodiyala.edu.iq/pages?id=65 | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | university of Diyala | en_US |
| dc.subject | message-digest algorithm, digital signature compressed large file, encrypted | en_US |
| dc.title | Implementation of (MD5) Algorithm | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | مجلة ديالى للعلوم الاكاديمية / Academic Science Journal (Acad. Sci. J.) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 149-160 E.pdf | 412.69 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.