一种加载随机预言模型的RSA公钥密码体制

RSA公钥密码体制是当今最流行的公钥密码体制,它具有很多优点,但是在实际应用中由于它的代数性质会让攻击者积累有效信息,而且在加密大量消息的情况下,加解密速度非常慢。针对这两个缺陷,提出了一种加载随机预言模型的RSA公钥密码体制,这种体制不但保留了原来体制的保密性,而且还大大降低了攻击者对信息的积累,提高了加解密的效率。最后还将改进的方案推广到私钥密码体制和公钥密码体制的结合的方案。     

一种加载随机预言模型的RSA公钥密码体制

RSA公钥密码体制是当今最流行的公钥密码体制,它具有很多优点,但是在实际应用中由于它的代数性质会让攻击者积累有效信息,而且在加密大量消息的情况下,加解密速度非常慢.针对这两个缺陷,提出了一种加载随机预言模型的RSA公钥密码体制,这种体制不但保留了原来体制的保密性,而且还大大降低了攻击者对信息的积累,提高了加解密的效率.最后还将改进的方案推广到私钥密码体制和公钥密码体制的结合的方案.     

一种加载随机预言模型的RSA公钥密码体制

RSA公钥密码体制是当今最流行的公钥密码体制，它具有很多优点，但是在实际应用中由于它的代数性质会让攻击者积累有效信息，而且在加密大量消息的情况下，加解密速度非常慢。针对这两个缺陷，提出了一种加载随机预言模型的RSA公钥密码体制，这种体制不但保留了原来体制的保密性，而且还大大降低了攻击者对信息的积累，提高了加解密的效率。最后还将改进的方案推广到私钥密码体制和公钥密码体制的结合的方案。     

AES与ECC相结合的数据加密方案的研究与实现

本文从公钥密码和私钥密码两方面分析了现有的数据加密体制，并提出一种将AES（高级数据加密标准）与ECC（椭圆曲线密码体制）相结合的数据加密方案。这一方案有效解决了私钥密码体制中密钥的分配和管理的问题，从而为在网络中高速、安全地传输数据提供了保障。     

基于ECC的密码系统研究与设计

文章设计了一个基于ECC的密码系统方案，给出了该方案所涉及主要操作的算法描述。该方案综合了对称密码体制和公钥密码体制的优点，采用基于ECC的密钥交换以及基于CBC的三重加密算法．具有安全可靠、加解密效率高、易于实现等特点，可应用于数据通信、电子商务等多个领域，以提供所需的安全服务。     

一种网络传输信息加密解密系统研制的方法

在对公钥密码体制分析的基础上，研究了RSA密码体制的实现算法，设计了系统程序模块。开发了端对端的网络传输信息加密解密系统。测试表明采用RSA密码体制可以研制出安全性更高的网络传输信息加密解密系统。     

RSA加密算法的研究

在传统的经典密码学当中我们可以从一个密钥得到一个加密规则和一个解密规则.在这些密码体制中加密规则和解密规则相同,或者可以很容易从加密规则导出解密规则,任何加密解密规则的泄露都会导致密码体制不安全,这是传统的对称密码加密.而公钥密码学就提出了一种想法,从加密规则推出解密规则在计算上不可行来解决这一问题.这就是本文所介绍的RSA加密体制就是其中的典型代表.     

现代密码算法研究

密码技术是信息安全的核心技术。密码技术主要包括对称密码算法和非对称密码算法及协议。对称加密算法加密密钥和解密密钥相互推导容易,加/解密速度非常快,适用于大批量数据加密的场合。非对称密钥密码体制从私有密钥推导公开密钥是计算不可行的,虽然公钥加密算法在运行速度方面无法和对称加密算法媲美,但很好地解决了对称密码学面临的密钥的分发与管理问题,同时对于数字签名问题也给出了完美的解答。     

丢番图公钥密码体制

本文利用丢番图方程建立了二类新型分钥密码体制——丢番图公钥密码体制。这些公钥体制与著名的RSA公钥体制相比的最大优点是共加密、解密算法简单,实现速度快。这些体制的安全性依赖于求解丢番图方程中的一些NP完全问题和大数的素因子分解的困难性。     

基于辫子群的密码体制研究及进展

综述了基于辫子群的密码体制的研究成果和发展状况:介绍了现有的基于辫子群的一些密码体制,包括密钥交换协议,加密-解密方案和身分认证方案,同时也概述了相关的密码分析方法,如解共轭问题、基于长度和线性表示的攻击等.指出了目前基于辫子群的密码体制所存在的问题,并对其研究前景进行了展望.     

基于随机背包的公钥密码

该文构造了一个背包型公钥密码算法。该背包公钥密码具有如下优点:加解密只需要加法和模减法运算,因此加解密速度快;该算法是基于随机背包问题而不是易解背包问题而构造的;证明了在攻击者不掌握私钥信息情况下该密码算法能抵抗直接求解背包问题的攻击,包括低密度攻击和联立丢番图逼近攻击等;证明了攻击者能够恢复私钥信息与攻击者能够分解一个大整数是等价的。分析表明,该算法是一个安全高效的公钥加密算法。     

RSA算法及其一种简单实现方法的设计

分析了RSA公钥密码算法的基本原理,根据算法原理中加密时所取素数应等长的建议,在PC机限制的范围内利用列等长素数表的方法设计了一种较为简单的实现方法.该实现方法既可以作为研究加密算法的平台,又可以通过延伸该平台应用于一些实际的通信系统.通过分析对明文信息的加密和密文信息的解密过程,列出了本算法实现的具体步骤,并给出了程序主模块的执行结果和加密、解密函数的程序流程,举例演示了加密和解密的过程.     

可公开验证的ElGamal／RSA加密

可公开验证加密允许任何实体验证加密的消息和先前承诺的秘密一样,但不会泄漏明文的任何信息。这在公平交换、防欺骗的秘密分享和安全多方计算中有重要应用。该文分别给出可公开验证的ElGamal加密和RSA加密方案。其中前者是Stalderr方案的改进,改进后的方案是语义安全的而Stalder方案达不到语义安全性。同时将该方案推广到了多个接受者的情形,最后给出了高效的可公开验证RSA加密方案。     

A New Public-Key Cryptosystem over a Quadratic Order with Quadratic Decryption Time

We present a new cryptosystem based on ideal arithmetic in quadratic orders. The method of our trapdoor is different from the Diffie—Hellman key distribution scheme or the RSA cryptosystem. The plaintext m is encrypted by mp ^r , where p is a fixed element and r is a random integer, so our proposed cryptosystem is a probabilistic encryption scheme and has the homomorphy property. The most prominent property of our cryptosystem is the cost of the decryption, which is of quadratic bit complexity in the length of the public key. Our implementation shows that it is comparably as fast as the encryption time of the RSA cryptosystem with e=2 ¹⁶ +1 . The security of our cryptosystem is closely related to factoring the discriminant of a quadratic order. When we choose appropriate sizes of the parameters, the currently known fast algorithms, for example, the elliptic curve method, the number field sieve, the Hafner—McCurley algorithm, are not applicable. We also discuss that the chosen ciphertext attack is not applicable to our cryptosystem. Received 29 June 1998 and revised 15 November 1998     

一种基于Z/nZ上椭圆曲线的公钥密码算法

本文在 Ｋ Ｍ Ｏ Ｖ 算法［１］的基础上作了改动,提出了一种 Ｚ／ｎ Ｚ 上椭圆曲线公钥密码算法,ｎ是两个大安全素数之积,算法安全性基于整数因子分解难题,与 Ｒ Ｓ Ａ 体制相似,能抵卸一些对 Ｒ Ｓ Ａ 算法的攻击,不足之处在于不能证明其安全性是否等价于因子分解问题。算法加解密过程都很简洁,且在加密过程中引入随机数,实现概率加密。同时给出了数字签名和身份认证方案。     

Elliptic curve ElGamal based homomorphic image encryption scheme for sharing secret images

This paper proposes an encryption scheme with a new additive homomorphism based on Elliptic Curve ElGamal (EC-ElGamal) for sharing secret images over unsecured channel. The proposed scheme enables shorter key and better performance than schemes based on RSA or ElGamal. It has a lower computation overhead in image decryption comparing with the method that uses other additively homomorphic property in EC-ElGamal. Elliptic curve parameters are selected to resist the Pohlig-Hellman, Pollard's-rho, and Isomorphism attacks. Experimental results and analysis show that the proposed method has superior performance to RSA and ElGamal.     

Autonomous Shared Key Management Scheme for Space Networks

Key management is more difficult in space networks than in ground wireless networks as long time delay, large scale and difficult maintain. The main challenge is how to handle 1-affects- $n$ problem,which becomes more serious as space entities spread over a wide geographic area. To solve the question, this paper proposes a one-to-many mapping shared key agreement, which is based on one-to-many encryption mechanism model. In the proposed key agreement, each entity has different decryption key and shares an encryption key. When an entity joins or leaves network, updated keys only are a public encryption key and its decryption key. However, the other entities’ secret key remains unchanged, so as to each member has the ability to update key autonomously and securely, legitimate member has capability of revoke it’s secret decryption key independency without other member’s agreement. Consequently the performance of the proposed key management scheme is unrelated to the network scale, node mobility and topology structure. It is shown that our proposed key management scheme not only improves the efficiency and flexibility for space networks, but also achieves good security properties, including forward security and backward security and many more by theoretical analyses.     

A group key exchange and secure data sharing based on privacy protection for federated learning in edge-cloud collaborative computing environment

Federated learning (FL) is widely used in internet of things (IoT) scenarios such as health research, automotive autopilot, and smart home systems. In the process of model training of FL, each round of model training requires rigorous decryption training and encryption uploading steps. The efficiency of FL is seriously affected by frequent encryption and decryption operations. A scheme of key computation and key management with high efficiency is urgently needed. Therefore, we propose a group key agreement technique to keep private information and confidential data from being leaked, which is used to encrypt and decrypt the transmitted data among IoT terminals. The key agreement scheme includes hidden attribute authentication, multipolicy access, and ciphertext storage. Key agreement is designed with edge-cloud collaborative network architecture. Firstly, the terminal generates its own public and private keys through the key algorithm then confirms the authenticity and mapping relationship of its private and public keys to the cloud server. Secondly, IoT terminals can confirm their cryptographic attributes to the cloud and obtain the permissions corresponding to each attribute by encrypting the attributes. The terminal uses these permissions to encrypt the FL model parameters and uploads the secret parameters to the edge server. Through the storage of the edge server, these ciphertext decryption parameters are shared with the other terminal models of FL. Finally, other terminal models are trained by downloading and decrypting the shared model parameters for the purpose of FL. The performance analysis shows that this model has a better performance in computational complexity and computational time compared with the cited literature.     

AES与ECC混合加密算法的无线数据通信系统设计

提出了一种新的无线数据通信数据加密算法。该算法利用高级加密标准AES加密数据，以ECC加密AES算法的密钥，并用ECC实现数字签名，无线数据系统的接收端对接收的信息进行相应的数据解密，得到原始数据。这样既能快速地进行数据加解密，又能很好地解决密钥分配问题，同时也能完成数字签名与验证功能，具有需求存储空间小、运算速度快、带宽需求低、密钥管理方便等优点，非常适合于无线通信网络环境下的数据加解密通信。