Advertisement
imk0tter

Imk0tter's Encryption

Jul 9th, 2025
276
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Python 1.11 KB | None | 0 0
  1. ## N to the power of (2 ** -1) produces the square root of N
  2. def ABS(INPUT): return (INPUT * INPUT) ** (2 ** -1)
  3.  
  4. def ATAN(INPUT): return 0 if INPUT == 0 else INPUT / ABS(INPUT)
  5.  
  6. #A trick I invented to produce -1 for numbers < 0 else 1
  7. def TRICK(number): return ATAN(number + ATAN(number ** ATAN(number)))
  8.  
  9. #Both of these encoding algorithms work (they can both be decoded with the same decoder invented by Caesar from Africa)
  10. def ENCRYPT(BASE, INPUT): return ((BASE * 2) + TRICK(INPUT)) * (2 ** ABS(INPUT))
  11. def ENCRYPT2(BASE, INPUT): return ((BASE / 2) + TRICK(INPUT)) / (2 ** ABS(INPUT))
  12.  
  13. def PERMUTE_INTEGERS(INT, *DIMENSIONS):
  14.     return 0
  15.  
  16.  
  17. #Please test safely. Only works for positive integers encoded. This is not the decoder invented by Caesar from africa.
  18. def DECRYPT(BASE):
  19.     BASE_BIT = 0
  20.     while BASE % 2 == 0:
  21.         BASE = BASE / 2
  22.         BASE_BIT = BASE_BIT + 1
  23.     BASE = (BASE - 1) / 2
  24.     return BASE, BASE_BIT
  25. BASE = 0
  26. BASE = ENCRYPT(BASE, 10)
  27. BASE = ENCRYPT(BASE, 256)
  28. print("ENCRYPTION_START: " + str(BASE))
  29. while BASE != 0:
  30.    BASE,BIT = DECRYPT(BASE)
  31.    print("BIT: " + str(BIT))
  32.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement