On the 2-Adic Complexity of Periodic Binary Sequences

Abstract

The 2-adic complexity of binary periodic sequences plays an important role in cryptology. In this paper, by means of the usual Fourier transform, we give a simpler form of the upper bound for 2-adic complexity than related result before. For pn-periodic sequences, we discuss the relation between sequences and their Fourier coefficients. Furthermore, based on the relation, we get the lower bound for the number of pn-periodic sequences with given 2-adic complexity.