Re: Hexlish Test :-)

On Thu, 23 Jan 2025 19:03:04 +0100
Stefan Claas <fgrsna.pynnf@vagrearg.eh> wrote:

Byrl Raze Buckbriar wrote:

On Sun, 19 Jan 2025 22:07:59 +0100
Stefan Claas <fgrsna.pynnf@vagrearg.eh> wrote:
 
<.....>
 

Thanks Byrl for inventing Hexlish! :-) 

 
You're welcome, sir. If you think of any improvements or
options to add to it, please brainstorm them in the group.
 

 
It would be interesting to solve the decoding from Hexlish
to English text, with a program, because of multiple chars
mapped to a single Hexlish char.
 
My encoder/decoder works only from hexadecimal to hexlish
and back, which is simple, but can then be used to encode
binary data to hex first and then hexlish.

You can already do that by setting custom digraphs or doublet
digraphs for the words that would collide on reverse decoding.

For example:

BACK ==> PAC || PACK ==> PAC || both collide to PAC.

Resolution:

BACK ==> PPAC || PACK ==> PAC || BACK uses double P.

Or the converse:

BACK ==> PAC || PACK ==> PPAC || PACK uses double P.

Another example:

BAG ==> PAC || BACK ==> PAC || both collide to PAC.

Resolution:

BAG ==> PACC | BACK ==> PAC || BAG uses double C.

This may also be done with vowels where useful.

Or use a custom digraph of letter combos not used in English:

BACK ==> PJAC || PACK ==> JPAC || PJ & JP not whole words.

If separation of words is required for clarity, insert any letter that
does not belong with either of the twain letters it divides.

You can make your own rules as you see fit for your case.

See the link for notes about double digraphs and custom digraphs:

https://soc.octade.net/octade/p/1736830573.829713

For creating ciphers, map each English letter to a pseudorandom,
secretly keyed set of trigraphs, then cycle through the trigraph per
letter before re-using it. This will not create unbreakable ciphers if
the trigraphs are re-used, but for short messages without re-use of
trigraphs it will be reasonably secure. Using trigraphs gives 157
graphs per English letter, so as long as no English letters occur more
than 157 times, the cipher should be a tough nut to crack.

--
  = OCTADE = https://soc.octade.net/octade =