At PKC 2006, Chevallier-Mames, Paillier, and Pointcheval proposed a very elegant technique over cyclic subgroups of Fp eliminating the need to encode the message as a group element in the ElGamal encryption scheme. Unfortunately, it is unclear how to adapt their scheme over elliptic curves. In a previous attempt, Virat suggested an adaptation of ElGamal to elliptic curves over the ring of dual ...

Sensor networks are primarily designed for real-time collection and analysis of low level data in hostile environments. Basically sensor networks are application dependent. Wireless sensor network (WSN) applications can be classified into two event based and Continuous monitoring. This paper focuses on continuous monitoring application. One of the major challenges of wireless sensor network is ...

Adding a Schnorr signature to ElGamal encryption is a popular proposal aiming at thwarting chosen-ciphertext attacks by rendering the scheme plaintext-aware. However, there is no known security proof for the resulting scheme, at least not in a weaker model than the one obtained by combining the Random Oracle Model (ROM) and the Generic Group Model (Schnorr and Jakobsson, ASIACRYPT 2000). In thi...

In this work we deal with the problem of how to squeeze multiple ciphertexts without losing original message information. To do so, we formalize the notion of decomposability for public-key encryption and investigate why adding decomposability is challenging. We construct an ElGamal encryption scheme over extension fields, and show that it supports the efficient decomposition. We then analyze s...

Kriptografi kunci publik ElGamal adalah kriptografi yang berdasarkan pada permasalahan logaritma diskrit. Pada kriptanalisis public diusulkan menggunakan Algoritma Optimasi Chaos dan Ridge Polinomial Neural Network dengan menghasilkan privat baik. Hasil tersebut mendapatkan nilai error paling kecil dari lainnya mendekati iterasi tidak terjebak ke dalam minimum local. Hal ini konvergen.

In this AFP entry, we show how to specify game-based cryptographic security notions and formally prove secure several cryptographic constructions from the literature using the CryptHOL framework. Among others, we formalise the notions of a random oracle, a pseudo-random function, an unpredictable function, and of encryption schemes that are indistinguishable under chosen plaintext and/or cipher...

The ElGamal encryption scheme is described in the setting of any finite cyclic group G. Among the groups of most interest in cryptography are the multiplicative group Z of the ring of integers modulo a prime p, and the multiplicative groups F of finite fields of characteristic two. The later requires finding irreducible polynomials h(x) and constructing the quotient ring . El-Kassar et al. modi...

The Diffie-Hellman key exchange protocol as well as the ElGamal signature scheme are based on exponentiation modulo p for some prime p. Thus the security of these schemes is strongly tied to the difficulty of computing discrete logarithms in the finite field Fp. The Diffie-Hellman protocol has been generalized to other finite groups arising in number theory, and even to the sets of reduced prin...

Cryptographic protocols often make use of the inherent hardness of the classical discrete logarithm problem, which is to solve gx ≡ y (mod p) for x. The hardness of this problem has been exploited in the Diffie-Hellman key exchange, as well as in cryptosystems such as ElGamal. There is a similar discrete logarithm problem on elliptic curves: solve kB = P for k. Therefore, Diffie-Hellman and ElG...

Communicating with confidential data requires special attention in a Mobile Agents environment, especially when the other hosts must be prevented from eavesdropping the communication. We propose a communication model for secured communication between the agents belonging to different entities for a web based application like voting involving multiple agents. We have used BRAHMS agent modeling, ...