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…     

基于频率的大素数高效生成算法

公钥密码体制加解密算法基于两个大素数乘积的难分解性.为了提升大素数生成算法的效率和降低算法的报错率,提出了一种基于概率论的方法,通过优化Eratosthenes筛法构建素数库,从而通过分析素数库中素数尾数的分类频数和表达式下素数频率,再通过对素数检验算法进行分析,最后得到一种高效的大素数生成算法.在算法中,任意初始的整...     

基于分数阶微分的医学图像边缘检测方法

医学图像边缘检测是医学图像处理和分析的关键步骤,它的清晰程度直接影响到医生诊断的速度以及准确性.传统边缘检测算子对噪声敏感,检测到的图像边缘效果不够理想,得到的图片边缘有可能模糊不清,为了克服传统边缘检测算子对噪声敏感的缺点,给出了一种改进的基于分数阶微分算法的医学图像边缘检测方法,实验结果表明:该方法不仅有效的提取了图像边缘特征,而且对噪声具有较好的抑制作用.是一种有效的医学图像边缘检测方法.     

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…     

SMO算法在邮件过滤中的应用

针对传统的支持向量机(SVM)算法在速度方面的缺陷,本文提出将序列最小优化(SMO)算法引人到垃圾邮件过滤系统中,实验结果证明,该模型训练时间快,过滤效果好.     

方程组系数矩阵的递归分块分解算法的设计实现

将方程组系数矩阵的LR分解算法过程加以改进,加入递归算法,使矩阵产生分块。用MATLAB和C语言对2种算法进行比较,发现递归分解法比LR分解算法速度快,占用内存少,适合当今分层多级存储的计算机结构。     

Adaptive Identification of Logging Lithology Based on VPSO-ENN Hybrid Algorithm

Particle swarm optimization (PSO) was modified by variation method of particle velocity, and a variation PSO (VPSO) algorithm was proposed to overcome the shortcomings of PSO, such as premature convergence and local optimization. The VPSO algorithm is combined with Elman neural network (ENN) to form a VPSO-ENN hybrid algorithm. Compared with the hybrid algorithm of genetic algorithm (GA) and BP neural network (GA-BP), VPSO-ENN has less adjustable parameters, faster convergence speed and higher identification precision in the numerical experiment. A system for identifying logging parameters was established based on VPSO-ENN. The results of an engineering case indicate that the intelligent identification system is effective in the lithology identification.     

基于时间约束的铁路空车调配模型与算法

为弥补现有的调配方法没有考虑排空站重车运输资源的利用率和空车调配的时效性的不足，在传统空车调配数学模型的基础上，提出了基于时问约束的空车调配模型和求解算法．通过合理利用排空站可利用的空车，将空车和重车结合起来优化调配，达到减少空车走行距离的目的．算例分析表明了模型的正确性和算法的合理性．     

The RSA Cryptoprocessor Hardware Implementation Based on Modified Montgomery Algorithm

RSA (Rivest-Shamir-Adleman)public-key cryptosystem is widely used in the information security area such as encryption and digital signature. Based on the modified Montgomery modular multiplication algorithm, a new architecture using CSA(carry save adder)was presented to implement modular multiplication. Compared with the popular modular multiplication algorithms using two CSA, the presented algorithm uses only one CSA, so it can improve the time efficiency of RSA eryptoproeessor and save about half of hardware resources for modular multiplication. With the increase of encryption data size n, the clock cycles for the encryption procedure reduce in T(n^2), compared with the modular multiplication algorithms using two CSA.     

基于实数编码遗传算法的桥梁有限元模型修正方法

