At the addressee the joint key as "start sequence" generates identically parameters and
matrixes. The procedure searches in the array of the respective ciphertext alphabet for the
received cipher characters, ascertains the index of the characters [1...128], converts each index
(-1) into a binary 7-bit sequence and combines it to a 7-bit series. This series will be separated
into 8-bit sequences. In one cycle 72 7-bit sequences result into 63 8-bit sequences. Each 8-bit
value corresponds with the XOR-concatenation generated at the sender and will be reconverted to
the initial plaintext by concatenating with the identically generated block key.
A fundamental effect of "bit conversion" becomes clear by this small example: The length of
cipher text expands, in this case at a ratio of 7:8. The initial 7 plaintext characters have now
become 8 converted ciphertext characters. Thus, the functional connection between plaintext
and ciphertext is interrupted.
E. Cryptanalysis of the procedure
Compared with conventional bit-encryption the here presented procedure indicates a remarkable
difference: in the first case the structure of the bits are changed, only. The number of bits in the
plaintext characters and in the respective ciphertext character are principaly equal (8-bit). A
specific ciphertext character exist for a definite plaintext character. Insofar there is a uniform
digital order system in the whole encryption process: c
= f (p
). This is the reason why the
encrypted text bears certain informations of the respective plaintext [#6].
1. „Coding by pointers“ is insignificant
In the second case with including "bit-conversion" there exists no uniform order system. The
connection between plaintext (p) and ciphertext (c) is interrupted. At least two separate
functions are necessary to realize the connection:
c = f [ f
= f (p) = Converting XOR-concatenated plaintext bits into index values and
= f (f
) = Index values to point to characters in the permuted ciphertext alphabet.
But the ciphertext characters as results of the second function are only "pointers" leading to the
respective positions in the ciphertext array at the addressee.
However, the "pointers" do not contain any information about the plaintext. Therefore, if the
encrypted message is not carrying any information about the initial plaintext the secret text is
actually of no value to any attacker. In data-technical sense this is a "coding by pointers"
[#7]. The only possible access is via the start sequence and by reproducing the correct
"CypherMatrix" at the addressee.
The best known attacks on encrypted messages include structure analysis, "known plaintext
attack", "chosen plaintext attack" and "brute force attack", and possibly also "differential" and
"linear" cryptanalysis [#8]. These attacks are meant to filter out statistically acquirable
regularities from the ciphertext which may possibly show a lead to the plaintext. However,
8. Seite von 11