Advanced Search

Joint 2-adic complexity is a new important index of the cryptographic security for multisequences. In this paper, we extend the usual Fourier transform to the case of multisequences and derive an upper bound for the joint 2-adic complexity. Furthermore, for the multisequences with -period, we discuss the relation between sequences and their Fourier coefficients. Based on the relation, we determine a lower bound for the number of multisequences with given joint 2-adic complexity.

For k = 1,2,... let $H_k$ denote the harmonic number ${\sum }_{j=1}^{k}1/j$. In this paper we establish some new congruences involving harmonic numbers. For example, we show that for any prime p > 3 we have ${\sum }_{k=1}^{p-1}\left(H_k\right)/\left(k{2}^k\right)\equiv 7/24p{B}_{p-3}\left(modp²\right)$, ${\sum }_{k=1}^{p-1}\left(H_{k,2}\right)/\left(k{2}^k\right)\equiv -3/8B_{p-3}\left(modp\right)$, and ${\sum }_{k=1}^{p-1}\left(H{²}_{k,2n}\right)/\left(k^{2n}\right)\equiv (\left(\genfrac{}{}{0pt}{}{6n+1}{2n-1}\right)+n)/(6n+1)p{B}_{p-1-6n}\left(modp²\right)$ for any positive integer n < (p-1)/6, where B₀,B₁,B₂,... are Bernoulli numbers, and $H_{k,m}:={\sum }_{j=1}^{k}1/\left(j^m\right)$.

Joint 2-adic complexity is a new important index of the cryptographic security for multisequences. In this paper, we extend the usual Fourier transform to the case of multisequences and derive an upper bound for the joint 2-adic complexity. Furthermore, for the multisequences with -period, we discuss the relation between sequences and their Fourier coefficients. Based on the relation, we determine a lower bound for the number of multisequences...

In this paper we studied the classical numerical range of matrices in sp(2n, C). We obtained some result on the relationship between the numerical range of a matrix in and that [...] of its diagonal block, the singular values of its off-diagonal block A2.