A new algorithm for signed binary representation and application in mobile phones

Abstract

Cryptographic protocols become a requirement for many software applications and communication. Therefore, understanding of such protocols is more essential in order to improve them mathematically and in software implementations. Elliptic curve cryptography is one of these protocol, which are highly used nowadays especially in mobile devices due to its small key size and good security level. Despite of these advantages, it is considered as slower than other cryptosystems with the same key size and this revert to the most important operation the scalar multiplication. In this work, we aimed to reduce the computation of this operation by proposing an algorithm considered as faster in comparing to other efficient methods. This algorithm is implemented in mobile device to prove its efficiency.