Talk:One-way function: Difference between revisions

Revision as of 07:28, 28 June 2024

Latest revision as of 19:27, 6 January 2025

(3 intermediate revisions by 2 users not shown)

Line 134:

:See [[Probabilistic Turing machine]]. Could be better named. [[User:Deco|Deco]] 11:59, 10 February 2006 (UTC)

:The auxiliary string isn't so much to inform the algorithm, it's simply to enforce a minimum length on the input. This is important because we defined the algorithm as working in polynomial time (implicitly tied to input length), but we actually just want the full f∘A'∘f to work in polynomial time, and the size of the input to f can dominate the size of the input to A'. I've removed the auxiliary string from the definition and added language instead, to reduce confusion. [[Special:Contributions/88.115.207.64|88.115.207.64]] ([[User talk:88.115.207.64|talk]]) 17:48, 29 October 2015 (UTC)

:Can I ask why you needed it 'today' then and if it was relevant to the one-way functional? [[Special:Contributions/50.220.179.25|50.220.179.25]] ([[User talk:50.220.179.25|talk]]) 07:28, 28 June 2024 (UTC)

==Other types of function==

Line 144 ⟶ 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)

Line 254 ⟶ 238:

This statement implies P != NP and is therefore currently unknown. It should therefore be removed. (If P = NP, then P != NP is false and thus trivially implies anything.) --fiesh [[Special:Contributions/91.43.222.42|91.43.222.42]] ([[User talk:91.43.222.42|talk]]) 23:21, 15 November 2022 (UTC)

== Editor's note ==

I was reading the page, and in consulting the sources for the page noticed that the source for '''"Lecture Notes on Cryptography"''' '''is outdated'''. I don't have anything else to contribute just wanted to inform the lovely editors of this page. [[User:Zipore|Zipore]] ([[User talk:Zipore|talk]]) 19:27, 6 January 2025 (UTC)