Boundary for the Linear Complexity of Well Balanced NTU

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

Abstract

A pseudorandom sequence has an inseparable role in various types of security applications. Especially, the linear complexity of a sequence is a measure of the randomness that should be large for secureness of a system. This paper considers the boundary of linear complexity of a geometric sequence called NTU sequence which is generated with a uniformization technique.

Original languageEnglish
Title of host publication2019 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781728132792
DOIs
Publication statusPublished - May 2019
Event6th IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2019 - Yilan, Taiwan, Province of China
Duration: May 20 2019May 22 2019

Publication series

Name2019 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2019

Conference

Conference6th IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2019
CountryTaiwan, Province of China
CityYilan
Period5/20/195/22/19

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering

Cite this