Finalizing the Repository

- Add README Docs
- Add pip dependencies
- Release under MIT License

LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2021 Ye Shu
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

README.md

@@ -0,0 +1,50 @@
+# MATH313-Wiener_Attack
+
+This is the code for my [MATH 313 Introduction to Number Theory](https://catalog.williams.edu/MATH/detail/?strm=1213&cn=313&crsid=011665) course finals presentation.
+
+The presentation is delivered by Michael Bedard, Alexander Paolozzi, Daniel Queen, and Ye Shu (ordered by last name). It focuses on the [Wiener's attack](https://en.wikipedia.org/wiki/Wiener's_attack) (also known as the low private exponent attack) on RSA. In the presentation, we mathematically proved how and why the attack works.
+
+Stars and contributions are welcomed!
+
+## Running
+
+This repository contains codes implementing [Wiener's attack](https://en.wikipedia.org/wiki/Wiener's_attack) in Python 3.
+
+All dependencies are listed in [requirements.txt](./requirements.txt). To run this program, you need to clone this repo, install the dependencies with `pip`, and run the main file `Wiener.py`
+
+```bash
+# Clone & Enter the repo
+git clone https://github.com/yechs/MATH313-Wiener_Attack.git
+cd MATH313-Wiener_Attack
+
+# Install the dependencies
+pip install -r requirements.txt
+
+# Run it!
+python3 Wiener.py
+```
+
+## Licensing
+
+All codes under the root directory are written by [Ye Shu (@yechs)](https://github.com/yechs) and are open sourced under [the MIT license](./LICENSE). Anyone can use and redistribute the codes freely as long as they preserve the copyright notices.
+
+#### Exception
+
+However, do note that this repo also contains codes from [pablocelayes/rsa-wiener-attack](https://github.com/pablocelayes/rsa-wiener-attack/tree/906d06109b600ebb515490bc061a2a4072052c14), which are not properly licensed with a free software license. 
+
+These codes are used to generate RSA keypairs vulnerable to Wiener's Attack (i.e. with small private exponent), when you do not supply the program with existing ones.
+
+All unlicensed codes are under the [`libs`](/libs) directory, use them at your own risk.
+
+## References & Further Reads
+
+Boneh, Dan. "Twenty years of attacks on the RSA cryptosystem." *Notices of the AMS* 46.2 (1999): 203-213. https://www.ams.org/notices/199902/boneh.pdf
+
+Calderbank, Alexander. “The RSA Cryptosystem: History, Algorithm, Primes”. Web. 2007. Accessed 27 April 2021. https://www.math.uchicago.edu/~may/VIGRE/VIGRE2007/REUPapers/FINALAPP/Calderbank.pdf
+
+Celayes, Pablo. “rsa-wiener-attack”. Web. 2017. Accessed 24 April 2021. https://github.com/pablocelayes/rsa-wiener-attack
+
+Schneier, Bruce. "Chapter 19.3: RSA". *Applied cryptography: protocols, algorithms, and source code in C.* john wiley & sons, 2007
+
+Wiener, M.J. "Cryptanalysis of short RSA secret exponents," in *IEEE Transactions on Information Theory*, vol. 36, no. 3, pp. 553-558, May 1990, doi: [10.1109/18.54902](https://doi.org/10.1109/18.54902).
+

requirements.txt

@@ -0,0 +1,4 @@
+mpmath==1.2.1
+pyasn1==0.4.8
+rsa==4.7.2
+sympy==1.8