23-06-2026, 11:47 PM
It's time to share my latest attempt to reproduce the cipher. At the moment, this option seems to me quite worthy of publishing it here, since it fully meets the criteria of the intended source cipher.
We will turn the letters into numbers by adding 20 to their ordinal number in the alphabet. For example, A = 21 (XXI).
Abbreviations that we use: dif- = 15 (XV); -a = 61 (LXI), I decided to distinguish between a as a letter and a as a morpheme; -ica = 62 (LXII); -is = 70 (LXX)
The original text: Hepatica in silvis diffusa est
1). H-E-P-A-T-ICA = 28-25-36-21-40-62. Sort in ascending order: 21-25-28-36-40-62.
2). I-N = 29-34. We will not sort it.
3). S-I-L-V-IS = 39-29-32-42-70. Sort in ascending order: 29-32-39-42-70.
4). DIF-F-U-S-A = 15-26-41-39-61. Sort in ascending order: 15-26-39-41-61
5). E-S-T = 25-39-40.
Our super-enigmatic alphabet will be:
e = X
d = V
i = n = I
y = 1 (
ch = XX
sh = XL/XV
ei = IX (a little trick, without it, the text will be plain. If anything ei = a)
p = XXX
k = XX
T = L
Encrypting the text: Kchy chd diin pdn et tan
ka pdn s ka pin pa etin tee
ed kdn pa etn ta sh pa et
s - whitespace
Only the first word is recognizable, the result hurts the eye. But let's try to improve this with the help of nulls...
Kchy cheody daiin cphdain ethy (cthy) otain kain pdaiin s kain ethain (cthain) sh pain etham (ctham)
You can introduce a trick with ch as a null and dissect the words, and then, for example, pain would become cphy cha. It will be clearer and more practical for the decryptor. Or, for example, turn chd into chey dy. But I didn't think about it at first and decided to go head-on...
What can I say? As we can see, it is not difficult to turn a series of Roman numerals into a Voynich-like text. Secondary encryption seems to reproduce well even with such a simple example. This proves not only that it is possible, but also that in general it is not as difficult as it seems.
We will turn the letters into numbers by adding 20 to their ordinal number in the alphabet. For example, A = 21 (XXI).
Abbreviations that we use: dif- = 15 (XV); -a = 61 (LXI), I decided to distinguish between a as a letter and a as a morpheme; -ica = 62 (LXII); -is = 70 (LXX)
The original text: Hepatica in silvis diffusa est
1). H-E-P-A-T-ICA = 28-25-36-21-40-62. Sort in ascending order: 21-25-28-36-40-62.
2). I-N = 29-34. We will not sort it.
3). S-I-L-V-IS = 39-29-32-42-70. Sort in ascending order: 29-32-39-42-70.
4). DIF-F-U-S-A = 15-26-41-39-61. Sort in ascending order: 15-26-39-41-61
5). E-S-T = 25-39-40.
Our super-enigmatic alphabet will be:
e = X
d = V
i = n = I
y = 1 (
ch = XX
sh = XL/XV
ei = IX (a little trick, without it, the text will be plain. If anything ei = a)
p = XXX
k = XX
T = L
Encrypting the text: Kchy chd diin pdn et tan
ka pdn s ka pin pa etin tee
ed kdn pa etn ta sh pa et
s - whitespace
Only the first word is recognizable, the result hurts the eye. But let's try to improve this with the help of nulls...
Kchy cheody daiin cphdain ethy (cthy) otain kain pdaiin s kain ethain (cthain) sh pain etham (ctham)
You can introduce a trick with ch as a null and dissect the words, and then, for example, pain would become cphy cha. It will be clearer and more practical for the decryptor. Or, for example, turn chd into chey dy. But I didn't think about it at first and decided to go head-on...
What can I say? As we can see, it is not difficult to turn a series of Roman numerals into a Voynich-like text. Secondary encryption seems to reproduce well even with such a simple example. This proves not only that it is possible, but also that in general it is not as difficult as it seems.