Retired
Affine Cipher (retired)
22sid114
Loading description...
Strings
Fundamentals
View
This comment has been reported as {{ abuseKindText }}.
Show
This comment has been hidden. You can view it now .
This comment can not be viewed.
- |
- Reply
- Edit
- View Solution
- Expand 1 Reply Expand {{ comments?.length }} replies
- Collapse
- Spoiler
- Remove
- Remove comment & replies
- Report
{{ fetchSolutionsError }}
-
-
Your rendered github-flavored markdown will appear here.
-
Label this discussion...
-
No Label
Keep the comment unlabeled if none of the below applies.
-
Issue
Use the issue label when reporting problems with the kata.
Be sure to explain the problem clearly and include the steps to reproduce. -
Suggestion
Use the suggestion label if you have feedback on how this kata can be improved.
-
Question
Use the question label if you have questions and/or need help solving the kata.
Don't forget to mention the language you're using, and mark as having spoiler if you include your solution.
-
No Label
- Cancel
Commenting is not allowed on this discussion
You cannot view this solution
There is no solution to show
Please sign in or sign up to leave a comment.
This terminology is wrong;
a^-1
is the modular multiplicative inverse ofa
in respect ofn
, not modular multiplicative inverse ofa mod n
.edited
Looks like a duplicate to me.
This one is easier. The other one has a broader alphabet, including greek letters. They may still be considered duplicates though. Edit: that other kata requires some serious rework on all levels (tests, error feedback, spec).
Did we somehow reach the point where having a different input alphabet makes the same kata not duplicate?
Not to my knowledge, no. I stated the difference between both kata's. Let the community decide uniqueness.
The description is fuzzy about the meaning of
m
in the modular multiplicatie inverse. It appears(x-b)
ism
, but it is not. I suggest to reword this part, to explain whatm
is.description has been reworded 'm' was a typo
a^−1
is the modular multiplicative inverse of a mod n (a number 'z' such that a.z≡1 mod n).This comment has been hidden.
This comment has been hidden.
ok
the decryption function is missing a colon in the solution setup
resolved
Hi,
The setup is ok, but asking only for encryption makes your kata too close to any other basic cipher kata. It has been done to death already and brings nothing new. The task as a stand alone is doomed to sit in beta, imo. Unpublishing so that you can change your mind and add decryption to it. Maybe it can make a difference (note that some users might even disagree about that).
cheers
decryption has also been added