Timeline for Computationally intractable orbit of a monoid action on a finite set
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 26, 2021 at 17:00 | history | edited | Dmitry Vaintrob | CC BY-SA 4.0 |
typos
|
| Sep 26, 2021 at 16:54 | history | edited | Dmitry Vaintrob | CC BY-SA 4.0 |
previous version had bug
|
| Sep 26, 2021 at 16:31 | comment | added | Dmitry Vaintrob | The assumption is that there exists a (in this case, "perfect") hash function which does not have a polynomial-time inverse. This is a standard cryptographic assumption but would fail if, for example, P and NP were equivalent. | |
| Sep 24, 2021 at 12:02 | comment | added | westlon | Could you expand what these standard cryptographic assumptions are? Do they apply when you are taking the preimage of one element? | |
| Sep 24, 2021 at 10:24 | vote | accept | westlon | ||
| Sep 24, 2021 at 14:24 | |||||
| Sep 24, 2021 at 9:29 | history | answered | Dmitry Vaintrob | CC BY-SA 4.0 |