Update README.md

README.md

@@ -2,3 +2,15 @@
 Resources for a unit or course in cryptography without prerequisites from a number-theoretic perspective, originally developed for the publication *Cross-Curricular Pure Math Applications* in the section *Modular Arithmetic through Secret Codes*.
 
 To access Jupyter notebooks (made for students to learn how to write basic SageMath/Python code for basic ciphers), see [Python Modules](https://github.com/kaince/cryptography/tree/main/Python%20Modules).
+
+The order in which the modules build on themselves is as follows. There is some flexibility (for example, whether and when you assign the Euclidean Algorithm and Frequency Analysis modules), but for the most part I strongly recommend following the ordering below when introducing basic ciphers.
+
+1. [ShiftEncrypt](https://github.com/kaince/cryptography/blob/main/Python%20Modules/ShiftEncrypt/ShiftEncrypt.ipynb): Encrypting Shift Ciphers
+2. [ShiftDecrypt](https://github.com/kaince/cryptography/blob/main/Python%20Modules/ShiftDecrypt/ShiftDecrypt.ipynb): Decrypting Shift Ciphers with Known Key
+3. [BruteShift](https://github.com/kaince/cryptography/blob/main/Python%20Modules/BruteShift/BruteShift.ipynb): Brute-Force Cryptanalysis of Shift Ciphers
+4. [AffineEncrypt](https://github.com/kaince/cryptography/blob/main/Python%20Modules/AffineEncrypt/AffineEncrypt.ipynb): Encrypting Affine Ciphers
+5. [Frequency Analysis](https://github.com/kaince/cryptography/blob/main/Python%20Modules/Frequency_Analysis/Frequency_Analysis.ipynb)
+6. [Euclidean Algorithm](https://github.com/kaince/cryptography/blob/main/Python%20Modules/Euclidean%20Algorithm/Euclidean_Algorithm.ipynb)
+7. [VigenereEncrypt](https://github.com/kaince/cryptography/blob/main/Python%20Modules/VigenereEncrypt/VigenereEncrypt.ipynb): Encrypting Vigenère Ciphers
+
+The rubrics I use to grade these modules are [available upon request](mailto:[email protected]).