A NEW MULTI PARTY KEY AGREEMENT PROTOCOL USING SEARCH PROBLEMS IN DISCRETE HEISENBERG GROUP.

In this work, a new methodology is proposed based on Tabu Search, for capacitor allocation in electric energy distribution systems. The object here is to minimize the costs related

are many fast search techniques that have been proposed such as the Three-Step Search (TSS) [4], the New Three-Step Search (NTSS) [6], the Four-Step Search (4SS) [9], the

As we have shown in this paper number of bits encrypted together using a public key has significant impact on the decryption time and the strength of the cryptosystem.. The

He designed some cryptosystems known as Little Dragon and Big Dragon with multivariate polynomials of total degree 2 and 3 respectively in plaintext and cipher text

The proposed method is based on a branch and bound (BB) scheme, and the NLP problems that appear in the BB tree search are solved to optimality by a derivative-free global method

based on pluralistic thinking that encourages diversity by means of participation by different social groups in the search for solutions to their health problems, as opposed to

Department of Computer Science, Adikavi Nannaya University Rajahmundry-533105, Andhra Pradesh,

In this protocol, the KS broadcasts the rekey information to all the group members. Chiou and Chen [9] proposed Secure Lock protocol, in this key server uses a