次碼鑰 的英文怎麼說
中文拼音 [cìmǎyào]
次碼鑰
英文
secondary key-
Typically, secret - key algorithms, called block ciphers, are used to encrypt one block of data at a time
通常，私鑰演算法（稱為塊密碼）用於一次加密一個數據塊。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 。Returns a pseudo - random key from a password, salt and iteration count
用密碼、 salt值和迭代次數返回偽隨機密鑰。First ， we introduce some basic cryptography theories such as secret - key cryptography ， public - key cryptography and hash algorithm. second ， we give the concepts of x. 509 certificate, crl ( certificate revocation list ) and certification path, and following this, we give some examples of certificate and authentication architectures. finally, we present an example of implementation of the certificate and key management system and some application cases of this system
論文首先簡單介紹了秘密密鑰密碼體制、公開密鑰密碼體制、 hash函數以及基於x . 509的公鑰證書等基礎密碼學理論；其次，論文描述了幾種典型的證書體系和鑒別機制；最後給出了一個電子政務證書管理系統的具體實現例子。The modular exponentiation, are the core and the most time consuming steps in public key crytographic schemes such as ras and elgammal schemes, in those the security is guaranteed by the assumption that the integers is large enough, say 1024 or 2048 bits long
在rsa和elgammal等一類公鑰密碼體制中，計算形如的運算是最耗時的運算步驟，大整數模運算是其核心運算。提高這種運算的運算速度方法分為加快模乘法的運算速度和減少模乘法的次數兩個方面。Every time cryptographic authentication is to be used, a password must be given in order to decode the key
每次要使用密碼認證時，必須給出一個密碼以解碼密鑰。In a password - based key derivation function, the base key is a password and the other parameters are a salt value and an iteration count
在基於密碼的密鑰派生功能中，基本密鑰是一個密碼，其他參數是一個salt值和一個迭代次數。Asymmetric - key cryptography, which we will discuss in chapter 10, is based on some topics in number theory, including theories related to primes, factorization of composites into primes, modular exponentiation and logarithm, quadratic residues, and the chinese remainder theorem
我們將在第十章中討論非對稱密鑰密碼學，非對稱密鑰密碼學基於一些數論的論題，這些論題與素數、把復合數分解為素數的因數分解、模指數與模對數、二次剩餘和中國剩餘定理有關。分享友人