01269naa a2200241 a 450000100080000000500110000800800410001902400350006010000180009524500940011326000090020752005410021665300180075765300200077565300240079565300170081965300170083665300270085365300310088065300320091165300150094377300690095820690182020-01-07       2017    bl uuuu     u00u1 u    #d7 a10.1007/s11128-017-1599-62DOI1 aCASTRO, A. de  aQuantum one-way permutation over the finite field of two elements.h[electronic resource]  c2017  aHere, we show that Levin?s one-way permutation is provably secure because its output values are four maximally entangled two-qubit states, and whose probability of factoring them approaches zero faster than the multiplicative inverse of any positive polynomial poly(x) over the Boolean ring of all subsets of x. Our results demonstrate through well-known theorems that existence of classical one-way functions implies existence of a universal quantum one-way permutation that cannot be inverted in subexponential time in the worst case.  aAleatoriedade  aCHSH inequality  aControlled NOT gate  aCriptografia  aCryptography  aNegligible probability  aPermutação unidirecional  aQuantum one-way permutation  aRandomness  tQuantum Information Processinggv. 16, n. 6, p. 1-18, June 2017.