冪的運算 的英文怎麼說
中文拼音 [mì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
-
We need to know how hard it is to reverse the exponentiation
我們需要知道求冪運算的逆運算的難度。First, computers have circuits for performing arithmetic operations, such as : addition, subtraction, division, multiplication and exponentiation
第一,計算機具有進行加、減、乘、除及取冪等各種算術運算的電路。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實現進行了改進。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盒的求逆運算。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
基於運算元有序性的構建思想,本文提出並構建了基於有序歐幾里德運算元的區間數多屬性決策演算法模型,證明了有序歐幾里德運算元的單調性、齊次性和冪等性。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演算法。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加/解密的效率,並在試驗測試中得到較為滿意的結果。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
為了刻畫強保持冪零的線性運算元和強保持可逆的線性運算元,我們首先研究二元布爾代數上的情況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
再利用線性擴張這一工具,我們刻畫了在一般布爾代數上強保持冪零的線性運算元和強保持可逆的線性運算元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
另外,利用矩陣模式和運算元模式等工具,我們在非負無零因子半環上刻畫了強保持冪零的線性運算元和強保持可逆的線性運算元Idempotent completions of operator partial matrices
缺項運算元矩陣的冪等補This paper studies the inverse operation of the matrix power operation, namely the root operation
摘要研究了矩陣冪運算的逆運算,即矩陣的開方運算。Structure to the specified power
結構的指定次冪運算結果。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位)來滿足不同的加密安全等級的需求;加密模塊中,選用了二進制序列的乘法方法,實現了大數模冪乘運算;解密模塊中,引用了擴展的歐幾里德法求逆元,並採用中國剩餘定理實現解密過程,大大提高了解密速度。The operation properties of uniform hypergroups
一致冪群的運算性質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的循環時,項鏈李代數非冪零。在2Variable to the power of a second variable and assign the result to the first variable
變量的值為底、以第二個變量的值為冪的運算,並將結果賦給第一個變量。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 )上保一秩冪零運算元的可加映射,作為應用我們還對許多可加保持映射進行了刻畫。6 kinds of methods to calculate the high power of matrix are given and examples of applying each method are explained
摘要代數中矩陣高次冪的運算量較大。針對不同類型的矩陣,給出計算矩陣高次冪的6種方法,並對其應用進行舉例。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
進行以變量或屬性的值為底、以表達式的值為冪的運算,並將結果賦回給該變量或屬性。分享友人