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 abstractOverview on Key Distribution Primitives in Wireless Sensor NetworkM. Raghini, N. Uma Maheswari, R. VenkateshOwing to the security requirements of wireless sensor network, the background of Wireless Sensor Network (WSN) is to be analyzed with different threats and attack models. Physical compromising of sensor nodes by an adversary is an emerging problem in sensor network and accordingly, it is necessary to provide an environment with efficient key management techniques due to resource constraints on … …Journal of Computer Science, Vol. 9, Issue 5 · 17 May 2013 · 6,177 accessesView PDFCite
Research ArticleOpen accessIn the abstractNew Mersenne Number Transform Diffusion Power AnalysisM. F. Al-Gailani, S. BoussaktaProblem statement: Due to significant developments in the processing power and parallel processing technologies, the existing encryption algorithms are increasingly susceptible to attacks, such as side-channel attacks, for example. Designing new encryption algorithms that work efficiently on different platforms and security levels to protect the transmitted data from any possible attacks is one of the most important issues in today’s … …American Journal of Engineering and Applied Sciences, Vol. 4, Issue 4 · 12 Jan 2012 · 7,448 accessesView PDFCite
Research ArticleOpen accessIn the abstractEfficiency Analysis for Public Key Systems Based on Fractal FunctionsNadia M.G. AL-Saidi, Mohamad Rushdan Md. Said, Adil Mahmood AhmedProblem statement: In the last decade, dynamical systems were utilized to develop cryptosystems, which ushered the era of continuous value cryptography that transformed the practical region from finite field to real numbers. Approach: Taking the security threats and privacy issues into consideration, fractals functions were incorporated into public-key cryptosystem due to their complicated mathematical structure and deterministic nature that meet … …Journal of Computer Science, Vol. 7, Issue 4 · 4 Apr 2011 · 6,939 accessesView PDFCite
Research ArticleOpen accessIn the abstractSecure Mobile Trade AgentMusbah M. Aqel, Sattar J. Aboud, Mohammed A. AL-FayoumiE-commerce on the internet has the ability to produce millions of transactions and a great number of merchants whose supply merchandise over the internet. As a result, it is difficult for entities to roam over every site on the internet and choose the best merchandise to trade. So, in this paper we introduced a mobile trade agent that visit the … …Journal of Computer Science, Vol. 3, Issue 5 · 31 May 2007 · 6,766 accessesView PDFCite
Research ArticleOpen accessIn the abstractKey Exchange Protocol in Elliptic Curve Cryptography with No Public PointK. Kaabneh, H. Al-BdourIn recent years some cryptographic algorithms have gained popularity due to properties that make them suitable for use in constrained environment like mobile information appliances, where computing resources and power availability are limited. One of these cryptosystems is Elliptic curve which requires less computational power, memory and communication bandwidth compared to other cryptosystem. This makes the elliptic curve cryptography to … …American Journal of Applied Sciences, Vol. 2, Issue 8 · 31 Aug 2005 · 7,067 accessesView PDFCite
Research ArticleOpen accessIn the abstractERROR DETECTION SCHEMES FOR FINITE FIELD MULTIPLIERSB. Sargunam, R. DhanasekaranFinite field multipliers are widely used in the field of cryptography for the purpose of scalar multiplication. The outputs of the finite field multipliers may consist of errors due to certain natural radiations which further leads to the failure of the cryptosystems. Here two Concurrent Error Detection (CED) schemes namely time redundancy and modular inversion based error detection schemes for … …American Journal of Applied Sciences, Vol. 11, Issue 1 · 11 Dec 2013 · 6,913 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 abstractMethods of Fast ExponentiationMohammed Al-MaitahProblem statement: Modular exponentiation constitutes the basis of many well-known and widely used public key cryptosystems. Approach: A fast portable modular exponentiation algorithm considerably enhanced the speed and applicability of these systems, also an efficient implementation of this algorithm was the key to high performance of such system. Results: In this study, two main approaches for solving this problem were … …Journal of Computer Science, Vol. 6, Issue 5 · 31 May 2010 · 7,695 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,517 accessesView PDFCite