--- Sat Nov 21 2015 | 00:00 | |

wpwrak | djb is fun: "There are many choices of elliptic-curve signature systems. The standard choice, ECDSA, is reasonable if you don't care about simplicity, speed, and security." | 17:19 |
---|---|---|

eintopf | wpwrak: I heard that you should not trust NIST curves | 17:21 |

eintopf | because they work together with NSA, etc :-/ | 17:21 |

eintopf | so big companies says "oh yes we use NIST curve xy, it's a well known standard curve" | 17:22 |

eintopf | but real users should not trust them :-/ | 17:22 |

wpwrak | hmm, i think he may go beyond just NIST curves. but i have to admit that i haven't carefully read let alone understood the article: http://blog.cr.yp.to/20140323-ecdsa.html | 17:24 |

eintopf | wpwrak: I had a course about cryptography at my university and I don't know nothing about cryptography for sure | 17:28 |

eintopf | but what I learned was that the deffie hellman algorithm on in german "Restklassenring"(some algebra with modulo and such things) can be adapted on elliptic-curve algebra | 17:30 |

eintopf | and then some algorithmn to crack deffie hellman is more complex by doing it on elliptic-curve algebra | 17:31 |

wpwrak | ECDH. About 268,000 results (0.46 seconds) :) | 17:31 |

eintopf | ah, the problem to crack Deffie hellman is discrete logarithmn | 17:32 |

eintopf | https://de.wikipedia.org/wiki/Index-Calculus-Algorithmus - that was the algorithmn which you can't easily use in elliptic-curve | 17:32 |

eintopf | something like that | 17:33 |

wpwrak | ah i understand it, the main advantage of EC is that you need a lot fewer bits for the same kind of operations | 17:34 |

wpwrak | e.g., RSA is getting ridiculous, with keys sometimes getting as large as 1 kB (well, that's still mainly for the tin-hat faction, but the rest is just 1-2 binary orders of magnitude behind) | 17:35 |

eintopf | yes, that's why it's interessting for mcu's | 17:36 |

eintopf | smartcards | 17:36 |

--- Sun Nov 22 2015 | 00:00 |

Generated by irclog2html.py 2.9.2 by Marius Gedminas - find it at mg.pov.lt!