From ef696ef4b7667930fb4cab2f4bdd6be35a154501 Mon Sep 17 00:00:00 2001 From: Callum Fortune Date: Tue, 23 Apr 2024 13:02:54 +0100 Subject: [PATCH] update readme to add github repo --- README.md | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/README.md b/README.md index 2af7fb0..9a94012 100644 --- a/README.md +++ b/README.md @@ -8,6 +8,10 @@ A complete Rust implementation of the Miller Rabin primality test algorithm, bas https://core.ac.uk/download/pdf/197479038.pdf +- The official github repo for this project is here... + + https://github.com/callum-fortune/rust-miller-rabin + - I am yet to be made aware of the higher limit of this project, I have tested the code with prime numbers more than 300 characters in length and as little as one, without fail. - I created this project on my journey to implenting a basic Rust RSA implementation. This is a common use case for the Miller-Rabin test and there is a good chance that you are in the same process. Be warned that any implementations of your own that use this code are done at your own risk.