Idioma:

An efficient exponentiation algorithm in GF(2m) using Euclidean inversion

HE, Wei ; ZHANG, Yu ; LI, Yin

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2022, pp.2022EAL2002 [Periódico revisado por pares]

Texto completo disponível

Citações Citado por

Título:
An efficient exponentiation algorithm in GF(2m) using Euclidean inversion
Autor: HE, Wei ; ZHANG, Yu ; LI, Yin
Assuntos: Cryptography ; Euclidean Inversion ; Exponentiation ; Finite field
É parte de: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2022, pp.2022EAL2002
Descrição: We introduce a new type of exponentiation algorithm in GF(2m) using Euclidean inversion. Our approach is based on the fact that Euclidean inversion cost much less logic gates than ordinary multiplication in GF(2m). By applying signed binary form of the exponent instead of classic binary form, the proposed algorithm can reduce the number of operations further compared with the classic algorithms.
Editor: The Institute of Electronics, Information and Communication Engineers
Idioma: Inglês

Voltar para lista de resultados