有限域 的英文怎麼說

中文拼音 [yǒuxiànyù]
有限域 英文
finite field
  • 有 : 有副詞[書面語] （表示整數之外再加零數）: 30 有 5 thirty-five; 10 有 5年 fifteen years
  • 限 : Ⅰ名詞（指定的范圍; 限度） limit; bounds Ⅱ動詞（指定范圍, 不許超過） set a limit; limit; restrict
  • 域 : 名詞（在一定疆界內的地方; 疆域） land within certain boundaries; territory; region
  • 有限 : limited; restricted; finite; a little; not much
  1. Finite fields ; almost perfect arrays ; divisible difference sets

    有限域幾乎完美陣列可分差集
  2. Also we study the ecc crypto theory in the field of public crypto system, in which the ecc encrypt principle, safety, reliability, as well as the structure of ecc based on galois field is focused on

    研究了公鑰加密系統中的橢圓曲線加密理論，詳細闡述了有限域上橢圓曲線的結構及其基本運算； 3
  3. Chapter 3 introduces the correcting ability of the rs code. then it particularly states the definition and algorithm of galois field, and analyses the realization of the limited field multiplier based on the dual basis

    第三章分析討論了rs碼的特點，給出了伽羅華有限域的定義與運算規則，推導和分析了基於對偶基的有限域乘法器實現方法。
  4. Then we show an algorithm design of the elliptic curve crypto based on galois field. as a main part, the design theory and concrete solution of it are presented step by step, ic chip design method for implementation of the algorithm is described in detail

    設計完成了一種基於有限域的橢圓曲線加密演算法，主要包括適合於168bit橢圓曲線加密的有限域乘法、加法、除法器的實現； 4
  5. This thesis is composed of following parts : the fundamental theory of the modern cryptology is briefly researched, in which the mathematic model of cryptology, data encrypt principle and galois field theory related with elliptic curve crypto is discussed

    論文的主要內容為： 1研究了現代密碼學相關的基本理論，介紹了密碼系統的數學模型、數據加密原理和與橢圓曲線加密密切相關的有限域理論； 2
  6. Including the importing of the elliptic ctirve, the geometrical meaning of the operation on the curve, the finite fie1ds and domain parameters on the curve

    包括橢圓曲線的引入、曲線上運算的幾何意義、有限域上的橢圓曲線以及橢圓曲線域參數的含義。
  7. An algorithm on the multiplication table of the normal basis over finite fields

    關于有限域上正規基乘法表的一個演算法
  8. Prime number theorem of an algebraic function field of dimension 1 over a finite field

    有限域上單變量代數函數域中的素數定理
  9. In this paper, we study two kinds of error - correcting codes. one kind is cyclic code over finite chain rings, and the other is sdq ( b ) code over finite fields

    本文研究了有限鏈環上的循環碼和有限域上的sd _ q （ b ）碼這兩類糾錯碼。
  10. 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 。
  11. In this paper, the common used encoding algorithms and basic finite - field opera - tions algorithms are introduced, and the decoding algorithms such as inverse - free ber - lekamp - massey ( ibm ) algorithm, reformulated inverse - free berlekamp - massey ( ribm ) algorithm and modified euclidean algorithm are analyzed in great detail. based on the ribm algorithm, a modified structure and a pipelined decoder scheme are presented. a tradeoff has been made between the hardware complexities and decoding latency, thus this scheme gains significant improvement in hardware complexity and maximum fre - quency

    本文簡要介紹了有限域基本運算的演算法和常用的rs編碼演算法，詳細分析了改進后的euclid演算法和改進后的bm演算法，針對改進后的bm演算法提出了一種流水線結構的譯碼器實現方案並改進了該演算法的實現結構，在譯碼器復雜度和譯碼延時上作了折衷，降低了譯碼器的復雜度並提高了譯碼器的最高工作頻率。
  12. Their size parameters, the largest probability of a successful impersonation attack and the largest probability of a successful substitution attack are computed ; chapter three use sympletic geometry to construct authentication codes with arbitration, some parameters and the largest probability of successful attack are also computed ; chapter four is about lattices generated by transitive sets of subalgebras under finite chevalley groups

    並計算了相關參數及成功偽造和成功替換的最大概率；第三章在辛幾何的基礎上構造了具有仲裁的認證碼，亦計算了相關參數及各種攻擊成功的最大概率；第四章討論了有限域上chevalley群作用下的子代數軌道生成的格。
  13. The primary advantage that elliptic curve systems have over systems based on the multiplicative group of a finite field ( and also over systems based on the intractability of integer factorization ) is the absence of a subexponential - time algorithm ( such as those of index calculus type ) that could find discrete logs in these groups

    與基於有限域的乘法群系統（及基於整數分解的難解性之上的系統）相比，橢圓曲線系統的優勢在於，迄今為止還沒找到這類群上離散對數的次指數時間演算法（如微積分類）
  14. The inversionless bm algorithm in rs decoder is implemented with serial mode, which avoids the inversion computation and only needs 3 finite - field multipliers. thus, the complexity of hardware implementation has been mostly reduced. a 3 - level pipe - line processing architecture is also used in the hardware and the coding circuit in rs coder is optimized by using the characteristics of the finite - field constant multiplier

    Rs解碼器的設計採用無逆bm演算法，並利用串列方式來實現，不僅避免了求逆運算，而且只需用3個有限域乘法器就可以實現，大大的降低了硬體實現的復雜度，並且因為在硬體實現上，採用了3級流水線（ pipe - line ）的處理結構。
  15. Nonlinear model based predictive control ( nmpc ) not only is a valuable approach for solving practical control problems, but also is the frontier of nonlinear control theory. the perceptible successes of mpc strategies can be attributed to several factors including its inherent ability to handle input and output constraints, time delay and incorporation of an explicit model of the plant into the optimization problem. this dissertation discusses two kinds of nonlinearity ( or nonlinear system )

    本文沿著理論研究與工程實際相結合的設計思路，較為系統和全面的研究了非線性模型預測控制理論，提出改進新演算法；探討了非線性模型預測控制理論在自主水下航行器控制系統設計中的應用，豐富和發展了模型預測控制理論，本論文的主要工作及意義有以下幾個方面： 1 ）從工程應用的角度研究有限域無終端約束廣義預測控制穩定性充分條件，為有約束廣義預測控制穩定性研究奠定了基礎。
  16. By making use of two kinds of exponential sums and cohen ' s sieve, we better the lower bound concerning the number of primitive elements and also prove the existence of primitive polynomials with a1, a2 prescribed when n = 5, 6. in the remaining of the paper we study primitive elements in the form of a + a - 1 over finite fields. a counting formula is given as a result, as well as all the finite fields that do not have such elements

    本文對n = 5 ， 6兩種情形，利用有限域上的兩類特徵和估計及cohen篩法[ 5 ] [ 7 ] ，改進了[ 10 ] [ 11 ]中關于方程組本原元解個數的下界，並得到在特徵為奇的有限域上存在可預先指定前兩項系數的n次本原多項式。
  17. By initiating the values of vector description for a primitive element, all finite field elements could be generated by continue cyclic shifting, gmw sequences then could be generated by trace function calculation

    通過預置本原元向量表達的初始值，不斷的進行向量循環移位來生成有限域中的元素。生成有限域中所有元素后，即可按跡函數計算出gmw序列。
  18. Signature and verification systems, such as ecdsa etc, the discuss about key exchange systems such as deffie - hellman systeme, etc. this thesis also discussed several applications and information safety products of the elliptic curve cryptosystems at the finite field too, such as digital signature, the group signature, the application in the smart card

    Ecdsa等簽名驗證體制的選取， deffie - hellman等密鑰交換體制的研究。論文也討論了基於有限域上橢圓曲線公鑰密碼系統的若干應用和信息安全產品，如數字簽名，組簽名，在智能卡中的應用。
  19. The main contributions of the second part of this dissertation are focused on the cryptographic properties of logical functions over finite field, with the help of the properties of trace functions, and that of p - polynomials, as well as the permutation theory over finite field : the new definition of chrestenson linear spectrum is given and the relation between the new chrestenson linear spectrum and the chrestenson cyclic spectrum is presented, followed by the inverse formula of logical function over finite field ; the distribution for linear structures of the logical functions over finite field is discussed and the complete construction of logical functions taking on all vectors as linear structures is suggested, which leads to the conception of the extended affine functions over finite field, whose cryptographic properties is similar to that of the affine functions over field gf ( 2 ) and prime field fp ; the relationship between the degeneration of logical functions and the linear structures, the degeneration of logical functions and the support of chrestenson spectrum, as well as the relation between the nonlinearity and the linear structures are discussed ; using the relation of the logical functions over finite field and the vector logical functions over its prime field, we reveal the relationship between the perfect nonlinear functions over finite field and the vector generalized bent functions over its prime field ; the existence or not of the perfect nonlinear functions with any variables over any finite fields is offered, and some methods are proposed to construct the perfect nonlinear functions by using the balanced p - polynomials over finite field

    重新定義了有限域上邏輯函數的chrestenson線性譜，考察了新定義的chrestenson線性譜和原來的chrestenson循環譜的關系，並利用一組對偶基給出了有限域上邏輯函數的反演公式；給出了有限域上隨機變量聯合分佈的分解式，並利用隨機變量聯合分佈的分解式對有限域上邏輯函數的密碼性質進行了研究；給出了有限域上邏輯函數與相應素域上向量邏輯函數的關系，探討了它們之間密碼性質的聯系，如平衡性，相關免疫性，擴散性，線性結構以及非線性度等；討論了有限域上邏輯函數各類線性結構之間的關系，並給出了任意點都是線性結構的邏輯函數的全部構造，由此引出了有限域上的「泛仿射函數」的概念；考察了有限域上邏輯函數的退化性與線性結構的關系、退化性與chrestenson譜支集的關系；給出了有限域邏輯函數非線性度的定義，利用有限域上邏輯函數的非線性度與相應素域上向量邏輯函數非線性度的關系，考察了有限域上邏輯函數的非線性度與線性結構的關系；利用有限域上邏輯函數與相信息工程大學博士學位論文應素域上向量邏輯函數的關系，揭示了有限域上的廣義bent函數與相應素域上的廣義bent函數的關系，以及有限域上的完全非線性函數與相應素域上向量廣義bent函數之間的關系;給出了任意有限域上任意。
  20. The added mass of the ship of three gorges project is also computed and the curves of the added mass coefficient via the different water domain are obtained. the results should be useful in practice and computer code could be used in relevant areas

    本文給出了船在有限域中運動時，隨有限水域尺寸的變化，附加質量系數的變化趨勢圖，為工程應用提供了參考，同時本文編制的程序可以直接計算各類相關工程問題。
分享友人
分享到 Line

分享到臉書