## You Are Here;

### May 26, 2014

Taking a moment to mull over morphism while contemplating a re-write…

I believe the hash function presented in the ‘One-Way‘ paper to be essentially, a binary modulated, fractionally iterated, derivative of a quadratic discriminant?

Algorithmic error is used as a ‘quantised’ form of binary forward feed for the hash function.

(I’m not concerned with the pragmatics of this approach, yes it’s computationally intensive…)

How do you denote the morphism of a function which is ternary-surjective but also preserving of a binary structure?

The binary conservation of a single ‘bit’ by the hash function, effectively cancels out all but ‘half-a-bit’ of ternary ‘onto’ surjectiveness.

The trapdoor table then conserves the required ‘auxiliary-bit’ via indexing between lateral, L-R (deterministic) inheritance leaves and the middle (non-deterministic) leaf, where the binary hash identity is freed to encode an external bit.

Perhaps that Master-of-Morphism, J.A, would care to comment? How would you categorize and describe this hybrid cryptographic primitive? How do you describe the traversal of its informtion space? Does this all come under a new taxonomy of ‘Pseudo’-One-Way Functions?