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

40 articles for “Cryptosystem”
Set a search alert
Research ArticleOpen accessEvery word in the titleImprovement of Menezes-Vanstone Elliptic Curve Cryptosystem Based on Quadratic Bézier Curve TechniqueDua M. Ghadi, Adil AL-RammahiCryptography is one of the most important applications and widely used in our life especially in the information security that needed by many government institutions, banks, communications and others to keep data over internet and other transportations that it is ensure safety of transfers between the sender and the recipient. The most important system in cryptography is public key cryptography … …Journal of Computer Science, Vol. 16, Issue 5 · 4 Jun 2020 · 8,216 accessesView PDFCite
Literature ReviewOpen accessEvery word in the titleA Review on Heuristics for Addition Chain Problem: Towards Efficient Public Key CryptosystemsAdamu Muhammad Noma, Abdullah Muhammed, Mohamad Afendee Mohamed, Zuriati Ahmad ZulkarnainField exponentiation and scalar multiplication are the pillars of and the most computationally expensive operations in the public key cryptosystems. Optimizing the operation is the key to the efficiency of the systems. Analogous to the optimization is solving addition chain problem. In this study, we survey from the onset of the addition chain problem to the state-of-the-art heuristics for optimizing … …Journal of Computer Science, Vol. 13, Issue 8 · 1 Jun 2017 · 8,163 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleOptimizing {0, 1, 3}-NAF Recoding Algorithm Using Block-Method Technique in Elliptic Curve CryptosystemMohsen Bafandehkar, Sharifah Md Yasin, Ramlan MahmodThe most expensive and time-consuming operation in Elliptic curve cryptosystem is scalar multiplication operation. Optimization of scalar multiplication will substantially enhance the ECC performance. Scalar multiplication can be improved by using an enhanced scalar recoding algorithm that can decrease the number of operations in the scalar representation process. The objective of this research is to introduce an efficient design and … …Journal of Computer Science, Vol. 12, Issue 11 · 30 Dec 2016 · 6,672 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleH-RABIN CRYPTOSYSTEMHayder Raheem HashimCryptography is the science of using mathematics that's used to hide information or data that is being sent between participants in a way that prevents other people from reading it. The need of exchanging messages secretly promoted the creation of cryptosystems to enable receivers to interpret the exchanged information. In this study, a particular public key cryptosystem called Rabin Cryptosystem … …Journal of Mathematics and Statistics, Vol. 10, Issue 3 · 10 May 2014 · 7,640 accessesView PDFCite
Research ArticleOpen accessEvery word 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 titleComputation of Private Key Based on Divide-By-Prime for Luc CryptosystemsZulkarnain Md Ali, Nawara Makhzoum Alhassan MakhzoumProblem statement: One of the public key cryptosystem is Luc cryptosystems. This system used Lucas Function for encryption and decryption process. Lucas Function is a special form of second-order linear recurrence relation. An encyption process is used to encrypt an original message to ciphertext by using public key. A decryption process is the process to decrypt a ciphertext into original … …Journal of Computer Science, Vol. 8, Issue 4 · 1 Feb 2012 · 7,064 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleSecure 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 accessEvery word in the titlePolynomial Interpolation in the Elliptic Curve CryptosystemLiew Khang Jie, Hailiza KamarulhailiProblem statement: In this research, we incorporate the polynomial interpolation method in the discrete logarithm problem based cryptosystem which is the elliptic curve cryptosystem. Approach: In this study, the polynomial interpolation method to be focused is the Lagrange polynomial interpolation which is the simplest polynomial interpolation method. This method will be incorporated in the encryption algorithm of the elliptic curve … …Journal of Mathematics and Statistics, Vol. 7, Issue 4 · 28 Oct 2011 · 7,828 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleNew 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 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