Learn Java Programming - BigInteger .isProbablePrime() Part 2 RSA Concepts Tutorial

In this tutorial I am going to build on concepts from the Part 1 Tutorial. I am going to go over how we can have some fun trying to crack the underlying foundation of RSA encryption and learn why it is considered to be so secure in the process. The foundation of RSA encryption depends upon the mathematical difficulty of finding exactly two large prime factors in a given composite number. There is more to RSA than what I am going to cover in this tutorial, I am just interested in demonstrating an example of using the isProbablePrime() method to find the factors. The first step in the RSA generation process is to create two large prime numbers - that is super easy to do using the BigInteger constructor designed to create random large prime numbers of a desired bit length.