A High-Performance Elliptic Curve Cryptographic Processor of SM2 over GF(p)

• DOI: 10.3390/electronics8040431
• Publication Date: 2019-04-15T15:15:58Z
• Authors: Xianghong Hu; Xin Zheng; Shengshi Zhang; Weijun Li; Shuting Cai; Xiaoming Xiong
• Keywords: Operand; Multiplication algorithm; Subtraction

Elliptic curve cryptography (ECC) is widely used in practical applications because ECC has far fewer bits for operands at the same level of security than other public-key cryptosystems such as RSA. The performance an processor usually determined by modular multiplication (MM) and point (PM) operations. For recommended prime field, MM operation can consist fast reduction In this paper, a 256-bit implemented 129-bit (half-word) multiplier using Karatsuba–Ofman algorithm. modulo operation, which gets 512-bit input data from outputs result ( 0 ≤ Z < p ) . We propose two-stage algorithm (TSFR) over SCA-256 obtain intermediate 2 instead 14 traditional algorithm, avoiding lot repetitive subtraction PM width nonadjacent form (NAF) its operational schedules are improved to increase parallelism Synthesized with 0.13 μ m complementary metal oxide semiconductor (CMOS) standard cell library, proposed costs area 280 k gates takes 0.057 ms frequency 250 MHz. design also on Xilinx Virtex-6 platform, consumes 27.655 LUTs 0.37 perform one attaining six times speed-up state-of-the-art. makes tradeoff between performance, thus it better methods.