14-09-2024, 04:56 PM
The substitution rules are reversible, ( phew, that took a while )
As for getting from a summed number to a word ...
Ahh, i see, it depends greatly on the numbers allocated the the letters.
doing it with a numerical increment of 1 between letters, as is the way i've done it, is really bad.
for the number 213 there are 82 letter sequences.
for the number 757 there are 54889 letter sequences.
Originally i used Greek letter values then switched to unicode values ( like an idiot ) because i thought it would be easier to compute.
the obvious fix is primes for the letters and multiply instead of sum.
I didn't do that because i wanted some numbers to decode into multiple words ( thats my personal preference for how voynichese works )
and i thought the resulting EVA-words would be too long.
In summary, With a good choice of numerical letter values then yes, i believe this system to be reversible.
Additionally, not necessary but creating a codebook with entries like { summed_number, word1, word2, etc } would make decrypting much easier.
As for getting from a summed number to a word ...
Ahh, i see, it depends greatly on the numbers allocated the the letters.
doing it with a numerical increment of 1 between letters, as is the way i've done it, is really bad.
for the number 213 there are 82 letter sequences.
for the number 757 there are 54889 letter sequences.
Originally i used Greek letter values then switched to unicode values ( like an idiot ) because i thought it would be easier to compute.
the obvious fix is primes for the letters and multiply instead of sum.
I didn't do that because i wanted some numbers to decode into multiple words ( thats my personal preference for how voynichese works )
and i thought the resulting EVA-words would be too long.
In summary, With a good choice of numerical letter values then yes, i believe this system to be reversible.
Additionally, not necessary but creating a codebook with entries like { summed_number, word1, word2, etc } would make decrypting much easier.