Research ArticleOpen accessPhrase in the titleDevelopment 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 accessEvery word in the titleA 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 keywordsInteger Factorization: Solution via Algorithm for Constrained Discrete Logarithm ProblemBoris S. VerkhovskyProblem statement: During the last thirty years many public-key cryptographic protocols based on either the complexity of integer factorization of large semiprimes or the Discrete Logarithm Problem (DLP) have been developed. Approach: Although several factorization algorithms with sub-exponential complexity have been discovered, the recent RSA Factoring Challenge demonstrated that it was still necessary to use several thousand computers working in … …Journal of Computer Science, Vol. 5, Issue 9 · 30 Dec 2009 · 7,156 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
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 abstractA New Partially Blind Signature Based on Factoring and Discrete LogarithmsN.M.F. Tahat, S.M.A. Shatnawi, E.S. IsmailPartially blind signatures played an important role in many electronic commerce applications. Many existing partially blind signature scheme based on a single hard problem but not secure. In this study, we propose a secure partially blind signature scheme based on factoring and discrete logarithms and show that the proposed scheme satisfies the partial blindness, randomization, unlinkability and unforgeability properties. We … …Journal of Mathematics and Statistics, Vol. 4, Issue 2 · 30 Jun 2008 · 7,057 accessesView PDFCite