NTIC An Introduction to Cryptography

Chapter 11 An Introduction to Cryptography

We are now ready for some applications. This chapter introduces cryptography, as well as the prototype for a cool mathematical encryption system and other similar topics. In Chapter 12, we will also discuss practical issues in implementing these – namely, finding huge primes and factoring huge composite numbers.

🔗

By ‘huge’ I mean something substantially bigger than the output of the following commands.

xxxxxxxxxx
 
print(next_prime(randrange(2^100)))
print(next_prime(randrange(2^200)))

🔗

Those are peanuts by today's standards. But with the tools we've developed up to this point, we are ready for them.