Alice and her three friends are all users of the RSA cryptosystem. Her friends nave public keys
Fantastic news! We've Found the answer you've been seeking!
Question:
Alice and her three friends are all users of the RSA cryptosystem. Her friends nave public keys (N i , e i = 3). 1 = 1. 2, 3, where as always. Ni = piqi for randomly chosen n-bit primes p i , q i . Show that if Alice sends the same n-bit message M (encrypted using RSA) to each of her friends, then anyone who intercepts all three encrypted messages will be able to efficiently recover M. (Hint: It helps to have solved problem 1.37 first.)
Related Book For
Data Structures and Algorithm Analysis in Java
ISBN: 978-0132576277
3rd edition
Authors: Mark A. Weiss
Posted Date: