From a0b12a69ea652d2ee838eb627af52dee1188ca13 Mon Sep 17 00:00:00 2001
From: LukeStenger <112510330+LukeStenger@users.noreply.github.com>
Date: Wed, 23 Apr 2025 22:42:11 -0400
Subject: [PATCH] Update README.md

---
 src/encryption/asymmetric/rsa/README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/encryption/asymmetric/rsa/README.md b/src/encryption/asymmetric/rsa/README.md
index 5d896484..aadd871c 100644
--- a/src/encryption/asymmetric/rsa/README.md
+++ b/src/encryption/asymmetric/rsa/README.md
@@ -21,7 +21,7 @@ Public Key = $(e, n)$
 ## Decryption
 - $m = c^d \mod n$
 
-See the examples in the tests.rs file
+For a complete working example of RSA key generation, encryption, and decryption, see the [examples](https://github.com/pluto/ronkathon/blob/main/src/encryption/asymmetric/rsa/tests.rs) in the `tests.rs` file.
 
 ## Security Assumptions
 The security of RSA relies on the assumption that it is computationally infeasible to factor large composite numbers into their prime factors, known as the factoring assumption. This difficulty underpins the RSA problem, which involves computing eth roots modulo  n  without the private key.