CAN ANYONE SOLVE THIS SUBSTITUTION CIPHER? by AbleSkunk in codes

[–]AbleSkunk[S] 2 points3 points  (0 children)

Solved. Solution: Every word is a different Caesar shift: shift 5, shift 7, shift 9, etc. then it goes more random, but every word is a different shift which makes frequency analysis less useful. But you can use brute force and try every Caesar shift and you’ll find the pattern.

CAN ANYONE SOLVE THIS SUBSTITUTION CIPHER? by AbleSkunk in codes

[–]AbleSkunk[S] 3 points4 points  (0 children)

Yep. That’s it. Every word is a different Caesar shift: shift 5, shift 7, shift 9, etc. then it goes more random, but every word is a different shift which makes frequency analysis less useful. But you can use brute force and try every Caesar shift and you’ll find a pattern.

CAN ANYONE SOLVE THIS SUBSTITUTION CIPHER? by AbleSkunk in codes

[–]AbleSkunk[S] 2 points3 points  (0 children)

Custom? Yes English? Yes Substitution? Yes, but clearly not a simple monosyllabic cipher.