Linear complexity of generalized NTU sequences

Kazuyoshi Tsuchiya, Chiaki Ogawa, Yasuyuki Nogami, Satoshi Uehara

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

Pseudorandom number generators are required to generate pseudorandom numbers which have not only good statistical properties but also unpredictability in cryptography. A geometric sequence is a sequence given by applying a nonlinear feedforward function to an m-sequence. Nogami, Tada and Uehara proposed a geometric sequence whose nonlinear feedforward function is given by the Legendre symbol, and showed the period, periodic autocorrelation and linear complexity of the sequence. Furthermore, Nogami et al. proposed a generalization of the sequence (this sequence is referred to as the generalized NTU sequence), and showed the period and periodic autocorrelation. In this paper, we investigate the linear complexity of the generalized NTU sequences. Under some conditions, we can ensure that generalized NTU sequences have large linear complexity from the results on linear complexity of Sidel'nikov sequences.

Original languageEnglish
Title of host publication2017 8th International Workshop on Signal Design and Its Applications in Communications, IWSDA 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages74-78
Number of pages5
ISBN (Electronic)9781509065332
DOIs
Publication statusPublished - Nov 3 2017
Event8th International Workshop on Signal Design and Its Applications in Communications, IWSDA 2017 - Sapporo, Japan
Duration: Sep 24 2017Sep 28 2017

Other

Other8th International Workshop on Signal Design and Its Applications in Communications, IWSDA 2017
CountryJapan
CitySapporo
Period9/24/179/28/17

Keywords

  • generalized NTU sequence
  • geometric sequence
  • linear complexity
  • pseudorandom number generator

ASJC Scopus subject areas

  • Signal Processing
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Linear complexity of generalized NTU sequences'. Together they form a unique fingerprint.

  • Cite this

    Tsuchiya, K., Ogawa, C., Nogami, Y., & Uehara, S. (2017). Linear complexity of generalized NTU sequences. In 2017 8th International Workshop on Signal Design and Its Applications in Communications, IWSDA 2017 (pp. 74-78). [8095739] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/IWSDA.2017.8095739