1,262 research outputs found
Random digital encryption secure communication system
The design of a secure communication system is described. A product code, formed from two pseudorandom sequences of digital bits, is used to encipher or scramble data prior to transmission. The two pseudorandom sequences are periodically changed at intervals before they have had time to repeat. One of the two sequences is transmitted continuously with the scrambled data for synchronization. In the receiver portion of the system, the incoming signal is compared with one of two locally generated pseudorandom sequences until correspondence between the sequences is obtained. At this time, the two locally generated sequences are formed into a product code which deciphers the data from the incoming signal. Provision is made to ensure synchronization of the transmitting and receiving portions of the system
Підходи до визначення випадкових послідовностей
Приводяться та порівнюються різні означення випадкових та псевдовипадкових послідовностей. Розглядається питання про тестування послідовностей.Different definitions of random and pseudorandom sequences are compared. Question about testing of sequences is considered. Random and pseudorandom sequences, testing
On the number of unsuitable boolean functions in constructions of filter and combining models of stream ciphers
It is well known that every stream cipher is based on a good pseudorandom generator. For cryptographic purposes, we are interested in generation of pseudorandom sequences of the maximal possible period. A feedback register is one of the most known cryptographic primitives that is used in construction of stream generators. We analyze periodic properties of pseudorandom sequences produced by filter and combiner generators equipped with nonlinear Boolean functions. We determine which nonlinear functions in these schemes lead to pseudorandom sequences of not maximal possible period. We call such functions unsuitable and count the exact number of them for an arbitrary n
Families of sequences with good family complexity and cross-correlation measure
In this paper we study pseudorandomness of a family of sequences in terms of
two measures, the family complexity (-complexity) and the cross-correlation
measure of order . We consider sequences not only on binary alphabet but
also on -symbols (-ary) alphabet. We first generalize some known methods
on construction of the family of binary pseudorandom sequences. We prove a
bound on the -complexity of a large family of binary sequences of
Legendre-symbols of certain irreducible polynomials. We show that this family
as well as its dual family have both a large family complexity and a small
cross-correlation measure up to a rather large order. Next, we present another
family of binary sequences having high -complexity and low cross-correlation
measure. Then we extend the results to the family of sequences on -symbols
alphabet.Comment: 13 pages. Comments are welcome
STATISTICAL PROPERTIES OF PSEUDORANDOM SEQUENCES
Random numbers (in one sense or another) have applications in computer simulation, Monte Carlo integration, cryptography, randomized computation, radar ranging, and other areas. It is impractical to generate random numbers in real life, instead sequences of numbers (or of bits) that appear to be ``random yet repeatable are used in real life applications. These sequences are called pseudorandom sequences. To determine the suitability of pseudorandom sequences for applications, we need to study their properties, in particular, their statistical properties. The simplest property is the minimal period of the sequence. That is, the shortest number of steps until the sequence repeats. One important type of pseudorandom sequences is the sequences generated by feedback with carry shift registers (FCSRs). In this dissertation, we study statistical properties of N-ary FCSR sequences with odd prime connection integer q and least period (q-1)/2. These are called half-ℓ-sequences. More precisely, our work includes: The number of occurrences of one symbol within one period of a half-ℓ-sequence; The number of pairs of symbols with a fixed distance between them within one period of a half-ℓ-sequence; The number of triples of consecutive symbols within one period of a half-ℓ-sequence.
In particular we give a bound on the number of occurrences of one symbol within one period of a binary half-ℓ-sequence and also the autocorrelation value in binary case. The results show that the distributions of half-ℓ-sequences are fairly flat. However, these sequences in the binary case also have some undesirable features as high autocorrelation values. We give bounds on the number of occurrences of two symbols with a fixed distance between them in an ℓ-sequence, whose period reaches the maximum and obtain conditions on the connection integer that guarantee the distribution is highly uniform.
In another study of a cryptographically important statistical property, we study a generalization of correlation immunity (CI). CI is a measure of resistance to Siegenthaler\u27s divide and conquer attack on nonlinear combiners. In this dissertation, we present results on correlation immune functions with regard to the q-transform, a generalization of the Walsh-Hadamard transform, to measure the proximity of two functions. We give two definitions of q-correlation immune functions and the relationship between them. Certain properties and constructions for q-correlation immune functions are discussed. We examine the connection between correlation immune functions and q-correlation immune functions
- …