A new image encryption/decryption algorithm has been designed using discrete chaotic systems as aSP (Substitution and Permutation) network architecture often used in cryptosystems. It is composed of two mainmodules: s...A new image encryption/decryption algorithm has been designed using discrete chaotic systems as aSP (Substitution and Permutation) network architecture often used in cryptosystems. It is composed of two mainmodules: substitution module and permutation module. Both analyses and numerical results imply that the algo-rithm has the desirable security and efficiency.展开更多
This paper is devoted to determining the structures and properties of one-Lee weight codes and two-Lee weight projective codes Ck1,k2,k3 over p IF+ v IFp with type p2k1pk2pk3. The authors introduce a distance-preservi...This paper is devoted to determining the structures and properties of one-Lee weight codes and two-Lee weight projective codes Ck1,k2,k3 over p IF+ v IFp with type p2k1pk2pk3. The authors introduce a distance-preserving Gray map from( IFp + v IFp)nto2np. By the Gray map, the authors construct a family of optimal one-Hamming weight p-ary linear codes from one-Lee weight codes over IFp+ v IFp, which attain the Plotkin bound and the Griesmer bound. The authors also obtain a class of optimal p-ary linear codes from two-Lee weight projective codes over IFp + vIFp, which meet the Griesmer bound.展开更多
By constructing a Gray map, a class of constacyclic codes over ring R = R＋ vR is studied. Using cyclic codes and negacyclic codes of length p^s over ring R, the structure of （1 - 2v）-constacyclic codes and dual cod...By constructing a Gray map, a class of constacyclic codes over ring R = R＋ vR is studied. Using cyclic codes and negacyclic codes of length p^s over ring R, the structure of （1 - 2v）-constacyclic codes and dual codes of length p^s over ring R are given, the Gray images of （1 - 2v）-constacyclic codes in a particular case are also studied. It is shown that linear codes of length pS over ring R are （1 -2v）-constacyclic codes if and only if their Gray images are distance-invariant cyclic codes of length 2p^s over ring R.展开更多
Abstract Constacyclic codes are an important class of linear codes in coding theory. Many optimal linear codes are directly derived from constacyclic codes. In this paper, a new Gray map between codes over Fp ＋ uFp ...Abstract Constacyclic codes are an important class of linear codes in coding theory. Many optimal linear codes are directly derived from constacyclic codes. In this paper, a new Gray map between codes over Fp ＋ uFp ＋ u^2Fp and codes over Fp is defined, where p is an odd prime. By means of this map, it is shown that the Gray image of a linear （1 ＋ u ＋ u2）-constacyclic code over Fp ＋ uFp ＋ u^2Fp of length n is a repeated-root cyclic code over Fp of length pn. Furthermore, some examples of optimal linear cyclic codes over F3 from （1 ＋ u ＋ u2）-constacyclic codes over F3 ＋ uF3 ＋ u^2F3 are given.展开更多
The explosive growth ofmalware variants poses a major threat to information security. Traditional anti-virus systems based on signatures fail to classify unknown malware into their corresponding families and to detect...The explosive growth ofmalware variants poses a major threat to information security. Traditional anti-virus systems based on signatures fail to classify unknown malware into their corresponding families and to detect new kinds of malware pro- grams. Therefore, we propose a machine learning based malware analysis system, which is composed of three modules： data processing, decision making, and new malware detection. The data processing module deals with gray-scale images, Opcode n-gram, and import fimctions, which are employed to extract the features of the malware. The decision-making module uses the features to classify the malware and to identify suspicious malware. Finally, the detection module uses the shared nearest neighbor （SNN） clustering algorithm to discover new malware families. Our approach is evaluated on more than 20 000 malware instances, which were collected by Kingsoft, ESET NOD32, and Anubis. The results show that our system can effectively classify the un- known malware with a best accuracy of 98.9%, and successfully detects 86.7% of the new malware.展开更多
The Lee weight enumerators and the complete weight enumerators for the linear codes over ring R = F2 ＋ u F2 ＋ v F2 are defined and Gray map from R^nto F2^3n is constructed. By proving the fact that the Gray images o...The Lee weight enumerators and the complete weight enumerators for the linear codes over ring R = F2 ＋ u F2 ＋ v F2 are defined and Gray map from R^nto F2^3n is constructed. By proving the fact that the Gray images of the self-dual codes over R are the self-dual codes over F2, and based on the Mac Williams identities for the Hamming weight enumerators of linear codes over F2, the Mac Williams identities for Lee weight enumerators of linear codes over R are given. Further, by introducing a special variable t, the Mac Williams identities for the complete weight enumerators of linear codes over R are obtained. Finally, an example which illustrates the correctness and function of the two Mac Williams identities is provided.展开更多
基金Sponsored by the National Natural Science Foundation of China(Grant No. 69874025)
文摘A new image encryption/decryption algorithm has been designed using discrete chaotic systems as aSP (Substitution and Permutation) network architecture often used in cryptosystems. It is composed of two mainmodules: substitution module and permutation module. Both analyses and numerical results imply that the algo-rithm has the desirable security and efficiency.
基金supported by the National Natural Science Foundation of China under Grant No.61202068Talented youth Fund of Anhui Province Universities under Grant No.2012SQRL020ZDthe Technology Foundation for Selected Overseas Chinese Scholar,Ministry of Personnel of China under Grant No.05015133
文摘This paper is devoted to determining the structures and properties of one-Lee weight codes and two-Lee weight projective codes Ck1,k2,k3 over p IF+ v IFp with type p2k1pk2pk3. The authors introduce a distance-preserving Gray map from( IFp + v IFp)nto2np. By the Gray map, the authors construct a family of optimal one-Hamming weight p-ary linear codes from one-Lee weight codes over IFp+ v IFp, which attain the Plotkin bound and the Griesmer bound. The authors also obtain a class of optimal p-ary linear codes from two-Lee weight projective codes over IFp + vIFp, which meet the Griesmer bound.
基金supported by the National Natural Science Foundation of China under Grant No.61370089
文摘By constructing a Gray map, a class of constacyclic codes over ring R = R＋ vR is studied. Using cyclic codes and negacyclic codes of length p^s over ring R, the structure of （1 - 2v）-constacyclic codes and dual codes of length p^s over ring R are given, the Gray images of （1 - 2v）-constacyclic codes in a particular case are also studied. It is shown that linear codes of length pS over ring R are （1 -2v）-constacyclic codes if and only if their Gray images are distance-invariant cyclic codes of length 2p^s over ring R.
基金supported by the National Natural Science Foundation of China under Grant No.61370089the Open Research Fund of National Mobile Communications Research Laboratory,Southeast University under Grant No.2014D04+3 种基金the Natural Science Fund of Education Department of Anhui province under Grant No.KJ2013Z276the Fundamental Research Funds of Hefei University under Grant No.10KY01ZDthe Key construction discipline Funds of Hefei University under Grant No.2014XK08the Natural Science Key Fund of Education Department of Anhui Province under Grant No.KJ2015A226
文摘Abstract Constacyclic codes are an important class of linear codes in coding theory. Many optimal linear codes are directly derived from constacyclic codes. In this paper, a new Gray map between codes over Fp ＋ uFp ＋ u^2Fp and codes over Fp is defined, where p is an odd prime. By means of this map, it is shown that the Gray image of a linear （1 ＋ u ＋ u2）-constacyclic code over Fp ＋ uFp ＋ u^2Fp of length n is a repeated-root cyclic code over Fp of length pn. Furthermore, some examples of optimal linear cyclic codes over F3 from （1 ＋ u ＋ u2）-constacyclic codes over F3 ＋ uF3 ＋ u^2F3 are given.
基金Project supported by the Natiooal Natural Science Foundation of China （No. 61303264） and the National Basic Research Program （973） of China （Nos. 2012CB315906 and 0800065111001）
文摘The explosive growth ofmalware variants poses a major threat to information security. Traditional anti-virus systems based on signatures fail to classify unknown malware into their corresponding families and to detect new kinds of malware pro- grams. Therefore, we propose a machine learning based malware analysis system, which is composed of three modules： data processing, decision making, and new malware detection. The data processing module deals with gray-scale images, Opcode n-gram, and import fimctions, which are employed to extract the features of the malware. The decision-making module uses the features to classify the malware and to identify suspicious malware. Finally, the detection module uses the shared nearest neighbor （SNN） clustering algorithm to discover new malware families. Our approach is evaluated on more than 20 000 malware instances, which were collected by Kingsoft, ESET NOD32, and Anubis. The results show that our system can effectively classify the un- known malware with a best accuracy of 98.9%, and successfully detects 86.7% of the new malware.
基金supported by the Natural Science Foundation of Hubei Province under Grant No.D20144401the Natural Science Foundation of Hubei Polytechnic University under Grant Nos.12xjz14A,11yjz37B
文摘The Lee weight enumerators and the complete weight enumerators for the linear codes over ring R = F2 ＋ u F2 ＋ v F2 are defined and Gray map from R^nto F2^3n is constructed. By proving the fact that the Gray images of the self-dual codes over R are the self-dual codes over F2, and based on the Mac Williams identities for the Hamming weight enumerators of linear codes over F2, the Mac Williams identities for Lee weight enumerators of linear codes over R are given. Further, by introducing a special variable t, the Mac Williams identities for the complete weight enumerators of linear codes over R are obtained. Finally, an example which illustrates the correctness and function of the two Mac Williams identities is provided.
