离散对数

我们知道，如果大规模的量子计算机能被制造出来，则所有基于配对、RSA以及离散对数的密码方案都是不安全的。

It is known that if large scale quantum computers can be realized , then all the cryptosystems which are based on Parings , RSA and DLP are not secure any more .

基于本文提出的门限签名方案，结合代理签名体制的特点，设计了一个基于离散对数问题的门限代理签名方案。

According to the presented threshold signature scheme in the thesis and the characteristics of proxy signature schemes , a threshold proxy signature scheme based on DLP is proposed .

基于离散对数公钥的（t，n）环签名的分析

Analysis on the t-out-of-n Ring Signatures from Discrete Logarithm Public Keys

基于离散对数的数字签名的（t，n）验证

Digital Signature with ( t , n ) Shared Verification Based on Discrete Logarithms

基于离散对数的（t，n）门陷共享验证签名方案

A ( t , n ) threshold shared verification signature scheme based on discrete logarithms

基于离散对数的动态（k，n）-门限方案

A dynamic ( k , n ) - threshold secret sharing scheme based on discrete logarithm

基于RSA与离散对数的门限群签名方案

A threshold group signature scheme based on RSA and discrete logarithm

一个基于离散对数、HASH函数和大数分解的访问控制协议

An Access Control Protocol Based on Discrete Logarithm , Hash Function and Factorization

限制后的Z（n，a）中离散对数问题仍然是困难的。

In this case , the discrete logarithm problem for Z_ ( n , a ) is also difficult .

在基于离散对数的安全机制的前提下讨论了（t，n）门限群签名方案。

This paper discusses the ( t , n ) threshold signature scheme based on the difficulty of solving the discrete logarithm problem .

算法空间中离散对数逻辑研究与Shank算法IP设计

The Discrete Logarithm Logic Research in the Algorithm Space and the IP Design of Shank Algorithm

Yang和Li提出了1个有效的基于离散对数和因子分解的签名方案，其安全性严格基于离散对数和因子分解两大困难问题之上。

Yang and Li proposed an efficient signature scheme that is strictly based on two hard problems of discrete logarithms and factoring .

最近Lee和Chang提出了一种基于离散对数的高效群签名方案。

Recently , Lee and Chang have proposed an efficient group signature scheme based on discrete logarithm problem .

对Ji和Li的基于椭圆曲线离散对数问题的代理多签名体制提出了两个伪造攻击。

Two forgery attacks presented on a proxy multi-signature scheme based on elliptic curves discrete logarithm problem proposed by Ji and Li .

提出了一个基于离散对数密码系统的（t，n）门限不可否认签名方案.该方案不仅安全、高效，而且不需要可信任方。

In this paper , based on discrete logarithm cryptosystem , a secure and efficient ( t , n ) threshold undeniable signature scheme without a trusted party is presented .

超椭圆曲线离散对数的WeilDescent代数攻击的分析

An analysis of Weil Descent algebraic attack on the hyperelliptic curves discrete logarithm

给出了一种新的（t，n）共享验证的认证加密方案，其安全性基于大数的因式分解和离散对数问题。

A new authenticated encryption scheme with dynamic ( t , n ) shared verification is presented , the security of which is based on the factoring and discrete logarithm problem .

基于RSA的因式分解和离散对数问题，文中提出了一种安全性高，具有良好特性的（t，n）门限群签名方案。

This paper proposes a new ( t , n ) threshold signature scheme with high security and good property based on factoring of RSA and discrete logarithm .

椭圆曲线加密体制（ECC）是一种基于椭圆曲线上的离散对数问题而设计的非对称公钥密码体制。

The security of Elliptic Curve Cryptography ( ECC ) is based on the difficulty of elliptic curve discrete logarithm .

基于离散对数的VES改进及在公平交换协议中的应用

The Betterment and Application in Fair Exchange of VES Based on Discrete Logarithm

采用此模型，对Fan等人提出的可否认认证协议的可否认性进行了分析和证明。（3）基于椭圆曲线的离散对数困难问题，提出一个非交互式可否认认证协议。

Apply this model to the proof of Fan et al deniable authentication protocol . ( 3 ) Based on elliptic curve discrete logarithm problem ; present a non-interactive deniable authentication protocol .

基于离散对数问题，提出了一个（t，n）门限签名-（k，m）门限验证的群签名方案。

Based on the discrete logarithm problem , a group signature scheme with a ( t , n ) threshold signature and a ( k , m ) threshold verification is proposed in this paper .

基于公钥密码思惟和PKI技术规范，本文提出了基于椭圆曲线离散对数题目的一次签名计划。

Based on the public key cryptosystem and PKI technology criterion , in the thesis , put forward a one-time signature scheme based on ECDLP .

基于离散对数问题和RSA公钥密码体制以及安全的单向函数，提出了一个安全的门限代理签名方案。

A new dynamic general secret sharing scheme , based on the RSA cryptosystem and the Pinch 's scheme , is proposed in this paper .

为了解决此问题，在基于离散对数难题和拉格朗日插值公式，提出了一个可动态调整门限值的（t，n）多秘密分享方案。

To overcome these problems , a ( t , n ) multi-secret sharing scheme based on the Discrete Logarithm Problem and Lagrange Interpolation Formula was proposed which could adjust the threshold value of a secret dynamically .

Shank算法是求解离散对数算法中比较快速且要求较少存储资源的一种算法。

Shark algorithm is a much more fast and resource-saving method in all the algorithms intended to solve discrete logarithm .

在离散对数困难问题的条件下，利用中国剩余定理来解密S2（方案2）。

Under the condition of the discrete logarithm problem , S_2 is decrypted by the Chinese Remainder Theorem ( scheme 2 ) .

它的安全性基于有限域上椭圆曲线离散对数问题（ECDLP）是一个困难的问题。

Its security is based on the difficulty of computing the discrete logarithm .

在离散对数和单向Hash函数安全性前提下，基于分组秘密共享方案设计了一种新的门限签名方案。

A new type ( t , n ) threshold group signature scheme with the security of the discrete logarithm and one-way Hash was proposed based on block secret sharing scheme .

椭圆曲线密码体制（ECC：EllipticCurveCryptosystem）是用有限域上的椭圆曲线有限群，代替基于离散对数问题密码体制中的有限群所得到的一类密码体制。

Elliptic curve cryptosystem is one of the most important cryptosystems , which is obtained by substituting finite group of elliptic curve on finite field for finite group of cryptosystem based on discrete logarithm problem .