Advertisement
Guest User

Manipulative Tag Cipher

a guest
Mar 1st, 2014
54
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.46 KB | None | 0 0
  1. <Copyright © 2013 Mark Veidemanis>
  2. --Manipulative Tag Cipher--
  3.  
  4. Tags are inside square brackets
  5. Tags are interpreted as individual letters and operations can be performed on them
  6.  
  7. Tags:
  8. X = Any Letter
  9. Y Z[...] = Variable Substitutes
  10.  
  11. 1) Positive Shift
  12. Syntax: "X[+Y]"
  13. Text Alternative: "X[P Y]"
  14. #Shifts X Y places forwards in the alphabet
  15.  
  16. Example:
  17. "A[+1]" = "AB"
  18. "A[P5]" = "AF"
  19.  
  20. 2) Negative Shift
  21. Syntax: "X[-Y]"
  22. Text Alternative: "X[N Y]"
  23. #Shifts X Y places backwards in the alphabet
  24.  
  25. Example:
  26. "A[-3]" = "AX"
  27. "A[N2]" = "AY"
  28.  
  29. 3) Settable Positive Shift
  30. Syntax: "X[SPS Y Z]"
  31. #Shifts Y Z places forwards in the alphabet
  32.  
  33. Example:
  34. "A[SPS A 5]" = "AF"
  35. "A[SPS 2 5]" = "AG"
  36.  
  37. 4) Settable Negative Shift
  38. Syntax: "X[SNS Y Z]"
  39. #Shifts Y Z places backwards in the alphabet
  40.  
  41. Example:
  42. "A[SNS R 1]" = "AQ"
  43. "A[SNS 2 1]" = "AA"
  44.  
  45. 5) Markers
  46. #Markers define a specific point in the alphabet or the distance forwards or backwards from the specified point
  47.  
  48. A) Center
  49. Syntax: "[C]"
  50. #The center of the alphabet, this is 'M'
  51.  
  52. B) Start
  53. Syntax: "[S]" Optional Parameter: "[S + X]"
  54. #The start of the alphabet
  55. #Parameter: Count X letters forwards from the start of the alphabet
  56.  
  57. C) End
  58. Syntax: "[E]" Optional Parameter: "[E + X]"
  59. #The end of the alphabet
  60. #Parameter: Count X letters backwards from the end of the alphabet
  61.  
  62. 6) Indexes
  63. Syntax: "[I-X]", "[I+X]", "[--]", "[++]"
  64. #Skips X places forwards or backwards + or - respectively
  65. #Can be used as raw signs, the number of signs determines the number of places skipped forwards or backwards depending on the sign
  66. #Maximum identical signs that can be together is 3
  67.  
  68. Example:
  69. "D[+3] [++] [SPS 3 2][+1]" = "DGFEF"
  70.  
  71. 7) Positive Binary Counter
  72. Syntax: "X[B+ Y]"
  73. #Complex: Counts forwards in the alphabet by binary digits
  74. #See Binary Reference
  75. Example:
  76. "A[B+ 10000]" = "AB"
  77.  
  78. 8) Negative Binary Counter
  79. Syntax: "X[B- Y]"
  80. #Complex: Counts backwards in the alphabet by binary digits
  81. #See Binary Reference
  82. Example:
  83. "R[B- 10100]" = "RM"
  84.  
  85. 9) Invert Tag
  86. Syntax: "<I></I>"
  87. #Inverts all text betweek the tags
  88. Example:
  89. "<I> [SPS A 5][+1]</I>" = "GF"
  90.  
  91. --References--
  92.  
  93. Binary
  94. 00000 is 0
  95. 1, 2, 4, 8, 16
  96. 01100 is 6
  97. 01011 is 26
  98. #Maximum digits is 5 because more would allow greater numbers that 26, greater numbers can be used to 'wrap' around the alphabet but are not recommended
  99. #Any number can be substituted with the corresponding binary string.
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement