Skip to content
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

Jump to bottom

Improving the efficiency of the 'mod_inv' method within the 'mathsHelper' class. Currently, it uses a brute-force approach to find the modular inverse, which may not be optimal for large values of 'm'. Instead, we can utilize the Extended Euclidean Algorithm to compute the modular inverse more efficiently. #794

Open
wants to merge 2 commits into
base: master
Choose a base branch
from

replaced the previous brute-force approach with the Extended Euclidea…

488c784
Select commit
Failed to load commit list.
Open

Improving the efficiency of the 'mod_inv' method within the 'mathsHelper' class. Currently, it uses a brute-force approach to find the modular inverse, which may not be optimal for large values of 'm'. Instead, we can utilize the Extended Euclidean Algorithm to compute the modular inverse more efficiently. #794

replaced the previous brute-force approach with the Extended Euclidea…
488c784
Select commit
Failed to load commit list.

Workflow runs completed with no jobs