Explore >> Select a destination
|
You are here 
|
kndrck.co | ||
| | | | |
dusty.phillips.codes
|
|
| | | | | The venerable RSA public key encryption algorithm is very elegant. It requires a basic understanding of modular arithmetic, which may sound scary if you havent studied it. It reduces to taking the remainder after integer long division. The RSA Wikipedia article describes five simple steps to generate the keys. Encryption and decryption are a matter of basic exponentiation. Theres no advanced math, and its easy to understand their example of working with small numbers. | |
| | | | |
www.johndcook.com
|
|
| | | | | RSA encryption as a group automorphism. Lagrange's theorem applied to the group. Carmichael's totient function applied to RSA. | |
| | | | |
www.forwardscattering.org
|
|
| | | | | ||
| | | | |
educatedguesswork.org
|
|
| | | |||
