Timeline for Is there any way to solve this equation without knowing the inverse modulo?
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 29, 2020 at 7:16 | comment | added | Aravind A | I read that page, but I don't think that it will be easy to guess the key here, because of its large bit size. Further more I am thinking that if we use a different k, frequency analysis won't be able to crack it. I don't think my question is along the lines of a mono alphabet substitution cipher, where each letter is mapped to an element in the field {0, ..., p-1}. Please can you explain a little more, of why you thought my method, is weak like the Affine cipher... | |
| Jan 28, 2020 at 20:50 | review | First posts | |||
| Jan 28, 2020 at 21:11 | |||||
| Jan 28, 2020 at 20:46 | history | answered | Nemo | CC BY-SA 4.0 |