/explore
|
You are here 
|
mfbmina.dev | ||
| | | | |
dusted.codes
|
|
| | | | | The beauty of asymmetric encryption - RSA crash course for developers | |
| | | | |
sergioprado.blog
|
|
| | | | | In this article, we will learn how asymmetric-key encryption and digital signatures work from a practical perspective. | |
| | | | |
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. | |
| | | | |
blog.demofox.org
|
|
| | | This post has an overview of information entropy then moves onto some technical details and experiments. If you have any comments, questions, important additions, etc, please hit me up by commenting on this post, or on twitter at https://twitter.com/Atrix256. The code that goes with this post is at https://github.com/Atrix256/Entropy/ Thanks to all the people on... | ||
