ecdsa造句
例句与造句
- in this thesis, we propose a variant of the ansi x9.62 ecdsa
摘要本篇?文主要目的在探讨椭圆曲线版的?位签署。 - ecdsa public key cryptography for the financial services industry : the elliptic curve digital signature algorithm
金融服务业用公开密钥加密：椭圆曲线数字签名规则 - the next chapter includes the elliptic curve version of dsa, and finally a variant of ecdsa will be given in chapter 5
紧接着介绍椭圆曲线版的?位签署(ecdsa)以及我们所提出的一个改良版本。 - in addition, we implement and analyze one ecdsa prototype by the object-oriented method and the unified modeling language uml, respectively
第三是采用面向对象方法实现一个椭圆曲线数字签名系统原型，并采用统一建模语言uml对系统原型进行分析并建模。 - the method we have developed can be applied in similar systems based on dsps, and it is a complement of the ecdsa in gf ( p ) which we realized on tms320c6201
此方法也可以推广应用在基于dsp的应用系统中，作为对我们在tms320c6201上实现的特征为p的ecdsa体制的补充。 - It's difficult to find ecdsa in a sentence. 用ecdsa造句挺难的
- in virtue of fpga product has the characteristic of field programmable, we can perform the ecdsa implementation with different bits according to modification the parameter of the source code
由于fpga器件具有现场可编程的特点，所以可以通过修改源程序的参数，就可以实现对不同位数的ecdsa的实现。 - 66 msec for one 192-bit ecdsa verification in gf ( p ) in the same system . in addition, ecc is widely adopted in the smart cards . therefore, we have proposed and accomplished a fast algorithm of ecdsa in gf ( 2m ) on a single chip based on the mcs51 kernel
另外，针对椭圆曲线密码(ecc)在智能卡等领域的广阔应用，本文还提出了一种特征为2的ecdsa体制的快速算法，并在基于mcs51内核的单片机系统中实现了该算法。 - 66 msec for one 192-bit ecdsa verification in gf ( p ) in the same system . in addition, ecc is widely adopted in the smart cards . therefore, we have proposed and accomplished a fast algorithm of ecdsa in gf ( 2m ) on a single chip based on the mcs51 kernel
另外，针对椭圆曲线密码(ecc)在智能卡等领域的广阔应用，本文还提出了一种特征为2的ecdsa体制的快速算法，并在基于mcs51内核的单片机系统中实现了该算法。 - the elliptic curve digital signature algorithm ( ecdsa ) is the elliptic curve analogue of the digital signature algorithm ( dsa ) . it was accepted in 1999 as an ansi standard, and was accepted in 2000 as ieee and nist standards . unlike the ordinary discrete logarithm problem and the integer factorization problem, no subexponential-time is known for the elliptic curve discrete logarithm problem . for this reason, the strength-per-key-bit is substantially greater in an algorithm that uses elliptic curves
椭圆曲线数字签名算法（ecdsa）是数字签名算法（dsa）的椭圆曲线对等。它先后成为ansi，ieee，nist和iso的标准，而且其它的一些组织正在考虑成为其标准。不象普通的离散对数问题和因数分解问题，椭圆曲线离散对数问题没有已知的亚指数算法，所以使用椭圆曲线的算法在密钥的位强度是足够高的。 - in this article, we study the implemetation of fpga for elliptic curve digital signature algorithm . based on number thesis 、 abstract algebra and complex thesis ， integrated information theory 、 cryptography and some specific relevant algorithm ， we ascertain the implementation of ecdsa for hardware project ： according to the design idea of hiberarchy and modularization, we adopt very high speed ic hardware description language ( vhdl ) as design input and simulate the design in every level and every model for the correct of the fundamental design . after finish the top design, we perform the whole simulation . then ， we carry out the timing simulation after the logic synthes and layout
本文从实际应用出发，研究了椭圆曲线数字签名算法的fpga的实现：以基本的数论理论、抽象代数和复杂度理论为依据，结合信息论、密码学的一些知识以及一些具体的相关算法，确定了ecdsa的硬件实现方案：按照层次化、模块化的设计思想，采用硬件描述语言vhdl作为设计输入进行ecdsa的硬件设计；在每个设计层次和每个模块都进行了仿真验证，得以保证底层设计的正确性。在确保每个模块的设计正确后，完成对电路的顶层设计，进行总体的仿真。 - signature and verification systems, such as ecdsa etc, the discuss about key exchange systems such as deffie-hellman systeme, etc . this thesis also discussed several applications and information safety products of the elliptic curve cryptosystems at the finite field too, such as digital signature, the group signature, the application in the smart card
ecdsa等签名验证体制的选取，deffie-hellman等密钥交换体制的研究。论文也讨论了基于有限域上椭圆曲线公钥密码系统的若干应用和信息安全产品，如数字签名，组签名，在智能卡中的应用。 - firstly, we generalize and analyze the advantages and present research of elliptic curve cryptography; secondly, we study the basic theory of the ecc; thirdly, we illustrate the safety of the ecc and discuss the elliptic curve key agreement scheme, elliptic curve encryption scheme and elliptic curve digital signature algorithm; fourthly, we study fast algorithms of the multiplication and inversion multiplication of the element of in the underlying finite field f2m whose characteristic is two represented by the two basis of optimal normal basis and polynomial basis . we make improvements to the fast algorithm of the polynomial basis multiplication by hankerson and base on the experiments, we describe the properties and compare the advantages of the multiplication and inversion multiplication of the elements in f2m field under optimal normal bases and polynomial basis . results concluding from the study car be used as references in the realization of the elliptic curve cryptosystem; fifthly, we overview the current fast algorithm of point multiplication, improve the fix base point comb algorithm, advance the speed of the whole system and remark the advantages and disadvantages of the popular algorithms based upon the experimental datas; sixthly we realize the algorithm library of elliptic curve cryptography based on the f2m . only change slightly in our algorithm library can we realize the ecdh, eces, ecdsa based onf2m of anysize; seventhly, we realize the ecc on two secure elliptic curves, including ecdh, eces, ecdsa
本文首先介绍并分析了椭圆曲线密码体制的优点及研究现状；其次研究了椭圆曲线密码体制的基本理论；第三，分析了椭圆曲线密码的安全性并介绍了密钥共享，加密，数字签名等椭圆曲线密码体制；第四，深入研究了特征为2的有限域f_2m中的元素在多项式基和最优正规基表示下的乘法运算和乘法逆运算的快速算法，并对hankerson等人提出的多项式基下的乘法运算的快速算法作了改进，而且在实验的基础上不仅分析研究了f_2m域中元素在多项式基和最优正规基表示下的乘法和乘法逆运算的性能，还对这两种基表示下的f_2m域中元素运算效率的优劣作了比较和研究，所得的结论可供在实现椭圆曲线密码体制时参考；第五，研究了目前流行的计算椭圆曲线标量乘法的快速算法，同时改进了固定基点梳形法，提高了整个系统的速度，并在实验的基础上分析研究了流行算法的优劣；第六，实现了基于f_2m的椭圆曲线密码体制的算法库，在我们的算法库中只需稍微改变便能实现基于任意尺寸的f_2m上的ecdh，eces，ecdsa等椭圆曲线密码体制；第七，实现了两条安全椭圆曲线上的椭圆曲线密码体制，包括ecdh，eces，ecdsa。 - firstly, we generalize and analyze the advantages and present research of elliptic curve cryptography; secondly, we study the basic theory of the ecc; thirdly, we illustrate the safety of the ecc and discuss the elliptic curve key agreement scheme, elliptic curve encryption scheme and elliptic curve digital signature algorithm; fourthly, we study fast algorithms of the multiplication and inversion multiplication of the element of in the underlying finite field f2m whose characteristic is two represented by the two basis of optimal normal basis and polynomial basis . we make improvements to the fast algorithm of the polynomial basis multiplication by hankerson and base on the experiments, we describe the properties and compare the advantages of the multiplication and inversion multiplication of the elements in f2m field under optimal normal bases and polynomial basis . results concluding from the study car be used as references in the realization of the elliptic curve cryptosystem; fifthly, we overview the current fast algorithm of point multiplication, improve the fix base point comb algorithm, advance the speed of the whole system and remark the advantages and disadvantages of the popular algorithms based upon the experimental datas; sixthly we realize the algorithm library of elliptic curve cryptography based on the f2m . only change slightly in our algorithm library can we realize the ecdh, eces, ecdsa based onf2m of anysize; seventhly, we realize the ecc on two secure elliptic curves, including ecdh, eces, ecdsa
本文首先介绍并分析了椭圆曲线密码体制的优点及研究现状；其次研究了椭圆曲线密码体制的基本理论；第三，分析了椭圆曲线密码的安全性并介绍了密钥共享，加密，数字签名等椭圆曲线密码体制；第四，深入研究了特征为2的有限域f_2m中的元素在多项式基和最优正规基表示下的乘法运算和乘法逆运算的快速算法，并对hankerson等人提出的多项式基下的乘法运算的快速算法作了改进，而且在实验的基础上不仅分析研究了f_2m域中元素在多项式基和最优正规基表示下的乘法和乘法逆运算的性能，还对这两种基表示下的f_2m域中元素运算效率的优劣作了比较和研究，所得的结论可供在实现椭圆曲线密码体制时参考；第五，研究了目前流行的计算椭圆曲线标量乘法的快速算法，同时改进了固定基点梳形法，提高了整个系统的速度，并在实验的基础上分析研究了流行算法的优劣；第六，实现了基于f_2m的椭圆曲线密码体制的算法库，在我们的算法库中只需稍微改变便能实现基于任意尺寸的f_2m上的ecdh，eces，ecdsa等椭圆曲线密码体制；第七，实现了两条安全椭圆曲线上的椭圆曲线密码体制，包括ecdh，eces，ecdsa。 - then, it introduce several cryptographic protocol based on elliptical curve, including diffie-hellman key switching, elgamal encryption and decryption, elgamal digital signature, ecdsa, etc . based on these, the author analyze kinds of security threat faced to 3g system and discuss the security rule and security objectives
然后介绍了基于椭圆曲线的几种密码协议，包括diffie?hellman密钥交换，elgamal加解密，elgamal数字签名，ecdsa等协议。在此基础之上，分析了3g系统面临的各种安全威胁并对系统的安全原则和安全目标进行了讨论。 - the main contributions of the dissertation are summarized as follows . ( 1 ) elliptic curve cryptosystems in optimal extension fields ( oef ), including elgamal encryption algorithm, diffie-hellman key agreement scheme and elliptic curve digital signature algorithm ( ecdsa ), are implemented, and a software package, which is applicable to microcomputers, is developed
本文所取得的主要研究成果是：(1)完整实现最优扩域oef上的椭圆曲线密码体制，其中包括elgamal加密算法、diffie-hellman密钥共享方案以及椭圆曲线数字签名算法ecdsa，并且提供了相应的适合在微机上实现的软件包。