In this paper, several versions of gluing theorems for quasiconformal mappings in the plane are obtained. The best possibility of gluing quasiconformal mappings is investigated. As an application, we provide a new short proof of the gluing theorem obtained by Jiang and Qi.

We study the problem of density of polynomials in the de Branges spaces ℋ($E$) of entire functions and obtain conditions (in terms of the distribution of the zeros of the generating function$E$) ensuring that the polynomials belong to the space ℋ($E$) or are dense in this space. We discuss the relation of these results with the recent paper of V. P. Havin and J. Mashreghi on majorants for the shift-coinvariant subspaces. Also, it is shown that the density of polynomials implies the hypercyclicity of translation operators in ℋ($E$).

We prove the following conjecture of Furstenberg (1969): if 𝐴,𝐵⊂[0,1] are closed and invariant under ×𝑝 mod1 and ×𝑞 mod1, respectively, and if log𝑝/log𝑞∉ℚ, then for all real numbers 𝑢 and 𝑣, dim_H (𝑢𝐴 + 𝑣) ∩ 𝐵 ≤ max {0, dim_H 𝐴 + dim_H 𝐵 − 1}. We obtain this result as a consequence of our study on the intersections of incommensurable self-similar sets on ℝ. Our methods also allow us to give upper bounds for dimensions of arbitrary slices of planar self-similar sets satisfying SSC and certain natural irreducible conditions.

SMS4 is a 128-bit block cipher used in the WAPI standard for providing data confidentiality in wireless networks. In this paper we investigate and explain the origin of the S-Box employed by the cipher, show that an embedded cipher similar to BES can be obtained for SMS4 and demonstrate the fragility of the cipher design by giving variants that exhibit 2^{64} weak keys. We also show attacks on reduced round versions of the cipher. The best practical attack we found is an integral attack that works on 10 rounds out of 32 rounds with a complexity of 2^{18} operations; it can be extended to 13 rounds using round key guesses, resulting in a complexity of 2^{114} operations and a data complexity of 2^{16} chosen pairs.

A numerical method for computing the extremal Teichmüller map between multiply-connected domains is presented. Given two multiply-connected domains, there exists a unique Teichmüller map (T-Map) between them minimizing the conformality distortion. The extremal T-Map can be considered as the ‘most conformal’ map between multiply-connected domains. In this paper, we propose an iterative algorithm to compute the extremal T-Map using the Beltrami holomorphic flow (BHF). The BHF procedure iteratively adjusts the initial map based on a sequence of Beltrami coefficients, which are complex-valued functions defined on the source domain. It produces a sequence of quasi-conformal maps, which converges to the T-Map minimizing the conformality distortion. We test our method on synthetic data together with real human face data. Results show that our algorithm computes the extremal T-Map between two multiply-connected domains of the same topology accurately and efficiently.