| Autor: |
Pham Van Luc, Vo Tung Linh, Hoang Dang Hai, Leu Duc Tan |
| Rok vydání: |
2020 |
| Předmět: |
|
| Zdroj: |
2020 4th International Conference on Recent Advances in Signal Processing, Telecommunications & Computing (SigTelCom). |
| DOI: |
10.1109/sigtelcom49868.2020.9199062 |
| Popis: |
Binary field multiplication (BFM) plays an important role in applications such as elliptic curve cryptography (ECC). For efficient implementation of BFM on hardware platforms, the design of fast BFM algorithms is remaining a hot research challenge. This paper proposes a new multiplication algorithm for performing multiplication of two binary polynomials. Our algorithm combines the Karatsuba algorithm (5 terms), a 64-bit multiplication and a 32-bit multiplication on ARMv7 microprocessors. We apply our proposed algorithm for Elliptic Curve Digital Signing Algorithm (ECDSA) based on NIST-standard at 128-bit security level and present the performance improvement for the point multiplication on binary elliptic curves. Results are performed on two hardware platforms: Xilinx Zynq-7000 SoC ZC702 and IMX6Q-SABRE for computation speed evaluation and comparison. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
