Some modifications of one-time pad cipher

Rok, strany: 2004, 157 - 171

The main step in the presented modifications of one-time pad (also called Vernam cipher) is a key sequence x_n, n=1,2,..., computed from private vector sequence b_n and random sequence x_n by the relation

$$ x_n= cases 1 for f( b_n, x_n)in [A,B), 0 for f ( b_n, x_n) otin [A,B), endcases $$

where f is a continuous function and the interval [A,B) satisfies g (B)-g (A)=((1) / (2)), where g is an asymptotic distribution function of the sequence f( b_n, x_n). We analyze the presented modification with respect to the disclosed message.

ISO 690:

Strauch, O. 2004. Some modifications of one-time pad cipher. In Tatra Mountains Mathematical Publications, vol. 29, no.3, pp. 157-171. 1210-3195.

APA:

Strauch, O. (2004). Some modifications of one-time pad cipher. Tatra Mountains Mathematical Publications, 29(3), 157-171. 1210-3195.