Throughput/Area-efficient ECC Processor Using Montgomery Point Multiplication on FPGA

Article English OPEN
Khan, Z-U-A. ; Benaissa, M. (2015)
  • Publisher: Institute of Electrical and Electronics Engineers
  • Subject:
    acm: Hardware_ARITHMETICANDLOGICSTRUCTURES

High throughput while maintaining low resource is a key issue for elliptic curve cryptography (ECC) hardware implementations in many applications. In this brief, an ECC processor architecture over Galois fields is presented, which achieves the best reported throughput/area performance on field-programmable gate array (FPGA) to date. A novel segmented pipelining digit serial multiplier is developed to speed up ECC point multiplication. To achieve low latency, a new combined algorithm is developed for point addition and point doubling with careful scheduling. A compact and flexible distributed-RAM-based memory unit design is developed to increase speed while keeping area low. Further optimizations were made via timing constraints and logic level modifications at the implementation level. The proposed architecture is implemented on Virtex4 (V4), Virtex5 (V5), and Virtex7 (V7) FPGA technologies and, respectively, achieved throughout/slice figures of 19.65, 65.30, and 64.48 (106/(Seconds × Slices)).
  • References (27)
    27 references, page 1 of 3

    Mar. 2000. [2] R. Hankerson, A. Menezes, and S. Vanstone, Guide to Elliptic Curve

    Cryptography. New York: Springer-Verlag, 2004. GF(2m) Without Precomputation, in Proc. 1st Int. Workshop

    Cryptograph. Hardw. Embedded Syst., 1999, pp. 316-327. [4] 2m)

    multiplier for curve based cryptography, IEEE Trans. Comput., vol. 55,

    no. 10, pp. 1306-1311, Oct. 2006. [5] Z. Khan and M. Benaissa, "Low area ECC implementation on FPGA," in

    Proc. IEEE 20th ICECS, Dec. 8-11, 2013, pp.581-584. [6] T. Itoh and S. Tsujii, A fast algorithm for computing multiplicative

    inverses in GF (2m J. Inf. Comput., vol. 78, no. 3,

    pp171-177, 1988. [7] B. Ansari, M. Hasan, High-Performance Architecture of Elliptic Curve

    Scalar Multiplication, IEEE Trans. Computers, vol.57, no. 11, pp. 1443-

    1453, Nov. 2008. [8] S. Roy, C. Rebeiro, and D. Mukhopadhyay,

  • Metrics
    0
    views in OpenAIRE
    0
    views in local repository
    143
    downloads in local repository

    The information is available from the following content providers:

    From Number Of Views Number Of Downloads
    White Rose Research Online - IRUS-UK 0 143
Share - Bookmark