Cryptanalysis on an improved version of ElGamal-Like Public-Key Encryption Scheme for encrypting large messages

Ting Yi Chang, Min Shiang Hwang, Wei Pang Yang

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Hwang et al. proposed an ElGamal-like scheme for encrypting large messages, which is more efficient than its predecessor in terms of computational complexity and the amount of data transformation. They declared that the resulting scheme is semantically secure against chosen-plaintext attacks under the assumptions that the decision Diffie-Hellman problem is intractable. Later, Wang et al. pointed out that the security level of Hwang et al.'s ElGamal-like scheme is not equivalent to the original ElGamal scheme and brings about the disadvantage of possible unsuccessful decryption. At the same time, they proposed an improvement on Hwang et al.'s ElGamal-like scheme to repair the weakness and reduce the probability of unsuccessful decryption. However, in this paper, we show that their improved scheme is still insecure against chosen-plaintext attacks whether the system is operated in the quadratic residue modulus or not. Furthermore, we propose a new ElGamal-like scheme to withstand the adaptive chosen-ciphertext attacks. The security of the proposed scheme is based solely on the decision Diffie-Hellman problem in the random oracle model.

Original languageEnglish
Pages (from-to)537-562
Number of pages26
JournalInformatica (Netherlands)
Volume23
Issue number4
Publication statusPublished - 2012 Jan 1

Fingerprint

Public Key Encryption
Cryptanalysis
Cryptography
Computational complexity
Repair
Diffie-Hellman
Attack
Quadratic residue
Data Transformation
Random Oracle Model
Modulus
Computational Complexity

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Applied Mathematics

Cite this

@article{24fc1ef019304616ba41d989f1c6f0d7,
title = "Cryptanalysis on an improved version of ElGamal-Like Public-Key Encryption Scheme for encrypting large messages",
abstract = "Hwang et al. proposed an ElGamal-like scheme for encrypting large messages, which is more efficient than its predecessor in terms of computational complexity and the amount of data transformation. They declared that the resulting scheme is semantically secure against chosen-plaintext attacks under the assumptions that the decision Diffie-Hellman problem is intractable. Later, Wang et al. pointed out that the security level of Hwang et al.'s ElGamal-like scheme is not equivalent to the original ElGamal scheme and brings about the disadvantage of possible unsuccessful decryption. At the same time, they proposed an improvement on Hwang et al.'s ElGamal-like scheme to repair the weakness and reduce the probability of unsuccessful decryption. However, in this paper, we show that their improved scheme is still insecure against chosen-plaintext attacks whether the system is operated in the quadratic residue modulus or not. Furthermore, we propose a new ElGamal-like scheme to withstand the adaptive chosen-ciphertext attacks. The security of the proposed scheme is based solely on the decision Diffie-Hellman problem in the random oracle model.",
author = "Chang, {Ting Yi} and Hwang, {Min Shiang} and Yang, {Wei Pang}",
year = "2012",
month = "1",
day = "1",
language = "English",
volume = "23",
pages = "537--562",
journal = "Informatica",
issn = "0868-4952",
publisher = "IOS Press",
number = "4",

}

Cryptanalysis on an improved version of ElGamal-Like Public-Key Encryption Scheme for encrypting large messages. / Chang, Ting Yi; Hwang, Min Shiang; Yang, Wei Pang.

In: Informatica (Netherlands), Vol. 23, No. 4, 01.01.2012, p. 537-562.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Cryptanalysis on an improved version of ElGamal-Like Public-Key Encryption Scheme for encrypting large messages

AU - Chang, Ting Yi

AU - Hwang, Min Shiang

AU - Yang, Wei Pang

PY - 2012/1/1

Y1 - 2012/1/1

N2 - Hwang et al. proposed an ElGamal-like scheme for encrypting large messages, which is more efficient than its predecessor in terms of computational complexity and the amount of data transformation. They declared that the resulting scheme is semantically secure against chosen-plaintext attacks under the assumptions that the decision Diffie-Hellman problem is intractable. Later, Wang et al. pointed out that the security level of Hwang et al.'s ElGamal-like scheme is not equivalent to the original ElGamal scheme and brings about the disadvantage of possible unsuccessful decryption. At the same time, they proposed an improvement on Hwang et al.'s ElGamal-like scheme to repair the weakness and reduce the probability of unsuccessful decryption. However, in this paper, we show that their improved scheme is still insecure against chosen-plaintext attacks whether the system is operated in the quadratic residue modulus or not. Furthermore, we propose a new ElGamal-like scheme to withstand the adaptive chosen-ciphertext attacks. The security of the proposed scheme is based solely on the decision Diffie-Hellman problem in the random oracle model.

AB - Hwang et al. proposed an ElGamal-like scheme for encrypting large messages, which is more efficient than its predecessor in terms of computational complexity and the amount of data transformation. They declared that the resulting scheme is semantically secure against chosen-plaintext attacks under the assumptions that the decision Diffie-Hellman problem is intractable. Later, Wang et al. pointed out that the security level of Hwang et al.'s ElGamal-like scheme is not equivalent to the original ElGamal scheme and brings about the disadvantage of possible unsuccessful decryption. At the same time, they proposed an improvement on Hwang et al.'s ElGamal-like scheme to repair the weakness and reduce the probability of unsuccessful decryption. However, in this paper, we show that their improved scheme is still insecure against chosen-plaintext attacks whether the system is operated in the quadratic residue modulus or not. Furthermore, we propose a new ElGamal-like scheme to withstand the adaptive chosen-ciphertext attacks. The security of the proposed scheme is based solely on the decision Diffie-Hellman problem in the random oracle model.

UR - http://www.scopus.com/inward/record.url?scp=84872360809&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84872360809&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:84872360809

VL - 23

SP - 537

EP - 562

JO - Informatica

JF - Informatica

SN - 0868-4952

IS - 4

ER -