Research ArticleOpen accessIn the abstractA Bit-Serial Multiplier Architecture for Finite Fields Over Galois FieldsHero Modares, Yasser Salem, Rosli Salleh, Majid Talebi ShahgoliProblem statement: A fundamental building block for digital communication is the Public-key cryptography systems. Public-Key Cryptography (PKC) systems can be used to provide secure communications over insecure channels without exchanging a secret key. Implementing Public-Key cryptography systems is a challenge for most application platforms when several factors have to be considered in selecting the implementation platform. Approach: The most popular … …Journal of Computer Science, Vol. 6, Issue 11 · 23 Oct 2010 · 8,431 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
Research ArticleOpen accessIn the abstractKey Exchange Protocol in Elliptic Curve Cryptography with No Public PointK. Kaabneh, H. Al-BdourIn recent years some cryptographic algorithms have gained popularity due to properties that make them suitable for use in constrained environment like mobile information appliances, where computing resources and power availability are limited. One of these cryptosystems is Elliptic curve which requires less computational power, memory and communication bandwidth compared to other cryptosystem. This makes the elliptic curve cryptography to … …American Journal of Applied Sciences, Vol. 2, Issue 8 · 31 Aug 2005 · 7,067 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordERROR DETECTION SCHEMES FOR FINITE FIELD MULTIPLIERSB. Sargunam, R. DhanasekaranFinite field multipliers are widely used in the field of cryptography for the purpose of scalar multiplication. The outputs of the finite field multipliers may consist of errors due to certain natural radiations which further leads to the failure of the cryptosystems. Here two Concurrent Error Detection (CED) schemes namely time redundancy and modular inversion based error detection schemes for … …American Journal of Applied Sciences, Vol. 11, Issue 1 · 11 Dec 2013 · 6,913 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordHighly 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