为克服传统桥梁有限元模型修正迭代优化过程中存在的局部收敛和提高模型修正精度, 提出了联合实数编码遗传算法与静动力实测数据的有限元模型修正方法; 引入四边形等参元理论和牛顿迭代法编制宏命令, 实现有限元模型中车辆荷载的快速自动加载; 基于结构有限元模型静动力特性构造目标函数, 以实数编码遗传算法为优化策略, 采用MATLAB平台建立了有限元模型修正框架; 通过对一个简支框架结构的数值模拟, 对比了所提出优化方法与其他方法的收敛效率和修正结果, 以验证所提出方法的有效性; 采用拉丁超立方体抽样分析了有限元模型参数变化对桥梁动力响应的影响, 以确定待修正参数, 并采用所提方法修正了一座改建的空心板桥梁的实体有限元模型。分析结果表明: 零阶算法和一阶算法对参数的敏感性和修正范围依赖大, 选用敏感性较小的参数或者参数修正范围大于50%将会导致错误的修正结果; 实数编码遗传算法对初始输入不敏感, 可避免局部收敛的情况; 采用灵敏度分析得到的主要待修正参数有空心板弹性模量、现浇层弹性模量以及支座横桥向和顺桥向的约束刚度; 修正后的空心板弹性模量增幅约为19.13%, 现浇层弹性模量增幅约为16.00%, 横向约束刚度增幅约为46.21%, 纵向约束刚度增幅约为72.72%, 修正后的有限元模型的静动力特性与实测响应吻合良好, 各测点静力响应误差均小于4%, 动力响应误差小于3%。     

云遗传算法

为了克服传统遗传算法搜索速度慢、易陷入局部最优解的缺陷，借鉴遗传算法的思想，利用云模型云滴的随机性和稳定倾向性的特点，提出了一种新的遗传算法——云遗传算法（CGA）．该算法由正态云模型的Y条件云发生器实现交叉操作，由基本云发生器实现变异操作．最后，进行了函数优化实验，并与标准遗传算法（SGA）和自适应遗传算法（AGA）进行了比较，以证明其有效性．     

基于EDV-Hop的免测距定位算法研究

为了更好地提高无线传感器网络节点定位精度,降低定位成本,针对APS算法存在的不足,提出一种新的免测距定位算法EDV-Hop,通过限制跳数实现局部范围内的定位信息提取,同时调整平均每跳距离,以此提高定位精度。在网络随机部署和任意节点密度的条件下估算节点位置,并从精度和有效性两个方面进行度量。仿真结果表明,EDV-Hop算法比DV-Hop具有更好的定位性能,它能够减少节点间通信量,降低通信成本,提高定位精度。     

DESIGN OF A DIGITAL SIGNATURE SCHEME BASED ON FACTORING AND DISCRETE LOGARITHMS

Objective Focusing on the security problem of authentication and confidentiality in the context of computer networks, a digital signature scheme was proposed based on the public key cryptosystem. Methods Firstly,the course of digital signature based on the public key cryptosystem was given. Then, RSA and ELGamal schemes were described respectively. They were the basis of the proposed scheme. Generalized ELGamal type signature schemes were listed. After comparing with each other, one scheme, whose Signature equation was (m r)x=j s modФ(p) , was adopted in the designing. Results Based on two well-known cryptographic assumptions, the factorization and the discrete logarithms, a digital signature scheme was presented. It must be required that s“ was not equal to p‘q“ in the signing procedure, because attackers could forge the signatures with high probabilities if the discrete logarithms modulo a large prime were solvable. The variable public key “e“ is used instead of the invariable parameter “3“ in Ham‘s signature scheme to enhance the security. One generalized ELGamal type scheme made the proposed scheme escape one multiplicative inverse operation in the signing procedure and one modular exponentiation in the verification procedure.Conclusion The presented scheme obtains the security that Harn‘s scheme was originally claimed. It is secure if the factorization and the discrete logarithms are simultaneously unsolvable.     

Cryptanalysis and Improvement of Digital Multisignature Scheme Based on RSA

Introduction Multisignature is a joint signature generated by agroup of signers. The group has a security policy thatrequires a multisignature to be signed by all groupmembers with the knowledge of multiple privatekeys. Digital multisignatures should have…     

