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

15 results for “secret keys”

Set a search alert
Research ArticleOpen accessIn the keywordsTesting Randomness: Poker Test with Hands of Three NumbersWael Mohamed Fawaz Abdel-Rehim, Ismail Amr Ismail, Ehab MorsyProblem statement: The problem of testing randomness is motivated by the need to evaluate of the quality of different random number generators used by many practical applications including computer simulations, cryptography and communications industry. In particular, the quality of the randomness of the generated numbers affects the quality of such applications. In this study we focus on one of the … …Journal of Computer Science, Vol. 8, Issue 8 · 30 Jul 2012 · 9,752 accessesView PDFCite
Research ArticleOpen accessIn the abstractSecure Symmetric Block Cipher Design for Encrypting the Bitcoin Wallets in Cryptocurrencies ApplicationsOmar A. Dawood, Othman I. Hammadi, Falath M. MohammedThis paper proposes a new symmetric secret-key cipher for construction of block cipher model. This new approach is considered as a smart step that can be applied to the long process research of modern designing methods used in developing earlier symmetric algorithms. The present cipher can encrypt block lengths of 128-bit by employing Substitution-Permutation Network (SPN) structure. The present cipher … …Journal of Computer Science, Vol. 15, Issue 5 · 1 Jun 2019 · 8,412 accessesView PDFCite
Research ArticleOpen accessIn the abstractThe Effect of RSA Exponential Key Growth on the Multi-Core Computational ResourceMohamad A. Mohamed, Ammar Y. Tuama, Mokhairi Makhtar et al.Cryptography has been widely used as a mean to secure message communication. A cryptosystem is made up of a publicly available algorithm and a secretly kept key. The algorithm is responsible for transforming the original message into something unintelligible. The result of losing the key or cracked algorithm can be catastrophic, where all secret communications will be known to adversaries. … …American Journal of Engineering and Applied Sciences, Vol. 9, Issue 4 · 25 Nov 2016 · 7,827 accessesView PDFCite
Research ArticleOpen accessIn the abstractTemporal, Delegable and Cheap Update Access Control to Published XML DocumentsWaleed Halboob, Ali Mamat, Ramlan Mahmod, Muhammad Khurram KhanProviding access control for published XML documents on the Web is an important topic. It involves the use of cryptographic techniques, addressing different requirements and, as a result, facing several challenges. Existing solutions still have some weaknesses such as system update cost, number of required secret encryption/decryption keys, size of encrypted document and supporting temporal and delegable access. This study … …Journal of Computer Science, Vol. 9, Issue 4 · 8 May 2013 · 6,532 accessesView PDFCite
Research ArticleOpen accessIn the abstractPerformance Evaluation of Multicrypt Encryption MechanismRhymend Uthariaraj Vaidyanathan, Lydia Elizabeth Benjamin, John Prakash ArockiasamyMulticast communication allows a single message packet to be routed to multiple nodes simultaneously. Membership in a multicast group is dynamic, allowing nodes to enter and leave the multicast session. Besides the benefits, multicast communication presents the challenge of securing the communication. In order to preserve confidentiality the general encryption mechanism used for point to point communications are used. A … …American Journal of Applied Sciences, Vol. 9, Issue 11 · 4 Sep 2012 · 7,168 accessesView PDFCite
Research ArticleOpen accessIn the abstractDevelopment of a New Elliptic Curve Cryptosystem with Factoring ProblemE. S. Ismail, M. S. HijaziProblem statement: The security of elliptic curve cryptosystems are based on elliptic curve discrete logarithm problem (ECDLP). However, if an attacker finds a solution to ECDLP, the elliptic curve-based systems will no longer be secure. Approach: To improve this, we develop a new elliptic curve cryptosystem using one of the old/novel problem in computational number theory; factoring problem (FAC). Specifically, … …American Journal of Applied Sciences, Vol. 9, Issue 9 · 2 Aug 2012 · 6,788 accessesView PDFCite
Research ArticleOpen accessIn the abstractEfficient Star Topology based Multicast Key Management AlgorithmK. Saravanan, T. PurusothamanProblem statement: Secure group communication is very important for many applications such as internet pay sites. It provides efficient delivery of identical data to only the customers in the group. In large and dynamic multicast groups, the group keys of members have to be changed frequently whenever the member leaves or joins. A common method is to apply a symmetric … …Journal of Computer Science, Vol. 8, Issue 6 · 22 Mar 2012 · 7,344 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