Isn't that a very simple substitution cipher (any clear text letter is substituted by two letters of cipher text, with a fixed one-to-one correspondence)?
And aren't they all amenable to very simple cryptanalysis, at least if the encrypted text is long enough, by counting how often certain letters appear, and then trying to plug in reasonable guesses?
FabHK · · focus · HN ↗
<a href="https://en.wikipedia.org/wiki/Substitution_cipher" rel="nofollow">https://en.wikipedia.org/wiki/Substitution_cipher
jgrahamc · · focus · HN ↗
The first step is to take each letter and turn it into a pair of letters from ADFGVX but the second step is then a keyed columnar transposition.
FabHK · · focus · HN ↗