Timeline for Inverting a function
Current License: CC BY-SA 4.0
20 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Jun 24, 2019 at 11:34 | history | bounty ended | CommunityBot | ||
| S Jun 24, 2019 at 11:34 | history | notice removed | user6671 | ||
| Jun 24, 2019 at 4:55 | vote | accept | CommunityBot | ||
| Jun 24, 2019 at 1:59 | answer | added | David White | timeline score: 7 | |
| Jun 17, 2019 at 9:50 | comment | added | user6671 | @DorianoBrogioli: Of course if someone proved, that it is an owf, than he or she would solve the famous $P = NP?$ question. My question is not if this is an owf, but as you said, if the function can be inverted quickly. It could be the case that I have overlooked some algorithm which does the job, and that is why I am asking. Thanks for your comment. | |
| Jun 17, 2019 at 9:47 | comment | added | Doriano Brogioli | I try to imagine why it is difficult to give an answer to this question. If I correctly understand, the inversion can be done (in principle) by testing all the $w$ with the correct length. So the question is if it is possible to perform the inversion with a fast algorithm, say in polynomial time. Simple solutions are not immediately clear, but this is definetly not enough to declare that this is a one-way function. I guess that this is the reason why you are not receiving answers. | |
| Jun 17, 2019 at 9:42 | comment | added | user6671 | @InfiniteLooper: If you are interested in this, there are also some python functions which do the computation of f: orgesleka.blogspot.com/2015/09/candidate-one-way-function.html | |
| Jun 17, 2019 at 9:41 | comment | added | InfiniteLooper | Yes, sorry but it's not clear in your question. The phrase "Compute the Lehmer-Permutation πk from k on n numbers" is really confusing. | |
| Jun 17, 2019 at 9:38 | comment | added | user6671 | @InfiniteLooper: Yes in short, that is how the function is computed. | |
| Jun 17, 2019 at 9:37 | comment | added | InfiniteLooper | So you mean you first take a word consisting of numbers, say $w$. Then, from $w$ you have the Lehmer encoding that gives you a permutation $\sigma$. Thirdly, you apply $\sigma$ to the ordering of your letter in your intial word $w$ ? | |
| Jun 17, 2019 at 9:06 | history | edited | user6671 | CC BY-SA 4.0 |
added 126 characters in body
|
| S Jun 17, 2019 at 9:03 | history | bounty started | CommunityBot | ||
| S Jun 17, 2019 at 9:03 | history | notice added | user6671 | Draw attention | |
| Jun 17, 2019 at 9:01 | history | edited | user6671 | CC BY-SA 4.0 |
added 126 characters in body
|
| Jun 17, 2019 at 6:19 | history | edited | user6671 |
edited tags
|
|
| Jun 17, 2019 at 6:18 | history | undeleted | user6671 | ||
| Jan 15, 2018 at 9:12 | history | deleted | user6671 | via Vote | |
| Jul 24, 2016 at 5:42 | comment | added | Kim Morrison | It's fine to post on an site after waiting a suitable amount of time. (In this case the poster waited 3 days, which I'd say is within the lower limit of reasonable times.) It's always best to provide links, as well --- thanks for adding that, @D.W. | |
| Jul 24, 2016 at 1:53 | comment | added | D.W. | Also posted on Crypto.SE. Please do not post the same question on multiple sites. Each community should have an honest shot at answering without anybody's time being wasted. | |
| Jun 21, 2016 at 14:15 | history | asked | user6671 | CC BY-SA 3.0 |