非对称加密体制中RSA算法的研究

由于对称加密体制的安全性难以保障,在网络安全状况日益严重的情况下,需要有一种强有力的安全加密方法来保护重要的数据不被窃取和篡改,非对称加密体制利用公钥和私钥来解决对称加密体制的安全性的缺点,RSA加密算法是实现非对称加密体制的核心,也是应用最广泛的一种加密算法,深入研究RSA加密体制的实现原理与算法,为该算法的应用提供理论基础.     

基于改进RSA算法的隐私数据集同态加密方法

为提高对数据集的加密效果和保障数据集的安全性,在分析传统非对称密钥(RSA)算法运行原理及其参数选择、素数判定条件的基础上,提出了改进RSA算法。为进一步提升加密速度,引入数据加密(DES)算法。首先利用DES算法实现明文数据集的加密,并针对密钥进行RSA加密;在此基础上,在明文和密文空间中,利用加法同态过程对密文进行计算,并通过对结果的解密操作得到相应的明文计算结果。实验结果表明,与基于传统RSA算法或DES算法的加密方法相比,该方法的加密效率和抵御攻击成功率更高,加密过程耗时5~6 s,抵御攻击成功率保持在95%上下,说明该方法能够有效保护隐私数据集的安全。     

基于RSA算法和超混沌的复合加密方案

结合RSA公钥算法和超混沌加密信号两者的优缺点,提出了一种基于RSA算法和超混沌的复合加密方案.理论分析和仿真结果表明,RSA算法抵抗选择密文攻击、公共模数攻击和低指数攻击的能力得到了提高,同时也不存在混沌加密方法在密钥空间设计上的问题.该方案充分利用了两种加密方法的优点,而克服了各自的缺点,因此其安全性能明显优于单独使用任一加密方法的安全性能.     

基于C语言的DES与RSA数据加密算法实现与分析

详细分析和介绍了DES和RSA加密算法的原理,通过C语言具体实现两种算法的加密和解密过程。同时对两种算法的差异进行分析和比较,总结出两种加密算法的特点。     

Broadcast encryption schemes based on RSA

Three broadcast schemes for small receiver set using the property of RSA modulus are presented. They can solve the problem of data redundancy when the size of receiver set is small. In the proposed schemes, the center uses one key to encrypt the message and can revoke authorization conveniently. Every authorized user only needs to store one decryption key of a constant size. Among these three schemes, the first one has indistinguishability against adaptive chosen ciphertext attack (IND-CCA2) secure, and any collusion of authorized users cannot produce a new decryption key but the sizes of encryption modulus and ciphertext are linear in the number of receivers. In the second scheme, the size of ciphertext is half of the first one and any two authorized users can produce a new decryption key, but the center can identify them using the traitor tracing algorithm. The third one is the most efficient but the center cannot identify the traitors exactly.     

Fast decipherment algorithm for RSA public-key cryptosystem

A fast algorithm is presented for deciphering cryptograms involved in the public-key cryptosystem proposed by Rivest, Shamir and Adleman. The deciphering method is based on the Chinese remainder theorem and on improved modular multiplication algorithms.     

基于AES和RSA的网络数据加密方案

随着计算机应用广度与深度的增加,信息安全问题越来越受到广泛关注,为确保网络传输数据的安全性,保障信息安全,网络数据加密技术获得较快发展,新型的数据加密标准AES逐渐取代传统的DES数据加密标准。在认知AES与RSA加密算法及其实现的基础上,分析两者优缺点,提出基于AES和RSA的网络数据加密方案,以实现对网络传输数据的加密保护,保障信息安全,实现其应用价值。     

An improved Montgomery's algorithm for high-speed RSA public-keycryptosystem

We revise Montgomery's algorithm such that modular multiplication can be executed two times faster. Each iteration in our algorithm requires only one addition, while that in Montgomery's requires two additions. We then propose a cellular array to implement modular exponentiation for the Rivest-Shamir-Adleman cryptosystem. It has approximately 2n cells, where n is the word length. The cell contains one full-adder and some controlling logic. The time to calculate a modular exponentiation is about 2n² clock cycles. The proposed architecture has a data rate of 100 kb/s for 512-b words and a 100 MHz clock     

A modification of the RSA public-key encryption procedure (Corresp.)

The Rivest, Shamir, and Adleman (RSA) public-key encryption algorithm can be broken if the integerRused as the modulus can be factored. It my however be possible to break this system without factoringR. A modification of the RSA scheme is described. For this modified version it is shown that, if the encryption procedure can be broken in a certain number of operations, thenRcan be factored in only a few more operations. Furthermore, this technique can also be used to produce digital signatures, in much the same manner as the RSA scheme.     

