Cryptanalysis of an ElGamal-Like Cryptosystem for Enciphering Large Messages


In 2002, Hwang et al. propose an asymmetric cryptosystem in which a large message is broken into smaller plaintexts which are then encrypted efficiently. They claim that based on the assumption of the intractability of the discrete logarithm problem, their cryptosystem is secure in the sense that even knowing some pairs of plaintext-ciphertext does not… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics