Tag: prime number theorem

RSA Encryption 2

I have completed the second part of my article on the fundamentals of RSA encryption. It can be accessed by clicking on the following link:

RSA 2

There are many more topics in the field of encryption that I would like to learn about and write about. These include:

  • Practical implementation of RSA (padding, signatures, etc)
  • Other algorithms for factoring integers (esp. general number field sieve)
  • Proof of the prime number theorem
  • Attacks on RSA (e.g., timing, chosen ciphertext, side-channel, acoustic, etc)
  • Elliptical curve encryption

However, these are not for the faint of heart. Perhaps in the future.

Instead, right now, what I plan to do next is give a description of the basic theory behind quantum encryption.