A New Class of Balanced Near-Perfect Nonlinear Mappings and Its Application to Sequence Design

A mapping from ZN to ZM can be directly applied for the design of a sequence of period N with alphabet size M, where ZN denotes the ring of integers modulo N. The nonlinearity of such a mapping is closely related to the autocorrelation of the corresponding sequence. When M is a divisor of N, the sequence corresponding to a perfect nonlinear mapping has perfect autocorrelation, but it is not balanced. In this paper, we study balanced near-perfect nonlinear (NPN) mappings applicable for the design of sequence sets with low correlation. We first construct a new class of balanced NPN mappings from Z(p2-p) to Zp for an odd prime p. We then present a general method to construct a frequency-hopping sequence (FHS) set from a nonlinear mapping. By applying it to the new class, we obtain a new optimal FHS set of period p2-p with respect to the Peng-Fan bound, whose FHSs are balanced and optimal with respect to the Lempel-Greenberger bound. Moreover, we construct a low-correlation sequence set with size p, period p2-p, and maximum correlation magnitude p from the new class of balanced NPN mappings, which is asymptotically optimal with respect to the Welch bound.

[1]  T. Kasami.  WEIGHT DISTRIBUTION FORMULA FOR SOME CLASS OF CYCLIC CODES , 1966 .

[2]  Xiaohu Tang,et al.  A Class of Optimal Frequency Hopping Sequences with New Parameters , 2012, IEEE Transactions on Information Theory.

[3]  Jong-Seon No,et al.  New Families of $M$-Ary Sequences With Low Correlation Constructed From Sidel'nikov Sequences , 2008, IEEE Transactions on Information Theory.

[4]  Tor Helleseth,et al.  Some results about the cross-correlation function between two maximal linear sequences , 1976, Discret. Math..

[5]  Cunsheng Ding,et al.  On Almost Perfect Nonlinear Permutations , 1994, EUROCRYPT.

[6]  Daiyuan Peng,et al.  Lower Bounds on the Hamming Auto- and Cross Correlations of Frequency-Hopping Sequences , 2004, IEEE Trans. Inf. Theory.

[7]  Cunsheng Ding,et al.  Sets of Optimal Frequency-Hopping Sequences , 2008, IEEE Transactions on Information Theory.

[8]  B. M. Fulk.  MATH , 1992 .

[9]  Pingzhi Fan,et al.  SEQUENCE DESIGN FOR COMMUNICATIONS APPLICATIONS , 1996 .

[10]  Jin-Ho Chung,et al.  $k$ -Fold Cyclotomy and Its Application to Frequency-Hopping Sequences , 2011, IEEE Transactions on Information Theory.

[11]  Eli Biham,et al.  Differential cryptanalysis of DES-like cryptosystems , 1990, Journal of Cryptology.

[12]  T. Kasami.  WEIGHT DISTRIBUTION OF BOSE-CHAUDHURI-HOCQUENGHEM CODES. , 1966 .

[13]  Guang Gong,et al.  Multiplicative Characters, the Weil Bound, and Polyphase Sequence Families With Low Correlation , 2010, IEEE Transactions on Information Theory.

[14]  Ying Miao,et al.  Optimal frequency hopping sequences: a combinatorial approach , 2004, IEEE Transactions on Information Theory.

[15]  Yoji Niho.  Multi-Valued Cross-Correlation Functions between Two Maximal Linear Recursive Sequences , 1972 .

[16]  Daiyuan Peng,et al.  New Constructions for Optimal Sets of Frequency-Hopping Sequences , 2011, IEEE Transactions on Information Theory.

[17]  Guang Gong,et al.  New designs for signal sets with low cross correlation, balance property, and largelinear span: GF(p) case , 2002, IEEE Trans. Inf. Theory.

[18]  Charles J. Colbourn,et al.  Optimal frequency-hopping sequences via cyclotomy , 2005, IEEE Transactions on Information Theory.

[19]  Oscar Moreno,et al.  Prime-phase sequences with periodic correlation properties better than binary sequences , 1991, IEEE Trans. Inf. Theory.

