Keyword | CPC | PCC | Volume | Score | Length of keyword |
---|---|---|---|---|---|

mod 26 decoder | 1.23 | 0.3 | 1576 | 10 | 14 |

mod | 1.55 | 0.5 | 5968 | 46 | 3 |

26 | 0.36 | 0.6 | 8334 | 30 | 2 |

decoder | 1.02 | 0.8 | 5371 | 8 | 7 |

Keyword | CPC | PCC | Volume | Score |
---|---|---|---|---|

mod 26 decoder | 0.11 | 0.7 | 8526 | 4 |

You should have realized that decoding means to undo the original multiplication. For instance, we encoded with a=3, then the encryption function was C=3*P mod 26. To find the decoding function, we have to solve for P. Normally, you would divide both sides by 3.

Your equation is basically: y = 9 x + 10 (mod 26) because you're trying to decode, which would mean that you'll be looking at the set of letters a.k.a. the alphabet, which has 26 letters (26 elements) x (mod 26) ⋅ 9 = 1 ⟹ x = 3 Multiply 3 with the original equation (mod 26).

The number 26 represents the length of the alphabet and will be different for different languages. The Affine cipher can be broken using the standard statistical methods for monoalphabetic substitution ciphers.

This free & easy-to-use Modulo (Mod) Calculator is used to perform the modulo operation on numbers. What is Modulo? Given two numbers, a (the dividend) and n (the divisor), a modulo n (abbreviated as a mod n) is the remainder from the division of a by n.