مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

video

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

sound

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Version

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View:

421
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download:

224
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Cites:

Information Journal Paper

Title

A NEW FINITE FIELD MULTIPLICATION ALGORITHM TO IMPROVE ELLIPTIC CURVE CRYPTOSYSTEM IMPLEMENTATIONS

Pages

  119-129

Abstract

 This paper presents a new and efficient implementation approach for the elliptic curve cryptosystem (ECC) based on a novel FINITE FIELD MULTIPLICATION in GF (2m) and an efficient SCALAR MULTIPLICATION algorithm. This new FINITE FIELD MULTIPLICATION algorithm performs zero chain multiplication and required additions in only one clock cycle instead of several clock cycles. Using modified (limited number of shifts) Barrel shifter, the partial result is also shifted in one clock cycle instead of several clock cycles. Both the canonical recoding technique and the sliding window method are applied to the multiplier to reduce the average number of required clock cycles. In the SCALAR MULTIPLICATION algorithm of the proposed implementation approach, the point addition and point doubling operations are computed in parallel. The sliding window method and the signed-digit representation are also used to reduce the average number of point operations. Based on our analysis, the computation cost (the average number of required clock cycles) is effectively reduced in both the proposed FINITE FIELD MULTIPLICATION algorithm and the proposed implementation approach of ECC in comparison with other ECC FINITE FIELD MULTIPLICATION algorithms and implementation approaches.

Multimedia

  • No record.

    • Cites

  • No record.

    • References

    Cite

    APA: Copy

    REZAI, ABDALHOSSEIN, & KESHAVARZI, PARVIZ. (2013). A NEW FINITE FIELD MULTIPLICATION ALGORITHM TO IMPROVE ELLIPTIC CURVE CRYPTOSYSTEM IMPLEMENTATIONS. JOURNAL OF INFORMATION SYSTEMS AND TELECOMMUNICATION (JIST), 1(2), 119-129. SID. https://sid.ir/paper/332638/en

    Vancouver: Copy

    REZAI ABDALHOSSEIN, KESHAVARZI PARVIZ. A NEW FINITE FIELD MULTIPLICATION ALGORITHM TO IMPROVE ELLIPTIC CURVE CRYPTOSYSTEM IMPLEMENTATIONS. JOURNAL OF INFORMATION SYSTEMS AND TELECOMMUNICATION (JIST)[Internet]. 2013;1(2):119-129. Available from: https://sid.ir/paper/332638/en

    IEEE: Copy

    ABDALHOSSEIN REZAI, and PARVIZ KESHAVARZI, “A NEW FINITE FIELD MULTIPLICATION ALGORITHM TO IMPROVE ELLIPTIC CURVE CRYPTOSYSTEM IMPLEMENTATIONS,” JOURNAL OF INFORMATION SYSTEMS AND TELECOMMUNICATION (JIST), vol. 1, no. 2, pp. 119–129, 2013, [Online]. Available: https://sid.ir/paper/332638/en

    Related Journal Papers

  • No record.

    • Related Seminar Papers

  • No record.

    • Related Plans

  • No record.

    • Recommended Workshops






    Move to top
    telegram sharing button
    whatsapp sharing button
    linkedin sharing button
    twitter sharing button
    email sharing button
    email sharing button
    email sharing button
    sharethis sharing button