In this paper, a new family S(r) of 2n binary sequences of period 2n-1 is proposed, where n ≡ 2 mod 4 and gcd(r, 2n/2-1)=1. The presented family takes 4-valued out-of-phase auto- and cross-correlation values -1, 2n/2-1, and 2n/2+1-1, and its correlation distribution is determined. For r=2(n-2)/4-1, each sequence in S(r), except the unique ideal autocorrelation sequence in the family, is proved to have a large linear span n2n/2-2, whilst the linear span of the latter is n2(n-2)/4-1.

In this paper, a new family of binary sequences of period 2n-1 with low correlation is proposed for integer n=em and even m. The new family has family size 2n+1 and maximum nontrivial correlation +1 and +1 for even and odd e respectively. Especially, for n=2m and 3m, we obtain a new family of binary sequences with maximum nontrivial correlation +1, and the obtained family is one of the binary families with best correlation among the known families with family size no less than their period 2n-1 for even n. Moreover, the correlation distribution of the new family is also determined.

Based on cyclic difference sets, sequences with two-valued autocorrelation can be constructed. Using these constructed sequences, two classes of binary constant weight codes are presented. Some codes proposed in this paper are proven to be optimal.

A new subfamily of sequences with optimal correlation properties is constructed for the generalized Kasami set. A lower bound on the linear span is established. It is proved that with suitable choices of parameters, this subfamily has exponentially larger linear spans than either No sequences or TN sequences. A class of sequences with ideal autocorrelation is also proved to have large linear span.

For a prime p with p≡3 (mod 4) and an odd number m, the Bentness of the p-ary binomial function fa,b(x)=Tr1n(axpm-1)+Tr12 is characterized, where n=2m, a ∈ F*pn, and b ∈ F*p2. The necessary and sufficient conditions of fa,b(x) being Bent are established respectively by an exponential sum and two sequences related to a and b. For the special case of p=3, we further characterize the Bentness of the ternary function fa,b(x) by the Hamming weight of a sequence.

In this letter, we propose a fast modular reduction method over Euclidean rings, which is a generalization of Barrett's reduction algorithm over the ring of integers. As an application, we construct new universal hash function families whose operations are modular arithmetic over a Euclidean ring, which can be any of three rings, the ring of integers, the ring of Gauss integers and the ring of Eisenstein integers. The implementation of these families is efficient by using our method.

For an integer q≥2, new sets of q-phase aperiodic complementary sequences (ACSs) are constructed by using known sets of q-phase ACSs and certain matrices. Employing the Kronecker product to two known sets of q-phase ACSs, some sets of q-phase aperiodic complementary sequences with a new length are obtained. For an even integer q, some sets of q-phase ACSs with new parameters are generated, and their equivalent matrix representations are also presented.

This letter presents a framework, including two constructions, for yielding several types of sequences with optimal autocorrelation properties. Only by simply choosing proper coefficients in constructions and optimal known sequences, two constructions transform the chosen sequences into optimally required ones with two or four times periods as long as the original sequences', respectively. These two constructions result in binary and quaternary sequences with optimal autocorrelation values (OAVs), perfect QPSK+ sequences, and multilevel perfect sequences, depending on choices of the known sequences employed. In addition, Construction 2 is a generalization of Construction B in [5] so that the number of distinct sequences from the former is larger than the one from the latter.

In this study, we construct balanced Boolean functions with a high nonlinearity and an optimum algebraic degree for both odd and even dimensions. Our approach is based on modifying functions from the Maiorana-McFarland's superclass, which has been introduced by Carlet. A drawback of Maiorana-McFarland's function is that their restrictions obtained by fixing some variables in their input are affine. Affine functions are cryptographically weak functions, so there is a risk that this property will be exploited in attacks. Due to the contribution of Carlet, our constructions do not have the potential weakness that is shared by the Maiorana-McFarland construction or its modifications.