Engineering your own voynich
#11
Now looking for the longest repeated strings, there are quite a few for such a short text, so homophones for many tokens are unlikely.

ooiea Tiaeean bar nmaei Teib
T fiiinuy Timyun Taeaei
ir Tian Fooyun Fiiiyun
iaq meaei Tiavinn Ti
TiiiT fiiinuy Ti
aiiea Tiiiig Ki
qeK niinuy
...

Is that what deterministic means: only one cipher text is possible? This would exclude homophones and nulls.
[+] 1 user says Thank You to nablator for this post
Reply
#12
Register or login to view the content
Reply
#13
Register or login to view the content
Reply
#14
Register or login to view the content
Reply
#15
Register or login to view the content
Reply
#16
Register or login to view the content
[+] 1 user says Thank You to nablator for this post
Reply
#17
Register or login to view the content
Reply
#18
Register or login to view the content
Reply
#19
Register or login to view the content
Reply
#20
Register or login to view the content
Reply


Forum Jump:


Users browsing this thread: 2 Guest(s)