Brute Force in Displacement Cryptography.

[austin...@hotmail.com]

Brute force in my view is any implicit attack that seeks to circumvent the proper decryption algorithm.

In my displacement cryptography the key-space is literally infinite (the set of all possible resolutions of each ciphertext item that is in truth a resultant of several unknown vectors) and even allowing for the practical limitations of what is 'usable' infinity really means it is out of the question to talk of traditional designs of brute force programs in this context. It is simply not possible to flag any condition that might terminate the test with any reasonable degree of expectation of being right.

It is just not feasible to construct a brute force program that clearly depends on user assistance for a solution (i.e. predetermined keys being called from arrays in mutual databases in a computer – these being known only to the entities of the secure communications loop).

I agree that the type of brute force program that is normally associated with scalar data is just not feasible in this cryptography - not in the expected form anyway – and a discussion of academic origin and comparisons with text book examples is not possible - nor is it needed.

The brute force program being postulated here as cryptanalysis in displacement cryptography is to do entirely with the statistical mapping of ciphertext onto the plaintext it represents in a Kasiski-Babbage style attack.

It is not the usual exhaustive testing of a very large key space.

- adacrypt