Week 3 Summmative assessment

docx

School

University of Phoenix *

*We aren’t endorsed by this school

Course

305

Subject

Computer Science

Date

Feb 20, 2024

Type

docx

Pages

4

Uploaded by AgentCranePerson1078

Report
1 Summative Assessment: Cryptographic Hash Function Reflection Julie M Regets University of Phoenix DAT/305 Joe Lodewyck June 19, 2023
2 Cryptographic hash functions (CHF) are mathematical processes that take an input, regardless of size, and reduces it to a set constant length of characters. This process is an essential part of ensuring data integrity and authenticity. A strong CHF is composed of several characteristics: collision resistance, avalanche effect, determinism, pre-image resistance and hash speed. These characteristics play a crucial role in digital information transmission and should be a part of any database design or business application, and in the security of both. When hashing data, a collision occurs when two sets of unique content are run through the same CSF process and the resulting output is identical. These collisions indicate the algorithm being used is ineffectual and allows for those with malicious intent to possible intercept data and replace it with their own with the receiver none the wiser. A collision resistant algorithm ensures the hashed data is reliable. Avoiding collisions is a great start, but in addition we ideally want to also see an avalanche effect if data is changed along the line. This means that even the absolute tiniest change in the content results in a hashed value that is wildly different from the original. If “b” is replaced with “B” in a 10,000-word missive one time the resulting value would change so drastically, there would be no way to miss it. This concept leads us to the next characteristic, determinism, an output that is always the exact same length regardless of the size of the input, a single passage or m the entire book, a solid CHF will put out the exact same number of characters as its final value. Pre-image resistance means the process is strictly one way, meaning it does not allow for the resulting string to be reverse engineered to reveal the original content, it only ensures the data received is identical to the data sent. Hash speed is the measure of how quickly the algorithm runs and creates the output value. Speed is an important factor. Too fast may indicate a process that can be easily manipulated and too slow can cause
3 problems when connecting over websites, so it is not an objective measure, the use case may dictate the speed that works best for the application involved. The purpose, use and security considerations of CHF in database design and business applications are consistent across the board. The security and integrity of our sites, data, and signatures is imperative in all these areas. CHF allows for verification of the data we share, the passwords we use to access it and protects against unauthorized access and modification. Digital signatures, time stamps could be faked, altered, or removed entirely. The use of CHF through the entire life-cycle of any digital asset from conception to retirement must be an integral part of the plan, without strong CHF protections, malicious people can cause all sorts of chaos for us and our businesses.
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
4 References Crane, C.   (2021, January 25).   What Is a Hash Function in Cryptography? A Beginner’s Guide   SSL Source.   https://www.thesslstore.com/blog/what-is-a-hash-function-in-cryptography-a-beginners- guide/ Olds, E. ,   Lysecky, R. ,   &   Vahid, F.   (2021).   DAT 305: Data Structures for Problem Solving .   Zyante Inc.   https://learn.zybooks.com/zybook/DAT_305_56827433/chapter/3/section/16? modal_name=about-zybook