Skip to content

Improve RSA section: link to the examples and style cleanup for file reference #233

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
LukeStenger wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Improve RSA section: link to the examples and style cleanup for file reference #233

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion src/encryption/asymmetric/rsa/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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.