Introduction

Figure 3.1 Encryption of computers and messages use very large prime numbers. (credit: modification of work “Jefferson cylinder cipher (replica)” by Daderot/Wikimedia Commons, Public Domain)

Chapter Outline

3.1 Prime and Composite Numbers

3.2 The Integers

3.3 Order of Operations

3.4 Rational Numbers

3.5 Irrational Numbers

3.6 Real Numbers

3.7 Clock Arithmetic

3.8 Exponents

3.9 Scientific Notation

3.10 Arithmetic Sequences

3.11 Geometric Sequences

Encryption is used to secure online banking, for secure online shopping, and for browsing privately using VPNs (Virtual Private Networks). We need encryption (using prime numbers) for a secure exchange of information. For a prime number to be useful for encryption, though, it has to be large. Encryption uses a composite number that is the product of two very large primes. In order to break the encryption, one must determine the two primes that were used to form the composite number. If the two prime numbers used are sufficiently large, even the fastest computer cannot determine those two prime numbers in a reasonable amount of time. It would take a computer 300 trillion years to crack the current encryption standard.