Cryptographic technique is one of the principal means to protect information security. Not
only has it to ensure the information confidential, but also provides digital signature …

Modular exponentiation in the Rivest, Shamir, and Adleman cryptosystem is usually
achieved by repeated modular multiplications on large integers. To speed up the …

Modular exponentiation with a large modulus and exponent is a fundamental operation in
many public-key cryptosystems. This operation is usually accomplished by repeating …

Modular exponentiation with large modulus and exponent, which is usually accomplished by
repeated modular multiplications, has been widely used in public key cryptosystems …

This paper presents the design of a power-and area-efficient high-speed 768000-bit
multiplier, based on fast Fourier transform multiplication for fully homomorphic encryption …

The Montgomery algorithm is a fast modular multiplication method frequently used in
cryptographic applications. This paper investigates the digit-serial implementations of the …

A design methodology for incorporating Residue Number System (RNS) and Polynomial
Residue Number System (PRNS) in Montgomery modular multiplication in GF (p) or GF (2 n) …

Authenticated broadcast, enabling a base station to send commands and requests to low-
powered sensor nodes in an authentic manner, is one of the core challenges for securing …

This brief presents a novel and efficient design for a Rivest-Shamir-Adleman (RSA)
cryptosystem with a very large key size. A new modular multiplier architecture is proposed …

Modular multiplication is a crucial operation in public key cryptosystems like RSA and elliptic
curve cryptography (ECC). This paper presents a new word-based Montgomery modular …