DESIGNING NEW TECHNIQUE IN DIGITAL SIGNATURE BASED ON GALOIS FIELD 2n AND CHAOTIC MAPS
Ensuring the utmost security, confidentiality, and integrity of digital communications has become an imperative requirement in today's world. This realization highlights the significance of employing Digital Signature Algorithms (DSA) in various online applications. DSA's true value lies in its ability to deliver secure digital signatures, assuring the verification of digital documents, messages, or transactions. This aspect holds paramount importance in critical domains such as online banking, e-commerce, digital contracts, and government services where safeguarding sensitive information is crucial. DSA encompasses diverse algorithms, including RSA, Elliptic Curve Cryptography (ECC), and Schnorr signatures, each possessing distinct strengths and weaknesses. RSA stands as one of the most prevalent DSA algorithms, although ECC is gaining popularity due to its smaller key size and faster performance. Moreover, Schnorr signatures are gaining attention due to their simplicity and efficiency. This paper introduces a novel Digital Signature algorithm scheme, incorporating robust elements like Hashing, Discrete Logarithm Problems (as seen in Elliptic Curve), and CHAOTIC maps for mapping, thus bolstering secrecy and enhancing security performance. The scheme aims to optimize speed and cost, offering a comparative analysis against other digital signature schemes such as RSA and the original ECDSA.
Digital Signature Algorithm (DSA), RON RIVEST, ADI SHAMIR, and LEONARD ADLEMAN (RSA), Elliptic Curve Digital Signature Algorithm (ECDSA), Galois Field (GF), Elliptic Curve Cryptography (ECC), Digital Signature (DS), Elliptic Curve Discrete Logarithm Problem (ECDLP), Discrete Logarithm Problem (DLP), National Institute of Standards and Technology (NIST).