智能卡操作系统中RSA算法的实现与应用

讨论了RSA算法在IC卡中的应用,以及在Ic卡中实现RsA算法的一种途径,即利用中国剩余定理(cRT)来简化大数乘方取模运算．该方法在Ic卡芯片上已经成功实现．测试结果表明,在Ic卡中运用这种方法实现的RsA算法其解密速度与同等条件下的Des算法的加解密速度相当.     

Seismic Evaluation of Multi-Storey RC Frame Using Modal Pushover Analysis

The recently developed pushover analysis procedure has led a new dimension to performance-based design in structural engineering practices. With the increase in the magnitude of monotonic loading, weak links and failure modes in the multi-storey RC frames are usually formed. The force distribution and storey displacements are evaluated using static pushover analysis based on the assumption that the response is controlled by fundamental mode and no mode shift takes place. Himalayan-Nagalushai region, Indo-Gangetic plain, Western India, Kutch and Kathiawar regions are geologically unstable parts of India and some devastating earthquakes of remarkable intensity have occurred here. In view of the intensive construction activity in India, where even a medium intensity tremor can cause a calamity, the authors feel that a completely up-to-date, versatile method of aseismic analysis and design of structures are essential. A detailed dynamic analysis of a 10-storey RC frame building is therefore performed using response spectrum method based on Indian Standard Codal Provisions and base shear, storey shear and storey drifts are computed. A modal pushover analysis (MPA) is also carried out to determine the structural response of the same model for the same acceleration spectra used in the earlier case. The major focus of study is to bring out the superiority of pushover analysis method over the conventional dynamic analysis method recommended by the code. The results obtained from the numerical studies show that the response spectrum method underestimates the response of the model in comparison with modal pushover analysis. It is also seen that modal participation of higher modes contributes to better results of the response distribution along the height of the building. Also pushover curves are plotted to illustrate the displacement as a function of base shear.     

On RSA moduli with almost half of the bits prescribed

We show that using character sum estimates due to H. Iwaniec leads to an improvement of recent results about the distribution and finding RSA moduli M=pl, where p and l are primes, with prescribed bit patterns. We are now able to specify about n bits instead of about n/2 bits as in the previous work. We also show that the same result of H. Iwaniec can be used to obtain an unconditional version of a combinatorial result of W. de Launey and D. Gordon that was originally derived under the Extended Riemann Hypothesis.     

Application of homomorphism to secure image sharing

In this paper, we present a new approach for sharing images between l players by exploiting the additive and multiplicative homomorphic properties of two well-known public key cryptosystems, i.e. RSA and Paillier. Contrary to the traditional schemes, the proposed approach employs secret sharing in a way that limits the influence of the dealer over the protocol and allows each player to participate with the help of his key-image. With the proposed approach, during the encryption step, each player encrypts his own key-image using the dealer's public key. The dealer encrypts the secret-to-be-shared image with the same public key and then, the l encrypted key-images plus the encrypted to-be shared image are multiplied homomorphically to get another encrypted image. After this step, the dealer can safely get a scrambled image which corresponds to the addition or multiplication of the l + 1 original images (l key-images plus the secret image) because of the additive homomorphic property of the Paillier algorithm or multiplicative homomorphic property of the RSA algorithm. When the l players want to extract the secret image, they do not need to use keys and the dealer has no role. Indeed, with our approach, to extract the secret image, the l players need only to subtract their own key-image with no specific order from the scrambled image. Thus, the proposed approach provides an opportunity to use operators like multiplication on encrypted images for the development of a secure privacy preserving protocol in the image domain. We show that it is still possible to extract a visible version of the secret image with only l-1 key-images (when one key-image is missing) or when the l key-images used for the extraction are different from the l original key-images due to a lossy compression for example. Experimental results and security analysis verify and prove that the proposed approach is secure from cryptographic viewpoint.     

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

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

一种移动Agent的安全认证方案的设计与实现

