Elliptic curve cryptography (ECC) and Pairings get more research attentions for computational constraint devices such as Pocket PCs and wireless sensors. As a result, computational evaluations of various cryptographic algorithms are highly desired to guide researchers to design effective communication protocols. In order to achieve this goal, we conduct comparative performance evaluations for Pocket PC and wireless sensors to study the computational ability to process cryptographic functions, such as point multiplication, Pairings, AES, and hash functions. Our study shows that current Pocket PC level devices are capable to process computational intensive cryptographic functions, such as Parings. However, purely software cryptographic solutions require long time to process cryptographic algorithms and special optimization methods must be used to improve the computation performance.
[1]
Hans Eberle,et al.
Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs
,
2004,
CHES.
[3]
Alfred Menezes,et al.
Guide to Elliptic Curve Cryptography
,
2004,
Springer Professional Computing.
[4]
Ian F. Blake,et al.
Refinements of Miller's algorithm for computing the Weil/Tate pairing
,
2006,
J. Algorithms.
[5]
Dijiang Huang.
Pseudonym-based cryptography for anonymous communications in mobile ad hoc networks
,
2007,
Int. J. Secur. Networks.
[6]
Matthew K. Franklin,et al.
Identity-Based Encryption from the Weil Pairing
,
2001,
CRYPTO.
[7]
Gerardo Pelosi,et al.
Computing Tate Pairing on Smartcards
,
2005
.