Research ArticleOpen accessIn the keywordsHighly Efficient Elliptic Curve Crypto-Processor with Parallel GF(2m) Field MultipliersTurki F. Al-Somani, M. K. Ibrahim, Adnan GutubThis study presents a high performance GF(2m) Elliptic Curve Crypto-processor architecture. The proposed architecture exploits parallelism at the projective coordinate level to perform parallel field multiplications. In the proposed architecture, normal basis representation is used. Comparisons between the Projective, Jacobian and Mixed coordinate systems using sequential and parallel designs are presented. Results show that parallel designs using normal basis gives … …Journal of Computer Science, Vol. 2, Issue 5 · 31 May 2006 · 6,874 accessesView PDFCite
Research ArticleOpen accessIn the abstractA 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
Research ArticleOpen accessIn the abstractA Cryptosystem Using the Concepts of Algebraic Geometric CodeK. V. Pramod, C. ManjuProblem statement: Cryptosystem using linear codes was developed in 1978 by Mc-Eliece. Later in 1985 Niederreiter and others developed a modified version of cryptosystem using concepts of linear codes. But these systems were not used frequently because of its larger key size. In this study we were designing a cryptosystem using the concepts of algebraic geometric codes with smaller key … …Journal of Computer Science, Vol. 6, Issue 3 · 31 Mar 2010 · 7,444 accessesView PDFCite