期刊文献+
共找到7篇文章
< 1 >
每页显示 20 50 100
A SCALABLE HYBRID MODULAR MULTIPLICATION ALGORITHM
1
作者 Meng Qiang Chen Tao +1 位作者 Dai Zibin Chen Quji 《Journal of Electronics(China)》 2008年第3期378-383,共6页
Based on the analysis of several familiar large integer modular multiplication algorithms, this paper proposes a new Scalable Hybrid modular multiplication (SHyb) algorithm which has scalable operands, and presents an... Based on the analysis of several familiar large integer modular multiplication algorithms, this paper proposes a new Scalable Hybrid modular multiplication (SHyb) algorithm which has scalable operands, and presents an RSA algorithm model with scalable key size. Theoretical analysis shows that SHyb algorithm requires m 2 n /2 + 2miterations to complete an mn-bit modular multiplication with the application of an n-bit modular addition hardware circuit. The number of the required iterations can be reduced to a half of that of the scalable Montgomery algorithm. Consequently, the application scope of the RSA cryptosystem is expanded and its operation speed is enhanced based on SHyb al- gorithm. 展开更多
关键词 modular multiplication Hybrid modular multiplication algorithm RSA SCALABLE
下载PDF
A New Fast Modular Arithmetic Method in Public Key Cryptography 被引量:1
2
作者 WANG Bangju ZHANG Huanguo 《Wuhan University Journal of Natural Sciences》 CAS 2006年第6期1645-1648,共4页
Modular arithmetic is a fundamental operation and plays an important role in public key cryptosystem. A new method and its theory evidence on the basis of modular arithmetic with large integer modulus-changeable modul... Modular arithmetic is a fundamental operation and plays an important role in public key cryptosystem. A new method and its theory evidence on the basis of modular arithmetic with large integer modulus-changeable modulus algorithm is proposed to improve the speed of the modular arithmetic in the presented paper. For changeable modulus algorithm, when modular computation of modulo n is difficult, it can be realized by computation of modulo n-1 and n-2 on the perquisite of easy modular computations of modulo n-1 and modulo n-2. The conclusion is that the new method is better than the direct method by computing the modular arithmetic operation with large modulus. Especially, when computations of modulo n-1 and modulo n-2 are easy and computation of modulo n is difficult, this new method will be faster and has more advantages than other algorithms on modular arithmetic. Lastly, it is suggested that the proposed method be applied in public key cryptography based on modular multiplication and modular exponentiation with large integer modulus effectively 展开更多
关键词 public key cryptography modular arithmetic modular multiplication modular exponentiation
下载PDF
RESEARCH OF FAST MODULAR MULTIPLIER FOR A CLASS OF FINITE FIELDS 被引量:1
3
作者 Jin Yi'er Shen Haibin Chen Huafeng Yan Xiaolang 《Journal of Electronics(China)》 2008年第4期482-487,共6页
A new structure of bit-parallel Polynomial Basis(PB)multiplier is proposed,which isbased on a fast modular reduction method.The method was recommended by the National Instituteof Standards and Technology(NIST).It take... A new structure of bit-parallel Polynomial Basis(PB)multiplier is proposed,which isbased on a fast modular reduction method.The method was recommended by the National Instituteof Standards and Technology(NIST).It takes advantage of the characteristics of irreducible polyno-mial,i.e.,the degree of the second item of irreducible polynomial is far less than the degree of thepolynomial in the finite fields GF(2m).Deductions are made for a class of finite field in which trino-mials are chosen as irreducible polynomials.Let the trinomial bex m +x k+1,where 1 ≤k≤?m/2?.??The proposed structure has shorter critical path than the best known one up to date,whilethe space requirement keeps the same.The structure is practical,especially in real time crypto-graphic applications. 展开更多
关键词 Fast modular multiplication Bit-parallel multiplier Trinomials
下载PDF
The RSA Cryptoprocessor Hardware Implementation Based on Modified Montgomery Algorithm 被引量:2
4
作者 陈波 王旭 戎蒙恬 《Journal of Shanghai Jiaotong university(Science)》 EI 2005年第2期107-111,共5页
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 arch... 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 cryptoprocessor 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. 展开更多
关键词 Montgomery algorithm modular multiplication modular exponentiation
下载PDF
FPGA IMPLEMENTATION OF RSA PUBLIC-KEY CRYPTOGRAPHIC COPROCESSOR BASED ON SYSTOLIC LINEAR ARRAY ARCHITECTURE 被引量:2
5
作者 Wen Nuan Dai Zibin Zhang Yongfu 《Journal of Electronics(China)》 2006年第5期718-722,共5页
In order to make the typical Montgomery’s algorithm suitable for implementation on FPGA, a modified version is proposed and then a high-performance systolic linear array architecture is designed for RSA cryptosystem ... In order to make the typical Montgomery’s algorithm suitable for implementation on FPGA, a modified version is proposed and then a high-performance systolic linear array architecture is designed for RSA cryptosystem on the basis of the optimized algorithm. The proposed systolic array architecture has dis- tinctive features, i.e. not only the computation speed is significantly fast but also the hardware overhead is drastically decreased. As a major practical result, the paper shows that it is possible to implement public-key cryptosystem at secure bit lengths on a single commercially available FPGA. 展开更多
关键词 RSA Montgomery's algorithm Systolic linear array modular multiplication modular exponentiation
下载PDF
Secure and Energy Efficient Design of Multi-Modular Exponential Techniques for Public-Key Cryptosystem
6
作者 Utkarsh Tiwari Satyanarayana Vollala +2 位作者 N.Ramasubramanian B.Sameedha Begum G.Lakshminarayanan 《Journal of Communications and Information Networks》 EI CSCD 2022年第3期309-323,共15页
The present paper proposes a secure design of the energy-efficient multi-modular exponential techniques that use store and reward method and store and forward method.Computation of the multi-modular exponentiation can... The present paper proposes a secure design of the energy-efficient multi-modular exponential techniques that use store and reward method and store and forward method.Computation of the multi-modular exponentiation can be performed by three novel algorithms:store and reward,store and forward 1-bit(SFW1),and store and forward 2-bit(SFW2).Hardware realizations of the proposed algorithms are analyzed in terms of throughput and energy.The experimental results show the proposed algorithms SFW1 and SFW2 increase the throughput by orders of 3.98% and 4.82%,reducing the power by 5.32% and 6.15% and saving the energy in the order of 3.95% and 4.75%,respectively.The proposed techniques can prevent possible side-channel attacks and timing attacks as a consequence of an inbuilt confusion mechanism.Xilinx Vivado-21 on Virtex-7 evaluation board and integrated computer application for recognizing user services(ICARUS)Verilog simulation and synthesis tools are used for field programmable gate array(FPGA)for hardware realization.The hardware compatibility of proposed algorithms has also been checked using Cadence for application specific integrated circuit(ASIC). 展开更多
关键词 public-key cryptography RSA multimodular exponentiation modular multiplication Montgomery multiplication
原文传递
Solving Low-Density Multiple Subset Sum Problems with SVP Oracle 被引量:2
7
作者 PAN Yanbin ZHANG Feng 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2016年第1期228-242,共15页
It is well known that almost all subset sum problems with density less than 0.9408… can be solved in polynomial time with an SVP oracle that can find a shortest vector in a special lattice.In this paper,the authors s... It is well known that almost all subset sum problems with density less than 0.9408… can be solved in polynomial time with an SVP oracle that can find a shortest vector in a special lattice.In this paper,the authors show that a similar result holds for the k-multiple subset sum problem which has k subset sum problems with exactly the same solution.Specially,for the single subset sum problem(k=1),a modified lattice is introduced to make the proposed analysis much simpler and the bound for the success probability tighter than before.Moreover,some extended versions of the multiple subset sum problem are also considered. 展开更多
关键词 Lattice low-density multiple modular subset sum problem multiple subset sum problem
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部