[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: VMs: VMS Word context similarities

Hi,


If VMS "words" are not words and they are not then they are
random pieces of ciphertext (spaces added every here and there-spaces are not characters anyway-just spaces, how would space be presented in the beginning or in the end of the line). This kind of can be produced by kind of table I mentioned or with numerical offset of alphabet.

Can't really tell. Gotta finish a couple of tests.


Gabriel Landini wrote:
On Thursday 08 September 2005 17:56, Heikki Qvist wrote:

You can use this to code 1 plain character with 2 ciphered ones
BB=c
You can use this to code 1 plain character with 1 ciphered one
?B=a (?B is equal B)
And 0 plain character (null) with 2 ciphered ones
TF=?
where ? is for null.



Hmm, but this does not fit in with the length of the labels.
Those are probably single words, otherwise how are they parsed?

With minor amount of data that's not a problem. Opener can do extra work with small piece of ciphertext as long the most of it is easy to decipher. Also labels are so small part of the whole manuscript that there can be less variation in them without giving the clue for solution to outsider.


Other charasteric feature: when plain character is present in ciphered
version , it's never alone.


Which is not the case in the vms, e.g. those cryptic :-) key-like sequences.


Pardon, I am not sure if I get that.
What I meant was that when you are ciphering a letter so that ciphered letter exists in piece of cipher itself (like EA(cipher)->a (plain) in table of prev msg) you cannot cipher a single letter by just itself. Never is a case: a->a).

Cheers,
G.
______________________________________________________________________
To unsubscribe, send mail to majordomo@xxxxxxxxxxx with a body saying:
unsubscribe vms-list

______________________________________________________________________
To unsubscribe, send mail to majordomo@xxxxxxxxxxx with a body saying:
unsubscribe vms-list