aboutsummaryrefslogtreecommitdiff
path: root/final/rsa.tex
diff options
context:
space:
mode:
authorholden watson <holdenew@gmail.com>2019-11-11 21:49:48 -0500
committerholden watson <holdenew@gmail.com>2019-11-11 21:49:48 -0500
commit312ae835a95a0f69cd3ee4480aca50809bc1b1b3 (patch)
treecb9ee8c9480446eada7833d8a46fa2f8a996025a /final/rsa.tex
parent399fbca52880871a9a927677275ba754d2874c04 (diff)
parent290603c1d683e63b2e73eebc8f07f3e5386fd9e0 (diff)
Merge branch 'master' of https://github.com/feynmansfedora/appcomb-proj
Diffstat (limited to 'final/rsa.tex')
-rw-r--r--final/rsa.tex11
1 files changed, 11 insertions, 0 deletions
diff --git a/final/rsa.tex b/final/rsa.tex
new file mode 100644
index 0000000..837a00e
--- /dev/null
+++ b/final/rsa.tex
@@ -0,0 +1,11 @@
+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 (Rivest-Shamir-Adleman, named after its MIT faculty creators) 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.
+
+\sinclude Methodology:rsa-method
+