Boolean permutations have important applications in the design of cryptosystems.
布尔置换在密码体制的设计中有着重要的应用。
Elliptic curve cryptosystems are one kind of the most promising public key cryptosystems.
椭圆曲线密码是目前最具潜力的一类公钥密码系统。
Modular exponentiation is the most common fundamental and time consuming operation in RSA public-key cryptosystems.
模幂运算是RSA公钥密码算法中最基本也是最耗时的运算。
The center to the implementation of elliptic curve cryptosystems efficiently lies in the arithmetic of scalar multiplication and addition.
椭圆曲线密码体制高速实现的关键是点的数乘与加法。
Because of the intrinsic relation between chaotic systems and cryptosystems, the idea of using digital chaotic ciphers has attracted more and more attention.
由于混沌理论和密码系统之间存在的自然联系,应用数字化混沌密码的想法得到了越来越多的关注。
In these cryptosystems, Euler totient functions play an important role.
在这些密码体制中,欧拉函数起着重要作用。
Elliptic curve cryptosystem is a hot topic in public key cryptosystems.
椭圆曲线密码体制是公钥密码体制研究的热点。
Boolean permutations are in very important applications in cryptosystems.
布尔置换在密码体制中有着非常重要的应用。
The obtained cryptosystem modifies the class of MC public key cryptosystems.
这种体制是一类MC公钥密码体制的改进。
Two threshold cryptosystems secure against chosen ciphertext attacks are proposed.
提出两个抗选择密文攻击的门限密码系统。
The RSA public-key cryptosystem is one of the widely used public-key cryptosystems.
RSA公钥密码体制是一种被广泛使用的公钥密码体制。
Cryptanalysis of two different kinds of symmetric chaotic cryptosystems is presented.
分别对两种对称混沌密码系统进行了密码分析。
Accordingly, the protocol security is rested on the used underlying public cryptosystems.
协议的安全性基于其使用的公钥加密方案。
In this dissertation the elliptic curve cryptosystems and the related algorithms are investigated.
本文主要研究椭圆曲线密码和其中的有关算法。
In this paper, we use a new method to show that generalized GM cryptosystems are polynomial secure.
本文用较独特的方法证明了广义GM体制是多项式安全的。
The RSA algorithm based on the numeric theory is the best encryption algorithm in public key cryptosystems.
RSA算法是基于数论的公钥密码体制,是公钥密码体制中最优秀的加密算法。
In this dissertation the elliptic curve cryptosystems and fast scalar multiplication algorithms are investigated.
本文主要研究了椭圆曲线公钥密码体制中标量乘法运算的快速算法。
A directed digital signature based on hyper elliptic curve cryptosystems was proposed and the security was discussed.
该文基于超椭圆曲线密码体制提出了一个单向签名方案,并分析了其安全性。
This paper proposes the concept of evolutionary cryptosystems and an evolutionary method for designing cryptosystems.
本文提出演化密码的概念和用演化计算设计密码的方法。
The fast implementation of elliptic curve cryptosystems relies on the efficient computation of scalar multiplication.
椭圆曲线密码体制的实现速度依赖于曲线上标量乘法的运算速度。
Modular inversion is a part of the kernel for computations in the Galois field GF (p) used by many public key cryptosystems.
有限域上的模逆运算是许多公钥密码系统使用的算法中的核心域运算之一。
They are basic modules to construct threshold cryptosystems, and also important components of secure multiparty computation.
分布式乘法计算是构造门限密码体制的基本模块,同时也是安全多方计算领域的重要研究内容。
And from which the fast and efficient public-key cryptosystems are constructed, and their security and efficiency are analysed.
在此基础上我们构造出快速高效的公钥密码算法,并对该算法进行了安全性和效率分析。
Finite field inversion, an important module of elliptic curve cryptosystems and hyper-elliptic curve cryptosystems, is introduced.
介绍了椭圆曲线密码和超椭圆曲线密码算法中一个重要的模块——求逆模块。
The drawbacks of the two chaotic cryptosystems are pointed out respectively, and chosen plaintext attacks are carried out successfully.
指出了这两种密码系统存在的缺陷,并且成功地实施了选择明文攻击。
The digital signature is different from traditional signature, it is based on public key cryptosystems and is constructed by cryptogram arithmetic.
数字签名不同于传统的手写签名方式,它是基于公钥密码体制,依据一定的密码算法构造而成的。
There are many intractable problems in number theory, many cryptosystems were established of which the security is based on the intractability of these problems.
数论中存在着许多难题,很多密码体制就是以这些难题为安全性基础的。
Using the improved algorithm, we present the attack on elliptic curve cryptosystems with binary scalar multiplication, and verify it through software simulation.
采用改进的算法针对二进制方法点乘的椭圆曲线密码进行了符号变换故障攻击,利用仿真实验进行了验证。
This paper lists some important and interesting properties of the Euter totient functions, which have the potential use in the design and analysis of cryptosystems.
本文给出了欧拉函数的一些重要而有趣的性质,这些性质可对密码的设计与分析起指导作用。
In this lecture the speaker will demonstrate sample algebraic and number theory applications in information security, in particular, in the design of cryptosystems.
在此讲座中,报告人将用实例展示代数和数论在信息安全,特别是密码系统设计中的应用。
应用推荐