Published in

Springer Verlag, Journal of Supercomputing, 2(66), p. 936-949

DOI: 10.1007/s11227-013-0930-y

Links

Tools

Export citation

Search in Google Scholar

Reordering computation sequences for memory-efficient binary field multiplication

Journal article published in 2013 by Tae Youn Han, 이문규, Mun-Kyu Lee
This paper was not found in any repository, but could be made available legally by the author.
This paper was not found in any repository, but could be made available legally by the author.

Full text: Unavailable

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

Finite field multiplication is a crucial building block for cryptography, especially the elliptic curve public key cryptosystem. Recently, various algorithms for efficient finite field multiplication over devices whose resources are extremely constrained have been proposed. However, most of these proposals only take speed optimization into account, but they do not pay much attention to optimization of memory usage. In this paper, we propose a multiplication algorithm on F2m, which minimizes the RAM requirement by rescheduling operation sequences. According to our experimental results on the ATmega128L microprocessor, the proposed algorithm reduces the amount of required RAM by up to 50 % while maintaining the speed at the same level.We also verify the feasibility of our algorithm by applying it to the elliptic curve cryptosystem.