Advantages and disadvantages of digital signature technology algorithms

The security of RSA depends mainly on the difficulty of finding the inverse of the mathematical function that constructs its encryption algorithm, as is the case with most public-key cryptosystems (e.g., the ElGamal algorithm is based on the difficulty of the discrete logarithmic problem, and we call such a function a one-way function. One-way functions cannot be used directly as cryptosystems because if a plaintext is encrypted with a one-way function, even a legitimate recipient cannot restore the plaintext because the inverse of a one-way function is difficult. Trapped one-way functions, which are more closely related to cryptographic regimes, i.e., efficient algorithms exist for the computation of both the function and its inverse, and the method of computing the function can be made public. The concepts of one-way and trapped one-way functions are at the heart of public-key cryptography, which is very important for the construction of public-key cryptosystems, and it can even be said that the design of public-key cryptosystems is the design of trapped one-way functions.

ECDSA algorithm applies DsA to elliptic curve equations, which changes the basis of security from the difficulty of computing discrete logarithms over a finite field to the difficulty of computing discrete logarithms over an elliptic curve group, and the basis of security is changed to shorten the length of the key under the same level of security, and only 192-bit-long keys can be used

to ensure security. p>

Security can be guaranteed with just a 192-bit key, whereas the DSA algorithm requires a 1024-bit key for adequate security. The improved

ECDSA algorithm improves the efficiency of the algorithm implementation.