I recently decided to work on a computer program for submission int competitions. I decided to work on the topic Encryption. So, over the past few days I came up with my own unique algorithm based upon an inspiration from an AP test. I have the ouput of running a string through the Encryptor. Here it is:
String 1:
Ǻ0½⌐lcb|n⌐lR▬~╪
String 2 (different from String 1, and longer):
/§%¿ òé~½ &┐0½ k═π╠ ÇZ╬½nOh☺[╝nOE&3⌠¬♀ss╬½¬♀╤[|√
I would like people to attempt to crack it, and see if they are able to resolve the original string. If my calculations are correct, then there are 255! (255 factorial) different possiblities that the same string can be encrypted, depending on some factors set by the user. So if you have the time, please attempt to crack this and post your results.
String 1:
Ǻ0½⌐lcb|n⌐lR▬~╪
String 2 (different from String 1, and longer):
/§%¿ òé~½ &┐0½ k═π╠ ÇZ╬½nOh☺[╝nOE&3⌠¬♀ss╬½¬♀╤[|√
I would like people to attempt to crack it, and see if they are able to resolve the original string. If my calculations are correct, then there are 255! (255 factorial) different possiblities that the same string can be encrypted, depending on some factors set by the user. So if you have the time, please attempt to crack this and post your results.