武器系统生存能力模型分析

对抗过程中，武器系统的生存概率包括以下的四个方面，即：被发现的可能性、被命中的可能性、易毁性和可修理性。武器系统生存能力的动态描述主要划分为四个阶段：被发现阶段、被命中阶段、被毁伤和修复阶段。本文从这四个阶段给出了对抗过程中武器系统生存能力的动态描述，并分析了各个阶段的计算模型。     

A public-key cryptosystem utilizing cyclotomic fields

While it is well-known that the RSA public-key cryptosystem can be broken if its modulusN can be factored, it is not known whether there are other ways of breaking RSA. This paper presents a public-key scheme which necessarily requires knowledge of the factorization of its modulus in order to be broken. Rabin introduced the first system whose security is equivalent to the difficulty of factoring the modulus. His scheme is based on squaring (cubing) for encryption and extracting square (cube) roots for decryption. This introduces a 14 (19) ambiguity in the decryption. Various schemes which overcome this problem have been introduced for both the quadratic and cubic case. We generalize the ideas of Williams' cubic system to larger prime exponents. The cases of higher prime order introduce a number of problems not encountered in the quadratic and cubic cases, namely the existence of fundamental units in the underlying cyclotomic field, the evaluation of higher power residue symbols, and the increased difficulty of Euclidean division in the field.     

A new color image cryptosystem via hyperchaos synchronization

This paper proposes a novel color image cryptosystem based on synchronization of two different six-dimensional hyperchaotic systems. In the transmitter end, we apply the drive system to generate the diffusion matrices and scrambling ones, which are used to change the image pixel value and position, respectively. Thus the ciphered image is obtained. In the receiver, synchronization of two nonidentical hyperchaotic systems can be achieved by designing the appropriate controllers. The response system is employed to yield the corresponding diffusion matrices and scrambling ones using the same generation method in the encryption algorithm. Then the cipher-image can be decrypted by the decryption algorithm, which is similar to that of the encryption process but in the reversed order. The experimental results show that the presented image cryptosystem has high security and can resist noise and crop attacks.     

Optical asymmetric watermarking using modified wavelet fusion and diffractive imaging

In most of the existing image encryption algorithms the generated keys are in the form of a noise like distribution with a uniform distributed histogram. However, the noise like distribution is an apparent sign indicating the presence of the keys. If the keys are to be transferred through some communication channels, then this may lead to a security problem. This is because; the noise like features may easily catch people׳s attention and bring more attacks. To address this problem it is required to transfer the keys to some other meaningful images to disguise the attackers. The watermarking schemes are complementary to image encryption schemes. In most of the iterative encryption schemes, support constraints play an important role of the keys in order to decrypt the meaningful data. In this article, we have transferred the support constraints which are generated by axial translation of CCD camera using amplitude-, and phase- truncation approach, into different meaningful images. This has been done by developing modified fusion technique in wavelet transform domain. The second issue is, in case, the meaningful images are caught by the attacker then how to solve the copyright protection. To resolve this issue, watermark detection plays a crucial role. For this purpose, it is necessary to recover the original image using the retrieved watermarks/support constraints. To address this issue, four asymmetric keys have been generated corresponding to each watermarked image to retrieve the watermarks. For decryption, an iterative phase retrieval algorithm is applied to extract the plain-texts from corresponding retrieved watermarks.     

The miracle role of lattice imperfections in benzene alkylation with methanol over mordenite

Mordenite (MOR) has demonstrated potential as a catalyst for alkylation due to high variability, intrinsic porosity, and outstanding stability. However, the contact probability of benzene and methanol has been limited by typical layered structures of MOR and there is no connection between layers. Here, we report the preparedness of H-MOR via a sequential post-treatment method based on a commercial MOR. H-MOR sample had appeared lattice imperfections inferred from characterization means. The samples were tested with benezene methylation reaction. Results show that the high conversion of benzene and the high selectivity of toluene were obtained from the miracle role of lattice imperfections in the H-MOR sample. Sequentially, based on the study of all catalyst structure and physical properties, a plausible reaction mechanism for the selectivity of the desired toluene was proposed.     

云计算在RSA密码体制分析中的应用

RSA是著名的公钥密码体制之一,其安全性是基于大整数因子分解困难性假设的,求解RSA问题的最直接方法是分解RSA的模数.由于云计算的大规模分布式计算能力,一些使用分布式计算模型MapReduce的大整数分解手段已经实现,针对大整数因子分解的问题,提出了给定范围内搜索因子的新方法,并对相应的实验数据和结果进行了分析.结果表明,在云中的分布式计算的运行时间远小于单台机器.     

A novel cryptosystem based on grey system theory and genetic algorithm

In this paper, we first attempt to introduce the biological concepts of genetic factor and genetic variation into the study of a Kaleidoscope–Queer (in brief, K–Q) cryptosystem. The novel K–Q cryptosystem including the genetic factor, (GM, X, λ(x)), can be applied to ensure the security of an information system. The main contributions include the K–Q cryptosystem concept with genetic factor, the existence theorem of -era K–Q cryptosystem with genetic factor, the limited embedded theorem of K–Q cryptosystem with genetic factor, and the genetic variability theorem of K–Q cryptosystem.     

How to Mask the Structure of Codes for a Cryptographic Use

In this paper we show how to strengthen public-key cryptosystems against known attacks, together with the reduction of the public-key. We use properties of subcodes to mask the structure of the codes used by the conceiver of the system. We propose new parameters for the cryptosystems and even a modified Niederreiter cryptosystem in the case of Gabidulin codes, with a public-key size of less than 4000 bits.Communicated by: P. WildAMS Classification: 11T71     

Cryptanalysis of a Matrix-based MOR System

We cryptanalyze a recently proposed matrix-based MOR cryptosystem. The security of the system depends on the difficulty of solving the following discrete logarithm problem: given an inner automorphism φ of SL(d, 𝔽 _q ) and φ ^a (each given in terms of their images on generators of SL(d, 𝔽 _q )), find a. We show that this problem can be reduced to a small number of similar problems in quotients of polynomial rings and solved in subexponential-time.