An Ameliorated “Strengthened He-Kiesler Digital Signature”

EasyChair Preprint 5314

Abstract

The advancement of information technology, cryptanalysis technology is also changing with each passing day. He & Kiesler[4] studied the squaring of the cipher on the discrete logarithm exponent, forcing the attacker to simultaneously crack the complexity of the double hypothesis before they could challenge their system. However, Harn[6], Lee & Hwang[10] have repeatedly disproved their views by using the complexity of solving a single hypothesis without having to solve the complexity of a double hypothesis at the same time. Shao[16] tried to create another double-complexity signature strategy similar to He & Kiesler, but was denied by Li & Xiao[5]. We point that Chen etc. tried to strengthen He and Kiesler on the basis of the Laih & Kuo[1] assumptions is failed.

Keyphrases: Dual-complexities, digital signature, discrete logarithm, factorization

@booklet{EasyChair:5314,
  author    = {Lee Ching-Min and Chiou Shin-Yan and Chen Jonathan Jen-Rong and Hu Ya-Ping},
  title     = {An Ameliorated “Strengthened He-Kiesler Digital Signature”},
  howpublished = {EasyChair Preprint 5314},
  year      = {EasyChair, 2021}}