Path: ...!3.eu.feeder.erje.net!feeder.erje.net!usenet.goja.nl.eu.org!newsfeed.bofh.team!paganini.bofh.team!not-for-mail
From: Stefan Claas <fgrsna.pynnf@vagrearg.eh>
Newsgroups: sci.crypt
Subject: Re: Hexlish Test :-)
Date: Fri, 24 Jan 2025 21:20:38 +0100
Organization: To protect and to server
Message-ID: <vn0sn8$2a2n5$1@paganini.bofh.team>
References: <20250117200511.B0E04200EA@hal.oc2mx.net> <20250118173709.81DC3200A9@hal.oc2mx.net> <vmih2j$pk0m$1@paganini.bofh.team> <vmjpjf$rlu8$2@paganini.bofh.team> <3eedaaaa44b3d78b6fc805940b38b14e$1@octade.net> <vmu099$20aip$1@paganini.bofh.team> <a5c21d7dcd4e7d8adb91dd3e86f8277f$1@octade.net>
Mime-Version: 1.0
Injection-Date: Fri, 24 Jan 2025 20:20:56 -0000 (UTC)
Injection-Info: paganini.bofh.team; logging-data="2427621"; posting-host="U/G9l/DcEtIZF5xwaqTcAA.user.paganini.bofh.team"; mail-complaints-to="usenet@bofh.team"; posting-account="9dIQLXBM7WM9KzA+yjdR4A";
User-Agent: flnews/1.3.0pre29 (for GNU/Linux)
Cancel-Lock: sha1:WRfSFLNbCs/P4yxIU5lRj78PQco=
X-Notice: Filtered by postfilter v. 0.9.3
X-Ed25519-Sig: 16d17331fb39a1a75d3e5fc5ceeeeda00d153598a9e92352adcf3a2a362efc8b
 3377183dfb0cbaf947f6c8ef5c1abec9fb1f3d4ee7c750c708cce4bdfef3ed0b
X-Date: It's Fri Sep 11469 09:20:38 PM CET 1993, the September that never ends.
X-Ed25519-Pub: c0ffee5a36e581eb10f60b2831b3cdb955d2e7ef680dd282a8d43ad8b84b357a
Bytes: 4075
Lines: 71

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