Complex One-Time Pad

key for one-time pad

200

sample message

I'm asking you to believe. - Barack Obama

key

encrypt

decrypt

{139.677-8546.52,6033.32-3605.29,-2174.21+1148.21,-2247.09-4069.8,-4111.23+9069.51,9402.41-3007.96,3866.47-9531.39,7195.92+9028.53,-7626.78+7035.6,-3031.07+984.749,1105.1+3324.95,7398.53+536.26,9252.78+7751.39,554.043+7030.67,7178.14+237.026,5676.46-3659.82,9934.32+4422.95,7292.46+1122.59,-6377.7+1072.13,-3592.39+9031.38,-2294.74-5520.11,4232.69+4017.9,-5309.11+9781.02,1456.32-5461.51,4182.48+7818.97,-5576.64+471.571,-1692.61-3681.63,5771.87+635.747,-6895.14+4732.06,-6664.98+538.35,-9493.78-286.416,-1943.17+4079.88,-7095.37+8274.9,-9315.2-3571.95,-1774.6-9344.07,6074.54+4052.49,2877.07-303.204,-7588.74+9478.93,-2675.35-5201.92,-8064.5-5415.98,7083.96+3935.41}

This Demonstration presents very simple but probably unbreakable code. The key, consisting of random complex numbers, is added and subtracted from the message without "XORing". Any Unicode-supported language can be used.