This paper presents an approach to generating a secure ciphertext. Quadratic Bézier curve equation has been used in this add more and complexity elliptic cryptosystem. Proposed method using quadratic with ElGamal cryptosystem (ElGamal ECC). The idea of proposed is encrypt the key that generated by public based on PGP behavior. have efficiency complex. compared different keys size computing rand...

We establish the complete complexity landscape surrounding CCA1-security of Elgamal and Damgård’s Elgamal (DEG). Denote by X [i] the assumption that the adversary, given a non-adaptive oracle access to the Y oracle with i free variables cannot break the assumption X . We show that the CCA1-security of Elgamal is equivalent to the DDH assumption. We then give a simple alternative to Gjøsteen’s p...

We present a new method to forge ElGamal signatures if the public parameters of the system are not chosen properly. Since the secret key is hereby not found this attack shows that forging ElGamal signatures is sometimes easier than the underlying discrete logarithm problem.

A design of secure and eecient public-key encryption schemes under weaker computational assumptions has been regarded as an important and challenging task. As far as ElGamal-type encryption schemes are concerned, some variants of the original ElGamal encryption scheme based on the weaker computational assumption have been proposed. For instance, security of the ElGamal variant of Fujisaki-Okamo...

In the generalized group-oriented cryptosystem, the sender can send a conditional message to a group of users such that only the specified sets of users in this group can cooperate to decrypt this message. In this paper, we will use an ElGamal cryptosystem and an elliptic curve ElGamal cryptosystem to achieve the purposes of generalization and group-orientation, respectively. Both of our scheme...

In this article we study the MOR cryptosystem. We use the group of unitriangular matrices over a finite field as the non-abelian group in the MOR cryptosystem. We show that a cryptosystem similar to the ElGamal cryptosystem over finite fields can be built using the proposed groups and a set of automorphisms of these groups. We also show that the security of this proposed MOR cryptosystem is equ...

In this letter, we show that structured ElGamal-type multisignature scheme due to Burmester et al. is not secure if the adversary attacks key generation. In this letter, we show that structured ElGamal-type multisignature scheme due to Burmester et al .is not secure if the adversary attacks key generation.

RSA Cryptosystem ElGamal Cryptosystem Messey Omura Cryptosystem Knapsack Cryptosystem Construction of Knapsack Cryptosystem Quadratic Residue Cryptosystem Hybrid Cryptosystem: Diffie Hellman’s key Exchange Digital Signatures A Classification of Digital Signature Schemes Digital Signature Schemes with Appendix Digital Signature Schemes with Message Recovery RSA Signature Scheme Feige– Fiat – Sha...

We present a new method to forge ElGamal signatures if the public parameters of the system are not chosen properly. Since the secret key is hereby not found this attack shows that forging ElGamal signatures is sometimes easier than the underlying discrete logarithm problem.

Since the time public-key cryptography was introduced by Diffie andHellman in 1976, numerous public-key algorithms have been proposed. Some of thesealgorithms are insecure and the others that seem secure, many are impractical, eitherthey have too large keys or the cipher text they produce is much longer than theplaintext. This paper focuses on efficient implementation and analysis of two mostpo...