An Improved Singularity Computing Algorithm Based on Wavelet Transform Modulus Maxima Method

IntroductionA recent finding is that noise signal may con-tain hidden information.Such information promis-es to be of application value(forecasting suddencardiac death in patients,or analyzing financialmarkets fluctuation,or predicting the properties ofelectric devices).We must use some approachesfor extracting such hidden information from noise.Conventional approaches include analysis ofmeans,standard deviations and other features ofhistograms,along with classical power spectrumanalysis.Thos…     

基于拟力法的框架结构静力推覆分析

传统静力推覆分析方法求解结构非线性变形需对结构整体刚度矩阵进行实时地合成与分解,该过程将占用大量计算资源.基于拟力法的纤维梁有限元分析方法进行静力推覆分析,在迭代求解结构非线性变形时,首先对弹性刚度矩阵进行分解,计算出侧向荷载作用下的弹性位移;然后通过反复调用弹性刚度矩阵的分解结果与弹性位移,减少回代计算量;最后采用算法时间复杂度理论定量对比了该方法与传统方法的计算效率,通过一榀八层钢筋混凝土框架结构数值算例,分析比较了两种方法的计算结果与算法时间复杂度.结果表明:两种方法顶点位移-基底剪力曲线基本吻合,层间位移角与楼层之间的关系曲线也基本一致,两者的最大误差出现在第3层,为3.72%,与传统方法相比,基于拟力法的静力推覆分析方法算法时间复杂度降低了80%,计算效率至少是传统方法的5倍.     

基于转向的Logit交通分配算法

为避免交通分配中传统的网络扩展法在处理转向延误时的缺陷,通过分析网络基本要素节点、路段和转向之间的拓扑关系,借鉴Dial算法的基本框架,设计了一个基于转向的Logit交通分配算法。该算法以源点至路段的含转向延误的最短路径长度为依据处理各条路段,正向计算转向权重,反向分配路段流量和转向流量。算法计算结果与Logit路径流量和Dial算法数据相一致,该算法可直接求解既满足Logit路径选择概率又考虑转向延误对交通分配影响的路段流量和转向流量模式,而且Dial算法是其在转向延误为零时的一个特例。     

基于双群进化策略的多项式近似因式分解

针对传统算法在解决多项式的因式分解过程中,存在着只适用于精确分解而不适合系数为浮点数的多项式的因式分解问题,文中提出一种应用双种群双突变进化策略来对浮点数多项式近似分解的算法,克服了传统算法不能解决浮点数多项式的因式分解的弊端.数值计算结果表明该算法收敛速度快、精度高、稳定性强.     

用限制性代理盲签名构造多银行电子现金系统

为克服基于群签名思想的多银行电子现金的不足,并提高效率,把盲签名的限制性假设与代理盲签名结合,提出了限制性代理盲签名的概念.根据此概念可构造多个银行参与发行的、公正的电子现金系统.在正常情况下,合法用户的匿名性得到保护,在特殊情况(如法律强制要求)下,发币银行在中央银行的帮助下,可以撤销用户的匿名性.     

优化端元提取方法的高光谱混合像元分解

高光谱图像的混合像元分解将原始图像分解为多种纯净地物及相应的丰度,端元提取是混合像元分解的关键技术. 针对传统算法计算速度慢、搜索范围较大的特点,基于改进的ICA （independent component analysis）算法以及优化的候选端元判断方法,提出了一种优化的混合像元分解方法. 首先使用改进的算法优化端元提取方法;然后利用相邻像素的光谱特征和空间特征信息,结合并行算法对候选端元进行优化;最后利用真实的高光谱数据对该方法的性能进行了验证. 验证结果表明:该方法能有效提高端元提取精度,降低复杂度,与经典的端元提取算法N-FINDER相比,准确度提高了3.55%,解混后得到的地物分类精度有了明显改善（总体分类精度提高了2.88%）.