• Possibility of decryption spee...

Treffer: Possibility of decryption speed-up by parallel processing in CCA secure hashed ElGamal.

Title:
Possibility of decryption speed-up by parallel processing in CCA secure hashed ElGamal.
Authors:
Kim GC; Faculty of Information Science and Technology, Kim Chaek University of Technology, Pyong Yang, Democratic People's Republic of Korea., Ji HA; Faculty of Information Science and Technology, Kim Chaek University of Technology, Pyong Yang, Democratic People's Republic of Korea., Jong YB; Faculty of Information Science and Technology, Kim Chaek University of Technology, Pyong Yang, Democratic People's Republic of Korea., Kim GH; Faculty of Information Science and Technology, Kim Chaek University of Technology, Pyong Yang, Democratic People's Republic of Korea., Kim HS; Faculty of Information Science and Technology, Kim Chaek University of Technology, Pyong Yang, Democratic People's Republic of Korea.
Source:
PloS one [PLoS One] 2023 Nov 30; Vol. 18 (11), pp. e0294840. Date of Electronic Publication: 2023 Nov 30 (Print Publication: 2023).
Publication Type:
Journal Article
Language:
English
Journal Info:
Publisher: Public Library of Science Country of Publication: United States NLM ID: 101285081 Publication Model: eCollection Cited Medium: Internet ISSN: 1932-6203 (Electronic) Linking ISSN: 19326203 NLM ISO Abbreviation: PLoS One Subsets: MEDLINE
Imprint Name(s):
Original Publication: San Francisco, CA : Public Library of Science
MeSH Terms:
Computer Security* , Algorithms*
References:
PLoS One. 2020 Oct 5;15(10):e0240248. (PMID: 33017837)
Entry Date(s):
Date Created: 20231130 Date Completed: 20231204 Latest Revision: 20260102
Update Code:
20260130
PubMed Central ID:
PMC10688657
DOI:
10.1371/journal.pone.0294840
PMID:
38032979
Database:
MEDLINE

Weitere Informationen

In order to prove the ElGamal CCA(Chosen Ciphertext Attack) security in the random oracle model, it is necessary to use the group where ICDH(Interactive Computational Diffie Hellman) assumption holds. Until now, only bilinear group with complex algebraic structure has been known as the ICDH group. In this paper, we introduce the ICDH group with simple algebraic structure. In other words, we prove that ICDH assumption holds in the integer group with composite modulus. On the basis of this, we propose the CCA secure hashed ElGamal and its fast variant to speed up decryption by parallel processing. Our parallel scheme has the fastest decryption among all CCA secure PKE(Public Key Encryption) schemes implemented in integer group and gives the possibility that ElGamal protocol could be practical when the big modulus numbers are used to resist the quantum attack.
(Copyright: © 2023 Kim et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

The authors have declared that no competing interests exist.