From 91845596775396914e410514ae084d5e0e0da9de Mon Sep 17 00:00:00 2001
From: Holden Rohrer <holden.rohrer@gmail.com>
Date: Mon, 11 Nov 2019 20:23:50 -0500
Subject: added rsa

---
 final/rsa.tex | 8 ++++++++
 1 file changed, 8 insertions(+)
 create mode 100644 final/rsa.tex

(limited to 'final/rsa.tex')

diff --git a/final/rsa.tex b/final/rsa.tex
new file mode 100644
index 0000000..0b2962e
--- /dev/null
+++ b/final/rsa.tex
@@ -0,0 +1,8 @@
+In determining correctness, a major concern is determining that the message hasn't been tampered with by an intelligent intermediate.
+Public key cryptography tries to answer this problem by providing proof of authorship and, as an extension of ``normal'' encryption, preventing interception.
+RSA is one such algorithm.
+It works by providing a set of public keys to all parties, and corresponding secret private keys. 
+
+One of the simpler algorithms, it applies the NP-hard nature of factorizing a semiprime, Euler’s theorem, and the Euclidean Algorithm to encrypt communication.
+Because it is simple to devise, it has been included as a sample, in the form of a Python script which encrypts and decrypts messages, given a small RSA key (compared to those used in real applications).
+There are several optimizations (such as applying the Chinese Remainder Theorem) which can be used, but none have been applied to maintain the code's simplicity.
-- 
cgit 

