Читать книгу Cryptography, Information Theory, and Error-Correction - Aiden A. Bruen - Страница 63

1 Bob chooses in secret two large primes with and sets .

2 Bob chooses bigger than 1 with relatively prime to and to , and with .

3 Bob calculates the decryption index , where is such that the remainder of on division by is 1. More generally, Bob calculates a decryption index , where is such that the remainder of on division by is 1. Here, is any number divisible by both and .

4 Bob announces his public key and keeps his private key secret.

5 Alice wishes to send a secret message and represents as a number between 0 and . Alice then encrypts the message as the remainder of upon division by and transmits to Bob.

6 Bob decrypts by calculating the remainder of upon division by : this gives the original secret message .