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

mod 26 encryption | 0.28 | 1 | 387 | 38 | 17 |

mod | 1.02 | 0.1 | 2131 | 42 | 3 |

26 | 0.32 | 0.9 | 1189 | 19 | 2 |

encryption | 1.04 | 0.8 | 8449 | 77 | 10 |

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

mod 26 encryption | 1.37 | 0.1 | 8953 | 86 |

Each character from the message and its corresponding character in key is added converted to modulo 26. Then the resulting number is mapped back to a character. For decryption, reverse of the same technique is used. Why modulo 26 as it restricts the character set from A to Z.

Mathematically, given a key N, the effective key is N mod 26 (i.e., the remainder after dividing by 26). This also correctly shows that any key that's a multiple of 26 has no effect ( i.e., the result is identical to the input).

26 is the length of your dictionary, which happens to be the length of the English alphabet (A to Z). Using the modulo operator allows you to map every possible output of the matrix multiplication (encryption) to a letter in the alphabet (834 = 2 (mod 26) which is C), which lets you store the encrypted message in the form of a string of letters.

Modified Caesar Cipher where c = (p+3x) mod 26, where c and p are the ciphertext and the plaintext, respectively, and x is the key. How many distinct keys, producing distinct encryption/decryption transformations, are there now? A must-have set of tools for multiplatform development.