The SM2 elliptic curve public key cryptography (ECC) is a Chinese commercial cryptography standard similar to National Institute of Standards and Technology (NIST) ECC. The recommended SM2 ECC parameter refers to a 256-bit prime field with different field characteristic from that with NIST ECC. This work proposes a new approach to perform modular reduction over the SM2 ECC modulus. In addition, the famous plus-minus algorithm for modular division is corrected to deal with universal data. Finally, the results for hardware implementation of the three SM2 ECC protocols are given, while the acceleration by the elliptic curve order is introduced.
10 August 2020 in Journal of Shanghai Jiaotong University (Science)
With rapid development and application of artificial intelligence and block chain, the requirement of information and data security is also increased, in which the public-key cryptography, such as Rivest-Shamir-Adleman (RSA) cryptography, plays a significant role. Modular exponentiation is fundamental in computer arithmetic and is widely applied in cryptography, such as ElGamal cryptography, Diffie–Hellman key exchange protocol, and RSA cryptography. The implementation of modular exponentiation in a residue number system leads to high parallelism in computation and has been applied in many hardware architectures. While most residue number system (RNS)-based architectures utilize RNS Montgomery algorithm with two residue number systems, the recent modular multiplication algorithm with sum residues performs modular reduction in only one residue number system with about the same parallelism. In this work, it is shown that the high-performance modular exponentiation and RSA cryptography can be implemented in RNS. Both the algorithm and architecture are improved to achieve high performance with extra area overheads, where a 1024-bit modular exponentiation can be completed in 0.567 ms in Xilinx XC6VLX195t-3 platform, costing 26 489 slices, 87 357 LUTs, 363 dedicated multipilers of $18$$\times $$18$ bits, and 65 block RAMs.
Network on a chip (NoC) uses packet-switched network to implement interconnections in System on chip (SoC). In SoC design, performance and energy efficiency are respectively the first and second priorities, and optimal on-chip communication should decrease the power consumption and area overhead. In this work, a simplified BCH codec is proposed for reliable communication in NoC and SoC. It performs BCH error corrections without Berlekamp's algorithm, only using reduced syndrome bits to determine error patterns. The error locations can be found by looking up tables, by which the possible errors are directly corrected. Only one matrix product and one ROM access are required in the BCH decoder. The proposed (20, 8, 2) and (31, 16, 3) decoders in the paper can be easily applied for error corrections of interconnects and buses for NoC and SoC. It is also beneficial to correct data lines without length definition and control lines without storage.
The long-precision modular multiplier is usually performed by Montgomery algorithm with bit shifts, yielding a result in the form of . In fact, with the precomputation of proposed by others, it is able to compute classic modular multiplication rather than Montgomery modular multiplication . In this work, a multi-bit CSA-based long-precision modular multiplier is proposed for hardware implementation. It includes two carry save adders and one RAM access to perform modular multiplications. After every modular multiplication, a division is applied to reduce the result down to . Hardware implementation results show that a 1024-bit modular multiplication can be completed in 2.39 s on the XC5V FPGA platform, costing 5793 slices, 8 DSPs and 36 BRAMs, which is a promising candidate to compute incontinuous classic modular multiplications.