Timeline for Implementing an affine cipher
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 16, 2020 at 9:23 | history | edited | CommunityBot |
Commonmark migration
|
|
| Feb 23, 2016 at 2:26 | history | edited | J. M.'s missing motivation♦ |
edited tags
|
|
| Jan 27, 2016 at 14:57 | comment | added | Michael Stern |
In addition to the modulus inverse problem identified by others, shouldn't you check that a is relatively prime to the number of characters in your allowable alphabet (26 in this case)?
|
|
| Jan 27, 2016 at 2:00 | comment | added | Edmund | @march Woops. Just saw this after I posted. +1 | |
| Jan 27, 2016 at 1:57 | answer | added | Edmund | timeline score: 6 | |
| Jan 27, 2016 at 0:56 | answer | added | m_goldberg | timeline score: 4 | |
| Jan 27, 2016 at 0:49 | review | Close votes | |||
| Jan 27, 2016 at 11:41 | |||||
| Jan 27, 2016 at 0:26 | history | edited | m_goldberg | CC BY-SA 3.0 |
Routine clean-up
|
| Jan 27, 2016 at 0:24 | comment | added | march |
Isn't the problem that a^-1 is supposed to be the modular inverse of a rather than just 1/a? Yes: replace a^-1 with PowerMod[a, -1, 26] in the definition of DecryptChar.
|
|
| Jan 27, 2016 at 0:14 | review | First posts | |||
| Jan 27, 2016 at 0:26 | |||||
| Jan 27, 2016 at 0:10 | history | asked | user37220 | CC BY-SA 3.0 |