RSA section

3 files changed, 8 insertions, 2 deletions

diff --git a/progress/RSA.tex b/progress/RSA.tex
new file mode 100644
index 0000000..67d57c6
--- /dev/null
+++ b/progress/RSA.tex
@@ -0,0 +1,4 @@
+Perhaps the most famous public-key cryptosystems algorithm is the RSA algorithm. This algorithm makes use of the difficulty to determine the prime factorization of large numbers, the infinite number of primes in existence, Euler’s theorem, and the Euclidean Algorithm to encrypt communication. The RSA algorithm is an asymmetric (two keys) cryptographic algorithm, and can also be classified as public-key cryptography, as it involves the general knowledge of one of the keys.
+
+As computer power and shortcuts to factorize large numbers become more efficient as we progress through the 21st century, the rapid increase of the magnitude of the large primes is necessary to keep encryptions secure. Decryption on the receiving end of the encrypted message uses a variety of techniques to decrypt the message efficiently, including the Chinese Remainder Theorem.
+
diff --git a/progress/progress.pdf b/progress/progress.pdf
index e897b86..23dc2c7 100644
--- a/progress/progress.pdf
+++ b/progress/progress.pdf
diff --git a/progress/progress.tex b/progress/progress.tex
index dd92573..7a7269f 100644
--- a/progress/progress.tex
+++ b/progress/progress.tex
@@ -1,8 +1,10 @@
 \input ../format
 \titlesub{Part 2: Progress Report}{Topic: Distributed Systems Integrity and Correctness}
 
-\include Overview
+\include Overview:Overview
 
-\include Products
+\include Products:Products
+
+\include RSA Algorithm:RSA
 
 \bye