Research ArticleOpen accessIn the abstractSecure Packet Encryption and Key Exchange System in Mobile Ad hoc NerworkSudhakar Sengan, S. Chenthur PandianProblem statement: Mobile Ad-hoc Network is infrastructureless network supported by no fixed trusted infrastructure. The packets had a chance to drop or hacked by eavesdropper during transmission. So, encryption method is required for sending and receiving packet in secret manner. Approach: In this approach, the block and key size had been increased by 256 bits. When compared to Rijndael algorithm, … …Journal of Computer Science, Vol. 8, Issue 6 · 17 Mar 2012 · 7,387 accessesView PDFCite
Research ArticleOpen accessIn the abstractSecure Authentication Technique for Data Aggregation in Wireless Sensor NetworksV. Bhoopathy, R. M.S. ParvathiProblem statement: In Wireless Sensor Networks (WSN), serious security threat is caused by node capture attacks where an adversary gains full control over a sensor node through direct physical access. Approach: This creates a high risk of data confidentiality. Results: We propose a secure authentication technique for data aggregation in WSN. During first round of data aggregation, the aggregator upon … …Journal of Computer Science, Vol. 8, Issue 2 · 24 Jan 2012 · 7,286 accessesView PDFCite
Research ArticleOpen accessIn the abstractSecure Hybrid Mode-Based CryptosystemE. S. Ismail, S. BaharudinProblem statement: A cryptosystem provides two parties; a sender and a receiver to communicate interactively via an insecure channel in which, the sender is able to send any confidential message, document or data in a disguised form to the intended receiver. Upon receiving the disguised message, the receiver converts it to the intelligible message using his secret key. The security … …American Journal of Applied Sciences, Vol. 9, Issue 3 · 12 Jan 2012 · 7,003 accessesView PDFCite
Research ArticleOpen accessIn the abstractNew Cryptosystem Using Multiple Cryptographic AssumptionsE. S. Ismail, M. S. HijaziProblem statement: A cryptosystem is a way for a sender and a receiver to communicate digitally by which the sender can send receiver any confidential or private message by first encrypting it using the receiver’s public key. Upon receiving the encrypted message, the receiver can confirm the originality of the message’s contents using his own secret key. Up to now, … …Journal of Computer Science, Vol. 7, Issue 12 · 15 Oct 2011 · 7,061 accessesView PDFCite
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 abstractAn Effective Contributory Re-Keying Approach to Compute Conference KeyD. Thilagavathy, M. RajaramProblem statement: With the explosive growth of and internet and web applications many emerging group-oriented distributed applications such as tele/video-conferencing, multiplayer games are based on group communication model that need security services such as privacy and data integrity Hence a secure distributed group key agreement is required to establish and authenticate a common group key for secure and private communication. … …Journal of Computer Science, Vol. 7, Issue 8 · 15 Jul 2011 · 6,643 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 abstractA Bit-Serial Multiplier Architecture for Finite Fields Over Galois FieldsHero Modares, Yasser Salem, Rosli Salleh, Majid Talebi ShahgoliProblem statement: A fundamental building block for digital communication is the Public-key cryptography systems. Public-Key Cryptography (PKC) systems can be used to provide secure communications over insecure channels without exchanging a secret key. Implementing Public-Key cryptography systems is a challenge for most application platforms when several factors have to be considered in selecting the implementation platform. Approach: The most popular … …Journal of Computer Science, Vol. 6, Issue 11 · 23 Oct 2010 · 8,431 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Fragile Watermarking Scheme for Image Authentication with Tamper Localization Using Integer Wavelet TransformP. MeenakshiDevi, M. Venkatesan, K. DuraiswamyProblem statement: In recent years, as digital media are gaining wider popularity, their security related issues are becoming greater concern. Method for authenticating and assuring the integrity of the image is required. Image authentication is possible by embedding a layer of the authentication signature into the digital image using a digital watermark. In some applications tamper localization is also required. … …Journal of Computer Science, Vol. 5, Issue 11 · 30 Nov 2009 · 7,731 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