DocumentCode
394091
Title
An efficient finite-field convolution to enhance the performance of the wavelet cryptosystem on handheld devices
Author
Noorkami, Maneli ; Fekri, Faramarz
Author_Institution
Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA
fYear
2003
fDate
28-30 April 2003
Firstpage
495
Lastpage
499
Abstract
In this paper, we design a fast finite field cyclic convolution algorithm to improve the speed of wavelet cryptosystems on handheld devices. We propose an efficient polynomial multiplication algorithm of degree 7 to design a bilinear cyclic convolution of length 15 that is used in the wavelet cryptosystem. The number of multiplications of the bilinear cyclic convolution is significantly less than the prime factor and the direct method of convolution. We implemented both the wavelet cryptosystem of key length 256 and DES on a Palm OS platform. Our simulation results indicate that the wavelet cryptosystem is approximately 3.3 and 6.6 times faster than DES for encryption and decryption, respectively.
Keywords
convolution; cyclic codes; matrix multiplication; mobile computing; polynomial matrices; public key cryptography; wavelet transforms; 256 bit; DES; Palm OS platform; bilinear cyclic convolution; cyclic convolution algorithm; decryption; encryption; finite-field convolution; handheld devices; performance enhancement; polynomial multiplication algorithm; wavelet cryptosystem; Algorithm design and analysis; Convolution; Cryptography; Design engineering; Handheld computers; Mobile communication; Polynomials; Power system security; Wavelet analysis; Wavelet transforms;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Technology: Coding and Computing [Computers and Communications], 2003. Proceedings. ITCC 2003. International Conference on
Print_ISBN
0-7695-1916-4
Type
conf
DOI
10.1109/ITCC.2003.1197579
Filename
1197579
Link To Document