Talk:One-way function: Difference between revisions

Revision as of 02:59, 9 March 2024

Revision as of 07:25, 28 June 2024

Line 143:

: You're reading too much into the definition. g(f(x))=x only says that g is a ''left inverse'' of f (not a total inverse since f may not be 1-to-1). That is, given y it returns some value z such that y=f(z). If f maps two values to y, g should return one of these two values, but we don't care which. In your example, the identity function g(x)=x is a left inverse of f(x)=x%5 [[User:Blokhead|Blokhead]] 13:50, 12 June 2006 (UTC)

::I don't think you're reading too much in. 06

:: 6-9=-3+8==11 -9-3===-12+1

:: +__ = +3

::Six minus nine is a negative number three

::If we add eight to this negative number

::the result is NOT eleven but five

::NOT if zero means plus

::six equals eleven

::and includes eight plus three

::as one half of this number is not one more than eleven plus three

::AND seven IS NOT three TIMES this number

::equaling zero as seventeen

::as seven and nineteen are two different numbers

::are not twelve not this negative number plus one

::equaling zero? [[Special:Contributions/50.220.179.25|50.220.179.25]] ([[User talk:50.220.179.25|talk]]) 07:25, 28 June 2024 (UTC)

: Bah, I should check the definitions before I post... anyway, the idea is the same, but notice how f^{-1}(f(x)) is used as a ''set of values'' in the definitions, not a single-valued thing. f^{-1}(y) is the set of all x's that f maps to y. Again, the algorithm could return any one of these, we don't care which. Forget what I said about left inverses.. [[User:Blokhead|Blokhead]] 13:54, 12 June 2006 (UTC)