PARTIAL SIGNCRYPTION ELLIPTIC CURVE CRYPTOGRAPHY

Partial signcryption is a new idea for calculation saving. A remarkable property of a partial signcryption scheme is that is fulfills the function of public key signcryption, with a cost significantly smaller than that required by signcryption. The purposes of this paper are to demonstrate how to specify partial signcryption schemes before and after applying elliptic curves over finite fields, and to examine the efficiency of such schemes. The analysis shows that when compared with signcryption, partial signcryption represents a 0% saving in computational cost and 50.2% saving in communication overhead for minimum number of blocks (2 blocks of message).