Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

50 results for “Encryption/Decryption”
Set a search alert
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,007 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,064 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,789 accessesView PDFCite
Research ArticleOpen accessIn the abstractAuthenticated Broadcast in Heterogeneous Wireless Sensor Networks using Chinese Remainder Theorem AlgorithmKalyani Palanisamy, ChellappanProblem statement: The security in Wireless Sensor Networks (WSN) is a critical issue due to the inherent limitations of computational capacity, storage capacity and power usage. Key management only makes sure the communicating nodes possess the necessary keys, at the same time protecting the confidentiality, integrity and authenticity of the communicated data. Approach: Proposed a RSA-CRT methodology for authenticated broadcast … …Journal of Computer Science, Vol. 7, Issue 6 · 14 Jun 2011 · 6,416 accessesView PDFCite
Research ArticleOpen accessIn the abstractSingle Core Hardware Module to Implement Partial Encryption of Compressed ImageMamun Bin Ibne Reaz, Md. Syedul Amin, Fazida Hanim Hashim, Khandaker AsaduzzamanProblem statement: Real-time secure image and video communication is challenging due to the processing time and computational requirement for encryption and decryption. In order to cope with these concerns, innovative image compression and encryption techniques are required. Approach: In this research, we have introduced partial encryption technique on compressed images and implemented the algorithm on Altera FLEX10K FPGA device that … …American Journal of Applied Sciences, Vol. 8, Issue 6 · 13 Jun 2011 · 7,383 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Novel Enhancement Technique of the Hill Cipher for Effective Cryptographic PurposesA. F.A. Abidin, O. Y. Chuan, M. R.K. AriffinProblem statement: The Hill cipher is the first polygraph cipher which has a few advantages in data encryption. However, it is vulnerable to known plaintext attack. Besides, an invertible key matrix is needed for decryption. It may become problematic since an invertible key matrix does not always exist. Approach: In this study, a robust Hill algorithm (Hill++) has been proposed. … …Journal of Computer Science, Vol. 7, Issue 5 · 7 May 2011 · 8,547 accessesView PDFCite
Research ArticleOpen accessIn the abstractSecurity Challenges in Multicast Communication for Mobile Ad Hoc NetworkS. Gunasekaran, K. DuraiswamyProblem statement: Multicasting communication network accepted a single message from an application and delivered copies of the message to multiple recipients at different locations. Recently, there has been an explosion of research literature on multicast communication environment. The objective of this study were to contribute the complexity of supporting current multicast applications, (i) the lack of reliable multicast transport mechanisms … …Journal of Computer Science, Vol. 6, Issue 5 · 31 May 2010 · 6,126 accessesView PDFCite
Research ArticleOpen accessIn the abstractChallenges of Hidden Data in the Unused Area Two within Executable FilesA. W. Naji, A. A. Zaidan, B. B. ZaidanProblem statement: The executable files are one of the most important files in operating systems and in most systems designed by developers (programmers/software engineers), and then hiding information in these file is the basic goal for this study, because most users of any system cannot alter or modify the content of these files. There are many challenges of hidden data … …Journal of Computer Science, Vol. 5, Issue 11 · 30 Nov 2009 · 7,855 accessesView PDFCite
Research ArticleOpen accessIn the abstractAccelerated Search for Gaussian Generator Based on Triple Prime IntegersBoris S. Verkhovsky, Md Shiblee SadikProblem statement: Modern cryptographic algorithms are based on complexity of two problems: Integer factorization of real integers and a Discrete Logarithm Problem (DLP). Approach: The latter problem is even more complicated in the domain of complex integers, where Public Key Cryptosystems (PKC) had an advantage over analogous encryption-decryption protocols in arithmetic of real integers modulo p: The former PKC have … …Journal of Computer Science, Vol. 5, Issue 9 · 30 Sep 2009 · 6,522 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,171 accessesView PDFCite