No abstract

Recently, a colour image encryption algorithm based on chaos was proposed by cascading two position permutation operations and one substitution operation, which are all determined by some pseudorandom number sequences generated by iterating the logistic map. This paper evaluates the security level of this encryption algorithm and finds that the position permutation-only part and the substitution part can be separately broken with only (log 2 (3MN ))/8 and 2 chosen plain-images, respectively, where MN is the size of the plain-image. The effectiveness of the proposed chosen-plaintext attack is supported by concise theoretical analyses, and is verified by experimental results.

We consider a standard Adaptive Edge Finite Element Method (AEFEM) based on arbitrary order Nédélec edge elements, for three-dimensional indefinite time-harmonic Maxwell equations. We prove that the AE-FEM gives a contraction for the sum of the energy error and the scaled error estimator, between two consecutive adaptive loops provided the initial mesh is fine enough. Using the geometric decay, we show that the AEFEM yields the best possible decay rate of the error plus oscillation in terms of the number of degrees of freedom. The main technical contribution of the paper is the establishment of a quasi-orthogonality and a localized a posteriori error estimator.

No abstract

Two new two-grid algorithms are proposed for solving the Maxwell eigenvalue problem. The new methods are based on the two-grid methodology recently proposed by Xu and Zhou [Math. Comp., 70 (2001), pp. 17–25] and further developed by Hu and Cheng [Math. Comp., 80 (2011), pp. 1287–1301] for elliptic eigenvalue problems. The new two-grid schemes reduce the solution of the Maxwell eigenvalue problem on a fine grid to one linear indefinite Maxwell equation on the same fine grid and an original eigenvalue problem on a much coarser grid. The new schemes, therefore, save total computational cost. The error estimates reveals that the two-grid methods maintain asymptotically optimal accuracy, and the numerical experiments presented confirm the theoretical results.

No abstract

No abstract

Recently, a chaos-based image encryption algorithm using alternate structure (IEAS) was proposed. This paper focuses on differential cryptanalysis of the algorithm and finds that some properties of IEAS can support a differential attack to recover equivalent secret key with a little small number of known plain-images. Detailed approaches of the cryptanalysis for cryptanalyzing IEAS of the lower round number are presented and the breaking method can be extended to the case of higher round number. Both theoretical analysis and experiment results are provided to support vulnerability of IEAS against differential attack. In addition, some other security defects of IEAS, including insensitivity with respect to changes of plain-images and insufficient size of key space, are also reported.