<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>V.N. Karazin Kharkiv National University</institution>
          ,
          <addr-line>Svobodu square 4, Kharkiv, 61022</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The paper presents the results of solving the actual problem of improving the performance indicators of information and communication systems (ICS), in particular, information security, noise immunity, secrecy, in terms of external and internal disturbing influences, based on the models and methods development for information exchange in ICS, synthesis new classes of nonlinear discrete cryptographic signals (CS) with the necessary properties. For the first time, complex non-linear discrete СS synthesis problem was formulated and solved, based on the use of random (pseudo-random) processes. Taking into account the requirements of cryptographic robustness and the complexity of generating a cryptographic signal as a source of random (pseudo-random) processes, the choice of a symmetric block encryption algorithm with a counter is grounded. The synthesis method obtained by the authors makes it possible to form large ensembles of discrete sequences of practically any period with given, but physically realizable, side-lobe values of auto, cross and butt correlation functions, as well as statistical characteristics of correlation functions that are not inferior to those of the best linear classes of signals, in terms of correlation functions. A method for synthesizing derived signal systems based on nonlinear discrete cryptographic signals is proposed. Improved (as compared with the known linear signal classes) ensemble, correlation and structural properties of the synthesized signal system allow improving the indicators of information security, noise immunity and secrecy of the operation of ICS.</p>
      </abstract>
      <kwd-group>
        <kwd>information security</kwd>
        <kwd>secrecy</kwd>
        <kwd>correlation function</kwd>
        <kwd>complex signal</kwd>
        <kwd>cryptographic signal</kwd>
        <kwd>ensemble signals</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>secure information and communication systems (ICS) is of particular importance. To
a significant extent, such systems are based on the use of secure radio channels. In
this case, under system protection we will understand, in a broad sense, their ability to
provide the necessary indicators for noise immunity, information, energy and
structural secrecy. Increased requirements for the effectiveness of the ICS in the
conditions of internal and external influences are largely not taken into account by
existing information technologies. There is a contradiction between the stringent
requirements for ensuring the reliability, secrecy, confidentiality, integrity,
authenticity of data transmitted over wired and wireless ICS communication lines,
and existing models, methods and technologies for managing telecommunications
networks, information security, services and quality of service.</p>
      <p>New models, methods and technologies creation for managing telecommunication
networks, information security, services and quality of service, in order to improve
system performance indicators, under external and internal impacts (threats), through
the creation of various interferences (retransmitted, structural, impulse, broadband,
narrowband etc.), breaches of confidentiality, integrity and authenticity of information
exchange, are, in our opinion, relevant research areas.</p>
      <p>A significant number of ICS are multi-user systems. In such systems, multiple
channels are located within a common time-frequency resource. One of the most
promising ways of multiple access to services and system resources is code division
multiple access in the common frequency band (CDMA). This access method is the
most promising in many aspects: high noise immunity of the channels and ensuring
the confidentiality of the transmitted data; high transmission rate and bandwidth
efficiency; high energy efficiency and network subscriber capacity. Since the code
division of ICS channels is based on the difference in signals provided to system
subscribers, the construction of such systems and their characteristics are determined
by the choice of signals and their properties. A promising direction for ensuring the
security of information resources is the use of distributed spectrum technology
(broadband noise-like signals).</p>
      <p>The main ways to solve the above contradiction is to increase the noise immunity
(in particular, energy and structural secrecy, noise immunity of signal reception) and
information security of ICS by improving the methodological basis for constructing
ICS by developing information exchange methods, methods for synthesizing new
classes of nonlinear complex discrete signal-data carriers with the necessary
ensemble, correlation and structural properties.
2 Statement and problem solution for nonlinear discrete
complex cryptographic signals system synthesis
The process of choosing complex signals structures that are rational for some criteria
is identical to the synthesis of the corresponding manipulating discrete sequences
(DS). As a criterion for choosing a discrete signal class, as a rule, they are guided by
the criterion of minimum mutual interference (minimax criterion). Such a criterion
implies the ensemble signal construction with volume M, manipulated by DS, which
differ as much as possible from each other during possible cyclic shifts. The
quantitative measure of the differences between manipulating DSs are the maximum
ensembles side-lobe levels of the periodic autocorrelation function (ACPF) and the
side lobe level of the periodic cross-correlation function (CCPF). On this basis, the
broadband signals (BBS) used in ICS should have such correlation properties, when
the lateral peaks of the correlation functions of the BBS are as low as possible, i.e.
ideally should aim for zero. However, the requirement of ideality (zero values of side
peaks) of auto- and cross- correlation functions between all cyclic shifts of K
sequences and various signal system isomorphisms with period N is not feasible,
since the values of side peaks cannot fall below 1/2√B (B – signal base) [1].</p>
      <p>Information exchange methods used in ICS, as well as classes of wideband
signals, used as a physical carrier of data (sets of linear recurrent sequences
(Msequence), Kasami, Golda, Kamaletdinov and others), possessing relatively small
values of side lobes of auto- and cross-correlation functions that do not support
necessary (for critical ICS applications) information security and noise immunity
indicators [1]. Thus, in the process of information exchange in ICS for a long time,
the correspondence: the message-signal bit is fixed, and the above signals have low
structural secrecy, limited ensemble properties, and also exist only for a limited
number of signal period values. In the case of period truncation (increase) of such
signals, their correlation properties deteriorate.</p>
      <p>The analysis showed that currently there are no regular methods for the discrete
