With the rapid application growing of internet and wireless network, information security becomes significant to protect commerce secret and personal privacy. Steganography plays crucial role for information security guarantee. There have been number of steganography embedding techniques proposed over last few years. In this paper, our goal is to evaluate number of JPEG steganography techniques...

In order to improve the steganographic robustness of the algorithm in binary images, suppose an new steganographic method which deals with the edge of the binary image using mathematical morphology and combines F5 encoding method to embedded information. Marginalization and reconstruction on binary image by dilation and erosion operations, and tag blocks that can embed information to. Finally e...

Random spin3 2 antiferromagnetic Heisenberg chains are investigated using an asymptotically exact renormalization group. Randomness is found to induce a quantum phase transition between two random-singlet phases. In the strong randomness phase the effective spins at low energies are Se f f5 3 2 , while in the weak randomness phase the effective spins are Se f f5 1 2 . Separating them is a quant...

Algebraic cryptanalysis usually requires to find solutions of several similar polynomial systems. A standard tool to solve this problem consists of computing the Gröbner bases of the corresponding ideals, and Faugère’s F4 and F5 are two well-known algorithms for this task. In this paper, we present a new variant of the F4 algorithm which is well suited to algebraic attacks of cryptosystems sinc...

In the process of biological knowledge discovery, PCA is commonly used to complement the clustering analysis, but PCA typically gives the poor visualizations for most gene expression data sets. Here, we propose a PCCF measure, and use PCA-F to display clusters of PCCF, where PCCF and PCA-F are modeled from the modified cumulative probabilities of genes. From the analysis of simulated and experi...

Article history: Received 2 June 2013 Accepted 15 July 2013 Available online xxxx

one of the most important problems of coding theory is to construct codes with beat possible minimum distances. In this paper, we use the algebraic structure of quasi-cyclic codes and the BCH type bound on the minimum distance to search for quasi-cyclic codes over IFS, the finite field with five elements, which improve the minimum distances of best-known linear codes. We construct 15 new linear...

Let nq(k, d) be the smallest integer n for which there exists an [n, k, d]q code for given q, k, d. It is known that n8(4, d) = ∑3 i=0 ⌈ d/8i ⌉ for all d ≥ 833. As a continuation of Jones et al. [Electronic J. Combinatorics 13 (2006), #R43], we determine n8(4, d) for 117 values of d with 113 ≤ d ≤ 832 and give upper and lower bounds on n8(4, d) for other d using geometric methods and some exten...

PQ and F5 are two typical steganography methods of JPEG images and have been used widely. To compare the robustness of the above two algorithms, to withstand steganalytic attack a classification algorithm based on sensitive features is presented. SVM is used as a classifier using sensitive features extracted from two domains DCT and DWT. A comparison between the two types of features is also sh...