Efficient scalar multiplication in elliptic curve cryptography

HeubergerUniv.-Prof. Dipl.-Ing. Dr. Clemens Heuberger | Mi, 09.04.2014 | 17:00-18:30, HS 2

Abstract: Scalar multiplication is the key operation in public key cryptosystems implemented via elliptic (or hyperelliptic) curves. One strategy to implement it efficiently uses suitable digit expansions. Having a larger set of digits than strictly necessary introduces redundancy which can be used to minimise the number of expensive curve operations. Apart from binary expansions, expansions to complex bases are used; these correspond to efficient endomorphisms on the curve. We give a survey on these methods and their asymptotic analysis.

This talk is part of / dieser Vortrag ist Teil der Ringvorlesung Informatik und Informationstechnik SS2014.

Posted in TEWI-Kolloquium | Tagged , , , , | Kommentare deaktiviert für Efficient scalar multiplication in elliptic curve cryptography
RSS
EMAIL