Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

FPGA Implementation of the ECC Over GF(2m) for Small Embedded Applications

FPGA Implementation of the ECC Over GF(2m) for Small Embedded Applications In this article, we propose a compact elliptic curve cryptographic core over GF(2m). The proposed architecture is based on the Lopez-Dahab projective point arithmetic operations. To achieve efficiency in resources usage, an iterative method that uses a ROM-based state machine is developed for the elliptic curve cryptography (ECC) point doubling and addition operations. The compact ECC core has been implemented using Virtex FPGA devices. The number of the required slices is 2,102 at 321MHz and 6,738 slices at 262MHz for different GF(2m). Extensive experiments were conducted to compare our solution to existing methods in the literature. Our compact core consumes less area than all previously proposed methods. It also provides an excellent performance for scalar multiplication. In addition, the ECC core is implemented in ASIC 0.18μm CMOS technology, and the results show excellent performance. Therefore, our proposed ECC core method provides a balance in terms of speed, area, and power consumption. This makes the proposed design the right choice for cryptosystems in limited-resource devices such as cell phones, IP cores of SoCs, and smart cards. Moreover, side-channel attack resistance is implemented to prevent power analysis. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Embedded Computing Systems (TECS) Association for Computing Machinery

FPGA Implementation of the ECC Over GF(2m) for Small Embedded Applications

Download PDF
19 pages

Loading next page...
 
/lp/association-for-computing-machinery/fpga-implementation-of-the-ecc-over-gf-2m-for-small-embedded-UcKV09Iz5H
Publisher
Association for Computing Machinery
Copyright
Copyright © 2019 ACM
ISSN
1539-9087
eISSN
1558-3465
DOI
10.1145/3310354
Publisher site
See Article on Publisher Site

Abstract

In this article, we propose a compact elliptic curve cryptographic core over GF(2m). The proposed architecture is based on the Lopez-Dahab projective point arithmetic operations. To achieve efficiency in resources usage, an iterative method that uses a ROM-based state machine is developed for the elliptic curve cryptography (ECC) point doubling and addition operations. The compact ECC core has been implemented using Virtex FPGA devices. The number of the required slices is 2,102 at 321MHz and 6,738 slices at 262MHz for different GF(2m). Extensive experiments were conducted to compare our solution to existing methods in the literature. Our compact core consumes less area than all previously proposed methods. It also provides an excellent performance for scalar multiplication. In addition, the ECC core is implemented in ASIC 0.18μm CMOS technology, and the results show excellent performance. Therefore, our proposed ECC core method provides a balance in terms of speed, area, and power consumption. This makes the proposed design the right choice for cryptosystems in limited-resource devices such as cell phones, IP cores of SoCs, and smart cards. Moreover, side-channel attack resistance is implemented to prevent power analysis.

Journal

ACM Transactions on Embedded Computing Systems (TECS) – Association for Computing Machinery

Published: Mar 27, 2019

Keywords: Elliptic curve cryptography (ECC)

References

  • Elliptic curve cryptosystems
    Koblitz, N.
  • Use of elliptic curves in cryptography
    Miller, V. S.
  • K
    Rodríguez-Henríquez, F.; Saqib, N. A.; Pérez, A. D.; Ç,
  • Recommended elliptic curves for federal government use
    NIST.,
  • Improved algorithms for elliptic curve arithmetic in GF(2n)
    Lopez, J.; Dahab, R.
  • FIPS PUB 186-4
    NIST.,
  • Xilinx—All Programmable
    Xilinx,
  • High-performance public-key cryptoprocessor for wireless mobile applications
    Sakiyama, L. B. K.; Preneel, B.
  • Comparing elliptic curve cryptography and RSA on 8-bit CPUs
    Gura, N.; Patel, A.; Wander, A.
  • Exploring the design space of prime field vs
    Wenger, E.; Hutter, M.
  • A
    Hankerson, D.
  • Fundamental Elliptic Curve Cryptography Algorithms, Request for Comments: 6090
    IETF.,
  • P1363 Standard Specifications for Public-Key Cryptography
    IEEE.,
  • A public key cryptosystem and a signature scheme based on discrete logarithms
    ElGamal, T.
  • Bit-parallel finite field multiplier and squarer using polynomial basis
    Wu, H.
  • Fast elliptic curve cryptography on FPGA
    Chelton, W.; Benaissa, M.
  • Elliptic curves cryptosystem implementation based on a look-up table sharing scheme
    Liu, S.; Bowen, F.; King, B.; Wang, W.
  • High performance elliptic curve cryptographic processor over GF(2⁁163)
    Choi, H. M.; Hong, C. P.; Kim, C. H.
  • Efficient FPGA elliptic curve cryptographic processor over GF(2m)
    Antao, S.; Chaves, R.; Sousa, L.
  • A high performance ECC hardware implementation with instruction-level parallelism over GF (2⁁163)
    Zhang, Y.; Chen, D.; Choi, Y.; Chen, L.; Ko, S.-B.
  • High-performance pipelined architecture of elliptic curve scalar multiplication over GF(2m)
    Lijuan, L.; Shuguo, L.
  • Multiplication of multidigit numbers on automata
    Karatsuba, A.; Ofman, Y.
  • High performance scalable elliptic curve cryptosystem processor in GF(2m)
    Loi, K. C. C.; Ko, S.-B.
  • Hardware Implementation of Finite-Field Arithmetic
    Deschamps, J.-P.; Imaña, J. L.; Sutter, G. D.
  • Speeding the Pollard and elliptic curve methods of factorization
    Montgomery, P. L.
  • A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases
    Itoh, T.; Tsujii, S.
  • ISE In-Depth Tutorial, complete guide (UG695)
    Xilinx,
  • Configurable Logic Block, Virtex 6, complete data sheet (UG364)
    Xilinx,
  • Improvements for high performance Elliptic Curve Cryptosystem processor over GF(2⁁163)
    Loi, K. C. Cinnati; Ko, S.-B.
  • High speed ECC implementation on FPGA over GF(2m)
    Khan, Z. U. A.; Benaissa, M.
  • Efficient elliptic curve point multiplication using digit-serial binary field operations
    Sutter, G. D.; Deschamps, J.; Imaña, J. L.
  • Pushing the limits of high-speed GF(2m) elliptic curve scalar multiplication on FPGAs
    Rebeiro, C.; Roy, S. S.; Mukhopadhyay, D.
  • Novel architecture for efficient FPGA implementation of elliptic curve cryptographic processor over GF(2⁁163)
    Mahdizadeh, H.; Masoumi, M.
  • High-speed hardware architecture of scalar multiplication for binary elliptic curve cryptosystems
    Rashidi, B.; Sayedi, S.; Farashahi, R. Rezaeian
  • High-speed and low-latency ECC processor implementation over (2m) on FPGA
    Khan, Z.; Benaissa, M.
  • A reconfigurable GF(2M) elliptic curve cryptographic coprocessor
    Morales-Sandoval, M.; Feregrino-Uribe, C.; Complido, R.; Algredo-Badillo, I.
  • Full-custom hardware implementation of point multiplication on binary Edwards curves for application-specific integrated circuit elliptic curve cryptosystem applications
    Rashidi, B.; Masoud, S. S.; Farashahi, R. R.
  • Xilinx Power Estimator (XPE)
    Xilinx,
  • Virtex-7 FPGAs
    Xilinx,
  • Differential power analysis
    Kocher, P.; Jaffe, J.; Jun, B.
  • Highly regular right-to-left algorithms for scalar multiplication
    Joye, M.