Intro To Cryptography – Final Exam Study Guide | Complete Questions & Verified Answers | Encryption, Hashing, & Security Concepts

Intro To Cryptography – Final Exam Study Guide |
Complete Questions & Verified Answers | Encryption,
Hashing, & Security Concepts
Virtually All Cryptographic Hash Functions Involve The Iterative Use Of A Compression Function.

ANS: True




A Good Hash Function Has The Property That "The Results Of Applying The Function To A Large
Set Of Inputs Will Produce Outputs That Are Evenly Distributed And Apparently Random".

ANS: True




Hash Functions Can Be Used For Intrusion And Virus Detections.

ANS: True




The Way To Measure The Resistance Of A Hash Algorithm To Cryptanalysis Is To Compare Its
Strength To The Effort Required For A Brute-Force Attack.

ANS: True




It Can Be Shown That Some Form Of Birthday Attack Will Succeed Against Any Hash Scheme
Involving The Use Of Cipher Block Chaining Without A Secret Key, Provided That Either The
Resulting Hash Code Is Small Enough Or That A Larger Hash Code Can Be Decomposed Into
Independent Subcodes.

ANS: True

, The Principal Purpose Of A Hash Function Is __________ .

ANS: Data Integrity




__________ Are Measures Of The Number Of Potential Collisions For A Given Hash Value.

ANS: Preimages




The Effort Required For A Collision Resistant Attack Is Explained By A Mathematical Result
Referred To As The ___________ .

ANS: Birthday Paradox




SHA-1 Produces A Hash Value Of __________ Bits.

ANS: 160




The __________ Resistance Guarantees That It Is Impossible To Find An Alternative Message
With The Same Hash Value As A Given Message.

ANS: Second Pre-Image




Requirements For A Cryptographic Hash Function Include ___________ Which Is The One-Way
Property.

ANS: Pre-Image Resistance