REFERENCES
- Adida, B. 2008. Helios: Web-based open-audit voting. In Proceedings of the 17th USENIX Security Symposium. https://www.usenix.org/legacy/event/sec08/tech/full_papers/adida/adida.pdf. Accessed 29 September 2022.
- AES Development. https://csrc.nist.gov/Projects/cryptographic-standards-and-guidelines/Archived-Crypto-Projects/aes-development. Accessed 2 September 2022.
- American Cryptogram Association. https://www.cryptogram.org/. Accessed 1 April 2022.
- Back, A. 2002. Hashcash – a denial of service counter-measure. http://www.hashcash.org/papers/hashcash.pdf. Accessed 30 August 2022.
- Barker, E. 2020. Recommendation for key management: Part 1 – general. NIST Special Publication 800-57 Par 1 Revision 5.
- Barr, T. 2002. Invitation to Cryptology. Upper Saddle River, NJ: Prentice Hall.
- Bauer, C. 2013. Secret History: The Story of Cryptology. Boca Raton: CRC Press.
- Beaver, C. 2009. Cryptology in the classroom: Analyzing a zero-knowledge protocol. Cryptologia. 33(1): 16–23. https://doi.org/10.1080/01611190802550911.
- Beaver, C. and S. Boersma. 2019. Celebrating ten years of KRYPTOS: A series of cryptanalysis. Cryptologia. 44(3): 257–266. https://doi.org/10.1080/01611194.2019.1670283.
- Benaloh, J. 2006. Simple verifiable elections. In Proceedings of the First Usenix/ACCURATE Electronic Voting Technology Workshop. https://www.usenix.org/legacy/events/evt06/tech/full_papers/benaloh/benaloh.pdf. Accessed 29 September 2022.
- Bhaskar, N. and D. Chuen. 2015. Bitcoin mining technology. In D. Chuen (Ed.), Handbook of Digital Currency: Bitcoin, Innovation, Financial Instruments, and Big Data, pp. 45–66. Amsterdam: Academic Press.
- Biham, E. and A. Shamir. 1991. Differential cryptanalysis of DES-like cryptosystems. Journal of Cryptology. 4(1): 3–72. https://doi.org/10.1007/BF00630563.
- Boersma, S. 2022. Complete examples of encryption systems broken by Elizebeth Smith Friedman: 1923–1934. Cryptologia. Online. https://doi.org/10.1080/01611194.2021.2023235.
- Boersma, S. 2022. Elizabeth Smith Friedman and one example of a prohibition era encryption system. Cryptologia. Online. https://doi.org/10.1080/01611194.2021.2003913.
- Boersma, S. 2022. Elizebeth Smith Friedman's recovery of the wiring of two rotors from an enigma D machine. Cryptologia. Online. https://doi.org/10.1080/01611194.2022.2109944.
- Boneh, D. 1999. Twenty years of attacks on the RSA cryptosystem. Notices of the American Mathematical Society (AMS). 46(2): 203–213. https://crypto.stanford.edu/dabo/pubs/papers/RSA-survey.pdf. Accessed 20 June 2022.
- Camenisch, J. and M. Michels. 1999. Proving in zero-knowledge that a number is the product of two safe primes. In J. Stern (Ed.), LNCS: Advances in Cryptology – Eurocrypt '99, Vol. 1592, pp. 107–122. Berlin Heidelberg: Springer.
- Chaum, D. 2004. Secret-ballot receipts: True voter-verifiable elections. IEEE Security & Privacy. 2(1): 38–47. https://doi.org/10.1109/MSECP.2004.1264852.
- Chaum, D., A. Fiat, and M. Naor. 1990. Untraceable electronic cash. In S. Goldwasser (Ed.), LCNS: Advances in Cryptology – Crypto '88, Vol. 403, pp. 319–327. New York: Springer.
- Christensen, C. 2007. Polish mathematicians finding patterns in enigma messages. Mathematics Magazine. 80(4): 247–273. https://doi.org/10.1080/0025570X.2007.11953492.
- Christensen, C. and J. Antrobus. 2017. Cracking the Japanese JN-25cipher. Math Horizons. 24(3): 22–25. https://doi.org/10.4169/mathhorizons.24.3.22.
- Crypto Wars. https://en.wikipedia.org/wiki/Crypto_Wars.
- Crypto Wars: Governments working to undermine encryption. Electronic Frontier Foundation. https://www.eff.org/document/crypto-wars-governments-working-undermine-encryption. Accessed 28 September 2022.
- CryptoDB. https://iacr.org/cryptodb/.
- Cryptologia. https://www.tandfonline.com/journals/ucry20.
- Cryptology ePrint archive. https://eprint.iacr.org/.
- Cyber.Org. Pringles can enigma. https://cyber.org/find-curricula/pringles-can-enigma. Accessed 3 March 2023.
- den Boer, B. 1989. More efficient match-making and satisfiability: The five card trick. In J. J. Quisquater and J. Vandewalle (Eds), LNCS: Advances in Cryptology – EUROCRYPT '89, Vol. 434, pp. 208–217. Berlin, Heidelberg: Springer.
- DES Cracker. https://en.wikipedia.org/wiki/EFF_DES_cracker.
- Desmdt, Y. and Y. Frankel. 1990. Threshold cryptosystems. In G. Brassard (Ed.), LNCS: Advances in Cryptology – Crypto '90, Vol. 435, pp. 307–315. New York: Springer.
- Diffie, W. and S. Landau. 2007. Privacy on the Line: The Politics of Wiretapping and Encryption. The MIT Press.
- Dunin, E. and K. Schmeh. 2020. Codebreaking: A Practical Guide. London: Robinson.
- Ecash. https://en.wikipedia.org/wiki/Ecash. Accessed 30 August 2022.
- Electonic Frontier Foundation. https://www.eff.org/. Accessed 20 July 2022.
- Fagone, J. 2017. The Woman Who Smashed Codes: A True Story of Love, Spies, and the Unlikely Heroine Who Outwitted America's Enemies. Dey Street Books.
- Fiat, A. and A. Shamir. 1987. How to prove yourself: Practical solutions to identification and signature problems. In A. Odlyzko (Ed.), LNCS: Advances in Cryptology – Crypto '86, Vol. 263, pp. 186–194. New York: Springer.
- Fox, P. Transport Layer Security (TLS). Kahn Academy. https://www.khanacademy.org/computing/computers-and-internet/xcae6f4a7ff015e7d:online-data-security/xcae6f4a7ff015e7d:secure-internet-protocols/a/transport-layer-security-protocol-tls. Accessed 30 August 2022.
- Fuensanta, J. and F. Espiau. 2007. The strip cipher – the Spanish official method. Cryptologia. 31(1): 46–56. https://doi.org/10.1080/01611190600954836.
- Greenfield, A. B. 2021. The Woman All Spies Fear: Code Breaker Elizebeth Smith Friedman and Her Hidden Life. New York: Random House Studio.
- Helios. https://vote.heliosvoting.org/. Accessed 20 September 2022.
- Hodges, A. 1983. Alan Turing: The Enigma. New York: Simon and Schuster.
- Hoffman, N. 2007. A simplified IDEA algorithm. Cryptologia. 31(2): 143–151. https://doi.org/10.1080/01611190701215640.
- Hoffstein, J., J. Pipher, and J. Silverman. 2014. An Introduction to Mathematical Cryptography, Second Edition. New York: Springer.
- Holden, J. 2013. Demitasse: A “small” version of the tiny encryption algorithm and its use in a classroom setting. Cryptologia. 37(1): 74–83. https://doi.org/10.1080/01611194.2012.660237.
- Holden, J. 2022. Resource guide for teaching post-quantum cryptography. Cryptologia. Online. https://doi.org/10.1080/01611194.2022.2078077.
- Hong, E. 2022. How does Bitcoin mining work? https://www.investopedia.com/tech/how-does-bitcoin-mining-work/. Accessed 30 August 2022.
- Hossenfelder, S. 2022. The quantum hype bubble is about to burst. https://www.youtube.com/watch?v=CBLVtCYHVO8. Accessed 12 February 2023.
- Integer factorization records. https://en.wikipedia.org/wiki/Integer_factorization_records. Accessed 30 September 2022.
- Kahn, D. 1996. The Codebreakers: The Story of Secret Writing. New York: Scribner.
- Katz, J. and Y. Lindell. 2015. Introduction to Modern Cryptography, Second Edition. Boca Raton, FL: CRC Press.
- Kryptos. https://www.cwu.edu/math/kryptos. Accessed 20 July 2022.
- Lenstra, A. and E. Verheul. 2000. Selecting cryptographic key sizes. In H. Imai andY. Zheng (Eds), LNCS – Public Key Cryptography – PKC 2000, Vol. 1751, pp. 446–465. Berlin, Heidelberg: Springer.
- Levy, S. 1994. Battle of the clipper chip. The New York Times Magazine 12 June 1994, Section 6, p. 46. https://www.nytimes.com/1994/06/12/magazine/battle-of-the-clipper-chip.html. Accessed 29 September 2022.
- Mathfest. https://www.maa.org/meetings/mathfest. Accessed 6 March 2023.
- Matsui, M. 1994. Linear cryptanalysis method for DES cipher. In T. Helleseth (Ed.), LNCS: Advances in Cryptoloty – Eurocrypt '93, Vol. 765, pp. 386–397. Berlin, Heidelberg: Springer.
- Mundy, L. 2017. Code Girls: The Untold Story of the American Women Code Breakers of World War II. New York: Hachette Books.
- Musa, M., E. Schaefer, and S. Wedig. 2003. A simplified AES algorithm and its linear and differential cryptanalyses. Cryptologia. 27(2): 148–177. https://doi.org/10.1080/0161-110391-891838.
- Nakamoto, S. 2008. Bitcoin: A peer-to-peer electronic cash system. https://bitcoin.org/bitcoin.pdf. Accessed 30 August 2022.
- Navajo Code Talkers. https://navajocodetalkers.org/. Accessed 29 September 2022.
- Nian, L. and D. Chuen. 2015. Introduction to Bitcoin. In D. Chuen (Ed.), Handbook of Digital Currency: Bitcoin, Innovation, Financial Instruments, and Big Data, pp. 5–30. Amsterdam: Academic Press.
- NIST. Post-quantum cryptography standardization. https://csrc.nist.gov/Projects/post-quantum-cryptography/post-quantum-cryptography-standardization. Accessed 12 February 2023.
- NIST Cryptography Overview. https://www.nist.gov/cryptography. Accessed 20 September 2022.
- Northwest Undergraduate Mathematics Symposium. https://sites.google.com/pdx.edu/nums2022. Accessed 2 March 2023.
- NSA. Announcing the commercial national security algorithm suite 2.0. https://media.defense.gov/2022/Sep/07/2003071834/-1/-1/0/CSA_CNSA_2.0_ALGORITHMS_.PDF. Accessed 12 December 2022.
- NSA Cryptologic History. https://www.nsa.gov/History/Cryptologic-History/.
- Paar, C. and J. Pelzl. 2010. Understanding Cryptography: A Textbook for Students and Practitioners. Heidelberg: Springer.
- Pacific Inland Mathematics Undergraduate Conference. https://sites.google.com/view/pimuc/home. Accessed 17 April 2023.
- Pacific Northwest section of the Mathematical Association of America. http://sections.maa.org/pnw/. Accessed 2 March 2023.
- Phan, R. 2002. Mini advanced encryption standard (mini-AES): A testbed for cryptanalysis students. Cryptologia. 26(4): 283–306. https://doi.org/10.1080/0161-110291890948.
- Pi Mu Epsilon. https://pme-math.org/. Accessed 2 March 2023.
- Quisquatar, J., M. Quisquatar, M. Quisquatar, M. Quisquatar, L. Guillou, M. A. Guillou, G. Guillou, A. Guillou, G. Guillou, and S. Guillou, 1990. How to explain zero-knowledge protocols to your children. In G. Brassard (Ed.), LNCS: Advances in Cryptology – Crypto '89, Vol. 435, pp. 618–631. New York: Springer.
- Rabin, T. 1998. A simplified approach to threshold and proactive RSA. In H. Krawczyk (Ed.), LNCS – Advances in Cryptology – Crypto '98, Vol. 1462, pp. 89–104. Berlin, Heidelberg: Springer.
- Schaefer, E. 1996. A simplified data encryption standard algorithm. Cryptologia. 20(1): 77–84. https://doi.org/10.1080/0161-119691884799.
- Schneier, B. 1999. The Solitaire encryption algorithm. https://www.schneier.com/academic/solitaire/. Accessed 28 July 2022.
- Shamir, A. 1979. How to share a secret. Communications of the ACM. 22(11): 612–613. https://doi.org/10.1145/359168.359176.
- Shepherd, S. 2007. The tiny encryption algorithm. Cryptologia. 31(3): 233–245. https://doi.org/10.1080/01611190601090606.
- Simons, J. 2006. Bridge cryptography fundamentals. Cryptologia. 30(3): 281–286. https://doi.org/10.1080/01611190600726358.
- Shor, P. 1999. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. Siam Journal on Computing. 26: 1484–1509. https://doi.org/10.1137/S0097539795293172.
- Shoup, V. 2000. Practical threshold signatures. In B. Preneel (Ed.), LNCS: Advances in Cryptology – Eurocrypt 2000, Vol. 1807, pp. 209–222. Berlin, Heidelberg: Springer.
- Singh, S. 1999. The Code Book: The Science of Secrecy from Ancient Egypt to Quantum Cryptography. New York: Anchor Books.
- Stallings, W. 2017. Cryptography and Network Security: Principles and Practice, Seventh Edition. Hoboken, NJ: Pearson.
- Stinson, D. 2006. Cryptography: Theory and Practice, Third Edition. Boca Raton: Taylor & Francis Group.
- Washington, L. 2003. Elliptic Curves: Number Theory and Cryptography. Boca Raton, FL: Chapman & Hall/CRC.
- Wheeler, D. and R. Needham. 1995. TEA, a tiny encryption algorithm. In B. Preneel (Ed.), LNCS: Fast Software Encryption – FSE 1994, Vol. 1008, pp. 363–366. Berlin, Heidelberg: Springer.
- Zimmerman, P. https://philzimmermann.com/. Accessed 30 August 2022.