# A Novel Digital Signature Scheme for Advanced Asymmetric Encryption Techniques
## 2 Related Work  
The RSA signature scheme was introduced in the late 1970s and is still widely used today. It involves hashing the message to be signed and then encrypting the hash value using the sender's private key. In the 1990s, the Digital Signature Algorithm (DSA) was introduced based on the discrete logarithm problem [19]. The DSA quickly became popular and is widely used in various applications today. The early 2000s saw the introduction of the Elliptic Curve Digital Signature Algorithm (ECDSA), which is based on elliptic curve cryptography [20; 21]. ECDSA is known for its small key size and fast computation time and is commonly used in resource-constrained environments. In recent years, there has been a trend towards developing lightweight digital signature schemes designed to be fast and efficient, particularly for use in resource-constrained environments such as the IoT and other embedded systems [22; 23; 24]. This section sheds some light on the recent related work in the literature. In [25], [PERSON] proposed the El Gamal signature scheme, which is one of the first digital signature schemes based on the algebraic nature of modular exponentiation. The El Gamal signature scheme involves generating a digital signature for a message using a private key and verifying the signature using a public key. The El Gamal signature scheme ensures the authenticity of data sent over insecure channels. However, the El Gamal signature algorithm has difficulty computing discrete logarithms; furthermore, it is a non-deterministic algorithm, meaning that there are many valid signatures for a given message, and the algorithm considers each of these valid signatures to be authentic [26]. In [27], [PERSON] et al. added some improvements to the ElGamal signature scheme. A new blind signature scheme was proposed in their work based on the number theory operations and modular arithmetic techniques. This scheme has the advantage of ensuring greater anonymity for participants, where if a message is signed multiple times, the corresponding signatures will differ. A new and fast cryptographic digital signature scheme was proposed in [28] by [PERSON] et al. The vital link between Mandelbrot and Julia fractal sets was used to generate the private and public keys using their particular functions (i.e., Mandelfn and Juliafn functions). The first fractal function inputs the selected private key and generates the corresponding public key. The message is then signed with the recipient's public key using the second fractal function, and the received message is verified against the recipient's private key. In [23], [PERSON] et al. proposed a lightweight Shortened Complex Digital Signature Algorithm (SCDSA) based on short complex numbers for both signature and verification operations. This algorithm aims to secure the communication between user-centric IoT devices and mitigate the communication and computational overhead on the network. Due to the multi-option parameter selection mechanism, their scheme is secure enough to resist traffic analysis attacks and has better resilience than extensive operations in DSA-based schemes. [PERSON] et al. presented an Elliptic Curve Digital Signature Algorithm (ECDSA) in [21] based on the curve drawn by a mathematical equation. On the curve, a point is selected randomly and considered its point of origin. Then, a random number is generated. It is precisely this random number that is known as the private key. Then, combining the private key and the origin point using a specific equation, a second point on the curve is obtained and considered the public key. This process is considered safe, and it is only possible to establish the mathematical relationship from the private key to the public key, but not the opposite. The ECDSA is used across many security systems and is the basis of Bitcoinsecurity. The ECDSA provides higher security with shorter key lengths than many popular algorithms such as the RSA and DSA.