Ok in the widget how the public key is generated is never stated. Soo… I looked it up. I have one student with enough Math to understand. It is quite complex but there you are. He wants to understand everything. Well it appears that the RSA algorithm would fail if the Modulus is prime (not the product of two primes) which all the Modulus choices are. I’m guessing they used a different algorithm not RSA. I know we don’t need to know, but it keeps at least my brightest student interested if we go to the gory details. anyone know the algorithm, just for fun?