  We present a novel, computationally simple method of hiding any message in
the stream of random bits by using a secret key. The method is called Bury
Among Random Numbers (BARN). A stream of random bits is produced by extracting
the entropy of a physical process in a hardware-based true random number
generator (TRNG). The process of placing bits of a message into the stream of
random bits is governed by the number of random bits skipped between subsequent
insertions. The set of numbers that correspond to the steps of BARN is derived
from a random number also provided by TRNG. Hence BARN cipher does not depend
on any arithmetic function. We propose an effective method of computing random
keys from a given number of random bits. We estimate the number of permutations
that need to be tested during a brute-force attack on the new cipher for
various key lengths. Some practical applications for the new class of
symmetrical ciphers are discussed.
