Research ArticleOpen accessIn the abstractA New Cryptosystem Based on Factoring and Discrete Logarithm ProblemsE.S. Ismail, M.S.N. HijaziProblem statement: A cryptosystem allows a sender to send any confidential or private message using a receiver’s public key and later the receiver confirms the integrity of the received message using his secret key. Currently the existing cryptosystems were developed based on a single hard problem like factoring, discrete logarithm, residuosity, knapsack or elliptic curve discrete logarithm. Although these schemes … …Journal of Mathematics and Statistics, Vol. 7, Issue 3 · 18 Jul 2011 · 7,786 accessesView PDFCite
Research ArticleOpen accessIn the abstractA New Scalable and Reliable Cost Effective Key Agreement Protocol for Secure Group CommunicationS. Jabeen Begum, Dr. T. PurusothamanProblem statement: In a heterogeneous environment, for a secure multicast communication, the group members have to share a secret key which is used to encrypt/decrypt the secret messages among the members. The Secure Group Communication of large scale multicast group in a dynamic environment is more complex than securing one-to-one communication due to the inherent scalability issue of group key … …Journal of Computer Science, Vol. 7, Issue 3 · 7 Mar 2011 · 6,960 accessesView PDFCite
Research ArticleOpen accessIn the abstractGroup Re-keying Protocol Based on Modular Polynomial Arithmetic Over Galois Field GF(2n)Sundaram Sudha, Azman Samsudin, Mohammad Ahmad AliaProblem statement: In this study we propose a group re-keying protocol based on modular polynomial arithmetic over Galois Field GF(2n). Common secure group communications requires encryption/decryption for group re-keying process, especially when a group member is leaving the group. Approach: This study proposes secret keys multiplication protocol based on modular polynomial arithmetic (SKMP), which eliminates the need for the encryption/decryption … …American Journal of Applied Sciences, Vol. 6, Issue 9 · 30 Sep 2009 · 7,165 accessesView PDFCite
Research ArticleOpen accessIn the abstractA New Digital Signature Scheme Based on Factoring and Discrete LogarithmsE.S. Ismail, N.M.F. Tahat, R.R. AhmadProblem statement: A digital signature scheme allows one to sign an electronic message and later the produced signature can be validated by the owner of the message or by any verifier. Most of the existing digital signature schemes were developed based on a single hard problem like factoring, discrete logarithm, residuosity or elliptic curve discrete logarithm problems. Although these schemes … …Journal of Mathematics and Statistics, Vol. 4, Issue 4 · 31 Dec 2008 · 7,259 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordSecure Group Key Management for Dynamic Sensor NetworksN. Suganthi, V. Sumathi, R S. MohanapriyhaProblem statement: Key management is an important cryptographic technique for providing security in a dynamic environment of sensor networks. To provide a secure communication among a group of sensor nodes keys should established in an efficient manner. We introduced an efficient and dynamic key management system for dynamic sensor networks. Approach: We pre deployed some of the keying materials in … …Journal of Computer Science, Vol. 7, Issue 7 · 28 Jun 2011 · 6,743 accessesView PDFCite