This could be encrypted with any key length that is equal or longer than 28 characters (sum of lengths of ciphertext you provided) and as such unsolvable. The character variation between the plaintext
CANDY VERY CRANBERRYhttphttp and its ciphertext
TXOtWjYhVk 8&O$4AmSAcZf.r5Hz is:
or visually in a scatter plot:
I don't see any pattern in it. The encryption is obviously not a simple letter substitution, otherwise same plaintext characters would translate into same ciphertext characters. The function could still be a simple modulo
n + shift
k though. For example, using
n of 32 and
k of -80, the key (or rather the first 28 characters of a key of unknown length) could be:
agQXNrSsTbPEL^NBLkQ8K6B6Z9LZ with 40 -80 respecitvely. Of course, there are countless values of
k that produce 28 printable character strings, and we can't say for sure only printable characters are accepted for the key either, or indeed that this is the encryption method used. Scatter plot suggests good randomness, which doesn't exclude advanced encryption algorithms such as AES, but nether it does a running key cipher or, as @Luc mentiones in the comments, one-time pad where the key used is at least as big as plaintext.
Your question is thus - with the data you provided being insufficient to detect any patterns or repetition - unsolvable.