公钥密码体制RSA算法

介绍了RSA密码算法原理及在生成注册码方面的应用,并对RSA算法的安全性、缺点进行了简单的分析。     

RSA加密算法及其安全性研究

RSA算法是最为重要的公开密钥密码算法之一。现主要阐述了RSA密码技术的基本理论，算法的基本实现，着重讨论了RSA算法的安全特性。     

复合混沌数字图像加密算法

针对有限精度下基于单一混沌映射的加密系统周期较短且易于破解的缺点,提出了一种复合混沌流密码加密算法并给出具体的实例模型,有效地扩展了混沌密钥流的周期并提高了系统抗自适应参数混沌同步攻击的能力.对由该模型生成的伪随机序列的初值敏感性、平衡性及相关性进行了深入分析,在此基础上,给出图像加密实例结果及其直方图分析,表明设计的加密算法具有高的安全性和有效性.     

Cryptanalysis of fast encryption algorithm for multimedia FEA-M

Certain weaknesses in the algebraic structure of the previously proposed fast encryption algorithm for multimedia FEA-M are pointed out. It is shown that, when the secret key consists of k bits, under realistic chosen and known plaintext attacks, the secret key recovery has complexity proportional to 2k/sup 2/ and k/sup 4/, respectively, implying that FEA-M is an insecure algorithm even if the secret keys of 4096 bits are employed.     

AES和RSA混合加密技术在网络数据传输中的应用

文章通过分析和比较AES加密算法和RSA加密算法的实现过程和各自的特点,提出了一种可以将这2种经典加密算法相混合的、新的数据信息加密技术。这种混合加密技术,可以充分发挥AES算法加密运算速度快,RSA算法密匙容易分发和保管的特点,更加有利于网络传输数据的加密。     

基于Montgomery模乘的RSA算法VLSI实现

介绍了一种基于可伸展的Montgomery模乘结构的1024位RSA加解密芯片实现。设计采用的新型心动阵列结构，可以有在有效控制芯片面积的前提下，极大地提高运算频率，从而提高运算速度。经过ModelSim仿真和Design Compiler综合，与当前已发表的RSA芯片设计相比，该设计在面积和速度上均有优势。     

基于图像信息摘要和RSA的图像加密技术研究

针对当今的信息安全问题和数字图像的特点，提出了一种基于图像信息摘要和RSA公钥密码体制的图像加密技术，利用图像信息摘要（IMD）构造图像像素置乱矩阵并对图像像素矩阵进行置乱后再运用RSA公钥加密算法对置乱后的图像加密。实验与讨论结果表明，该方案产生的IMD对图像变化极具敏感性，而且图像像素矩阵的置乱敏感地依赖于IMD，具有较好的加密效果，并对差分、少数据、统计分析攻击具有较好的抗击能力。     

Column generation algorithm for RSA problems in flexgrid optical networks

Finding optimal routes and spectrum allocation in flexgrid optical networks, known as the RSA problem, is an important design problem in transport communication networks. The problem is $\mathcal{NP }$ -hard, and its intractability becomes profound when network instances with several tens of nodes and several hundreds of demands are to be solved to optimum. In order to deal with such instances, large-scale optimization methods need to be considered. In this work, we present a column (more precisely, path) generation-based method for the RSA problem. The method is capable of finding reasonable sets of lightpaths, avoiding large sets of precomputed paths, and leading to high-quality solutions. Numerical results illustrating effectiveness of the proposed method for obtaining solutions for large RSA problem instances are presented.     

蒙哥马利算法在RSA公钥算法中的应用

RSA算法是第一个能同时用于加密和数字签名的算法,是一个被研究的最广的算法,从提出到现在经历了各种攻击的考验,逐渐为人们接受,普遍认为是目前最优秀的公钥算法之一。但是幂模运算是RSA的速度瓶颈,而模幂运算又可以转化为平均(3e)/2次的模乘运算,蒙哥马利算法被认为是计算大数模乘的最快算法,利用蒙哥马利算法对幂模运算的改进可以大大提高RSA的加解密效率。实验证明,使用1 024位密钥加密文件,利用蒙哥马利算法改进后的RSA算法的加密耗时减少了3/4左右。     

RSA算法的研究与实现

本文介绍了RSA算法的加密和解密原理,分析并设计出该算法在教学实验平台上实现的方法,本系统采用在 PC限制的范围内列等长素数表的方法来实现密钥的选取,便于学生在实验过程中观察加密和解密结果,并可通过延伸应 用于一些实际的通信系统,为简化课堂教学的研究开发算法提供了一种简单的方法。