Ameliorative effect of citrus peel extract on castration-induced oxidative stress in liver and kidney ratsNada A. E. Mohamed, Amany Tohamy, Basma Elgamal Ahmed Abdel moneim

Cryptography addresses the necessary elements for secure communication that involved privacy, confidentiality, key exchange, authentication, and non-repudiation. This paper proposed a new computation of encryption and decryption that was based on the computation of RSA and ElGamal Cryptosystems. The RSA is a public key encryption system that gets its security from the difficulty of factoring la...

When deploying wireless sensor networks (WSNs) in public environments it may become necessary to secure their data storage and transmission against possible attacks such as node-compromise and eavesdropping. The nodes feature only small computational and energy resources, thus requiring efficient algorithms. As a solution for this problem the TinyPEDS approach was proposed in [7], which utilize...

It is known that there exists a reduction from the CCA1security of Damg̊ard’s Elgamal (DEG) cryptosystem to what we call the ddh assumption. We show that ddh is unnecessary for DEGCCA1, while DDH is insufficient for DEG-CCA1. We also show that CCA1-security of the Elgamal cryptosystem is equivalent to another assumption ddh, while we show that ddh is insufficient for Elgamal’s CCA1-security. Fin...

We present an attack on plain ElGamal and plain RSA encryption. The attack shows that without proper preprocessing of the plaintexts, both ElGamal and RSA encryption are fundamentally insecure. Namely, when one uses these systems to encrypt a (short) secret key of a symmetric cipher it is often possible to recover the secret key from the ciphertext. Our results demonstrate that preprocessing me...

ElGamal encryption is the most extensively used alternative to RSA. Easily adaptable to many kinds of cryptographic groups, ElGamal encryption enjoys homomorphic properties while remaining semantically secure providing that the DDH assumption holds on the chosen group. Its practical use, unfortunately, is intricate: plaintexts have to be encoded into group elements before encryption, thereby re...

The ElGamal encryption scheme is best described in the setting of any finite cyclic group. Its classic case is typically presented in the multiplicative group of the ring of integers modulo a prime p and the multiplicative groups * 2m F of finite fields of characteristic two. The ElGamal cryptosystem was modified to deal with Gaussian integers, and extended to work with group of units of / . In...

The ElGamal encryption scheme can be used for both digital signatures and encryption, and its security results from the difficulty of calculating discrete logarithms in a finite field. This algorithm usually works in a multiplicative group of GF (p) and in this case the progress in the discrete logarithm problem forces the users of such a basic ElGamal public key cryptosystem to permanently inc...