Challenges in data representation for efficient execution of encryption operation
Big number operation has always been a bottleneck to computer system as it imposes high
demand on computing power. With a limited power available, operations such as …
demand on computing power. With a limited power available, operations such as …
Elliptic curve scalar multiplication algorithm using complementary recoding
P Balasubramaniam, E Karthikeyan - Applied mathematics and …, 2007 - Elsevier
Elliptic curve based cryptosystem is an efficient public key cryptosystem, which is more
suitable for limited environments. The very expensive operation in elliptic curve based …
suitable for limited environments. The very expensive operation in elliptic curve based …
[PDF][PDF] A comparison among fast point multiplication algorithms in elliptic curve cryptosystem
In the Elliptic Curve Cryptosystem, the multiplication of points is essential in the successful
computation of any operation. Reduction of time complexity for the mathematical operations …
computation of any operation. Reduction of time complexity for the mathematical operations …
Computational complexity theoretical analyses on cryptographic algorithms for computer security application
CL Wu, CH Hu - … International Conference on Innovations in Bio …, 2012 - ieeexplore.ieee.org
We know the" signed-digit recoding algorithm" has less occurrence probability of the
nonzero digit than original binary number representation. The goal of study time-efficient …
nonzero digit than original binary number representation. The goal of study time-efficient …
[PDF][PDF] CCS Representation: A new non-adjacent form and its application in ECC
A Rezai, P Keshavarzi - Journal of basic and applied scientific …, 2012 - researchgate.net
This paper introduces CCS (complementary canonical sliding window) representation which
is an efficient class of the non-adjacent-form (NAF). The CCS representation is an extension …
is an efficient class of the non-adjacent-form (NAF). The CCS representation is an extension …
[PDF][PDF] Accelerate Performance for Elliptic Curve Scalar Multiplication based on NAF by Parallel Computing.
The aim of Elliptic Curve Cryptosystems (ECC) is to achieve the same security level as RSA
but with shorter key size. The basic operation in the ECC is scalar multiplication which is an …
but with shorter key size. The basic operation in the ECC is scalar multiplication which is an …
Fast modular multi-exponentiation using modified complex arithmetic
CL Wu, DC Lou, JC Lai, TJ Chang - Applied Mathematics and Computation, 2007 - Elsevier
Modular multi-exponentiation [Formula: see text] is a very important but time-consuming
operation in many modern cryptosystems. In this paper, a fast modular multi-exponentiation …
operation in many modern cryptosystems. In this paper, a fast modular multi-exponentiation …
Minimizing hamming weight based on 1's complement of binary numbers over GF(2m)
Elliptic curve cryptosystems have been the focus of much attention as the benefits of elliptic
curve cryptography (ECC) become many such as a small software footprint, low hardware …
curve cryptography (ECC) become many such as a small software footprint, low hardware …
An efficient montgomery exponentiation algorithm for cryptographic applications
CL Wu, DC Lou, TJ Chang - Informatica, 2005 - content.iospress.com
Efficient computation of the modular exponentiations is very important and useful for public-
key cryptosystems. In this paper, an efficient parallel binary exponentiation algorithm is …
key cryptosystems. In this paper, an efficient parallel binary exponentiation algorithm is …
Fast simultaneous scalar multiplication
P Balasubramaniam, E Karthikeyan - Applied mathematics and …, 2007 - Elsevier
Scalar multiplication is a very expensive operation in elliptic curve based cryptographic
protocol. In this paper, we propose a modified simultaneous elliptic curve scalar …
protocol. In this paper, we propose a modified simultaneous elliptic curve scalar …