Advanced Search

In a series of papers many Boolean functions with good cryptographic properties were constructed using number-theoretic methods. We construct a large family of Boolean functions by using polynomials over finite fields, and study their cryptographic properties: maximum Fourier coefficient, nonlinearity, average sensitivity, sparsity, collision and avalanche effect.

This work deals with Feigenbaum’s functional equation ⎧ $h\left(g\left(x\right)\right)=g^p\left(h\left(x\right)\right)$, ⎨ ⎩ g(0) = 1, -1 ≤ g(x) ≤ 1, x∈[-1,1] where p ≥ 2 is an integer, $g^p$ is the p-fold iteration of g, and h is a strictly monotone odd continuous function on [-1,1] with h(0) = 0 and |h(x)| < |x| (x ∈ [-1,1], x ≠ 0). Using a constructive method, we discuss the existence of continuous unimodal even solutions of the above equation.

Let $N$ be a sufficiently large integer. We prove that almost all sufficiently large even integers $n\in [N-6U,N+6U]$ can be represented as $$n=p_1^2+p_2^3+p_3^3+p_4^3+p_5^3+p_6^3,\left|p_1^2-{\displaystyle \frac{N}{6}}\right|\le U,\left|p_i^3-{\displaystyle \frac{N}{6}}\right|\le U,i=2,3,4,5,6,$$ where $U=N^{1-\delta +\epsilon }$ with $\delta \le 8/225$.

Let ${𝒫}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. Suppose that $a$ and $q$ are positive integers satisfying $(a,q)=1$. Denote by ${𝒫}_2(a,q)$ the least almost-prime ${𝒫}_2$ which satisfies ${𝒫}_2\equiv a(modq)$. It is proved that for sufficiently large $q$, there holds $${𝒫}_2(a,q)\ll q^{1.8345}.$$ This result constitutes an improvement upon that of Iwaniec (1982), who obtained the same conclusion, but for the range $1.845$ in place of $1.8345$.