On Parallelization of High-Speed Processors for Elliptic Curve Cryptography

Järvinen, Kimmo; Skyttä, Jorma

doi:10.1109/tvlsi.2008.2000728

Cited by 77 publications

(38 citation statements)

References 42 publications

(84 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…1(a) [8], where the latency of each step is indicated on the left, where the latency for GNB field addition, squaring and multiplication are 1, 1 and M clock cycles [16], respectively. [8]. (b) the proposed scheme using only three multipliers.…”

Section: Proposed Schemementioning

confidence: 99%

“…Binary curves have attracted many researchers to reduce point multiplication. These methods include parallelization, by using multiple parallel field multipliers in the finite field computations [8,9,10,11], and by interleaving [12,13]. Recently, several methods to perform parallel computations for point addition on Koblitz curves have been proposed in [8,9,11,13,14,15].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Very efficient point multiplication on Koblitz curves

Al-Somani

2016

IEICE Electron. Express

View full text Add to dashboard Cite

This paper presents a very efficient scheme for point multiplication on Koblitz curves. The proposed scheme reduces the critical path in the data dependency graph of the point addition operation and increases the utilization of the three parallel multipliers that are used. The proposed scheme exploits an idle multiplier to perform an extra field operation that will be needed in the next iteration. Furthermore, the proposed scheme is implemented on an Altera Stratix II EP2S180F1020C3 FPGA over GF (2 163 ) and compared with the related parallel schemes in the literature. The results show that the proposed scheme outperforms the previous schemes in terms of the area-time (AT) and AT 2 products. Accordingly, the proposed scheme is very attractive for use in high-performance applications.

show abstract

Section: Proposed Schemementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Very efficient point multiplication on Koblitz curves

Al-Somani

2016

IEICE Electron. Express

View full text Add to dashboard Cite

show abstract

“…where a 1 ,a 3 ,a 2 ,a 4 ,a 5 Є E A set of pairs(x,y) which solves (1) and the point at infinity denoted by 'O' called as additive identity for the abelian group which are described in appendix are used to implement elliptic curve cryptography [5]. The elliptic curve can be analyzed over polynomial basis (10),dual basis(2), triangular basis(6) and redundant basis(3).…”

Section: Ecc Over Prime Fieldmentioning

confidence: 99%

“…The above proposed methodology minimizes number of loop carried dependence, data dependence, control dependence and register dependence which helps to improve code scheduling on software to minimize the different hazards and stalls during execution. But the linear scalar multiplication Equation 7, P is repeated k times alternatively to perform the different case of point doubling operation [5]. During the processing, the recent iteration is always dependent on early iteration known as loop carried dependence [11].…”

Section: Proposed Techniquementioning

confidence: 99%

Optimizing point Doubling Operations in ECC Zp

Sakthivel¹,

Nedunchezhian²

2012

IJCA

View full text Add to dashboard Cite

Today a wireless network has minimum power consume and less security access. Based on these the suitable way of providing a security system for wireless application is to select the Elliptic Curve Cryptography. But this public key cryptography has required more number of clock cycles to compute its point operations. One of the point operations called point multiplication requires a lot of clock cycles to compute result. This proposed technique reduces the number of clock cycles of point multiplication for parallel processing by reducing number of dependent and independent operations. General TermsWireless network,security system and dependent and independent operations.

show abstract

“…The elliptic curve point multiplication is computed with point operations which, further are computed using finite field arithmetic. Although the point multiplication itself is hard to parallelize, it is possible to efficiently use parallelism [5], [6], [7], [8] in field arithmetic specifically to some of the NIST recommended elliptic curves.…”

Section: Introductionmentioning

confidence: 99%

A Technique to Speed up the Modular Multiplicative Inversion over GF(P) Applicable to Elliptic Curve Cryptography

Sridhar¹,

N²

2012

IJCA

View full text Add to dashboard Cite

This paper presents a technique to speed up the computation of inversion of NIST recommended elliptic curve with modulus p 521 -1. The property of multiplicative inverse between pair of numbers over Meresenne"s prime is used to reduce the number of iterations in the Binary Inversion Algorithm in GF(p). This increases the speed requirement for point operations applicable to Elliptic Curve Cryptography. This paper proposes an model of the architecture to achieve the above objective which uses parallelism in multiplicative inversion arithmetic block to speed up the computation.

show abstract

On Parallelization of High-Speed Processors for Elliptic Curve Cryptography

Cited by 77 publications

References 42 publications

Very efficient point multiplication on Koblitz curves

Very efficient point multiplication on Koblitz curves

Optimizing point Doubling Operations in ECC Zp

A Technique to Speed up the Modular Multiplicative Inversion over GF(P) Applicable to Elliptic Curve Cryptography

Contact Info

Product

Resources

About