A Note on Shor''s Quantum Algorithm

Shor proposed a polynomial time algorithm for computing the order of one element in a multiplicative group using a quantum computer. Based on Miller's randomization, he then gave a factorization algorithm. But the algorithm has two shortcomings, the order must be even and the output might be a trivial factor. Actually, these drawbacks can be overcome if the number is an RSA modulus. Applying the special structure of the RSA modulus,an algorithm is presented to overcome the two shortcomings. The new algorithm improves Shor's algorithm for factoring RSA modulus. The cost of the factorization algorithm almost depends on the calculation of the order of 2 in the multiplication group.     

实时网上交易的数据安全方案探讨

提出了一种新的网上交易方法，并给出了这种方法的实现步骤，拓展了电子商务的功能。并且针对这种网上交易方法中的数据安全问题进行了深入探讨，提出了相应的解决方案。该方案便于实施而又具备高安全性和可行性。可以满足实际应用的需要。     

一种基于RSA的有序多重数字签名方案

提出了一种基于RSA的有序多重数字签名方案,该方案能够允许多个用户顺序地对一份文件进行签名,最后形成一个群体签名;并提出一种新的签名验证方案,可以有效地防止成员的欺诈行为,因而更具有安全性和实用性.     

利用DES和RSA加密算法实现JAVA软件的注册授权策略

通过JNI接口调用本地应用程序读取用户主机的硬盘序列号作为用户唯一性依据,利用RSA加密算法实现用户信息和注册信息的加密保护和验证。本文介绍了在商用JAVA软件开发过程中可以使用的一种注册验证策略的实现方法。     

A Note on Shor’s Quantum Algorithm

Introduction Factoring integers is generally thought to behard on a classical computer. But it is now heldthat prime factorization can be accomplished inpolynomial time on a quantum computer. This re-markable work is due to Shor[1]. For a given num-ber n, he gave a quantum computer algorithm forfinding the order r of an element x (mod n) insteadof giving a quantum computer algorithm for factor-ing n directly. The indirect algorithm is feasiblebecause factorization can be reduced to finding th…     

数字签名技术

探讨网络信息安全非对称加密中典型的数字签名技术，着重阐述数字签名方法特点、重要应用、RSA算法实现、安全性分析及研究方向。     

公钥密码体制研究综述

公钥密码体制对于保证网络信息安全起到了非常重要的作用,本文结合笔者学习密码学基础的一些体会,对公钥密码体制的基本概念,发展现状、及未来的发展展望做个简单地概述。     

基于注册码的软件加密方法

本文介绍了在网络上大行其道的注册码(序列号)软件加密方法,并给出了一个基于Visual C 6.0开发平台和非对称加密算法RSA的实例.该方法可实现一台计算机一个注册码,解密难度大,从而较为有效的防止非法用户,而且实现容易,几乎不需要额外的成本.     

A universal composability framework for analysis of proxy threshold signature

The universal composability framework is a new approach for designing and analyzing the security of cryptographic protocols. In this framework, the security of protocols is maintained under a general protocol composition operation. In the paper, we propose the universal composability framework for the analysis of proxy threshold signature and present a universally composable secure proxy threshold signature scheme which is the first one in this area. The proposed scheme is suitable for the mobile agents, which should migrate across different environment through network. Furthermore, we give the concrete analysis of the reduction to prove the security of the proposed scheme.     

A NEW RSA CRYPTOSYSTEM HARDWARE IMPLEMENTATION BASED ON MONTGOMERY‘S ALGORITHM

IntroductionData security is becoming a more and more im-portantissue nowadays with the ever- creasing pop-ularity of electronical communication[1] . The fun-damental security requirements include confiden-tiality,authentication,data integrity,and nonre-pudiation.To provide such security services,mostsystems use public key cryptography. Among thevarious public key cryptography algorithms,theRSA cryptosystem is the bestknown,most versa-tile,and widely used public key cryptosystem to-day.In pu…