Suppose cryptographic keys are generated at startup time on a certain O, before much entropy has buit up for eeding the TRNO of he machine in partc the primes p, g in RSA are chosen at this time, with the resut that they are not very random. Any hwo machines running this 00 have a non negligtie proeuty of agreeing on one of the factors of N pg in the RSA parameter generation Some clever attackers have the idea of harvesting the public parameter N trom a large number of these ystens, whch they are atie to do over henmet because these machines are actually webservers They know a way to break at inast a few of the RSAinplementations on the severs Can you th of what they Could do? Hint: Suppose N,- P and N pr where p, , and rare prime and yr. What can you do

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...
icon
Related questions
Question
Previous Problem
Problem List
Next Problem
Suppose cryptographic keys are generated at startup time on a certain OS, before much entropy has buit up for seedng the TRNG o me machire in particiar the
primes p, q in RSA are chosen at this time, with the result that they are not very random. Any hwo machines running this 0S have a non negligbie proeuty of
agreeing on one of the factors of N- pg in the RSA parameter generation.
Some clever attackers have the idea of harvesting the puble parameter N trom a large number of these systems, which they are atie to do over the intmet
because these machines are actually webservers. They know a way to break at least a few of the RSA implementations on the servers Can you th of what they
could do?
Hint: Suppose N = pg and N pr where p, q, and rare prime and qr. What can you do?
Transcribed Image Text:Previous Problem Problem List Next Problem Suppose cryptographic keys are generated at startup time on a certain OS, before much entropy has buit up for seedng the TRNG o me machire in particiar the primes p, q in RSA are chosen at this time, with the result that they are not very random. Any hwo machines running this 0S have a non negligbie proeuty of agreeing on one of the factors of N- pg in the RSA parameter generation. Some clever attackers have the idea of harvesting the puble parameter N trom a large number of these systems, which they are atie to do over the intmet because these machines are actually webservers. They know a way to break at least a few of the RSA implementations on the servers Can you th of what they could do? Hint: Suppose N = pg and N pr where p, q, and rare prime and qr. What can you do?
Expert Solution
steps

Step by step

Solved in 2 steps

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