Sentence examples for modular multiplications in from inspiring English sources

Montgomery's algorithm is a popular technique to speed up modular multiplications in public-key cryptosystems.

However, the column of in a keying share must be restored when needed, resulting in modular multiplications.

A new processing element (PE) structure and serial-in-serial-out systolic multiplier are proposed for the efficient implementation of Montgomery's modular multiplication algorithm in RSA cryptosystem.

Modular exponentiation and modular multiplications are two fundamental operations in various cryptographic applications, and hence the performance of public-key cryptographic algorithms is strongly influenced by the efficient implementation of these operations.

Reducing the frequency of modular multiplications and the time requirements for modular multiplication will help in developing efficient modular exponential algorithms.

Due to the high computational complexity of the asymmetric cryptography, such as modular multiplications and exponentiations which lead much heavier burden than operations in symmetric cryptography, the proposed protocol transfers the demanding computational requirements from the buyer to a powerful server in protocol design.

Performance can be improved in three ways: (i) by reducing the frequency of modular multiplications; (ii) by reducing the time required to evaluate modular multiplication; (iii) by increasing the RSA cores.

It is performed using successive modular multiplications.

On the considered computational platforms for operand lengths used in cryptography, the fastest presented modular inverse algorithms need about twice the time of modular multiplications, or even less.

In general, given the keying information, computing a shared key with one neighbor takes modular multiplications for both key space models.

Generally, modular exponentiation is implemented using a chain of modular multiplications.