A Scalable Dual-Field Elliptic Curve Cryptographic Processor
IEEE Transactions on Computers
A comparison of secure mechanisms for mobile commerce
MCBE'06 Proceedings of the 7th WSEAS International Conference on Mathematics & Computers in Business & Economics
The investigation of the elliptic curve cryptology applies to the new generation protocol
WSEAS Transactions on Computers
A cryptography index technology and method to measure information disclosure in the DAS model
WSEAS Transactions on Information Science and Applications
Identity based threshold cryptography and blind signatures for electronic voting
WSEAS Transactions on Computers
A power-efficient secure routing protocol for wireless sensor networks
WSEAS Transactions on Computers
| Hi-index | 0.00 |
Embedded systems find applications in fields such as defense, communications, industrial automation and many more. For majority of these applications, security is a vital issue. Over the last decade, security has become the primary concern when discussing e-commerce. The rapid development in the field of information technology has led to the increase in need of techniques capable of providing security. Cryptography plays an important role in providing data security. Until recently, symmetric key encryption schemes were used for a majority of these applications. Now however, asymmetric key encryption schemes such as Elliptic curve cryptography are gaining popularity as they require less computational power and memory and are still capable of providing equivalent security when compared to their counterparts. Elliptic curve cryptography was first introduced in 1985 and has always been around since. Scalar or point multiplication in elliptic curve cryptography has been a topic of research interest. Improving the performance of scalar multiplication can improve the overall performance of elliptic curve cryptography. One popular method to improve scalar multiplication is by means of hardware accelerators. The authors of this paper have implemented scalar multiplication, the most time consuming operation in elliptic curve cryptography using binary non-adjacent form algorithm. The results of the software implementation have been presented in section- 4. Methodology to improve the performance of the scalar multiplication by use of hardware accelerators has also been presented in this paper.