针对移动Agent的安全问题，简要介绍了几种常用的安全认证技术，并在公钥密码体制认证方案的基础上，提出并实现了一种可用于移动Agent和Agent平台之间安全认证的方案。证书采用X.509证书格式，使用RSA和IDEA混合加密的算法，密钥管理采用PGP算法中公私钥环的方式，使该认证方案具有很高的安全性。文中详细说明了方案的实现流程，并深入分析了其安全性。结果表明，采用该方案能有效改善移动Agent的安全性。     

混沌参数调制下RSA数据加密算法研究

随着网络信息通讯技术的发展,信息数据的通讯安全成为信息化网络信息数据通讯过程中的重要问题。面对大量侵入程序与数据漏洞的威胁,一套强有效的数据加密算法成为数据研究领域的研究方向。RSA数据加密算法作为如今常用的安全性最高的算法,在大数据动态数据节点混沌排列的条件下,无法有效保证数据的加密安全。混沌参数下,出现加密逻辑断裂、溢出、数列逆排等严重的算法漏洞。对此,提出混沌参数调制下RSA数据加密算法研究,采用混沌参数特征处理单元、特征序列逻辑控制单元与混沌FIE-RSA算法,对传统RSA加密算法存在的问题进行针对性解决。通过仿真实验证明,提出的混沌参数调制下RSA数据加密算法研究中,采用的一系列方法具有加密处理响应速度快、处理运算时间短、加密安全度高、反破解性能强等特点。     

Impact of orientational distribution of adsorbing objects on dynamics of Random Sequential Ballistic Adsorption (RSBA) dynamics

Recently, by proposing a new variant of Random Sequential Adsorption (RSA) namely Random Sequential Ballistic Adsorption (RSBA) model [Pradip B. Shelke, A.G. Banpurkar, S.B. Ogale, A.V. Limaye, Surf. Sci. 601 (2007) 274], we addressed the issue of adsorption dynamics of extended objects where the objects, upon adsorption, protrude outside the substrate. This study brought out the role of the arriving trajectory in the adsorption dynamics. In the present work the possible role of the orientational distribution of the arriving objects in the RSBA dynamics is investigated. The dynamics of RSBA of needles (line segments) is studied analytically and by computer simulation for different types of θ distributions of arriving needles, θ being the angle made by the arriving needle with normal to the substrate. Three types of θ distributions, namely a uniform distribution over the range (0, π/2), a Gaussian distribution and a distribution uniform over the solid angle, are considered. Analytical treatment establishes that in all the three cases, the number n(t) of adsorbed objects at a late time t follows a power law n(t) ∼ t^α, and the exponent α depends on the specifics of the θ distribution. In general, for distribution f(θ) ∝ θ^β, for θ → 0, α is found to be 2/(β + 3). The simulation results are in excellent agreement with the analytical findings and together they reveal that the orientational distribution of arriving objects has significant consequences for the Random Sequential Ballistic Adsorption (RSBA) process.     

Construction of the Thermodynamic Jamming Limit for the Parking Process and Other Exclusion Schemes on {\mathbb Z}^{d}

We provide an explicit construction of the thermodynamic jamming limit for the parking process and other finite range exclusion schemes on . By means thereof, a strong law of large numbers for occupation densities is accomplished, and, amongst other results, the so called “super-exponential” (i.e. gamma) decay of pair correlation functions is established. Mathematics Subject Classification (1991): 60K99     

An efficient and secure RSA-like cryptosystem exploiting Rédei rational functions over conics

We define an isomorphism between the group of points of a conic and the set of integers modulo a prime equipped with a non-standard product. This product can be efficiently evaluated through the use of Rédei rational functions. We then exploit the isomorphism to construct a novel RSA-like scheme. We compare our scheme with classic RSA and with RSA-like schemes based on the cubic or conic equation. The decryption operation of the proposed scheme turns to be two times faster than RSA, and involves the lowest number of modular inversions with respect to other RSA-like schemes based on curves. Our solution offers the same security as RSA in a one-to-one communication and more security in broadcast applications.