Please help have been trying this for 5 weeks
J is encrypted as S and S is encrypted as N encryption map y congruen(ax+b)mod 26,decryption map x congruent(cy+d) mod 26
HKHYKXOOB NTHPKYHNYN EHE KVY YXDP YWP TVKTPGY VA IOXTD WVOPN NPCHVJNOB
In the decryption map, x goes to cx + d (mod 26). We know that 18 goes to 9, and 13 goes to 18. So and . Solve these simultaneous equations (mod 26) by subtracting the first from the second, to get , or , which has the solution c=19. Substitute c=19 into the first equation and you find d=5.
Thus the decryption algorithm sends x to 19x + 5. So it sends A (=0) to F (=5). Then it sends B to Y, C to R and so on, going 19 letters forward (or equivalently 7 letters backwards) each time. That should enable you to decrypt the message. (But note that there is an error in the fifth letter of the message, which should be H, not K.)