Functional Abuse?

November 3, 2014

Equation

… for the composite ternary-binary identity of one.way.function

Advertisements

7 Responses to “Functional Abuse?”


  1. Presuming this can be expanded to cover some polynomial-trapdoor reduction…

    Like

  2. AdC Says:

    Phill,
    Is this an involution?

    Like


  3. The function itself, as opposed to the representation above?
    The above was meant to show the (reduction between) fn & its inverse…
    In terms of the fn itself;
    If a permutation, a point reflection, affine transform are involutions, then yes?
    I see where you’re headed with this I think… an XOR is an involution?

    Like

  4. AdC Says:

    yes, reflection is an involution.

    If the product between the transpose of f and f is equato to identity matrix, f is a permutation; and If f²=Id, this permutations is an involution.

    f(control=0,1, target=0,1) = (control, control XOR target) is an involution, because f²=Id.

    Like

  5. AdC(Alexandre) Says:

    if (control XOR target) is irreducible, then this XOR provides a hidden bit for inverting the function f

    Liked by 1 person


  6. Ok, thanks Alex! Give me some time to absorb all of that.

    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: