One of the general methods for implementing a multiple recursive generator
is recursive reduction method (RRM). This paper provides an analysis of its
number of operations. We also propose a new method that modifies the RRM b
y considering the stop conditions and the order of multiplier and multiplic
and. Some empirical comparisons reveal that the new algorithm is more effic
ient with a reduction of iterative numbers in the range of 13.1416%-20.5118
% depending on the moduli and multipliers being used.