Modular exponentiation is an important operation in many applications that requires a large
number of operations. Efficient computations of the modular exponentiation are extremely …

This paper makes two major contributions. First, we propose an algorithm to compute a
multiplicative inverse modulo without using integer division by refining the Arazi–Qi …

Phenomenal demands for all kind of real-time e-commerce transactions and internet usage
insist security as an essential part for protecting sensitive data. Many organizations use …

One of the most principal operations in many PKCs is Modular Exponentiation (ME). This
operation is usually performed by successive modular multiplications. So, the efficiency of …

The efficiency and throughput primarily of public key cryptography (PKC) are determined by
the efficient execution of modular multiplication and thus modular exponentiation. If we wish …

Modular exponentiation (ME) that computes by repeating modular multiplications (M2), is
main operation in public-key cryptosystems. In recent years, many researchers studied on …

This chapter discusses the implementation of modular Exponentiation in Dual-core with
High Radix Multiplication (DCHRM), for further reduction of clock cycles and better …

This chapter illustrates the energy-efficient hardware implementation of the BFW technique
for modular exponentiation. Hardware accomplishments of the given BFW techniques have …

This chapter discusses the better performing approaches for modular exponential
techniques that are adaptable by the different architectures of PKC. The importance of PKC …

In this chapter, the basics of exponentiation is discussed ie, how to compute g^ e ge, here g
is a base and e is an exponent. Following this, we will apply modulus operation over …