Recently in class a computer science related deciphering riddle was shown which I could not solve. For the course itself it is not obligatory to solve it but I am interested in the topic and I wonder if it is actually solveable with the given details of the riddle.
It is about finding out encryption mapping of the following two strings, they both are encrypted according to the same mapping:
C : \ 0 0 0 0 0 0 . c p p
D : \ 0 0 0 0 0 0 . c p p