An alternate decomposition of an integer for faster point multiplication on certain elliptic curves

Young Ho Park, Sangtae Jeong, Chang Han Kim, Jong In Lim

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    27 Citations (Scopus)

    Abstract

    In this paper the Gallant-Lambert-Vanstone method is re-examined for speeding up scalar multiplication. Using the theory of μ-Euclidian algorithm, we provide a rigorous method to reduce the theoretical bound for the decomposition of an integer k in the endomorphism ring of an elliptic curve. We then compare the two different methods for decomposition through computational implementations.

    Original languageEnglish
    Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    PublisherSpringer Verlag
    Pages323-334
    Number of pages12
    Volume2274
    ISBN (Print)3540431683, 9783540431688
    DOIs
    Publication statusPublished - 2002
    Event5th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2002 - Paris, France
    Duration: 2002 Feb 122002 Feb 14

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume2274
    ISSN (Print)03029743
    ISSN (Electronic)16113349

    Other

    Other5th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2002
    Country/TerritoryFrance
    CityParis
    Period02/2/1202/2/14

    ASJC Scopus subject areas

    • Computer Science(all)
    • Theoretical Computer Science

    Fingerprint

    Dive into the research topics of 'An alternate decomposition of an integer for faster point multiplication on certain elliptic curves'. Together they form a unique fingerprint.

    Cite this