sequences (DS) synthesis that are optimal by the minimax criterion. The problem of
DS synthesis turns out to be even more complex if the requirements are imposed on
signal system dimension (volume), structural properties and the number of DS
elements. Since, for distributed spectrum technology, data carrier signal properties are
completely determined by DS properties, which manipulate the information bits of
system users [1-2], the search for efficient methods for the discrete signals
(sequences) synthesis of corresponding to the potentially achievable boundary
characteristics of correlation functions (minimax properties) or the border of “dense
packing”) and possessing the required correlation, structural, ensemble properties.</p>
      <p>The quality of services provided by ICS is proposed to assess, including the level
of information security. At the same time, information security means the ability of
ICS to provide protection against the destruction, modification, blocking of
information, its unauthorized leakage or against violation of the established procedure
for its routing. Also, information security should be understood as the state of security
of data processing and storage systems, which ensures information confidentiality,
integrity and availability, as well as other information properties and services:
authenticity, traceability, irrefutability and reliability. [3].</p>
      <p>We will formulate in general terms the problem of signal synthesis with given
correlation ensemble and structural properties that provide the required values of
noise immunity, information security and information transmission system secrecy.
We require that such signal systems have the property of "blurring" in the correlation
properties. This property means that increasing or decreasing the length of a discrete
sequence does not change the correlation properties of the original discrete sequence.</p>
      <p>The need to use secure radio channels forces researchers to take a fresh look at
both protected radio channels operation modes and formation and application of
complex signals aspects. Therefore, in our opinion, new approaches and new views on
the complex signals application processes and functions are needed. In our opinion,
new fundamental understanding of methods to ensure information secrecy, that is,
functions that in traditional ICS are assigned to cryptographic systems and means.
Therefore, a productive step, from the point of view of a new direction of using
complex signal systems, is the synthesis of so-called cryptographic signal (CS)
systems. The synthesis of such signals is based on the application of key data, and at
the same time, the signals must have: absolute structural secrecy regarding the laws of
their formation; improved ensemble properties (exist for almost any period value,
have a significant amount of signal system); necessary to ensure the required value of
noise immunity, the correlation properties. For protected radio channels, considered
signal systems are defined by the applications in which they applied. In particular,
these can be either individual signals or pairs of signals, as well as large sets of
discrete sequences with necessary, but objectively limited values of «dense packing»,
cross-correlation and ensemble properties.</p>
      <p>Under cryptographic discrete signals, it is proposed to understand symbol
sequence sets (vectors) of a certain alphabet that possess the necessary (specified)
structural, ensemble and correlation properties, temporal and spatial formation
complexity and are formed on the basis of random (pseudo-random) processes,
including using cryptographic algorithms [4-6]. Such signals must meet the
requirements of chance, irreversibility, unpredictability [7], have correlation and
ensemble properties determined by the owner (user) ICS. The use of CS, will improve
the performance of ICS, in particular: noise immunity (noise immunity of signal
reception in the face of structural, barrage, retransmitted and other types of
interference, secrecy of operation) and information security. With this approach, the
signal’s structural secrecy is provided by randomness or pseudo-randomness of the
symbol sequence, noise immunity is provided by the synthesized signal system
correlation properties, ICS information security is provided based on statistical
properties of CS close to the properties of random sequences, and the use of
cryptographic keys, and the key length can be significantly less than the period
(length) of the signal itself. It is necessary to note the special property of
cryptographic signal systems: the possibility of their recovery in space and in time
using keys and a number of other parameters that are used in the synthesis of this
signal system.
3</p>
    </sec>
    <sec id="sec-2">
      <title>Discrete cryptographic signal models</title>
      <p>Under task of constructing (synthesizing) CS, we will understand the task of
constructing subsets of discrete sequences. (Wlq ), q  1, N,l  1, L , the combination of
which forms a discrete signal system with given dimension alphabet Mk  N  L ,
such that in each of the subsets (vocabulary) the conditions that are imposed on the
subset of CS in terms of structural, ensemble, correlation properties, spatial and
temporal complexity of their generation are met.</p>
      <p>CS construction is based on the analysis and use of periodic and aperiodic
correlation functions and is based on the following theoretical principles.</p>
      <p>1. Ensuring conditions for fulfilling the requirements for structural and ensemble
properties, the possibilities of forming a CS subset with permissible temporal and
spatial complexity, including using keys.</p>
      <p>2. CS formation Wq, periodic autocorrelation function (ACPF) of each of which
