Multiple point compression on elliptic curves

Xinxin Fan, Adilet Otemissov, Francesco Sica, Andrey Sidorenko

    Research output: Contribution to journalArticle

    1 Citation (Scopus)

    Abstract

    Point compression is an essential technique to save bandwidth and memory when deploying elliptic curve based security solutions in wireless communication systems. In this contribution, we provide new linear algebra (LA) based compression algorithms for multiple points on elliptic curves, that are compression algorithms which only make use of LA (with a constant number of field multiplications and at most one inversion, with no quadratic or higher degree polynomial root finding). In particular, we extend the results of Khabbazian et al. (IEEE Trans Comput 56(3):305–313, 2007) to four (resp. five) points on elliptic curves by generically storing five (resp. six) field elements and provide an asymptotic generalization to any number n of points on a curve (Formula presented.) by generically storing (Formula presented.) values.

    Original languageEnglish
    Pages (from-to)1-24
    Number of pages24
    JournalDesigns, Codes, and Cryptography
    DOIs
    Publication statusAccepted/In press - Jul 25 2016

    Keywords

    • Cryptography
    • Elliptic curves
    • Point compression

    ASJC Scopus subject areas

    • Applied Mathematics
    • Computer Science Applications

    Fingerprint Dive into the research topics of 'Multiple point compression on elliptic curves'. Together they form a unique fingerprint.

  • Cite this