I am currently solving a simple cryptanalysis problem where I need to decrypt a text file using frequency analysis. The text has been encrypted using an affine cipher over a 68 character alphabet which includes lower and upper case English letters, digits from 0 to 1, as well as those characters: ". , ; : _ \n" where _ denotes space.
Going over the frequency histogram of the text, the most frequent character is "," followed by "z". According to what I know, the most frequent character for the 68 character alphabet is space followed by "e".
Thus I end up with those two equations:
$$66a + b = 63 \bmod 68$$
$$4a + b = 25 \bmod 68$$
Which gives me:
$$62a = 38 \bmod 68$$
$a = 38 \cdot 62^{-1} \bmod 68$
However, 62 isn't invertible mod 68. I am quite new to cryptography so I am quite unsure if there is some method to solve this issue.