Construction Method for Infinite Families of Bent Sequences

Authors

  • A.V. Sokolov Department of Radioelectronic and Telecommunication Systems, Odessa National Polytechnic University, Ukraine.
  • I.V. Tsevukh Department of Radioelectronic and Telecommunication Systems, Odessa National Polytechnic University, Ukraine.

Keywords:

bent-sequence, Maiorana-McFarland construction, recursive method,

Abstract

Bent-sequences is one of the most important classes of Boolean functions, which are widely used in modern cryptographic algorithms, and telecommunication systems that are based on CDMA and OFDM standards. The problem of synthesis of bent-sequences of large lengths is actual and widely discussed. However, in view of the high complexity and unpredictability of the class of bent-sequences, the creation of methods for their synthesis faces significant difficulties. In this paper, a recursive method for constructing infinite families of bent-sequences, based on easily synthesized bent-sequences of small length, has been developed. As the basis of this method, the operations of interleaving of elements and strings, which are widely used in the theory of synthesis of perfect binary arrays, are applied. Effective reproduction rules for bent-sequences in the time domain based on the operation of rearrangement of segments, a rotor, and dimensional changes are proposed. The method developed allows rapid acquisition of a lot of bentsequences of any predefined length. Moreover, the obtained bent-sequences belong to different classes according to Agievich classification, which is important from the cryptographic point of view.

Author Biography

A.V. Sokolov, Department of Radioelectronic and Telecommunication Systems, Odessa National Polytechnic University, Ukraine.

Department of Radioelectronics and telecommunications, senior lecturer

References

O.S. Rothaus “On “bent” functions”, J. Comb. Theory Ser. A, USA, Academic Press Inc, 1976, No. 20(3), pp. 300–305.

K.G. Peterson “Sequences For OFDM and Multi-code CDMA: two problems in algebraic Coding Theory”, Sequences and their applications. Seta 2001. Second Int. Conference, Bergen, Norway, May 13–17, 2001, Proc. Berlin: Springer, 2002. pp. 46–71.

N.N. Tokareva “Bent functions: results and applications. Review of papers [Original text in Russian]”, Applied. discrete. mathematics, Tomsk, 2009, Ser. No. 1 (3), pp. 15–37.

M.I. Mazurkov, A.V. Sokolov “The regular rules of constructing the complete class of bent-sequences of length 16 [Original text in Russian]”, Odessa, Proceedings of ONPU, 2013, pp. 227–230.

A.V. Sokolov “Synthesis method of a complete class of bent-functions of six variables [Original text in Russian]”, Problems of physics, mathematics and technics, No. 4 (29), pp. 94–102.

M.I. Mazurkov “Broadband radio communication systems [Original text in Russian]”, Odessa: Science and Technology, 2010, p. 340.

V.D. Dvornikov. “Method for the formation of bent-sequences [Original text in Russian]”, Reports of BSUIR, Minsk, 2003, pp. 106– 109.

Wild, P. Infinite families of perfect binary arrays, Electronics Letters, United Kingdom, Vol. 24, Issue 14, 1988, P. 845—847.

Agievich S.V. On the representation of bent functions by bent rectangles. — Probabilistic Methods in Discrete Mathematics: Proceedings of the Fifth International Petrozavodsk Conference (Petrozavodsk, June 1–6, 2000). Utrecht, Boston: VSP, 2002, P. 121— 135.

M. I. Mazurkov, A.V. Sokolov, I.V. Tsevukh, Synthesis Method for Families of Constant Amplitude Correcting Codes Based on an Arbitrary Bent-Square. Journal of Telecommunication, Electronic and Computer Engineering, Vol. 9, No. 2, 2017, pp. 99—103.

Downloads

Published

2018-05-30

How to Cite

Sokolov, A., & Tsevukh, I. (2018). Construction Method for Infinite Families of Bent Sequences. Journal of Telecommunication, Electronic and Computer Engineering (JTEC), 10(2), 51–54. Retrieved from https://jtec.utem.edu.my/jtec/article/view/3274

Issue

Vol. 10 No. 2: April - June 2018

Section

Articles

License

TRANSFER OF COPYRIGHT AGREEMENT

The manuscript is herewith submitted for publication in the Journal of Telecommunication, Electronic and Computer Engineering (JTEC). It has not been published before, and it is not under consideration for publication in any other journals. It contains no material that is scandalous, obscene, libelous or otherwise contrary to law. When the manuscript is accepted for publication, I, as the author, hereby agree to transfer to JTEC, all rights including those pertaining to electronic forms and transmissions, under existing copyright laws, except for the following, which the author(s) specifically retain(s):

  1. All proprietary right other than copyright, such as patent rights
  2. The right to make further copies of all or part of the published article for my use in classroom teaching
  3. The right to reuse all or part of this manuscript in a compilation of my own works or in a textbook of which I am the author; and
  4. The right to make copies of the published work for internal distribution within the institution that employs me

I agree that copies made under these circumstances will continue to carry the copyright notice that appears in the original published work. I agree to inform my co-authors, if any, of the above terms. I certify that I have obtained written permission for the use of text, tables, and/or illustrations from any copyrighted source(s), and I agree to supply such written permission(s) to JTEC upon request.