Affine enhancements #1892
Open
Affine enhancements #1892
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Updated to use Node 20
|
Hey @profbbrown, could you list the enhancements you have made to the affine operator? |
|
Sure thing. I changed the description of this PR. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Uses the extended Euclidean algorithm to calculate the multiplicative inverse, rather than a brute-force loop.
User can specify the alphabet to use. Some common alphabets are supplied in a menu.
For decryption, a new "use modular inverse" checkbox requires that the correct values for
aandbmust be supplied by the user, rather than calculated from the values used to encrypt.