文章詳目資料

Journal of Computers EIMEDLINEScopus

  • 加入收藏
  • 下載文章
篇名 Subquadratic Complexity Gaussian Normal Basis Multiplier with Subquadratic and Quadratic Computation Approach
卷期 31:3
作者 Che Wun Chiou 、 Chiou-Yng Lee 、 Yuh-Sien Sun 、 Cheng-Min Lee 、 Shih Shng Chen 、 Jim-Min Lin 、 Tai-Pao Chuang
頁次 011-026
關鍵字 elliptic curve cryptography 、 finite field 、 Gaussian normal basis 、 subquadratic computation complexity multiplier 、 Toeplitz matrix-vector product 、 EI 、 MEDLINE 、 Scopus
出刊日期 202006
DOI 10.3966/199115992020063103002

中文摘要

英文摘要

Finite field multiplication over GF(2m) is the most important arithmetic operation in elliptic curve cryptography. Efficient hardware and software implementations of finite field multiplication are important and necessary. In the past, the Toeplitz matrix-vector product (TMVP) approach was used widely for subquadratic space complexity finite field multipliers. However, the TMVP approach is not effective for core multipliers of such subquadratic space complexity finite field multipliers. Therefore, this study will present a novel subquadratic space complexity type-t Gaussian normal basis (GNB) multiplier, which uses a non-TMVP core multiplier instead of the TMVP core multiplier found in existing approaches. The space complexity of the proposed type-t GNB multiplier is 26% lower than that in the best existing subquadratic space complexity GNB multipliers and the time complexity is 17% lower.

本卷期文章目次

查看更多

關鍵知識WIKI

查看更多

相關文獻