remove repeated information

Author: Wyliemaster

docs/_sidebar.md

@@ -28,6 +28,7 @@
     - [AES](/topics/Algorithms/AES.md)
     - [Base64](/topics/Algorithms/base64.md)
     - [XOR](/topics/Algorithms/Xor.md)
+    - [Robtop Cipher](/topics/Algorithms/robtop-cipher.md)
 
 - [Client]()
     - [Tags](/Topics/client/tags)

docs/reference/keys.md

@@ -22,42 +22,9 @@
 
 ## XOR Types
 
-> <u>There are **two** ways Geometry Dash applies [XOR Cipher](#) to strings - **Static** and **Cycled**</u>
+> there are **two** ways Geometry Dash applies [XOR Cipher](topics/algorithms/xor.md) to strings - **Static** and **Cycled**
 >
 > - Static Ciphers apply the key as is without any changes applying to the key itself.
 > - Cycled Ciphers iterate through each value on the key one by one and then loops back once it reaches the end.
 
-## XOR Example
 
-> *Below are XOR functions for both variations. They are written in javascript for the sake of simplicity*
-
-<!-- tabs:start -->
-
-### **Static**
-
-```js
-function xor_static(key, string) {
-  let result = "";
-  for (let i = 0; i < string.length; i++) {
-    let input = string.charCodeAt(i);
-    result += String.fromCharCode(input ^ key);
-  }
-  return result;
-}
-```
-
-### **Cycle**
-
-```js
-function xor_cycle(key, string) {
-  let result = "";
-  for (let i = 0; i < string.length; i++) {
-    let input = string.charCodeAt(i);
-    let xKey = key.charCodeAt(i % key.length);
-    result += String.fromCharCode(input ^ xKey);
-  }
-  return result;
-}
-```
-
-<!-- tabs:end -->

docs/topics/Algorithms/robtop-cipher.md

@@ -55,23 +55,4 @@ Within the cyclic XOR RobTop Cipher (the most common variant), the key should be
 The differentiating factor between cyclic and static XOR is that cyclic XOR uses a key longer than one byte. This means that the key has to be
 repeatedly looped over during the string iteration.
 
-This idea can be demonstrated within the pseudocode:
-```js
-plaintext = "value to encode"
-xor_key = "..." // The XOR Key from the key reference material.
-
-function cyclic_xor(text, key) {
-    key_length = key.length
-    result = "" // The final result will be stored here
-    for (idx = 0; idx < plaintext; idx++) {
-        cur_key_byte = into_utf8_code(key[idx % key_length]) // The key may be shorter than the text, so we loop over it. Hence the name "cyclic".
-        cur_char_byte = into_utf8_code(text[idx])
-        result += from_utf8_code(cur_char_byte ^ cur_key_byte)
-    }
-    return result
-}
-
-ciphertext = cyclic_xor(plaintext, xor_key)
-```
-
-Likewise, decoding involves the same process as encoding.
+Please refer to the [XOR](/topics/algorithms/xor.md) section for details on the implementation