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. | |
| | | | |
dusted.codes
|
|
| | | | | The beauty of asymmetric encryption - RSA crash course for developers | |
| | | | |
www.jeremykun.com
|
|
| | | | | This post assumes working knowledge of elementary number theory. Luckily for the non-mathematicians, we cover all required knowledge and notation in our number theory primer. So Three Thousand Years of Number Theory Wasn't Pointless It's often tough to come up with concrete applications of pure mathematics. In fact, before computers came along mathematics was used mostly for navigation, astronomy, and war. In the real world it almost always coincided with the physical sciences. | |
| | | | |
blog.cryptographyengineering.com
|
|
| | | If you've hung around this blog for a while, you probablyknow how much I like to complain. (Really, quite a lot.) You might even be familiar with one of my favorite complaints:dumb cryptostandards. More specifically:dumb standards promulgated by smart people. The people in question almost always have justifications for whatever earth-shakingly stupid decision they're about... | ||