[20]  Tor Helleseth,et al.  New Families of Almost Perfect Nonlinear Power Mappings , 1999, IEEE Trans. Inf. Theory.

[21]  Jin-Ho Chung,et al.  Optimal Frequency-Hopping Sequences With New Parameters , 2010, IEEE Transactions on Information Theory.

[22]  Hu Chuan-Gan,et al.  On The Shift Register Sequences , 2004 .

[23]  Warwick de Launey.  CirculantGH(p2; Zp) exist for all primesp , 1992, Graphs Comb..

[24]  Daiyuan Peng,et al.  New Bound on Frequency Hopping Sequence Sets and Its Optimal Constructions , 2011, IEEE Transactions on Information Theory.

[25]  Gennian Ge,et al.  Optimal Frequency Hopping Sequences: Auto- and Cross-Correlation Properties , 2009, IEEE Trans. Inf. Theory.

[26]  John J. Komo,et al.  Nonbinary Kasami sequences over GF(p) , 1992, IEEE Trans. Inf. Theory.

[27]  Kyeongcheol Yang,et al.  On the Sidel'nikov Sequences as Frequency-Hopping Sequences , 2009, IEEE Transactions on Information Theory.

[28]  R. C. Heimiller,et al.  Phase shift pulse codes with good periodic correlation properties , 1961, IRE Trans. Inf. Theory.

[29]  P. Vijay Kumar,et al.  Frequency-hopping code sequence designs having large linear span , 1988, IEEE Trans. Inf. Theory.

[30]  Claude Carlet,et al.  Vectorial Boolean Functions for Cryptography , 2006 .

[31]  Hans Dobbertin,et al.  Almost Perfect Nonlinear Power Functions on GF(2n): The Welch Case , 1999, IEEE Trans. Inf. Theory.

[32]  K. Yang,et al.  New M -Ary Sequence Families With Low Correlation and Large Size , 2009, IEEE Trans. Inf. Theory.

[33]  Cunsheng Ding,et al.  Algebraic Constructions of Optimal Frequency-Hopping Sequences , 2007, IEEE Transactions on Information Theory.

[34]  Masakazu Jimbo,et al.  Sets of Frequency Hopping Sequences: Bounds and Optimal Constructions , 2009, IEEE Transactions on Information Theory.

[35]  Bradley W. Brock.  A new construction of circulant GH(p2;Zp) , 1993, Discret. Math..

[36]  Jin-Ho Chung,et al.  New Classes of Optimal Frequency-Hopping Sequences by Interleaving Techniques , 2009, IEEE Transactions on Information Theory.

[37]  Robert Gold,et al.  Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.) , 1968, IEEE Trans. Inf. Theory.

[38]  Lloyd R. Welch,et al.  Lower bounds on the maximum cross correlation of signals (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[39]  Guang Gong,et al.  New Construction of $M$-Ary Sequence Families With Low Correlation From the Structure of Sidelnikov Sequences , 2010, IEEE Transactions on Information Theory.

[40]  Robert L. Frank,et al.  Phase shift pulse codes with good periodic correlation properties (Corresp.) , 1962, IRE Trans. Inf. Theory.

[41]  Alexander Pott,et al.  A new APN function which is not equivalent to a power mapping , 2005, IEEE Transactions on Information Theory.

[42]  Abraham Lempel,et al.  Families of sequences with optimal Hamming-correlation properties , 1974, IEEE Trans. Inf. Theory.

[43]  Mohammad Umar Siddiqi,et al.  Optimal Large Linear Complexity Frequency Hopping Patterns Derived from Polynomial Residue Class Rings , 1998, IEEE Trans. Inf. Theory.

[44]  Jong-Seon No,et al.  A New Family of p -Ary Sequences of Period (pn-1)/2 With Low Correlation , 2011, IEEE Trans. Inf. Theory.

[45]  P. Vijay Kumar,et al.  Generalized Bent Functions and Their Properties , 1985, J. Comb. Theory, Ser. A.

[46]  Cunsheng Ding,et al.  Highly nonlinear mappings , 2004, J. Complex..