Sequence generated by the subtract-with-carry engine may be described by the recurrence relation:
Constants S and R are known as the short and long lags, respectively.
Therefore, expressions and correspond to the S-th and R-th previous terms of the sequence.
S and R satisfy the condition .
ModulusM has the value , where W is the word size, in bits, of the state sequence and .