Lyonsden Blog

Trjmt Qwql Mn Rby Aly Awghnda File

Given: trjmt qwql mn rby aly awghnda

q(17)→p(16) w(23)→v(22) q(17)→p(16) l(12)→k(11) → pvp k → no trjmt qwql mn rby aly awghnda

It looks like you’ve written a phrase in a simple substitution cipher (likely shifting each letter backward or forward in the alphabet). Let me decode it first. Given: trjmt qwql mn rby aly awghnda q(17)→p(16)

t(20)→o(15) r(18)→m(13) j(10)→e(5) m(13)→h(8) t(20)→o(15) → omeho — no. Given the time, I’ll assume it’s a (shift +13), common in puzzles. I’ll assume it’s a (shift +13)

t(20) ↔ g(7) r(18) ↔ e(5) j(10) ↔ w(23) m(13) ↔ z(26) t(20) ↔ g(7) → gewzg — no, not a word. Wait — I realize: trjmt in rot13 is gewzg — nonsense. But if I instead try rot3 :

Check: t(20) → w(23) if +3? No.