mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-23 21:11:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

Merge 3a98cdab6e into e3bd7721c8

Browse Source
This commit is contained in:
Srivaishnavi Yaddanapudi 2024-11-17 17:51:30 +05:30 committed by GitHub
commit f577a1966d
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 14 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
ciphers/rot13.py
View File

@ -1,14 +1,20 @@
def dencrypt(s: str, n: int = 13) -> str:
def apply_rot13(s: str) -> str:
"""
https://en.wikipedia.org/wiki/ROT13
Performs a special reversible case of the Caesar cipher.
Rotates a text by 13 letters.
Also see: https://en.wikipedia.org/wiki/ROT13
Example usage:
>>> msg = "My secret bank account number is 173-52946 so don't tell anyone!!"
>>> s = dencrypt(msg)
>>> s = apply_rot13(msg)
>>> s
"Zl frperg onax nppbhag ahzore vf 173-52946 fb qba'g gryy nalbar!!"
>>> dencrypt(s) == msg
>>> apply_rot13(s) == msg
True
"""
if not isinstance(s, str):
return "The input must be a string. Please try again."
n = 13
out = ""
for c in s:
if "A" <= c <= "Z":
@ -21,13 +27,13 @@ def dencrypt(s: str, n: int = 13) -> str:
def main() -> None:
s0 = input("Enter message: ")
s0 = input("Enter message: ").strip()
s1 = dencrypt(s0, 13)
s1 = apply_rot13(s0)
print("Encryption:", s1)
s2 = dencrypt(s1, 13)
print("Decryption: ", s2)
s2 = apply_rot13(s1)
print("Decryption:", s2)
if __name__ == "__main__":