Re: My nonereversible keyrescheduler with full entropy 2^256

I should said that my permutation algorithm of course reach every 256!
arrangement of password bits.


jt64@xxxxxxxx skrev:

This password rescheduler makes a password morph into the full 2^256
states, it is none reversible and to find output rescheduled key z you
must know t, y and x.

t and y is dependent upon bitpermutations.
x is the savestat created by XOR t and y
so to figure out z you must know all three, or "THE ORIGINAL PASSWORD"
to create t,y,x and roll ->forward in keyscheduling scheme.

You can not recreate t,y,x by knowing/solving one rescheduled key.
The algorithm that creates z is nonereversible you can not find t,y,x
even if you know z.

[init]->
password^invpassword=savestatepw
permutate password at bitlevel
permutate invpassword at bitlevel


[while more passes/byteblocks to reshedule]->
password^invpassword^savestatepw=keysheduled password
password^invpassword=savestatepw
permutate password at bitlevel
permutate invpassword at bitlevel

.

Relevant Pages