Onion Courier wrote:

IOEAMMLOMHLNEAMILNLJEAMHLHLOEULHMEMOMAMIEALHLVLTLTMJLULOMIMOEALC EALULOLHLJEAMMLJLJLRLJLULIECEAHPETEOAP

LNMIMIMAMHHPEVEVLMLOMILNMJLEEULHLVLTEVHMHAHLLLHLLHHLLHHMHJHMHNEVLNLJMNLSLOMHLN

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)

Onion Courier wrote:

Onion Courier wrote:

IOEAMMLOMHLNEAMILNLJEAMHLHLOEULHMEMOMAMIEALHLVLTLTMJLULOMIMOEALC EALULOLHLJEAMMLJLJLRLJLULIECEAHPETEOAP

LNMIMIMAMHHPEVEVLMLOMILNMJLEEULHLVLTEVHMHAHLLLHLLHHLLHHMHJHMHNEVLNLJMNLSLOMHLN

https://jmp.sh/rQrAU3r8

--
Regards
Stefan

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)

Stefan Claas wrote:

Onion Courier wrote:

Onion Courier wrote:

IOEAMMLOMHLNEAMILNLJEAMHLHLOEULHMEMOMAMIEALHLVLTLTMJLULOMIMOEALC EALULOLHLJEAMMLJLJLRLJLULIECEAHPETEOAP

LNMIMIMAMHHPEVEVLMLOMILNMJLEEULHLVLTEVHMHAHLLLHLLHHLLHHMHJHMHNEVLNLJMNLSLOMHLN

https://jmp.sh/rQrAU3r8

https://jmp.sh/Oa8dl26a

$ hexlish2img -d < test_opt.png | hexlish -d | b2h -d | xchacha20+ -k test1234567890987654321234567890 -n test45678908765432123456

Thanks Byrl for inventing Hexlish! :-)

--
Regards
Stefan

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)

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.

I did not lay down hard rules about resolving similar word collisions with digraphs. I left that very open ended for the user to decide. If I get enough feedback over the next year or so I might revise it with some more iron clad rules.

There is more here on using digraphs to resolve collisions:

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

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

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)

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.

Regards
Stefan

--
Onion Courier Home Server Mon-Fri 15:00-21:00 UTC Sat-Sun 11:00-21:00 UTC ohpmsq5ypuw5nagt2jidfyq72jvgw3fdvq37txhnm5rfbhwuosftzuyd.onion:8080 inbox
age1yubikey1qv5z678j0apqhd4ng7p22g4da8vxy3q5uvthg6su76yj0y8v7wp5kvhstum

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)

IOEAMMLOMHLNEAMILNLJEAMHLHLOEULHMEMOMAMIEALHLVLTLTMJLULOMIMOEALC EALULOLHLJEAMMLJLJLRLJLULIECEAHPETEOAP

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)

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 =

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)

Byrl Raze Buckbriar wrote:

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

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

Thanks for the information, much appreciated! I discussed this but
come to the conclusion that this is for me a major task, involving
a lot of work. Therefore I guess a reference implemenation, either
from you or someone else, who is a native English speaker should
handle this task. This seems to be a complex task, in order to work
properly, with the right English dictionary and mapping dictionary etc.

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.

I already thought about using the Diana Cryptosystem, or the German
'Dein Star' OTP Cryptosystem, with the Hexlish output. Well, ...

Regards
Stefan

--
Onion Courier Home Server Mon-Fri 15:00-21:00 UTC Sat-Sun 11:00-21:00 UTC ohpmsq5ypuw5nagt2jidfyq72jvgw3fdvq37txhnm5rfbhwuosftzuyd.onion:8080 inbox
age1yubikey1qv5z678j0apqhd4ng7p22g4da8vxy3q5uvthg6su76yj0y8v7wp5kvhstum

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)