observation 3: how about keyphrases permute in a term whereas somehow there wasnt a germ permusohn in a wall where the key is to take on inblocks

we can take a wall and beta a value over its totient to bus the wall with the next value in uniant beta respose value ALPHAMOXIVE wall operator revaal finite permutation over totient value wall operator next zomo value nessie wall no eil ianu eil wall eyankneu wall eil wall revaal in __finite __wall __there __is __infinite values totient mix in wall beta alpha nessie whereas eil is permuted in hives over the keyphrase.

now let us consider inboxes whereas there is plaintext.

how in germ order can we consider the key to permute without the data adding more vile scill to the mix of a simple assumption and that is is the wall operator great enough to generate beta finite values where the inbox is to take on the permuted key values as beans whereas can the ciphertext to tangle on in the weleu of finite values, be considered key exchange beta moxive permuter mix.

to my mind the ciphertext must take on the key in the plaintext beans to whereas the pemean'T is to in soilist orders, take on canting the plaintext to bean permute also with the key permuted beans.

this to my knowledge is difficult to concieve as much i hive about the weight of the algorithm to remain at a point that it has high entropy value for data encryption purposes, the notion to make war with the plaintext is hardly fathomable but im sure its possible because the plaintext carries an ianu bean totient where the greater the wall totient the more simplistic the ideal weight of freedom goes into simple operators where full totient entropy is possible with key beans and plaintext beans.

i must really try to figure this out, im bent on it!