Variably Modified Permutation Composition: Difference between revisions

Content deleted Content added
Addbot (talk | contribs)
m Bot: Migrating 2 interwiki links, now provided by Wikidata on d:q4052549
let the readers decide what interests them
Line 12:
for x from 0 do n-1: g(x) = VMPC(f(x)) = f(f(f(x))+1)
 
Interestingly invertingInverting the function, i.e. obtaining f from g appears to be a complex problem. According to computer simulations the average number of operations required to recover f from g for a 16-element permutation is about 2<sup>11</sup>, for 64-element permutation - about 2<sup>53</sup> and for a 256-element permutation - about 2<sup>260</sup>.
 
Theoretically speaking - if these results were possible to be proved - it would imply that VMPC is a true [[One-way function|one way function]], which would solve the famous [[P = NP problem|P vs NP problem]].