Skip to main content
17 events
when toggle format what by license comment
Jun 28, 2016 at 19:06 vote accept Elliot Gorokhovsky
Jun 28, 2016 at 16:27 history edited e-sushi CC BY-SA 3.0
added 8 characters in body; edited title
Jun 28, 2016 at 15:49 answer added Foon timeline score: 3
Jun 28, 2016 at 15:29 answer added Kristina Dedndreaj timeline score: 1
Jun 27, 2016 at 21:23 review Close votes
Jun 28, 2016 at 11:51
Jun 27, 2016 at 21:13 comment added CodesInChaos @D.W. Not all public key crypto is based on bijective one-way functions. Hash signatures are obviously not. And even RSA is a trapdoor function and not one-way in the sense SDL was looking for (unless you throw the private key away)
Jun 27, 2016 at 21:07 comment added D.W. See crypto.stackexchange.com/q/11576/351 and crypto.stackexchange.com/q/13266/351.
Jun 27, 2016 at 21:07 comment added D.W. Possible duplicate of Are there any bijective one-way functions not based on number-theoretic hardness assumptions?
Jun 27, 2016 at 19:29 history tweeted twitter.com/StackCrypto/status/747512239582752768
Jun 27, 2016 at 17:02 answer added poncho timeline score: 12
Jun 27, 2016 at 16:45 answer added mikeazo timeline score: 18
Jun 27, 2016 at 16:38 comment added Elliot Gorokhovsky That would certainly count.
Jun 27, 2016 at 16:37 comment added mikeazo How about McEliece? It's hardness is based on decoding a general linear code.
Jun 27, 2016 at 16:30 comment added Elliot Gorokhovsky From skimming that article it seems the hardness assumption is at least partially based on lattice problems, so maybe? It depends on whether the problem is hard independently of those lattice problems.
Jun 27, 2016 at 16:28 comment added Hilder Vitor Lima Pereira Does the LWE count as a number theoretic problem?
Jun 27, 2016 at 16:17 review Low quality posts
Jun 27, 2016 at 17:15
Jun 27, 2016 at 15:58 history asked Elliot Gorokhovsky CC BY-SA 3.0