base multiplication 中文意思是什麼

base multiplication 解釋
基數乘法
  • base : n 1 基底，基，根基，底座；底層，底子；（紀念碑等的）基址；（山）麓。2 【軍事】基地，根據地。3 根...
  • 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. Round these two respects, how to structure security elliptic curve cryptography and the implementations of ecc is first discussed in this paper. then we have analysed especially the scalar multiplication on the elliptic curves, and present a new algorithm to quickly implement the fixed point scalar multiplication according to the idea of interleaving exponentiation algorithm and power division. this algorithm is much faster than fixed - base windowing method ; and a little faster than fixed - base comb method

    圍繞這兩個方面的問題，本文首先討論了如何構造安全的橢圓曲線密碼體制和橢圓曲線密碼體制的應用；然後重點分析了橢圓曲線上數乘運算的快速實現，並結合interleavingexponentiation演算法和冪分割的思想，提出一種計算固定點數乘的快速演算法，該演算法的計算速度明顯快于fixed - basewindowing演算法，稍快于fixed - basecomb演算法。
  3. The subject inducts digital time division technology ( pwm ), which is more advantageous at the accuracy and the predigest of hardware than simulant multiplication. what they call measuring power energy reasonably is that measuting except harmonics power energy fed back power. yet it realizes reasonable measurement of power energy which measures by base wave ac parameters method base on digital time division

    本課題引入了數字時分割（ pwm ）脈寬調制技術，在測量的準確性、硬體電路的簡化等方面都比模擬乘法器具有較高的優越性。所謂合理的計量電能，就是不計非線性負載回饋給電網的負的諧波電能，而採用基於數字時分割的基波交流參數測量的方法，真正實現了電能的合理計量。
  4. The latter pay special attention to the software implementation environments, including the technical details such as programming interface, data structures and 32 - bits visual c + + inline assembler. a sorftware packet is designed and implemented at last, which can perform the modular multiplication with equal 2048 - bits long of modulu and operands within approximately 5. 239ms and the modular exponentiation with equal 2048 - bits long of modulu, exponent and base within approximately 4290. 559ms

    經測試，在intelceleron400mhz ， ram64mb的pc機上，進行一次乘數與被乘數的最大位數均為2048位長的模乘運算所需平均時間約為5 . 239ms ，在進行一次底數和指數的最大位數均為2048位長的模指數運算所需的平均時間約為4290 . 559ms 。
  5. Telier company produces take the green environmental protection, the succinct fashion design idea as the base, absorbs the western europe land furniture the romantic style, creates the natural graceful noble product style unceasingly, the service eagerly anticipates the modern multiplication demand

    特麗爾公司生產的產品以綠色環保、簡潔時尚的設計理念為基梯，吸取西方歐陸傢具的浪漫風格，不斷締造出大方優雅的高貴的產品風格，真心真意的服務引領現代多元化需求。
  6. Paper [ 76 ] provides a integer algorithm for rasterizing free curves, we need change the curve form to implicit function form, then use curve ' s positive - negative property to draw, but we ca n ' t use this algorithm when curve ' s degree is higher than 3 and this algorithm ca n ' t avoid using multiplication ; paper [ 77 ] provides a new generating algorithm, this algorithm can draw bezier very well, but for b - spline curve, we need use convert them into bernstein base form. because this process spends a lot of time, this algorithm has not a good speed and effect for rendering rational b - spline curve

    現在經常採用的演算法也是基於幾何的演算法（即線式生成演算法）和基於像素的演算法（點式生成演算法） ;文獻78 ]提供了一種有理參數曲線的快速逐點生成演算法，該演算法對有理b吮ier曲線的繪制，能起到很好的作用，但是對于有理b樣條曲線，必須先通過多項式的代數基與bemstein基間的變換矩陣，把原式用bemstein基表示，這一過程由於計算量大，降低了曲線生成的速度和效率
  7. The research object of traditional dm method is the output of base - band dsss / bpsk signal delay and multiplication processing or the base - band component of output of if dsss / bpsk signal delay and multiplication processing

    傳統的延遲相乘法研究對象是基帶信號的延遲相乘輸出，或中頻信號延遲相乘輸出的基帶部分。
  8. Basing on the operating characteristics of the pmsm machine tool spindle drive system, a novel frequency multiplication circuits which can be switch to 2 or 4 times of base frequency is proposed in the paper. it resolves the paradox of using a same photoelectric encoder under high and low speed operating condition of motors

    它能夠根據指令實時的對編碼器反饋回來的電機速度信號進行2倍頻或4倍頻處理，解決了用同一個編碼器來檢測電機低速和高速的矛盾。
分享友人
分享到 Line

分享到臉書