A survey of fast exponentiation methods
Journal of Algorithms
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Speeding up Elliptic Cryptosystems by Using a Signed Binary Window Method
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Speeding up Elliptic Cryptosystems Using a New Signed Binary Representation for Integers
DSD '02 Proceedings of the Euromicro Symposium on Digital Systems Design
Guide to Elliptic Curve Cryptography
Guide to Elliptic Curve Cryptography
Left-to-Right Optimal Signed-Binary Representation of a Pair of Integers
IEEE Transactions on Computers
| Hi-index | 0.00 |
Scalar multiplication dP and gP+hQ are important in encryption, decryption and signature in information security and wireless network. The speed of computation of scalar multiplication is significant for related applications. In this paper, a new signed binary representation (SBR) for integers called complementary code method (CC) is proposed, which has minimum weight and needs less memory. An efficient algorithm using CC method for computing dP is shown also. According to analyzing and comparing to the other methods, this algorithm is the better one in window methods and is the simplest for applying in software and hardware. By applying joint representation in computing gP+hQ, new algorithm using CC method has the least joint weight compared to other methods mentioned in this paper. So, the new SBR can efficiently speed up the computation of scalar multiplication dP and gP+hQ and can be widely used in secure communication for improving the speed of encryption and signature.