Page 160 - ISCI’2017

x
x
where ≥i 1 – the number of PRS generating element, ( f 1 ( ) ),, n  , ( f n ( ) ) – intermediate
n ,
1
n
modules.
7. If necessary determine hash-value number i from b and accept it as random word number i,
i
i.e.:
b
y = H ( ).
i
i
The scheme of algorithm (variant) that implements above-described method of determined random
number generator (DRNG) is illustrated on fig. 1.

m1 m2 m3,…,mn
k a0 ai bi ci
θ mod(f1(x),m1) ai-1θmod(f1(x),m1) aimod(f2(x),m2) bi(mod(f3(x),m3),…,(fn(x),mn))
k

θ H(bi)

pseudorandom pseudorandom
numbers numbers

Fig.1 – The scheme of algorithm of determined random sequences generation in the finite

field of p n − 1 division by method of multimodulo transformation

160