Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
To sce how the birthday attack works, let us model a hashing function by a probabilistic algorithm. For a given mcssage, the algorithm chooscs at random its digcst from the sct ZN whcre N is an integer. Implement the hash function using the acccssible pscudorandom number gencrator. Preparc two collections of digests (onc for the original mcssage the other for the bogus mcssage). Each collcction should have VN random numbers. Run your program scvcral timcs and count how many timcs it is possible to find colliding mcssag'CS.

To sce how the birthday attack works, let us model a hashing function by a probabilistic algorithm. For a given mcssage, the algorithm chooscs at random its digcst from the sct ZN whcre N is an integer. Implement the hash function using the acccssible pscudorandom number gencrator. Preparc two collections of digests (onc for the original mcssage the other for the bogus mcssage). Each collcction should have VN random numbers. Run your program scvcral timcs and count how many timcs it is possible to find colliding mcssag'CS.

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

4)

4. To scc how the birthday attack works, let us model a hashing function by a probabilistic algorithm. For a given message, the algorithm chooscs at random its digcst from the set ZN whcre N is an integer. Implemcnt the hash function using the acccssible pscudorandom number gencrator. Preparc two collections of digcsts (onc for the original mcssage the other for the bogus mcssage). Each collection should have vN random numbers. Run your program scvcral times and count how many timcs it is possiblc to find colliding mcssagcs.
Transcribed Image Text:4. To scc how the birthday attack works, let us model a hashing function by a probabilistic algorithm. For a given message, the algorithm chooscs at random its digcst from the set ZN whcre N is an integer. Implemcnt the hash function using the acccssible pscudorandom number gencrator. Preparc two collections of digcsts (onc for the original mcssage the other for the bogus mcssage). Each collection should have vN random numbers. Run your program scvcral times and count how many timcs it is possiblc to find colliding mcssagcs.
Expert Solution
steps

Step by step

Solved in 4 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS