A set of congruence relations is a z-covering if each integer belongs to at least one
congruence class from that set. In this paper, we first show that most existing scalar …

In this paper we present a novel, powerful attack on a recently introduced randomized scalar
multiplication algorithm based on covering systems of congruences. Our attack can recover …

This paper presents parallel scalar multiplication techniques for elliptic curve cryptography
using q-based addition-subtraction k-chain which can also effectively resist side-channel …

The dynamic nature of knowledge and software evolution and usage present a pervasive
challenge to system developers. Discrete attempts to create such systems often lead to a …

This paper shows that stochastic heuristic approach for implicitly solving addition chain
problem (ACP) in public-key cryptosystem (PKC) enhances the efficiency of the PKC and …

Elliptic Curve Cryptography (ECC) was introduced independently by Miller and Koblitz in
1986. Compared to the integer factorization based Rivest-Shamir-Adleman (RSA) …

As a unique form of signed-digit representation, non-adjacent form (NAF) minimizes
Hamming weight by removing a stream of non-zero bits from the binary representation of …