Uh oh!
There was an error while loading. Please reload this page.
Uh oh!
There was an error while loading. Please reload this page.
- Notifications
You must be signed in to change notification settings - Fork 51k
Add docstrings and doctests and fix a bug ciphers/trifid_cipher.py#10716
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Merged
Uh oh!
There was an error while loading. Please reload this page.
Merged
Changes from all commits
Commits
Show all changes
15 commits
Select commit
Hold shift + click to select a range
9d55469
Added docstrings,doctests and fixed a bug
FEROS01 7fea1ee
Added docstrings,doctests and fixed a bug
FEROS01 91208b5
Added docstrings,doctests and fixed a bug
FEROS01 3036859
Added docstrings and doctests with a bug fix
FEROS01 476be60
Merge https://github.com/TheAlgorithms/Python into Feros_branch
FEROS01 7ff162d
[pre-commit.ci] auto fixes from pre-commit.com hooks
pre-commit-ci[bot] e2a865e
Added docstrings and doctests with a bug fix
FEROS01 cf94238
Merge branch 'feros001_branch' of https://github.com/FEROS01/Python i…
FEROS01 27b63be
Update ciphers/trifid_cipher.py
FEROS01 b3511bf
Update ciphers/trifid_cipher.py
FEROS01 e28f430
[pre-commit.ci] auto fixes from pre-commit.com hooks
pre-commit-ci[bot] 63be682
Docstrings edit
FEROS01 c678fa7
[pre-commit.ci] auto fixes from pre-commit.com hooks
pre-commit-ci[bot] 9278361
Update trifid_cipher.py
cclauss 055d5c8
Update pyproject.toml
cclauss File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Uh oh!
There was an error while loading. Please reload this page.
Jump to
Jump to file
Failed to load files.
Loading
Uh oh!
There was an error while loading. Please reload this page.
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,15 +1,35 @@ | ||
| # https://en.wikipedia.org/wiki/Trifid_cipher | ||
| """ | ||
| The trifid cipher uses a table to fractionate each plaintext letter into a trigram, | ||
| mixes the constituents of the trigrams, and then applies the table in reverse to turn | ||
| these mixed trigrams into ciphertext letters. | ||
| https://en.wikipedia.org/wiki/Trifid_cipher | ||
| """ | ||
| from __future__ import annotations | ||
| # fmt: off | ||
| TEST_CHARACTER_TO_NUMBER = { | ||
| "A": "111", "B": "112", "C": "113", "D": "121", "E": "122", "F": "123", "G": "131", | ||
| "H": "132", "I": "133", "J": "211", "K": "212", "L": "213", "M": "221", "N": "222", | ||
| "O": "223", "P": "231", "Q": "232", "R": "233", "S": "311", "T": "312", "U": "313", | ||
| "V": "321", "W": "322", "X": "323", "Y": "331", "Z": "332", "+": "333", | ||
| } | ||
| # fmt: off | ||
| def __encrypt_part(message_part: str, character_to_number: dict[str, str]) -> str: | ||
| one, two, three = "", "", "" | ||
| tmp = [] | ||
| TEST_NUMBER_TO_CHARACTER = {val: key for key, val in TEST_CHARACTER_TO_NUMBER.items()} | ||
| for character in message_part: | ||
| tmp.append(character_to_number[character]) | ||
| for each in tmp: | ||
| def __encrypt_part(message_part: str, character_to_number: dict[str, str]) -> str: | ||
| """ | ||
| Arrange the triagram value of each letter of 'message_part' vertically and join | ||
| them horizontally. | ||
| >>> __encrypt_part('ASK', TEST_CHARACTER_TO_NUMBER) | ||
| '132111112' | ||
| """ | ||
| one, two, three = "", "", "" | ||
| for each in (character_to_number[character] for character in message_part): | ||
| one += each[0] | ||
| two += each[1] | ||
| three += each[2] | ||
| @@ -20,12 +40,16 @@ def __encrypt_part(message_part: str, character_to_number: dict[str, str]) -> st | ||
| def __decrypt_part( | ||
| message_part: str, character_to_number: dict[str, str] | ||
| ) -> tuple[str, str, str]: | ||
| tmp, this_part = "", "" | ||
| """ | ||
| Convert each letter of the input string into their respective trigram values, join | ||
| them and split them into three equal groups of strings which are returned. | ||
| >>> __decrypt_part('ABCDE', TEST_CHARACTER_TO_NUMBER) | ||
| ('11111', '21131', '21122') | ||
| """ | ||
| this_part = "".join(character_to_number[character] for character in message_part) | ||
| result = [] | ||
| for character in message_part: | ||
| this_part += character_to_number[character] | ||
| tmp = "" | ||
| for digit in this_part: | ||
| tmp += digit | ||
| if len(tmp) == len(message_part): | ||
| @@ -38,97 +62,148 @@ def __decrypt_part( | ||
| def __prepare( | ||
| message: str, alphabet: str | ||
| ) -> tuple[str, str, dict[str, str], dict[str, str]]: | ||
| """ | ||
| A helper function that generates the triagrams and assigns each letter of the | ||
| alphabet to its corresponding triagram and stores this in a dictionary | ||
| ("character_to_number" and "number_to_character") after confirming if the | ||
| alphabet's length is 27. | ||
| >>> test = __prepare('I aM a BOy','abCdeFghijkLmnopqrStuVwxYZ+') | ||
| >>> expected = ('IAMABOY','ABCDEFGHIJKLMNOPQRSTUVWXYZ+', | ||
| ... TEST_CHARACTER_TO_NUMBER, TEST_NUMBER_TO_CHARACTER) | ||
| >>> test == expected | ||
| True | ||
| Testing with incomplete alphabet | ||
| >>> __prepare('I aM a BOy','abCdeFghijkLmnopqrStuVw') | ||
| Traceback (most recent call last): | ||
| ... | ||
| KeyError: 'Length of alphabet has to be 27.' | ||
| Testing with extra long alphabets | ||
| >>> __prepare('I aM a BOy','abCdeFghijkLmnopqrStuVwxyzzwwtyyujjgfd') | ||
| Traceback (most recent call last): | ||
| ... | ||
| KeyError: 'Length of alphabet has to be 27.' | ||
| Testing with punctuations that are not in the given alphabet | ||
| >>> __prepare('am i a boy?','abCdeFghijkLmnopqrStuVwxYZ+') | ||
| Traceback (most recent call last): | ||
| ... | ||
| ValueError: Each message character has to be included in alphabet! | ||
| Testing with numbers | ||
| >>> __prepare(500,'abCdeFghijkLmnopqrStuVwxYZ+') | ||
| Traceback (most recent call last): | ||
| ... | ||
| AttributeError: 'int' object has no attribute 'replace' | ||
| """ | ||
| # Validate message and alphabet, set to upper and remove spaces | ||
| alphabet = alphabet.replace(" ", "").upper() | ||
| message = message.replace(" ", "").upper() | ||
| # Check length and characters | ||
| if len(alphabet) != 27: | ||
| raise KeyError("Length of alphabet has to be 27.") | ||
| for each in message: | ||
| if each not in alphabet: | ||
| raise ValueError("Each message character has to be included in alphabet!") | ||
| if any(char not in alphabet for char in message): | ||
| raise ValueError("Each message character has to be included in alphabet!") | ||
| # Generate dictionares | ||
| numbers = ( | ||
| "111", | ||
| "112", | ||
| "113", | ||
| "121", | ||
| "122", | ||
| "123", | ||
| "131", | ||
| "132", | ||
| "133", | ||
| "211", | ||
| "212", | ||
| "213", | ||
| "221", | ||
| "222", | ||
| "223", | ||
| "231", | ||
| "232", | ||
| "233", | ||
| "311", | ||
| "312", | ||
| "313", | ||
| "321", | ||
| "322", | ||
| "323", | ||
| "331", | ||
| "332", | ||
| "333", | ||
| ) | ||
| character_to_number = {} | ||
| number_to_character = {} | ||
| for letter, number in zip(alphabet, numbers): | ||
| character_to_number[letter] = number | ||
| number_to_character[number] = letter | ||
| character_to_number = dict(zip(alphabet, TEST_CHARACTER_TO_NUMBER.values())) | ||
| number_to_character = { | ||
| number: letter for letter, number in character_to_number.items() | ||
| } | ||
| return message, alphabet, character_to_number, number_to_character | ||
| def encrypt_message( | ||
| message: str, alphabet: str = "ABCDEFGHIJKLMNOPQRSTUVWXYZ.", period: int = 5 | ||
| ) -> str: | ||
| """ | ||
| encrypt_message | ||
| =============== | ||
| Encrypts a message using the trifid_cipher. Any punctuatuions that | ||
| would be used should be added to the alphabet. | ||
| PARAMETERS | ||
| ---------- | ||
| * message: The message you want to encrypt. | ||
| * alphabet (optional): The characters to be used for the cipher . | ||
| * period (optional): The number of characters you want in a group whilst | ||
| encrypting. | ||
| >>> encrypt_message('I am a boy') | ||
| 'BCDGBQY' | ||
| >>> encrypt_message(' ') | ||
| '' | ||
| >>> encrypt_message(' aide toi le c iel ta id era ', | ||
| ... 'FELIXMARDSTBCGHJKNOPQUVWYZ+',5) | ||
| 'FMJFVOISSUFTFPUFEQQC' | ||
| """ | ||
| message, alphabet, character_to_number, number_to_character = __prepare( | ||
| message, alphabet | ||
| ) | ||
| encrypted, encrypted_numeric = "", "" | ||
| encrypted_numeric = "" | ||
| for i in range(0, len(message) + 1, period): | ||
| encrypted_numeric += __encrypt_part( | ||
| message[i : i + period], character_to_number | ||
| ) | ||
| encrypted = "" | ||
| for i in range(0, len(encrypted_numeric), 3): | ||
| encrypted += number_to_character[encrypted_numeric[i : i + 3]] | ||
| return encrypted | ||
| def decrypt_message( | ||
| message: str, alphabet: str = "ABCDEFGHIJKLMNOPQRSTUVWXYZ.", period: int = 5 | ||
| ) -> str: | ||
| """ | ||
| decrypt_message | ||
| =============== | ||
| Decrypts a trifid_cipher encrypted message . | ||
| PARAMETERS | ||
| ---------- | ||
| * message: The message you want to decrypt . | ||
| * alphabet (optional): The characters used for the cipher. | ||
| * period (optional): The number of characters used in grouping when it | ||
| was encrypted. | ||
| >>> decrypt_message('BCDGBQY') | ||
| 'IAMABOY' | ||
| Decrypting with your own alphabet and period | ||
| >>> decrypt_message('FMJFVOISSUFTFPUFEQQC','FELIXMARDSTBCGHJKNOPQUVWYZ+',5) | ||
| 'AIDETOILECIELTAIDERA' | ||
| """ | ||
| message, alphabet, character_to_number, number_to_character = __prepare( | ||
| message, alphabet | ||
| ) | ||
| decrypted_numeric = [] | ||
| decrypted = "" | ||
| for i in range(0, len(message) + 1, period): | ||
| decrypted_numeric = [] | ||
| for i in range(0, len(message), period): | ||
cclauss marked this conversation as resolved.
Uh oh!There was an error while loading. Please reload this page. | ||
| a, b, c = __decrypt_part(message[i : i + period], character_to_number) | ||
| for j in range(len(a)): | ||
| decrypted_numeric.append(a[j] + b[j] + c[j]) | ||
| for each in decrypted_numeric: | ||
| decrypted += number_to_character[each] | ||
| return decrypted | ||
| return "".join(number_to_character[each] for each in decrypted_numeric) | ||
| if __name__ == "__main__": | ||
| import doctest | ||
| doctest.testmod() | ||
| msg = "DEFEND THE EAST WALL OF THE CASTLE." | ||
| encrypted = encrypt_message(msg, "EPSDUCVWYM.ZLKXNBTFGORIJHAQ") | ||
| decrypted = decrypt_message(encrypted, "EPSDUCVWYM.ZLKXNBTFGORIJHAQ") | ||
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Uh oh!
There was an error while loading. Please reload this page.