Performance Analysis of the Postcomputation- Based Generic-Point Parallel Scalar Multiplication Method
نویسنده
چکیده
A Postcomputation-based generic-point parallel scalar multiplication method has recently been proposed for high-performance end servers that employ parallel elliptic curve cryptoprocessors. The sequential precomputation overheads, in the postcomputation-based method, are replaced with parallelizable postcomputations. This paper analyzes the performance of the postcomputation-based method with 128 ≤ m ≤ 256 using a number of parallel elliptic curve cryptoprocessors. The results show that the best performance is achieved when eight cryptoprocessors are used. KeywordsElliptic Curve Cryptosystems, Parallel Scalar Multiplication, Precomputations, Postcomputations, Generic-Point Scalar Multiplication.
منابع مشابه
Generic-point parallel scalar multiplication without precomputations
The first efficient generic-point parallel scalar multiplication method is presented here. The novelty of the proposed method is that the precomputation overhead can be replaced by postcomputations that can be parallelised. This method will be very attractive for use in high-performance end servers that employ parallel elliptic curve cryptoprocessors.
متن کاملA Novel and Efficient Hardware Implementation of Scalar Point Multiplier
A new and highly efficient architecture for elliptic curve scalar point multiplication is presented. To achieve the maximum architectural and timing improvements we have reorganized and reordered the critical path of the Lopez-Dahab scalar point multiplication architecture such that logic structures are implemented in parallel and operations in the critical path are diverted to noncritical path...
متن کاملEfficient Elliptic Curve Point Multiplication with Montgomery Ladder Algorithm
Scalar point multiplication has encountered significant attention in Elliptic curve cryptography (ECC) which is gaining popularity due to providing same level security with smaller key sizes compared to traditional cryptosystems, such as Ron Rivest, Adi Shamir, and Leonard Adleman (RSA). Point multiplication (KP) in ECC is basically performed on point addition and point doubling on elliptic cur...
متن کاملEfficient elliptic curve scalar multiplication algorithms resistant to power analysis
This paper presents four algorithms for securing elliptic curve scalar multiplication against power analysis. The highest-weight binary form (HBF) of scalars and randomization are applied to resist power analysis. By using a special method to recode the scalars, the proposed algorithms do not suffer from simple power analysis (SPA). With the randomization of the secret scalar or base point, thr...
متن کاملComparison of Simple Power Analysis Attack Resistant Algorithms for an Elliptic Curve Cryptosystem
Side channel attacks such as Simple Power Analysis(SPA) attacks provide a new challenge for securing algorithms from an attacker. Algorithms for elliptic curve point scalar multiplication such as the double and add method are prone to these attacks. The protected double and add algorithm provides a simple solution to this problem but is costly in terms of performance. Another class of algorithm...
متن کامل