Greatest Common Divisor is one of the basic subjects in computational number theory, it has a wide application in encryption and analysis of cryptography.
最大公因子计算是计算数论的基础课题之一，它在密码算法和密码分析中有着非常广泛的应用。
In some detail, the paper expounds the principle about simple power analysis (SPA) attacks against the general cryptography and a particular theory against data encryption standard (DES) algorithm.
详细地阐述了对通用密码系统实施简易功耗分析攻击(SPA)的理论基础和对DES算法攻击的特定理论，并提出了对SPA的改进算法。
The analysis of security for the cryptography demonstrates the cryptography can resist the message replay attacks and man in the middle attacks, and is feasible in practice.
对该密码安全体制进行安全分析后表明：该体制能有效地抵御网络中的消息重放攻击和中间人攻击，并在实际应用中有较高的可行性。
His research interests include analysis of algorithms, computational complexity, cryptography and quantum computing.
他的研究方向包括算法分析、计算的复杂性，以及密码和量子计算等。
A dynamic password authentication which is based on the Chinese remainder theorem and RSA public-key cryptography are represented. Finally analysis is made on the scheme security and feasibility.
最后提出一种基于公钥密码和中国剩余定理的动态口令验证方案，进行方案安全性及性能的分析。
Analysis of finite field modular multiplication requirement of Elliptic Curve Cryptography (ECC), the application specific instruction for modular multiplication computation is designed in this paper.
针对椭圆曲线密码算法中有限域模乘运算的需求，提出其专用模乘指令。
Analysis of finite field modular multiplication requirement of Elliptic Curve Cryptography (ECC), the application specific instruction for modular multiplication computation is designed in this paper.
针对椭圆曲线密码算法中有限域模乘运算的需求，提出其专用模乘指令。
应用推荐