Cooper_Assignment #4

docx

School

American Military University *

*We aren’t endorsed by this school

Course

266

Subject

Computer Science

Date

Jan 9, 2024

Type

docx

Pages

Uploaded by UltraLemur3395

Cooper: Assignment 4 Zachary Cooper Cryptography Concepts: ISSC266 Doctor Leonard Simon April 30, 2023

2 Assignment 3 A hash is a formula that acts as a summary of the original value after going through a process. For example, a passcode of “P@ssw0rd!” will be truncated to a fixed size such as “01101.” Security is only guaranteed if the input is equal to the truncated output (Freeman Law, Accessed 2023). The benefit to hashes is they are easy to conduct the process but difficult to do the process backwards, or in reverse. Every unique input is designed to produce a unique out, but this not always the case. A hash collision is when to different inputs create the same output, or when one hash has two different inputs. For example, “01101” has an input of not only “P@ssw0rd!” but also the input “$n4k3.” Hash collisions are issues for many reasons (Freeman Law, Accessed 2023). For one, message integrity is degraded. No matter the hash algorithm, a hash collision will result in messages that are incorrect due the multiple possibilities of inputs to one output (Selinger, 2011). Another issue to arise is hackers taking advantage of collisions to find passwords that are close enough to get the same hash. Message Digest 5, or MD5, is a hashing algorithm that used to be the most popular (Freeman Law, Accessed 2023). When it comes to hash collisions, MD5 is very unlikely to experience a collision due to the way the algorithm works for hashing. MD5 has a process of timestamping with more of a hash. MD5 will hash the input and then add a timestamp, this means that the initial hash may be like another but will have a unique timestamp. This timestamp allows the possibility for over 9 trillion hashes. This number of hashes makes it very difficult for hash collisions to occur (Selinger, 2011).

3 Assignment 3 References Freeman Law. Accessed: 29 April 2023. Hash collisions explained. https://freemanlaw.com/hash-collisions-explained/ Selinger, P. Last updated: 11 October 2011. MD5 collision demo. https://www.mscs.dal.ca/~selinger/md5collision/

Your preview ends here

Eager to read complete document? Join bartleby learn and gain access to the full version

Access to all documents
Unlimited textbook solutions
24/7 expert homework help

Related Documents

LANG_12Blueprint.docx

IT_meagerManuscript.docx

POLISCI_beCode.docx

CS 132 Counseling and Interviewing Assignment 1.docx

Cooper_Assignment #5.docx

Cooper_Assignment4.docx

Cooper_Assignment #7.docx

Cooper_Assignment #6.docx

ISSC262_Paper_Zachary_Cooper.docx

Cooper_Assignment #1.docx

Cooper_Assignment #3.docx

Cooper_Assignment #2.docx

Recommended textbooks for you

C++ Programming: From Problem Analysis to Program...

Computer Science

ISBN:9781337102087

Author:D. S. Malik

Publisher:Cengage Learning

Programming Logic & Design Comprehensive

Computer Science

ISBN:9781337669405

Author:FARRELL

Publisher:Cengage

Systems Architecture

Computer Science

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Cengage Learning

Operations Research : Applications and Algorithms

Computer Science

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Brooks Cole

CMPTR

Computer Science

ISBN:9781337681872

Author:PINARD

Publisher:Cengage

SEE MORE TEXTBOOKS

Recommended textbooks for you

C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole
CMPTR
Computer Science
ISBN:9781337681872
Author:PINARD
Publisher:Cengage