Research ArticleOpen accessIn the keywordsNew 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
Review ArticleOpen accessIn the abstractA Comprehensive Review of Post-Quantum Cryptography AlgorithmsSamandeep Kaur, Jaswinder SinghThe development of quantum computing has been rapid, and an existential threat to computational hardness assumptions that underlie today's public-key cryptography has been encountered. This manuscript is a complete and thoroughly organized review of Post-Quantum Cryptography (PQC), discussing the mathematical concepts, complexity, and mechanisms of the algorithms that underpin quantum-safe security infrastructures. Rather than the principles of quantum mechanics, the … …Journal of Computer Science, Vol. 22, Issue 9 · 25 Sep 2026 · 723 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 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 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 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,259 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,396 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordA VARIANT OF POLLARD'S RHO ATTACK ON ELLIPTIC CURVE CRYPTOSYSTEMSSiham Ezzouak, Mohammed Elamrani, Abdelmalek AziziElliptic Curve cryptosystems appear to be more secure and efficient when requiring small key size to implement than other public key cryptosystems. Its security is based upon the difficulty of solving Elliptic Curve Discrete Logarithm Problem (ECDLP). This study proposes a variant of generic algorithm Pollard's Rho for finding ECDLP using cycle detection with stack and a mixture of cycle … …Journal of Computer Science, Vol. 10, Issue 8 · 9 Apr 2014 · 7,269 accessesView PDFCite