Reordering computation sequences for memory-efficient binary field multiplication

Title
Reordering computation sequences for memory-efficient binary field multiplication
Authors
이문규
Keywords
Finite field · Binary field · Multiplication · Elliptic curve cryptosystem
Issue Date
2013
Publisher
JOURNAL OF SUPERCOMPUTING
Series/Report no.
JOURNAL OF SUPERCOMPUTING ; Vol66 no.2 Startpage 936 Endpage 949
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.
URI
http://dspace.inha.ac.kr/handle/10505/33506
ISSN
0920-8542
Appears in Collections:
College of Engineering(공과대학) > Computer Engineering (컴퓨터공학) > Journal Papers, Reports(컴퓨터정보공학 논문, 보고서)
Files in This Item:
35643.pdfDownload

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse