Low-complexity digit-serial systolic Gaussian normal basis multiplier for curve-based cryptosystems

Autor:	Chiou-Yng Lee, Wen-Yo Lee, Jim-Min Lin, Che Wun Chiou, Yun-Chi Yeh
Rok vydání:	2014
Předmět:	Exponentiation Finite field Multiplicative function General Engineering Systolic array Multiplication Multiplier (economics) Hardware_ARITHMETICANDLOGICSTRUCTURES Arithmetic Time complexity Square (algebra) Mathematics
Zdroj:	Journal of the Chinese Institute of Engineers. 38:191-199
ISSN:	2158-7299 0253-3839
Popis:	Finite field multiplication over GF(2m) is one of the most important arithmetic operations for curve-based cryptosystems, such as elliptic curve cryptosystems and pairing-based cryptosystems. Gaussian normal basis (GNB) multiplier is very suitable for realizing finite field multiplication in curve-based cryptosystems because GNB multiplier is highly efficient in performing square operations of multiplicative inversion, squaring, and exponentiation operations. Therefore, this study will present a digit-serial GNB multiplier with unidirectional systolic array which is suitable for fault-tolerant design and very large scale integrated circuits implementation. The proposed digit-serial GNB multiplier can save about 22% space complexity and requires almost the same time complexity when compared with the existing similar multipliers.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::e43f396ed912eb15fed4c7a789f00314 https://doi.org/10.1080/02533839.2014.955977 Zobrazit plný text záznamu