satisfies the system of nonlinear parametric inequalities (NPI):</p>
      <p>L</p>
      <p>
        Raq1 (l)  i 1 Wiq (Wiql )  Raq2 (l), l=1,L  1 , q  1, N , (
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
where Raq1 (l) і Raq2 (l) – ACPF implementation setpoints, and indices are calculated
modulo (i+ l) modL.
      </p>
      <p>
        If l=L for all q  1, N (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) convolution by value L
L WiqWiq  L, q  1, N . (
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
i 0
3. Pair formation CS Wq and Wp, cross-correlation functions (CCF) which meet
the requirements that are determined by a set of NPI systems (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ), and also meet the
requirements for butt cross-correlation functions (CCBF) pair CS Wq and Wp with butt
discrete signals Wqp and Wpq (
        <xref ref-type="bibr" rid="ref3 ref4 ref5 ref6 ref7">3 – 7</xref>
        ):
      </p>
      <p>Rqp (l)  LK Wiq  (Wi pl )* 
b1,1 i0</p>
      <p>L 1

i L  K 1</p>
      <p>Wiq (Wi pl  K )*  Rbq2p,1 (l)
Rqp (l) </p>
      <p>b1,2
Rqp (l) </p>
      <p>b1,3
Rqp (l) 
Rqp (l) 
b1,4
b1,5</p>
      <p>LK Wiq  (Wiql )* 
i0
LK Wiq  (Wipl )* 
i0
LK
 Wip  (Wipl )* 
i0
LK
 Wip  (Wiql )* 
i0</p>
      <p>L1

iLK 1</p>
      <p>L1

iLK 1</p>
      <p>L1

iL K 1</p>
      <p>L1

iLK 1</p>
      <p>Wiq (Wipl  K )*  Rqp (l);</p>
      <p>
        b2,2
Wiq (Wiql  K )*  Rbq2p,3 (l);
Wip (Wiql  K )*  Rbq2p,4 (l);
Wip (Wipl  K )*  Rbq2p,5 (l);
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
(
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
(
        <xref ref-type="bibr" rid="ref5">5</xref>
        )
(
        <xref ref-type="bibr" rid="ref6">6</xref>
        )
(
        <xref ref-type="bibr" rid="ref7">7</xref>
        )
where l=1,L  1   for all kinds of connections q and p, q  1, N , p  1, N , q p,
where
      </p>
      <p>R qp (l )
b1, j
and</p>
      <p>R qp (l ) , CCPF and CCBF implementations are set</p>
      <p>b2, j
respectively, j  1, 5 .</p>
      <p>
        In NPI systems (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) - (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) and (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) – (
        <xref ref-type="bibr" rid="ref7">7</xref>
        ) Wiq and Wip are unknown values of random
or pseudo-random characters CS Wq and Wp, q  1, N , to be determined in the process
of their construction.
      </p>
      <p>
        Let us analyze the systems of nonlinear parametric quadratic inequalities (further
systems) (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) - (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) and (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) - (
        <xref ref-type="bibr" rid="ref7">7</xref>
        ), using the introduced model.
      </p>
      <p>
        Systems (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ) and (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ) if l=L for all q  1, N  must give a complete convolution with
the value L, i.e (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ):
and (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ) gives
      </p>
      <p>
        L
WiqWiq  L, q  1, N
i1
L
Wi pWi p  L, p  1, N .
i1
(
        <xref ref-type="bibr" rid="ref8">8</xref>
        )
(
        <xref ref-type="bibr" rid="ref9">9</xref>
        )
p
independent NPI. Further, using (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ), we obtain one more expression, but already the
equality. A feature of system (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) is that it gives a convolution of each of q CS with
value L. Based on (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) and (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ), each N subset of CS can be constructed to form N
independent systems of quadratic NPI, each of which will contain L-1 quadratic
inequalities of the form (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) and formally one equality, so that all of them will be L.
      </p>
      <p>
        We will also analyze the totality of systems of parametric inequalities (
        <xref ref-type="bibr" rid="ref3 ref4 ref5 ref6 ref7">3-7</xref>
        ), taking
into account (
        <xref ref-type="bibr" rid="ref8">8</xref>
        ) – (
        <xref ref-type="bibr" rid="ref12">12</xref>
        ), for solutions existence, systems independence and individual
equalities. Systems (
        <xref ref-type="bibr" rid="ref3 ref4 ref5 ref6 ref7">3-7</xref>
        ) determine the permissible cross-correlation properties with
respect to the CCPF and CCBF of each pair CS – Wq and Wp. They define the
requirements for CCPF and butt cross-correlation functions (CCBF) specifically only
two CS -Wq and Wp. When building three CDSs, we’ll have 3!/2 systems like (
        <xref ref-type="bibr" rid="ref3 ref4 ref5 ref6 ref7">3-7</xref>
        ),
and for N CS respectively -N!/2 such systems. Thus, with increasing N, the number of
systems of the form (
        <xref ref-type="bibr" rid="ref3 ref4 ref5 ref6 ref7">3-7</xref>
        ) increases exponentially (in terms of factorial).
      </p>
      <p>
        For N = 2, among (
        <xref ref-type="bibr" rid="ref8">8</xref>
        ) – (
        <xref ref-type="bibr" rid="ref12">12</xref>
        ) NPI systems are redundant nonlinear quadratic
equalities. Equality (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) coincides with (
        <xref ref-type="bibr" rid="ref8">8</xref>
        ) and (
        <xref ref-type="bibr" rid="ref9">9</xref>
        ), therefore, the last two are already
included in system (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ), are dependent, and therefore cannot be used. Further,
equalities (
        <xref ref-type="bibr" rid="ref10">10</xref>
        ) and (
        <xref ref-type="bibr" rid="ref11">11</xref>
        ) coincide, and equality (
        <xref ref-type="bibr" rid="ref12">12</xref>
        ) is symmetric, in terms of the
correlation function, with respect to equalities (
        <xref ref-type="bibr" rid="ref10">10</xref>
        ) and (
        <xref ref-type="bibr" rid="ref11">11</xref>
        ). Therefore, for each pair
p and q independent is (
        <xref ref-type="bibr" rid="ref10">10</xref>
        ).
      </p>
      <p>
        Based on a detailed analysis, we find that all (
        <xref ref-type="bibr" rid="ref3 ref4 ref5 ref6 ref7">3-7</xref>
        ) NPI systems define different
implementations of CCPF and CCBF specifically only two CS Wq and Wp. Therefore,
a mathematical model for constructing two CS Wq and Wp uniquely determined by
the five systems NPI like (
        <xref ref-type="bibr" rid="ref3 ref4 ref5 ref6 ref7">3 -7</xref>
        ), and, as already stated, by the equation (
        <xref ref-type="bibr" rid="ref10">10</xref>
        ).
      </p>
      <p>The above analysis results allow us to determine model complexity and, on its
basis, N CS subset constructing.</p>
      <p>
        When building a CS, it is necessary, depending on the allowed values.
Raq1 (l) and Raq2 (l) , which are determined by the boundaries of «dense packing»,
consider v ≥k systems such as (
        <xref ref-type="bibr" rid="ref1 ref2">1 – 2</xref>
        ).
where k2 determined by Rb1, j (l ) and Rbq2p, j (l ) .
      </p>
      <p>2.</p>
      <p>
        When building two CS you need to consider v2 ≥k2 systems like (
        <xref ref-type="bibr" rid="ref3 ref4 ref5 ref6 ref7">3 – 7</xref>
        ),
qp
3. When building N CS you need to consider vN ≥ kN systems like (
        <xref ref-type="bibr" rid="ref3 ref4 ref5 ref6 ref7">3-7</xref>
        ), where
kN determined by Raq1 (l) , Raq2 (l) and Rbq1p,j (l ) , Rbq2p, j (l )  valid values.
      </p>
      <p>
        Thus, on the basis of taking into account the boundaries of CS subset [1,6]
physical packing, there are possibilities for constructing subsets of CS in accordance
with (
        <xref ref-type="bibr" rid="ref1 ref2">1 -2</xref>
        ) and (
        <xref ref-type="bibr" rid="ref3 ref4 ref5 ref6 ref7">3 -7</xref>
        ). Similarly (
        <xref ref-type="bibr" rid="ref1 ref2">1 -2</xref>
        ) and (
        <xref ref-type="bibr" rid="ref3 ref4 ref5 ref6 ref7">3- 7</xref>
        ) the model of the CS subset
(dictionary) is specified through aperiodic autocorrelation functions (ACAF). In this
case, simplifications are possible. So, the system (
        <xref ref-type="bibr" rid="ref1 ref2">1 -2</xref>
        ) by analogy can be represented
as the NPI system based on aperiodic correlation functions, i.e.
      </p>
      <p>
        raq1 (l)  Li1mWiq Wiq1 *  raq2 (l) , l  1, L, m  1, L, (
        <xref ref-type="bibr" rid="ref13">13</xref>
        )
rq (l)
where r q (l) and a2 – given but admissible implementations in terms of «dense
a1
packing». Systems (
        <xref ref-type="bibr" rid="ref1 ref2">1 - 2</xref>
        ) and (
        <xref ref-type="bibr" rid="ref3 ref4 ref5 ref6 ref7">3- 7</xref>
        ) can also be represented through aperiodic
crosscorrelation functions (CCAF) as a system NPI
rqp(l) 
b1,1
1 Lm q  *
      </p>
      <p> Wi Wiq1  rqp (l);</p>
      <p>L  m i0 b1,2
l  1, L, m  1, L,
rqp (l) 
b2,1</p>
      <p>L 1 m Li0mWip Wiq1 *  rb2,2</p>
      <p>pq (l);
l  1, L, m  1, L,
(14)
(15)
where rb1,1qp , rrb1,1,qp rb2,1,qp rb2,2qp - permissible in terms of «dense packing»,
ACAF and CCAF.
4</p>
      <p>Solution for CS subset constructing (synthesis) problem
The authors first obtained complex non-linear cryptographic signal systems synthesis
method. The construction (synthesis) of CS sets is based on the application of key
data, as well as random or pseudo-random processes. The method includes the
following steps. [6].</p>
      <p>1. Discrete sequences formation using key data and a source of random
(pseudo-random) processes.</p>
      <p>2. Potential CS statistical properties evaluation [7].</p>
      <p>
        3. Build the required number of potential CS Wq using the system (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) and key
data.
      </p>
      <p>
        4. Finding pairs or subsets CS Wq and Wp, that meet the requirements (
        <xref ref-type="bibr" rid="ref3 ref4 ref5 ref6 ref7">3 – 7</xref>
        ).
5. Obtaining a cross-correlation functions state matrix of all possible pairs of
potential CS, selected by the results of the previous step, and have all the necessary
properties.
      </p>
      <p>
        6. Processing the matrix, consisting in the fact that the formation of the required
number of subsets or pairs CS according to (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) and (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) and selection into a subset of
sequences satisfying the boundaries «dense packing» (maximum achievable values)
for the corresponding correlation functions.
      </p>
      <p>In order to ensure cryptographic security and structural secrecy (complexity) of
cryptographic signals, the choice of a symmetric block encryption algorithm with a
counter is justified as a source of pseudo-random sequences of characters (1st stage of
the method): National cryptographic standard of the block symmetric transformation
DSTU 7624:2014, defining the cipher «Kalina» and its modes of operation to ensure
the confidentiality and integrity of information [8]. Alternatively, such a source may
be offered a source based on the AES algorithm (international standard ISO/IEC
18033). Preference is given to choosing DSTU 7624:2014, taking into account the
following factors. Block symmetric ciphers are one of the most common
cryptographic primitives. In addition to ensuring the confidentiality (encryption) of
the main volumes of information transmitted over the network or stored locally, they
are used as a constructive element of other primitives (hashing functions, message
authentication codes, pseudo-random sequence generators, etc.). The significance of
this cryptographic transformation is underlined by a number of international contests,
such as AES, NESSIE, CRYPTRACK, which were focused on the development of
block cipher (as the main goal or as part of a set of promising solutions).</p>
      <p>The national standard supports the block size and encryption key length of 128,
256, and 512 bits (the key length is equal to the block size or twice its size), providing
a normal, high, and extremely high level of resilience (now it is the only block
encryption standard in the world that supports 512 bit symmetric keys). Different
standard versions provide flexibility in the choice of parameters for developers of
cryptographic protection systems, which makes it possible to obtain both the highest
level of performance and the greatest margin of transformation durability. High-level
design uses well researched Square-like SPN-structure, used in algorithms
AES/Rijndael, Whirlpool, «Stribog» and many others. The cycle transformation is
built on the basis of lookup tables (S-blocks) and multiplication by an MDR-matrix
over a finite field, providing the necessary cryptographic properties. The use of such
design allows us to provide provable durability with respect to differential, linear and
other types of cryptographic analysis, while simultaneously providing an efficient
implementation for a wide range of software and hardware-software platforms. When
choosing the size of the MDR-matrix, the size of the L1 cache of modern and
promising processors was taken into account, which made it possible to optimize the
speed of the software implementation of the cipher. Ukraine standard provides the
greatest non-linearity of Boolean functions, which gives an additional margin of
stability with respect to linear cryptanalysis. In addition, in our opinion, the standard
of the block symmetric transformation DSTU 7624:2014 refers to post-quantum
algorithms, i.e. - it will provide (at the choice of the corresponding parameters)
cryptographic resistance against attacks with the use of quantum computers.</p>
      <p>Finding discrete sequences with the necessary correlation functions characteristics
is reduced, in fact, to the enumeration of all possible variants of the sequences
belonging to a certain set and the selection of those sequences that satisfy the known
estimates. Moreover, the computational complexity of such methods turns out to be
quite significant. It is known that there is a large group of improved brute force
methods, united by the common name «branch and bound method» [9]. The main idea
of such methods is to use the finiteness of the set of solutions and to replace their
complete search with a reduced (directed) search. Thus, the essence of improved brute
force methods is to find optimal solutions for various optimization problems, in
particular, discrete and combinatorial optimization. For method implementation
procedure for finding estimates (boundaries) being used. The procedure for finding
estimates is to establish the boundaries for solving the problem of finding valid
values. If the estimate of the subset (parameter) is greater than the boundary of the
values of the function of the subset, then the value is excluded from further
consideration. The general principle implementation described above has certain
difficulties determined by the specifics of the optimization problem being solved. As
applied to the problem of synthesizing systems of nonlinear discrete cryptographic
signals formulated above, this optimization method is aimed at implementing the
procedure «branching», consisting in splitting the set of permissible values of a
variable x (scan steps) on subregions (subsets) of smaller sizes. The resulting
subregions form a tree called the search tree or the tree of branches and borders. The
nodes of this tree are constructed subregions (subsets of the set of values of the
variable x ). In the course of the research, the authors obtained an improved method
for the synthesis of nonlinear cryptographic sequences based on the use of an
abbreviated (directed) search based on the application of the method «branches and
borders», by excluding from further consideration subregions (implementations of
discrete sequences that have side lobes of the correlation function that exceed the
boundary established by the researcher), as well as using the properties and mutual
relation of ACAF and ACPF, as well as «big» and «small» steps. Simulation
modeling of the above sequence synthesis method was carried out and the
performance (speed) of which was estimated. As the source of nonlinear
cryptographic signals, the data encryption standard of Ukraine «Kalina» was used. In
the modeling process, using the above method, sequences were selected with different
symbol repetition periods (from 256 to 1024), whose autocorrelation function meets
«dense packing» boundary for specified periods. Analysis of the research results
showed that this method provides a performance gain in nonlinear discrete
cryptographic sequence systems synthesis with given correlation properties from 40
to 60 percent with respect to the method of synthesizing a signal system based on the
enumeration of all possible sequence variants. When implementing this method, there
may be gaps (losses) in finding the best signals in terms of signal correlation
properties. But, as studies have shown, the percentage of such losses is insignificant,
and for these periods it is no more than 8 percent.</p>
      <p>We will evaluate the ensemble properties of this signal system. It should be noted
that nonlinear discrete cryptographic signals, in contrast to the known classes of
signals used in various ICS applications, can be synthesized for any discrete signal
period values. The synthesis of this signal class is based on the limitations associated
with the boundary values of the functions of auto - and cross-correlation signals in
periodic and aperiodic modes of information transfer. The volume of nonlinear
cryptographic signals system (coding power) is determined, firstly, by the
requirements resulting from the use of this signal class (detection and measurement of
signal parameters, the data transfer mode of users, etc.), and secondly, by the
requirements imposed on from the point of view of such indicators of the
effectiveness of the functioning of ICS as the noise immunity of signal reception,
information secrecy of the system. The user (owner) of the system, on the basis of
these restrictions, must make a compromise decision on the choice of an ensemble of
non-linear cryptographic signals with the necessary properties.</p>
      <p>For most ICS applications, large signal sets with good cross-correlation properties
are of interest. That is why the problem of the signal system synthesis was considered
as a complex problem, including signal synthesis with the necessary (for certain
conditions) ensemble, correlation, and structural properties.</p>
      <p>Table 1 shows the data characterizing the ensemble properties of CS in
comparison with M-sequences and sequences with 3-level CCPF.</p>
      <p>Analysis of the data presented in Table 1 shows that CS have significantly better
ensemble properties compared to M - sequences and sequences with 3-level CCPF.</p>
      <p>Table 2 shows the data characterizing CS correlation properties for various
periods. In particular, the following are given: the dimension (period) of the
cryptographic symbol sequence studied; the boundary values of the side peaks of the
autocorrelation functions and the signals number satisfying a given boundary in the
CS class for various correlation functions; the smallest side peaks of various
correlation functions and their number; signal system volume (including the number
of CS pairs satisfying boundary values for the corresponding sequence period), etc.</p>
      <p>Analysis of the data in the table shows the following. So for the sequence period N
= 63, the number of cryptographic discrete sequences pairs that satisfy the specified
boundary value of the maximum side lobes of the CCPF - 17 is 12 214 869. For linear
sequences class representative - sequences with a three-level cross-correlation
function (Gold sets, which is optimal from the point of view of the cross-correlation
functions of signals [1]), the number of pairs of signals satisfying a given boundary is
- 975. The excess of CS over an ensemble composed of M-sequences is more than
107. For the sequence period N = 1023, the number of cryptographic discrete
sequences pairs that satisfy the set boundary value for the cross-correlation functions
side lobes (CCF) – 100, is 5 293 538, whereas for linear sequences class
representative M-sequences, the pairs number satisfying a given boundary is - 435,
i.e. signal system excess is more than 105.</p>
      <p>With a slight decrease in the requirements for the limiting value of the maximum
lateral peak of the CCF (in fact, reducing the noise immunity of reception), in
accordance with which the selection of signals is carried out, the information security
performance of the ICS can be significantly improved. So, for the period of the
sequence N = 127, increasing the border value by 1.2 dB will allow increasing the
ensemble volume with М=11610 (with limit value Rsmax=17), up to 9 006 648 signals
(with limit value Rsmax=27), i.e. more than 700 times.</p>
      <p>Thus, by varying the boundary values of the side-lobe level of the corresponding
correlation function (taking into account the requirements for a telecommunications
system signal reception noise immunity and systems information security point of
view), the tasks of achieving the necessary noise immunity values of signal reception
and telecommunications signals information secrecy.</p>
      <p>The ICS immunity, and one of its components - the structural secrecy of the
system, is largely determined by the structural or statistical properties of the signals
data carriers in the system. Statistical properties studies are carried out in the
methodology of statistical tests framework based on statistical tests. In our opinion,
the most acceptable (for practical use) testing methods are: FIPS PUB 140-1, AIS 20
и AIS 31, NIST 800-90b, NIST 800-22. In the process of research using the
methodology NIST SP 800-22 [10] the implementation of a cryptographic sequence
of characters has been tested.</p>
      <p>The simulation results showed that nonlinear CS statistical properties (in terms of
estimated probabilities values) are within the acceptable values. And this, in turn,
means that the CSs satisfy the requirements for pseudo-random sequences:
unpredictability of following characters, irreversibility, chance, equiprobability,
independence, unpredictability, indistinguishability, etc. Essentially, CSs are
indistinguishable from random sequences. Thus, using them as a physical data carrier
will increase the structural and information secrecy (cryptographic resistance) of ICS.
5 Derived signal systems synthesis based on cryptographic
discrete symbol sequences
Among the systems of phase-shifted signals, many are based on Walsh systems. [1-2].
It is known that the auto- and cross-correlation functions of the Walsh sequences have
large side peaks. To improve signals correlation properties, derived signal systems
(DSS) are formed by multiplying Walsh sequences (source sequences) by a signal that
has certain properties (producing a signal), in particular, have small side peaks of the
autocorrelation function.</p>
      <p>The authors formulated a hypothesis about the possibility of using nonlinear
cryptographic sequences as generating ones, the theoretical foundations of which are
given in [11].</p>
      <p>The method of synthesizing derived signal systems based on the use of CS
includes the following steps.</p>
      <p>1. The selection of M cryptographic sequences of a fixed period N, with the
minimum values of the maximum side lobes (Rmax.) ACPF.</p>
      <p>2. A set of Walsh codes (matrix N∙N) is formed, in which each row corresponds to
a separate code.</p>
      <p>3. Perform the multiplication of sequences (each of the lines of the Walsh code of
the original sequences) on the cryptographic signal, forming N derived orthogonal
signals.</p>
      <p>4. Carry out a study of the correlation properties of the obtained derived
orthogonal signals (in particular, ACPF, ACAF). To study the functions of
crosscorrelation, they form a matrix of dimension N∙N. The number of such matrices: L∙N.</p>
      <p>Table 3 shows cryptographic sequences (M = 14), selected from a set of
sequences, by the criterion of the minimum values of the maximum side lobes ACPF
(Rmax &lt; 10).</p>
      <p>The results of the CCPF DSS study based on cryptographic sequences show that
the number of pairs of signals for a period of sequences is 64 characters, for which the
values Rmax do not exceed 17 (this is the so-called «dense packing» border, achieved
in the class of the best, from the point of view of CCF, sequences with a three-level
CCPF), 604 pairs (about 30% of the total number of possible combinations of pairs of
signals). The number of signals pairs for which values Rmax do not exceed 20 – 1577,
which is 77% of the total number of signal pairs. With limit Rmax &lt; 25 the maximum
number of selected signal pairs is 1984 (96,8%). Such values Rmax have a place for
sequences that are most prevalent in modern telecommunications systems
Msequence.</p>
      <p>Table 4 shows the results of studies of the correlation functions statistical
characteristics of various signal classes, including DSS, when used as generating
cryptographic signals. As correlation function statistical characteristics were used:
largest lateral emission values R макс ; expected value of the emission module
N</p>
      <p>D1/R2
value of the standard deviation of emissions N and emission module - N .
Calculations were carried out for different values of sequence periods (from 30 to
2052).</p>
      <p>Analysis of the data given in table. 4, indicates that the values of the maximum
lateral emissions of CS, as well as the statistical characteristics of this class of signals
are not inferior to the corresponding characteristics of signals based on the use of
Msequences. As follows from the data presented in the table, the statistical
characteristics of the DSS are close to the corresponding characteristics for linear and
nonlinear signal classes. The values of the maximum lateral peaks of the DSS
crosscorrelation functions are smaller than those of the linear M-sequences widely used in
modern ICS.</p>
      <p>Due to the fact that CSs have ensemble properties that are improved compared to
other classes of signals, ICS protection indicators against imposing (entering)
spurious messages can be improved. At the same time, it should be noted that the use
of CS ensures the noise immunity of receiving signals not lower than when applying
the above signals based on the linear formation laws.</p>
      <p>Perform an assessment of ICS security against the imposition of false messages
when used as a manipulating (extending the range) CS. At the same time, we will
assume that the system implements a dynamic mode of operation, which implies,
among other things, a change in the correspondence of m message bits - 2m complex
signals. Change of compliance is carried out at set time intervals and using a control
sequence that meets the requirements of randomness. To provide the necessary noise
immunity of signal reception, we will use CS systems that have good correlation
properties [1-2,4-5].</p>
      <p>The probability of imposing a false message is determined by the ability of the
reaction station to determine the law of conformity: m bits of the message - 2m
complex signals, or, in other words, determine the structure (law of formation) of the
control sequence establishing the specified correspondence, and is determined from
the ratio:</p>
      <p>Pimp./message = (2-k)n, (16)
where: 2-k- the source control sequence possible states number; n – message length
expressed in bits.</p>
      <p>Note that the number of possible states of the source control sequence (2-k) is
determined by an ensemble of discrete sequences, by which the phase of the
highfrequency carrier is manipulated to form a phase-shift keyed broadband discrete
signal. Table 5 shows the values. Pimp./message for various systems of discrete signals
obtained on the basis of M - sequences, sequences with a three-level periodic
crosscorrelation function (CCPFT) and non-linear cryptographic sequences (NLCS). The
message dimension is set to n = 32. As the sequence period N were selected: 31, 63,
127, 1023. In the calculations were used data on the ensemble NLCS, are given in
table 2.</p>
      <p>It must be emphasized that in the calculations Pimp./message (for use in the system
NLCS), sequences were selected whose correlation characteristics are close to optimal
boundary values («dense packing») from CCPF point of view. Such boundary values
are achieved in a class of sequences with a three-level cross-correlation function and
constitute Rбок. max ≤ 1,5√N.</p>
      <p>As can be seen from the data table, the values Pimp./message for NLCS significantly
smaller than in the case of using the most widely used in practice linear classes of
signals (M-sequences and sequences with three-level CCPF). In the case when the
system does not have strict requirements for the Pimp./message (imitation resistance), but
it is necessary to provide increased requirements for signal reception noise immunity
and to fulfill high requirements in terms of the structural secrecy of the complex
signals used, the values of the maximum lateral peaks of the CCPF can be selected as
the limiting values «dense packing». In this case, the volume of the system of signals
satisfying this boundary will be less, and accordingly Pimp./message will be higher, but at
the same time, the noise immunity of receiving signals will be improved. Thus, when
using systems of nonlinear signals, it becomes possible to vary (taking into account
the requirements for ICS) indicators of the noise immunity of signal reception — the
system is protected from unauthorized data modification (imitation resistance).</p>
      <p>The above estimates suggest that in ICS, in which as a method of information
exchange, the dynamic mode of changing the correspondence is implemented, m bits
of the message - 2m complex signals and apply nonlinear cryptographic signals,
provide high levels of system security from unauthorized data modification and the
imposition of false information.</p>
      <p>In essence, the presented system of providing imitability is [12-13] a
cryptographic system, because it contains all the attributes of such a system: an
algorithm for protecting against imposing a false message and hiding the semantic
content of a message, based on the implementation of the dynamic mode of ICS
functioning and using cryptographic discrete signals as information carriers;
algorithm for deciding the truth of the information received; a key system that
implements the functions of generating a control sequence for a change of
correspondence: the message bit is a complex signal, as well as the generation of
cryptographic discrete signals.
6</p>
    </sec>
    <sec id="sec-3">
      <title>Conclusions</title>
      <p>Information exchange methods used in the information and communication system
based on a fixed correspondence: message bit (m bit) signal (2m signals) in the
information channel and use (for a long time) in the synchronization channel of the
same broadband signal (and the signals used are constructed using linear laws), do not
allow to achieve the necessary values of noise immunity and information security of
operation ICS. A comprehensive solution to the problem of ensuring noise immunity
and information security of ICS operation can be achieved, including, based on the
implementation of a dynamic information transmission mode, in which compliance:
message bit - the signal changes over time according to the law, which can be
predicted with a probability not exceeding the allowable in the system the values and
applications of signals with the necessary correlation, ensemble, structural properties.
At the same time, signal systems should be based on nonlinear rules for constructing.
For the first time, a method for synthesizing nonlinear cryptographic discrete complex
signals was obtained, which uses key data as well as random (pseudo-random)
processes and allows you to create signals with the necessary ensemble, structural and
correlation properties, which makes it possible to improve ICS performance indicators
impacts. Improvement of these efficiency indicators is achieved, in particular, due to
the possibility of forming, using the obtained CS synthesis method, large discrete
sequences ensembles of almost any period with the necessary side lobes of the auto,
cross and butt correlation functions (for various ICS applications) in periodic and
aperiodic modes of operation, as well as the statistical characteristics of the
correlation functions (CF), which are not inferior to those of the best, from the CF
point of view, linear classes of signals.</p>
      <p>The volume of the system of nonlinear CS (coding power) is determined, firstly,
by the requirements resulting from the use of this class of signals (detection and
measurement of signal parameters, the mode of data transmission of users, etc.) and,
secondly, by the requirements imposed on the system from the point of view ICS
performance indicators such as noise immunity of signal reception, information
security of the system. The user (owner) of the system, on the basis of these
limitations, needs to make compromise decisions on the choice of a particular
ensemble of nonlinear CS with the necessary properties. In general, the problem of
synthesizing nonlinear discrete complex CSs is formulated and solved, the ensemble
correlation properties of which can be selected depending on the requirements for
noise immunity and information security of ICS. A method for optimizing the
synthesis of complex nonlinear CS based on the use of abbreviated (directional)
enumeration based on the application of the «branches and borders» method is
proposed.</p>
      <p>Studies of the DSS properties formed on the basis of nonlinear cryptographic
sequences show that more than 30% of the total number of combinations of such DSS
pairs have side peaks of the correlation function equal to potentially achievable
values, for the remaining pairs the maximum side peaks of CF are less than in widely
used linear M sequences. In addition, the resulting DSS have improved structural and
ensemble properties compared with orthogonal signals.</p>
      <p>Currently, mathematical model and software have been developed that implements
methods for synthesizing and studying the properties of non-linear cryptographic
signal systems, which is almost ready for possible use as part of prototypes and
elements of modern digital communication tools, and allows: to generate non-linear
cryptographic signals for almost any period; determine the values of the minimum
and maximum lateral emissions of various correlation functions; compare the
obtained values with known, potentially achievable boundaries for the corresponding
correlation functions; assign to the implementations of the synthesized sequences, as
well as the parameters used for the synthesis of signals, unique identifiers that are
necessary for optimal signal processing; calculate the statistical characteristics of the
various correlation functions of the synthesized signals; carry out studies of the
ensemble characteristics of the synthesized signals.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Sarwate</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pursley</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Correction to "Crosscorrelation properties of pseudorandom and related sequences</article-title>
          .
          <source>" Proceedings of the IEEE</source>
          .
          <volume>68</volume>
          ,
          <fpage>1554</fpage>
          -
          <lpage>1554</lpage>
          (
          <year>1980</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Ipatov</surname>
          </string-name>
          , V.:
          <article-title>Spread Spectrum and CDMA</article-title>
          . John Wiley &amp; Sons, Ltd.,
          <string-name>
            <surname>Hoboken</surname>
          </string-name>
          (
          <year>2006</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Joye</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tunstall</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Fault Analysis in Cryptography</article-title>
          . Springer-Verlag, Heidelberg (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ling</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Feng</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lei</surname>
          </string-name>
          , R.:
          <article-title>Computer cryptography through performing chaotic modulation on intrinsic mode functions with non-dyadic number of encrypted signals</article-title>
          .
          <source>IET Signal Processing</source>
          .
          <volume>13</volume>
          ,
          <fpage>7</fpage>
          -
          <lpage>13</lpage>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kavun</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Panchenko</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Prokopovych-Tkachenko</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kurinniy</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shoiko</surname>
            ,
            <given-names>V</given-names>
          </string-name>
          :
          <article-title>Periodic Properties of Cryptographically Strong Pseudorandom Sequences</article-title>
          . In: 2018 International Scientific-Practical Conference Problems of Infocommunications. Science and
          <string-name>
            <surname>Technology (PIC S&amp;T)</surname>
          </string-name>
          , Kharkiv, Ukraine,
          <year>2018</year>
          , pp.
          <fpage>129</fpage>
          -
          <lpage>134</lpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Gorbenko</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          , Zamula, А.,
          <string-name>
            <surname>Semenko</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Morozov</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Method for synthesis of perfprmed signals systems based on cryptographic discrete sequences of symbols</article-title>
          .
          <source>Telecommunications and Radio Engineering</source>
          .
          <volume>76</volume>
          ,
          <fpage>1523</fpage>
          -
          <lpage>1533</lpage>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Goubin</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Cryptographic hardware and embedded systems</article-title>
          . Springer, Berlin (
          <year>2006</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8. DSTU 7624:
          <year>2014</year>
          .
          <article-title>National Standard of Ukraine. Information technologies</article-title>
          .
          <source>Cryptographic Data Security. Symmetric block transformation algorithm</source>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Land</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Doig</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>An Automatic Method of Solving Discrete Programming Problems</article-title>
          . Econometrica.
          <volume>28</volume>
          ,
          <issue>497</issue>
          (
          <year>1960</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>NIST</surname>
            800-22
            <given-names>A Statistical</given-names>
          </string-name>
          <string-name>
            <surname>Test</surname>
          </string-name>
          <article-title>Suite for Random and Pseudorandom Number Generators for Cryptographic Applications (</article-title>
          <year>2000</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Gorbenko</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          , Zamula, А.,
          <string-name>
            <surname>Semenko</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Morozov</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Method for complex improvement of characteristics of orthogonal ensembles based on multiplicative combining of signals of different classes</article-title>
          .
          <source>Telecommunications and Radio Engineering</source>
          .
          <volume>76</volume>
          ,
          <fpage>1581</fpage>
          -
          <lpage>1594</lpage>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Gorbenko</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          , Zamula, А.,
          <string-name>
            <surname>Morozov</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Information security and noise immunity of telecommunication systems under conditions of various internal and external impacts</article-title>
          .
          <source>Telecommunications and Radio Engineering</source>
          .
          <volume>76</volume>
          ,
          <fpage>1705</fpage>
          -
          <lpage>1717</lpage>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Hameed</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>High data rate of a novel modulation scheme based on orthogonal chaotic signals</article-title>
          .
          <source>Telecommunications and Radio Engineering</source>
          .
          <volume>75</volume>
          ,
          <fpage>1657</fpage>
          -
          <lpage>1663</lpage>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>