Explore >> Select a destination
|
You are here 
|
datagenetics.com | ||
| | | | |
kevinventullo.com
|
|
| | | | | Suppose you knew that 9,273,284,218,074,431 was a perfect 7th power. How would you compute the 7th root? This is a long overdue sequel to the previous post, in which the author promised to derive an efficient algorithm for computing exact k-th roots of integers. That is, computing the k-th root of an integer assumed to... | |
| | | | |
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. | |
| | | | |
blog.codingconfessions.com
|
|
| | | An explanation of how Linux handles system calls on x86-64 and why they show up as expensive operations in performance profiles | ||
