However, some machines are faster using
integer arithmetic. To increase the flexibility of both the FM and ZM packages, they have been written so that the type of arithmetic used for the basic operations can be easily changed.
RSA algorithm is built on large
integer arithmetic, whose input and output are both large integers.
We now describe a method for exploiting that feature through
integer arithmetic. A previous old, as well as a recent new article in the Communications have discussed such implementations: Payne, Rabung and Bogyo [11] for IBM 360s in 1969 and Carta in 1990 [2] for unspecified CPU's that seem to do
integer arithmetic with 31-bit registers, a variety unknown to us.
The use of modular exponentiation of primitive roots of prime over its residual elements generates session keys which involves only
integer arithmetic and is free from round off errors.
(2) Some of the fastest
integer arithmetic performance in the world:Compared processor performance based on values posted from SPECint_rate(R)2006, excluding HPC servers (as of July 11, 2013).
Note that there is a residual
integer arithmetic requirement in this version of Random.
[2] have proposed a very efficient way to implement a portable MLCG with modulus m using only [log.sub.2(m + 1)]-bit
integer arithmetic, when a satisfies: a.sup.2 <m.
The desire to use
integer arithmetic. The precision required to represent the [low, high) interval grows with the length of the message.