Linear complexity of generalized NTU sequences

Kazuyoshi Tsuchiya; Chiaki Ogawa; Yasuyuki Nogami; Satoshi Uehara

doi:10.1109/IWSDA.2017.8095739

Linear complexity of generalized NTU sequences

Kazuyoshi Tsuchiya, Chiaki Ogawa, Yasuyuki Nogami, Satoshi Uehara

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

6 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 language	English
Title of host publication	2017 8th International Workshop on Signal Design and Its Applications in Communications, IWSDA 2017
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	74-78
Number of pages	5
ISBN (Electronic)	9781509065332
DOIs	https://doi.org/10.1109/IWSDA.2017.8095739
Publication status	Published - Nov 3 2017
Event	8th International Workshop on Signal Design and Its Applications in Communications, IWSDA 2017 - Sapporo, Japan Duration: Sep 24 2017 → Sep 28 2017

Other

Other	8th International Workshop on Signal Design and Its Applications in Communications, IWSDA 2017
Country	Japan
City	Sapporo
Period	9/24/17 → 9/28/17

Keywords

generalized NTU sequence
geometric sequence
linear complexity
pseudorandom number generator

ASJC Scopus subject areas

Signal Processing
Computer Networks and Communications

Access to Document

10.1109/IWSDA.2017.8095739

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

Cite this

Linear complexity of generalized NTU sequences. / Tsuchiya, Kazuyoshi; Ogawa, Chiaki; Nogami, Yasuyuki; Uehara, Satoshi.

2017 8th International Workshop on Signal Design and Its Applications in Communications, IWSDA 2017. Institute of Electrical and Electronics Engineers Inc., 2017. p. 74-78 8095739.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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., 8095739, Institute of Electrical and Electronics Engineers Inc., pp. 74-78, 8th International Workshop on Signal Design and Its Applications in Communications, IWSDA 2017, Sapporo, Japan, 9/24/17. https://doi.org/10.1109/IWSDA.2017.8095739

@inproceedings{1293d4da3a8b48a4b735d5b29529dd73,

title = "Linear complexity of generalized NTU sequences",

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.",

keywords = "generalized NTU sequence, geometric sequence, linear complexity, pseudorandom number generator",

author = "Kazuyoshi Tsuchiya and Chiaki Ogawa and Yasuyuki Nogami and Satoshi Uehara",

year = "2017",

month = nov,

day = "3",

doi = "10.1109/IWSDA.2017.8095739",

language = "English",

pages = "74--78",

booktitle = "2017 8th International Workshop on Signal Design and Its Applications in Communications, IWSDA 2017",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "8th International Workshop on Signal Design and Its Applications in Communications, IWSDA 2017 ; Conference date: 24-09-2017 Through 28-09-2017",

}

TY - GEN

T1 - Linear complexity of generalized NTU sequences

AU - Tsuchiya, Kazuyoshi

AU - Ogawa, Chiaki

AU - Nogami, Yasuyuki

AU - Uehara, Satoshi

PY - 2017/11/3

Y1 - 2017/11/3

N2 - 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.

AB - 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.

KW - generalized NTU sequence

KW - geometric sequence

KW - linear complexity

KW - pseudorandom number generator

UR - http://www.scopus.com/inward/record.url?scp=85040598670&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85040598670&partnerID=8YFLogxK

U2 - 10.1109/IWSDA.2017.8095739

DO - 10.1109/IWSDA.2017.8095739

M3 - Conference contribution

AN - SCOPUS:85040598670

SP - 74

EP - 78

BT - 2017 8th International Workshop on Signal Design and Its Applications in Communications, IWSDA 2017

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 8th International Workshop on Signal Design and Its Applications in Communications, IWSDA 2017

Y2 - 24 September 2017 through 28 September 2017

ER -