3 articles for “Modular Exponentiation”

Set a search alert

Literature ReviewOpen accessIn the keywordsA 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 PDF Cite

Research ArticleOpen accessIn the abstractCARRY SAVE COMMON MULTIPLICAND MONTGOMERY FOR RSA CRYPTOSYSTEMRupali Verma, Maitreyee Dutta, Renu VigRSA public key cryptosystem provides encryption and digital signatures. With growth of key size an efficient design of RSA in terms of area, frequency, throughput and power consumption is hard to achieve. Also with the different type of attacks possible, a need for secure RSA cryptosystem which is attack resistant has arisen. This study presents RSA design with Montgomery powering … …American Journal of Applied Sciences, Vol. 11, Issue 5 · 8 Mar 2014 · 6,969 accessesView PDF Cite

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 PDF Cite