椭圆曲线密码体制是公钥密码体制研究的热点。
Elliptic curve cryptosystem is a hot topic in public key cryptosystems.
首先提出一个基于椭圆曲线密码体制的签密方案。
In this paper, a signature encryption scheme based on ellipse curve cryptosystem is proposed.
除子标量乘是超椭圆曲线密码体制中的关键运算。
Divisor scalar multiplication is the key operation in hyperelliptic curve cryptosystem.
椭圆曲线密码体制高速实现的关键是点的数乘与加法。
The center to the implementation of elliptic curve cryptosystems efficiently lies in the arithmetic of scalar multiplication and addition.
本文提出一种基于椭圆曲线密码体制的3g认证协议。
A 3g authentication protocol based-on the elliptic curve cryptosystem is presented in this article.
设计了一种基于该椭圆曲线密码体制的用户身份认证方案。
Design a user identity authentication scheme based on the elliptic curve cryptosystem.
椭圆曲线密码体制是一种基于代数曲线的公开钥密码体制。
Elliptic curve cryptosystem is a kind of public-key cryptosystem based on algebra curve.
提出了一种高效的基于椭圆曲线密码体制的联合签名方案。
An efficient Shared signature based on elliptic curve cryptography is presented.
该文提出一种利用椭圆曲线密码体制（ECC）智能卡公钥方案。
This paper gives a solution by using Elliptic Curve Cryptosystem(ECC)as the public key scheme.
文章提出一种利用椭圆曲线密码体制(ECC)加密卡硬件方案。
This paper gives a hardware solution to encryption card by using Elliptic Curve Cryptosystem (ECC) as the public key scheme.
在椭圆曲线密码体制的实现中，选取安全的椭圆曲线是首要问题。
In the implementation of the elliptic curve cryptosystem, we first have to select a secure elliptic curve.
椭圆曲线密码体制的实现速度依赖于曲线上标量乘法的运算速度。
The fast implementation of elliptic curve cryptosystems relies on the efficient computation of scalar multiplication.
基于椭圆曲线密码体制建立了几个具有语义安全的可转换签密方案。
Several convertible signcryption schemes with semantic security based on elliptic curve cryptosystem were proposed.
椭圆曲线密码体制(ECC)是一种基于代数曲线的公钥密码体制。
Elliptic curve cryptosystem (ECC) is a kind of public-key cryptosystem based on algebraic curve.
基于椭圆曲线密码体制建立了几个具有语义安全的可转换签密方案。
Several convertible signcryption schemes with semantic security based on elliptic curve cryptosystem are proposed.
作者以椭圆曲线密码体制为基础，完成了该事务数字签名算法的实现。
We implement the algorithm of transaction signature, base on Elliptic Curve Cryptography.
安全的椭圆曲线构造和基点的选取，是椭圆曲线密码体制实现的的关键。
Point out that the secure elliptic curve is the master key of constructing the elliptic curve cryptosystem.
该文基于超椭圆曲线密码体制提出了一个单向签名方案，并分析了其安全性。
A directed digital signature based on hyper elliptic curve cryptosystems was proposed and the security was discussed.
椭圆曲线密码体制具有密钥短，安全性高的特点，十分适合在智能卡上使用。
ECC has the advantages of short key and high level of security, so it is quite suitable for using on smart card.
椭圆曲线密码体制是目前公钥体制中每比特密钥安全强度最高的一种密码体制。
Elliptic Curve Cryptography (ECC) has the highest safety strength of private key per bit in the Public-Key Cryptography recently.
椭圆曲线密码体制因其具有密钥短、开销小的优点，非常适合应用于移动通信设备。
ECC (Elliptical Curve Crypto system) is suit for the mobile communication equipment for its advantage of short key and low cost.
首次在射影坐标系下对亏格为3的超椭圆曲线密码体制推导了无需求逆的明确公式。
For the first time, the inversion-free explicit formulae are derived for genus 3 HECC in projective coordinate system.
协商过程采用椭圆曲线密码体制和双线性对来实施，能够对不诚实节点进行检测和鉴别。
Elliptic curve cryptography and bilinear pairing is employed in the agreement, the dishonest node can be detected and identified.
安全椭圆曲线的选取和标量乘法的快速计算是有效实现椭圆曲线密码体制的两个主要问题。
The selection of secure elliptic curves and the scalar multiplications of elliptic curves are two important problems in the practice of efficiently implementing an elliptic curve cryptosystems.
自椭圆曲线密码体制提出以后，经过众多密码学者十多年的研究，取得了丰富的研究成果。
ECC has been studied for more than ten years since it had been proposed, and many results have been made by the cipher scholars.
在椭圆曲线密码体制(ECC)中，无论是最终性能或是存储需求，最优扩域都具有明显优势。
In Elliptic Curves Cryptosystems (ECC), the optimal extension fields is preferable to others method, whether concerns performance or memory request.
为了实际应用的需要，本文设计了实现椭圆曲线密码体制所需的并行环境，并建立了并行算法。
For the needs of practical application, this paper designed a necessary parallel architecture of realizing elliptic curve cryptosystem and designed the parallel algorithm.
实现椭圆曲线密码体制还有一个关键的步骤，就是椭圆曲线有限群基点选取算法的设计与实现。
In the implementation of elliptic curve cryptosystem, one of the key steps is to design and implement the base-point choice algorithm of elliptic curve finite group.
通过对椭圆曲线密码体制的研究，将快速实现椭圆曲线密码的问题归结为标量乘法的实现效率。
By investigating the elliptic curve cryptosystems, the problems are reduced the fast computations of scalar multiplication of the elliptic curve.
椭圆曲线密码体制中，最耗时的运算是倍点运算也就是椭圆曲线上的点与一个整数的乘法运算。
The operation consume most time is multiplication of a point on the elliptic curve with an integer in the system, which was called multiple point operation.
应用推荐