Efficient divisor class halving on genus two curves

P. Birkner

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    7 Citations (Scopus)
    66 Downloads (Pure)

    Abstract

    Efficient halving of divisor classes offers the possibility to improve scalar multiplication on hyperelliptic curves and is also a step towards giving hyperelliptic curve cryptosystems all the features that elliptic curve systems have. We present a halving algorithm for divisor classes of genus 2 curves over finite fields of characteristic 2. We derive explicit halving formulae from a doubling algorithm by reversing this process. A family of binary curves, that are not known to be weak, is covered by the proposed algorithm. Compared to previous known halving algorithms, we achieve a noticeable speed-up for this family of curves.
    Original languageEnglish
    Title of host publicationRevised selected papers of the 13th Annual Workshop on Selected Areas in Cryptography (SAC 2006) 17-18 August 2006, Montreal, Quebec, Canada
    EditorsE. Biham, A.M. Youssef
    Place of PublicationBerlin
    PublisherSpringer
    Pages317-326
    ISBN (Print)978-3-540-74462-7
    DOIs
    Publication statusPublished - 2007
    Event13th Annual Workshop on Selected Areas in Cryptography (SAC 2006) - Montreal, Canada
    Duration: 17 Aug 200718 Aug 2007
    Conference number: 13

    Publication series

    NameLecture Notes in Computer Science
    Volume4356
    ISSN (Print)0302-9743

    Conference

    Conference13th Annual Workshop on Selected Areas in Cryptography (SAC 2006)
    Abbreviated titleSAC 2006
    CountryCanada
    CityMontreal
    Period17/08/0718/08/07

    Fingerprint Dive into the research topics of 'Efficient divisor class halving on genus two curves'. Together they form a unique fingerprint.

    Cite this