Timeline for Are there any bijective one-way functions not based on number-theoretic hardness assumptions?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 20, 2014 at 13:15 | comment | added | juaninf | the trapdoor functions of McEliece and MPKC are not bijective ... | |
| Nov 14, 2013 at 22:27 | history | edited | Dmitry Khovratovich | CC BY-SA 3.0 |
added 624 characters in body
|
| Nov 7, 2013 at 15:07 | comment | added | Dmitry Khovratovich | I will then make an update about bijective polynomials. | |
| Nov 7, 2013 at 12:39 | comment | added | CodesInChaos | I don't see a requirement in the OP that it should be easy to invert when knowing a secret parameter. | |
| Nov 7, 2013 at 10:14 | comment | added | pg1989 | But these schemes have seen renewed interest in the last decade because of their presumed resistance to quantum attacks. Shor's algorithm can't touch McEliece; that would be like trying to use a hammer to pick a lock. | |
| Nov 7, 2013 at 10:10 | history | answered | Dmitry Khovratovich | CC BY-SA 3.0 |