Suppose Bob wants to send Alice a message.
Alice now generates her public key where and sends this to Bob.
Bob breaks up his message into binary strings of length . To send the string to Alice, he forms and sends to Alice.
On receiving , Alice forms . Now, since , we have that . Since is a superincreasing sequence, it is easy to recover the if you know and , and it takes arithmetic operations.
In 1982, a fast algorithm was found for recovering the message knowing only the public key and the cryptogram . It takes advantage of the fact that the public key is not generated in a random way, but comes from a superincreasing sequence.
|Date of creation||2013-03-22 15:12:40|
|Last modified on||2013-03-22 15:12:40|
|Last modified by||aoh45 (5079)|