Skip to main navigation Skip to search Skip to main content

Binary Sequences Derived from Monomial Permutation Polynomials over GF(2p )

  • Qun Xiong Zheng
  • , Yupeng Jiang*
  • , Dongdai Lin
  • , Wen Feng Qi
  • *Corresponding author for this work
  • Information Engineering University
  • CAS - Institute of Information Engineering

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper, we propose a class of binary sequences induced by monomial permutation polynomials over GF (2p) and study the period property and the shift-equivalence of these binary sequences. In particularly, we give a necessary and sufficient condition for such a sequence to have maximal period. Moreover, we also give a necessary and sufficient condition for two such sequences to be shift equivalent.

Original languageEnglish
Title of host publicationInformation Security and Cryptology - 17th International Conference, Inscrypt 2021, Revised Selected Papers
EditorsYu Yu, Moti Yung
PublisherSpringer Science and Business Media Deutschland GmbH
Pages371-383
Number of pages13
ISBN (Print)9783030883225
DOIs
StatePublished - 2021
Event17th International Conference on Information Security and Cryptology, Inscrypt 2021 - Virtual, Online
Duration: 12 Aug 202114 Aug 2021

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13007 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference17th International Conference on Information Security and Cryptology, Inscrypt 2021
CityVirtual, Online
Period12/08/2114/08/21

Keywords

  • Mersenne prime
  • Periodicity
  • Permutation polynomial
  • Pseudorandom sequence
  • Shift equivalence

Fingerprint

Dive into the research topics of 'Binary Sequences Derived from Monomial Permutation Polynomials over GF(2p )'. Together they form a unique fingerprint.

Cite this