RSA Encryption with Excel Part 1

This is a class room example of RSA encryption using 3 digit primes and excel for the calculation engine. The video is in three parts. Part 1 describes the initial setup of the algorithm and how to generate exponents of those numbers. This class happened on April 12, 2011 at Eastside Preparatory School in Kirkland

Category:

Education

Tags:

• RSA
• Excel
• Eastside
• Prep
• Education

[fiygkjhgvjlhvgfjklgh]

Do you have a mistake @ 6:45? did you mean (1-0)*28?

[irishbloke99]

i cant thank you enough for this video:) thanks so much

[MrStillspringwater]

Also could you explain how you came up with e (761) I couldnt quite hear what you said in the video. Thanks again.

[MrStillspringwater]

thank you very much for making this video, has been very useful. I do have some questions. Firstly, I thought RSA used the extended euclidean algorithm? What is the difference between this and the euler algorithm?

Also, is it really necessary when you raised the message to the power of 761 (mod n) the way you did? (doing 1-10, the 10-100, 100-700). Could you have not just done 1 line of code to encrypt and 1 line to decrypt?