A collection of helper programs with basic cryptography operations written in TI-Basic
Tests based on Fermat's little theorem and Miller-Rabin algorithm to check a number for primality.
Working on my very first Number Theory Theorem. Please read the research paper too. These programs have been used by me to create practical proofs for my conjecture. Please read the readme file for further details.
Add a description, image, and links to the fermats-little-theorem topic page so that developers can more easily learn about it.
To associate your repository with the fermats-little-theorem topic, visit your repo's landing page and select "manage topics."