Development of electronic digital signature algorithms with compound modules and their cryptanalysis

Abstract

This article proposes options of electronic digital signature algorithms, the cryptographic strength of which is based on the complexity of computing a discrete logarithm in a finite field and the complexity of solving a problem of decomposing a sufficiently large odd number to prime factors, on the hash function used, as well as their cryptanalysis.

Unlike existing electronic digital signature algorithms (RSA, El-Gamal) in the proposed new electronic digital signature algorithm signature generation process – s, is carried out using a private parameter - ϕ(N).

Subject Classification:

• 94A60
• 94A62
• 11Y05

Keywords:

• Digital signature
• Factorization problem
• Discrete logarithm problem
• Strength
• One-way functions
• Crypto attacks
• Cryptanalysis