Decomposing Quanta

December 16, 2014

For this function, essentially we have what could be termed a redundant bit representation of a quantised, ternary-binary inheritance. Output is split between the hash identity & the trapdoor index. The trapdoor index signs determinism or non indeterminisim. The hash identity is deterministic for lateral leaf identities, nonindeterministic for the sole middle identity. Separately, the hash identity & trapdoor index represent the decomposition of a two-state system. Cryptographically, the trapdoor index itself leaks no specific information about the hash identity but it does indicate an approximate 1/3 – 2/3 probability split in the indexing. *A superposition of hash & trapdoor identity would obfuscate that issue but is it necessary? Keeping in mind, as per the previous post, that some trivial n of the hash pre-image is extractable from any in range adversarial guess. Quantum protocols immediately spring to mind as following on from superposition but we’re opening up a whole ‘nother dimension there…

Add: *Upon reflection, probably not. It would superficially appear more random but the real source of randomness comes from the deterministic output. With even trivial extractable correlation of  a pre-image, superposition of the hash & trapdoor would leak information about the plaintext.
Quantum protocols… I’m not sure, I might have to do another post on that.

Add: See post ‘Determining Determinism‘ above, for correction-clarification re; determinism.

Advertisements

2 Responses to “Decomposing Quanta”


  1. Determinism is a somewhat fraught term in cryptography?
    I use ‘non-determinism here’ in the sense that the N-dt leaf-nodes allow free binary encoding, not in the sense of their output being stochastically indeterminate. In this algorithm, the ‘deterministic’ output is the PRG.

    Like


  2. […] appropriated the language beforehand. Determinism Vs. nondeterminism being a case in point. In this post I incorrectly ascribed the property of nondeterminism to the algorithm. At the time, it made naive […]

    Like


Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: