From 38d8fa8919a3624a6d2efea1ed77720ea8f32794 Mon Sep 17 00:00:00 2001
From: Holden Rohrer <holden.rohrer@gmail.com>
Date: Mon, 21 Oct 2019 22:59:08 -0400
Subject: RSA update

---
 progress/RSA.tex | 3 +--
 1 file changed, 1 insertion(+), 2 deletions(-)

(limited to 'progress/RSA.tex')

diff --git a/progress/RSA.tex b/progress/RSA.tex
index 67d57c6..fe70e81 100644
--- a/progress/RSA.tex
+++ b/progress/RSA.tex
@@ -1,4 +1,3 @@
 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.
-
+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. 
-- 
cgit 

