Publication:
Hash functions: analysis study

dc.contributor.affiliation#PLACEHOLDER_PARENT_METADATA_VALUE#en_US
dc.contributor.authorAbdulMajeed, Khanssaa Munthiren_US
dc.date.accessioned2024-10-08T07:40:54Z
dc.date.available2024-10-08T07:40:54Z
dc.date.issued2013
dc.description.abstractWhile the some weaknesses have appeared in many hash functions such as MD4, MD5, RIPEMD-family and the series of Secure Hash Algorithm (SHA) families such as, SHA-0, SHA-1, SHA-2, with a number of SHA-3. Thus, National Institute of Standard and Technology (NIST) has suggested different principles to avoid the blunders, and to choice the ideal quality of hash function, that to be a measurement in future of hash function generations. Therefore, the goal of the NIST contenders in SHA-3 between the hash functions is to be chosen as the winner in the end of 2012, or the beginning of 2013. Therefore, for this reason the research addresses the comparative study of the finalist SHA-3 candidates in: design and structure, complexity, with performance and cost, to measure the robustness of the algorithms through the Fundamentals Security Measurement Factors of Hash Function (FSMFHF) of Secure Hash Algorithm (SHA). As a result, from this comprehensive comparison study between the finalist SHA-3 candidates such as; BLAKE, Grostl, JH, Keccak, and Skein, a choice can be made as to the ideal security algorithm against different attacks in suitable structure design of high utilizing of message distribution with high trade-off of speed/ area performance in low cost. Therefore main idea in this research is classify, comparison, and analysis for all five SHA-3 candidates of finalist, and studying the details of these five candidates that in Round 3 by using different structures and different design approaches, and identifying whether the complexity for each design. Thus, this research found a JH hash function is the faster in implementation followed by Grostl hash function, after that Keccak hash function, which gets best security of the hash function applications for different industry structures, as well as supporting a security of different size of data in computer science.en_US
dc.description.callnumbert QA 76.9 A43 A136H 2013en_US
dc.description.degreelevelMasteren_US
dc.description.identifierThesis : Hash functions: analysis study /by Khanssaa Munthir AbdulMajeeden_US
dc.description.identityt00011282816KhanssaaMunthiren_US
dc.description.kulliyahKulliyyah of Information and Communication Technologyen_US
dc.description.notesThesis (MIT)--International Islamic University Malaysia, 2013en_US
dc.description.physicaldescriptionxiv, 94 leaves : ill. ; 30cm.en_US
dc.description.programmeMaster of Information Systemsen_US
dc.identifier.urihttps://studentrepo.iium.edu.my/handle/123456789/9429
dc.identifier.urlhttps://lib.iium.edu.my/mom/services/mom/document/getFile/MFt2h21jkHssLDi6GFCZTMY1uB97iGCX20130826114604661
dc.language.isoenen_US
dc.publisherKuala Lumpur: International Islamic University Malaysia, 2013en_US
dc.rightsCopyright International Islamic University Malaysia
dc.subject.lcshAlgorithmsen_US
dc.subject.lcshData encryption (Computer science)en_US
dc.subject.lcshComputer -- Access controlen_US
dc.subject.lcshCryptographyen_US
dc.titleHash functions: analysis studyen_US
dc.typeMaster Thesisen_US
dspace.entity.typePublication

Files

Original bundle

Now showing 1 - 2 of 2
Loading...
Thumbnail Image
Name:
t00011282816KhanssaaMunthir_SEC_24.pdf
Size:
641.17 KB
Format:
Adobe Portable Document Format
Description:
24 pages file
Loading...
Thumbnail Image
Name:
t00011282816KhanssaaMunthir_SEC.pdf
Size:
2.9 MB
Format:
Adobe Portable Document Format
Description:
Full text secured file

Collections