RSA encryption algorithm and it's methematical background and it's application in php
Mathematics Behind RSA Encryption Algorithm rsa cryptography uses properties of humongous numbers as large power of bigger numbers we can't calculate this mathematics directly when numbers are so huge. so here we use tricky mathematics called Modular Airthmathics. we uses Modular Airthmathic because we we don't have to work with large numbers in Modular Airthmatic. For example: 5 module 3 is 2 because: 5 = 1 * 3 + 2. example: 40mod10=30mod10=0. because:40=4*10+0. 30=3*10+0. Modular multiplication of many numbers- X = 36 * 53 * 91 * 17 * 22 (mod 29) . now 36(mod29)=7. 53(mod29)=24. 91(mod29)=4. 17(mod29)=17. 22(mod29)=22. hence X=7*24*4*17*22(mod29). X=14. Modular Powers- compute 11 43 ...