polynomial multiplication 中文意思是什麼

polynomial multiplication 解釋
多項式乘法
  • polynomial : adj. 1. 【動、植】多詞學名的。2. 【數學】多項式的。n. 1. 【動、植】多詞學名。 2. 【數學】多項式。
  • multiplication : n. 增加,增殖；倍增；【數學】乘法；乘法運算。
  1. 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 。
  2. Other operations are defined in terms of four - byte words. addition, as usual, corresponds with the simple bitwise exor at the byte level. in the polynomial representation, multiplication in gf 2

    如果它是遠程安裝的，即使已經由文件系統重新命名了，它也可以讓基於inode的psid /對象映射表跟蹤文件。
  3. In order to improve their speed, " fast polynomial multiplication algorithm " and " fast algorithm of r - circulant matrix inversion " are proposed, which offer obviously computational advantages

    本文提出了「快速多項式乘法運算」演算法和「 r -循環矩陣快速乘逆運算」演算法，用以提高這兩種運算的速度，具有明顯的速度優勢。
  4. To obtain the fast matrix - vector multiplication algorithm, we approximate the kernel function with piece - wise polynomial and get the approximate coefficient matrix a using the approximate kernel function. let n be the number of quadrature points and k2 be the number of interpolating knots at each subdomain. it is proved that the construction of a and the matrix - vector multiplication ax require o ( nk ) operations respectively

    我們利用對核函數進行分片多項式插值逼近得到適用於快速方法的近似系數矩陣a ：矩陣a的計算和矩陣-向量相乘ax各需要o （ nk ）次運算，存貯a需要佔用o （ nk ）內存，其中n為積分節點的個數， k ~ 2為每個小區域的插值節點數。
分享友人
分享到 Line

分享到臉書