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,264 accessesView PDFCite
Research ArticleOpen accessIn the abstractRobust and Blind Watermarking of Relational Database SystemsA. Al-Haj, A. OdehProblem statement: Digital multimedia watermarking technology was suggested in the last decade to embed copyright information in digital objects such images, audio and video. However, the increasing use of relational database systems in many real-life applications created an ever increasing need for watermarking database systems. As a result, watermarking relational database systems is now merging as a research area that … …Journal of Computer Science, Vol. 4, Issue 12 · 31 Dec 2008 · 7,511 accessesView PDFCite
Research ArticleOpen accessIn the abstractDSP-128:Stream Cipher Based On Discrete Log Problem And Polynomial ArithmeticKhaled M. Suwais, Azman SamsudinDSP-128 is a new multithreaded stream cipher based on the intractability of the Discrete Logarithm Problem (DLP) with key size of 128-bit. The design of DSP-128 is divided into three stages: Initialization Stage, Keystream Generation Stage, and Encryption Stage. The design goal of DSP-128 is to come up with a secure stream cipher with good performance for data encryption. The … …American Journal of Applied Sciences, Vol. 5, Issue 7 · 31 Jul 2008 · 7,399 accessesView PDFCite
Research ArticleOpen accessIn the abstractFractal (Mandelbrot and Julia) Zero-Knowledge Proof of IdentityMohammad Ahmad Alia, Azman Bin SamsudinWe proposed a new zero-knowledge proof of identity protocol based on Mandelbrot and Julia Fractal sets. The Fractal based zero-knowledge protocol was possible because of the intrinsic connection between the Mandelbrot and Julia Fractal sets. In the proposed protocol, the private key was used as an input parameter for Mandelbrot Fractal function to generate the corresponding public key. Julia Fractal … …Journal of Computer Science, Vol. 4, Issue 5 · 31 May 2008 · 6,965 accessesView PDFCite
Research ArticleOpen accessIn the abstractSecure Antnet Routing Algorithm for Scalable Adhoc Networks Using Elliptic Curve CryptographyV. Vijayalakshmi, T. G. PalaniveluThe secure end-to-end route discovery in the decentralized Mobile Adhoc Networks (MANETs) should have to meet the requirements of prevention of DoS attacks on data traffic, should be adaptive and fault tolerant and must have high speed, low energy overhead and scalability for future development. In this research a secure routing using antnet mechanism and mutual authentication using Elliptic Curve … …Journal of Computer Science, Vol. 3, Issue 12 · 31 Dec 2007 · 6,959 accessesView PDFCite
Research ArticleOpen accessIn the abstractA New Digital Signature Scheme Based on Mandelbrot and Julia Fractal SetsMohammad Ahmad Alia, Azman Bin SamsudinThis paper describes a new cryptographic digital signature scheme based on Mandelbrot and Julia fractal sets. Having fractal based digital signature scheme is possible due to the strong connection between the Mandelbrot and Julia fractal sets. The link between the two fractal sets used for the conversion of the private key to the public key. Mandelbrot fractal function takes the … …American Journal of Applied Sciences, Vol. 4, Issue 11 · 30 Nov 2007 · 6,964 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Main Object-oriented Projective Invariant Image Watermarking ApproachMalik F. AlamairehDigital Watermarking is a technology that enables to protect distributed digital content from unauthorized reuse. Robust watermarks must be able to survive a range of geometrical "attacks," such as image resizing, cropping, translation, rotation, scaling, smoothing, filtering, and simplification. In the current paper we extend existing approaches that are based partially on image invariant features; by introducing new image invariant … …American Journal of Applied Sciences, Vol. 4, Issue 6 · 30 Jun 2007 · 6,741 accessesView PDFCite
Research ArticleOpen accessIn the abstractHiding a Large Amount of Data with High Security Using Steganography AlgorithmNameer N. EL-EmamThis study deals with constructing and implementing new algorithm based on hiding a large amount of data (image, audio, text) file into color BMP image. We have been used adaptive image filtering and adaptive image segmentation with bits replacement on the appropriate pixels. These pixels are selected randomly rather than sequentially by using new concept defined by main cases with … …Journal of Computer Science, Vol. 3, Issue 4 · 30 Apr 2007 · 8,625 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Secure Protocol Based on a Sedentary Agent for Mobile Agent EnvironmentsAbdelmorhit E. Rhazi, Samuel Pierre, Hanifa BouchenebThe main challenge when deploying mobile agent environments pertains to security issues concerning mobile agents and their executive platform. This paper proposes a secure protocol which protects mobile agents against attacks from malicious hosts in these environments. Protection is based on the perfect cooperation of a sedentary agent running inside a trusted third host. Results show that the protocol detects … …Journal of Computer Science, Vol. 3, Issue 1 · 31 Jan 2007 · 6,881 accessesView PDFCite