Open AccessLow space‐complexity digit‐serial dual basis systolic multiplier over Galois field GF(2 m ) using Hankel matrix and Karatsuba algorithm
Author(s) -
Yan Hua Ying,
Lin JimMin,
Wun Chiou Che,
Lee ChiouYng,
Huan Liu Yong
Publication year - 2013
Publication title -
iet information security
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.308
H-Index - 34
eISSN - 1751-8717
pISSN - 1751-8709
DOI - 10.1049/iet-ifs.2012.0227
Subject(s) - gf(2) , polynomial basis , finite field , mathematics , galois theory , normal basis , multiplier (economics) , arithmetic , matrix multiplication , elliptic curve cryptography , algorithm , discrete mathematics , computer science , public key cryptography , encryption , mathematical analysis , physics , quantum mechanics , economics , quantum , macroeconomics , operating system
Multiplication is one important finite field arithmetic operation in cryptographic computations. Dual basis multipliers over Galois field GF(2 m ) have been widely applied in this kind of computations because of its advantage of small chip area. Nevertheless, up to date, there are only few methods that can keep balance of low space complexity and low time complexity at the same time. In order to achieve such an efficient aim, this study presents a novel digit‐serial dual basis multiplier that is different from existing ones with a modified cut‐set method using Karatsuba algorithm as well as Hankel matrix. As a result, the proposed multiplier can save much space and thus be particularly suitable for some hand held devices equipped with only limited resources. The proposed digit‐serial dual basis multiplier saves 55% space complexity as compared with existing similar studies with National Institute of Standards and Technology (NIST) suggested values for elliptic curve cryptosystem.