冪的運算 的英文怎麼說

中文拼音 [deyùnsuàn]
冪的運算 英文
rules of exponents
  • : Ⅰ名詞1. [書面語] (覆蓋東西的巾) cloth cover2. [數學] (表示一個數自乘若干次的形式) power Ⅱ動詞[書面語] (覆蓋; 罩) cover with cloth
  • : 4次方是 The fourth power of 2 is direction
  • : Ⅰ動詞1 (物體位置不斷變化) move; revolve 2 (搬運; 運輸) carry; transport 3 (運用) use; wield...
  • : Ⅰ動詞1 (計算數目) calculate; reckon; compute; figure 2 (計算進去) include; count 3 (謀劃;計...
  • 運算 : [數學] operation; arithmetic; operating
  1. We need to know how hard it is to reverse the exponentiation

    我們需要知道求難度。
  2. First, computers have circuits for performing arithmetic operations, such as : addition, subtraction, division, multiplication and exponentiation

    第一,計機具有進行加、減、乘、除及取等各種電路。
  3. The key of rsa is the modular exponentiation multiplication of large number, in this thesis, we modify the montgomery algorithm which be used to implement rsa

    Rsa演核心是大數模,本文選用montgomery模乘演法來實現ras演法,對montgomery模乘演fpga實現進行了改進。
  4. Considering the difference - resisting capacity of power function in classic s - box, we substitute the inverse function by better power function. we prove that these change do not influence the difference resisting capacity from the theory

    其次考慮到經典s盒中函數抗差分攻擊能力,我們用函數取代rijndael演法中s盒求逆
  5. Considering the monotony and regularity of euclid arithmetic, the paper proposes a new multiple attribute decision making approach based on the ordinal euclid arithmetic, and the monotony, regularity and metathesis immutability of the ordinal euclid arithmetic are proved too

    基於元有序性構建思想,本文提出並構建了基於有序歐幾里德區間數多屬性決策演法模型,證明了有序歐幾里德單調性、齊次性和等性。
  6. 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演法。
  7. One special feature of this paper is that it provides fast implementation means for the all kinds of modular exponentiation algorithms, which facilitate the implementation of the rsa public key algorithms. the paper improved the sliding window algorithm by largely reducing the space complexity. meanwhile this paper represents an efficient combined algorithm to improve the processing of encryption and decryption

    大數模是實現rsa等公鑰密碼基本,其行效率決定了rsa公鑰密碼性能,文章主要研究了各種模快速實現方法,提出用組合演思想來減少演行時間;並對滑動窗口取法進行了部分改進,用線性表來存儲預計數據,從而減少了演復雜度,進一步提高了rsa加/解密效率,並在試驗測試中得到較為滿意結果。
  8. In order to characterize the linear operators that strongly preserve nilpotence and that strongly preserve invertibility, we first study the case of the binary boolean algebra

    為了刻畫強保持線性元和強保持可逆線性元,我們首先研究二元布爾代數上情況
  9. By the means of the extension of linear operator, we characterize the linear operators that strongly preserve nilpotence and that strongly preserve invertibility over any boolean algebra

    再利用線性擴張這一工具,我們刻畫了在一般布爾代數上強保持線性元和強保持可逆線性
  10. Also, by the means of the pattern of matrix and the pattern of linear operator, we characterize the linear operators that strongly preserve nilpotence and that strongly preserve invertibility over antinegative commutative semirings without zero divisors

    另外,利用矩陣模式和元模式等工具,我們在非負無零因子半環上刻畫了強保持線性元和強保持可逆線性
  11. Idempotent completions of operator partial matrices

    缺項元矩陣等補
  12. This paper studies the inverse operation of the matrix power operation, namely the root operation

    摘要研究了矩陣,即矩陣開方
  13. Structure to the specified power

    結構指定次結果。
  14. The author mainly realized the method of generating the large random numbers and judging the prime number using lehmann means, then three pairs of secure key with different lengths ( 256 bits, 512 bits, 1024 bits ) was generated to meet the demand of different security grade. in encryption module, modular multiplication arithmetic of large number was realized adopting addition chaining. in decryption module, extended euclid was used to get inverse, and the chinese remainder theorem was used to realize decryption, which increased the speed of decryption greatly

    作者主要實現了大隨機數生成、採用整除小素數和勒曼測試法判定素數,可以生成三種不同長度密鑰對( 256位、 512位、 1024位)來滿足不同加密安全等級需求;加密模塊中,選用了二進制序列乘法方法,實現了大數模;解密模塊中,引用了擴展歐幾里德法求逆元,並採用中國剩餘定理實現解密過程,大大提高了解密速度。
  15. The operation properties of uniform hypergroups

    一致性質
  16. In section 2. 2, we prove that if the set of arrows in a quiver is not empty, then nq is not semisimple. we construct the nonsovable subalgebra of nq when there is no less than one circle whose length is bigger than one, and there is no loop in quiver q, thus leads to a conclusion that nq is nonsovable. using the index arrays to discuss the operation of necklace word. construct a sovable subalgebra of nq, which is not nilpotent. this shows that nq is not nilpotent provided that there is a cyclic with length bigger than 1

    當箭圖中有長度大於1循環,且無圈時,構造了n _ q非可解子代數,從而證明了n _ q是不可解李代數。我們還利用指標數組討論了項鏈字,構造了n _ q可解非零子代數,從而證明了當箭圖中有長度大於1循環時,項鏈李代數非零。在2
  17. Variable to the power of a second variable and assign the result to the first variable

    變量值為底、以第二個變量值為冪的運算,並將結果賦給第一個變量。
  18. In chapter 6, we pay our attention to additive rank one nilpotence preservers on b ( h ). as application of this result, we characterise many additive perservers on b ( h )

    第六章我們研究了b ( h )上保一秩可加映射,作為應用我們還對許多可加保持映射進行了刻畫。
  19. 6 kinds of methods to calculate the high power of matrix are given and examples of applying each method are explained

    摘要代數中矩陣高次冪的運算量較大。針對不同類型矩陣,給出計矩陣高次6種方法,並對其應用進行舉例。
  20. Raises the value of a variable or property to the power of an expression and assigns the result back to the variable or property. variableorproperty expression

    進行以變量或屬性值為底、以表達式值為冪的運算,並將結果賦回給該變量或屬性。
分享友人