Elliptic Curve Digital Signature Algorithm Using Boolean Permutation based ECC

FATIMA AMOUNAS, EL HASSAN EL KINANI

Abstract


The Elliptic Curve Digital Signature Algorithm (ECDSA) is the elliptic curve analogue of the Digital Signature Algorithm (DSA), where it is a digital signature scheme designed to provide a digital signature based on a secret number known only to the signer and also on the actual message being signed. Digital signature schemes reduce transmission costs, because the message is contained in the signature itself and no separate message and signature need be sent again. In this paper, we attempt to provide more secure digital signature scheme by using Boolean permutation based elliptic curve cryptography (ECC). In particular, we introduce a proposed to development the original ECDSA with more complexity. In our scheme, using ECC and then applying the Boolean permutation generates the signature. The use of Boolean permation will provide better performance in this regard.


Full Text:

PDF
Total views : 6 times

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.