您要查找的是不是：
- A fast finite field multiplier is proposed in this paper. 提出了一種快速有限域乘法器結構。
- Furthermore,according to the data transfer rate(DTR) of third generation discs,this paper analyzes the minimum speed for RS decoding and simulates the finite field multiplier in RS decoding. 針對現有幾種光盤(pán)的DTR,進(jìn)一步分析了光存儲中RS譯碼速度的要求,并對譯碼中的有限域乘法器做了仿真。
- A Fast Finite Field Multiplier Architecture and Its VLSI Implementation 一種快速有限域乘法器結構及其VLSI實(shí)現
- An Efficient Digit-Serial Finite Field Multiplier and Its VLSI Implementation 一種高效的可伸縮分組并行有限域乘法器及VLSI實(shí)現
- The Polynomial-Basis Multiplier in the finite field is the key module to realizing ECC basic operations. 有限域上的多項式乘法器是實(shí)現ECC底層運算的關(guān)鍵模塊。
- A new high regular structure of partial parallel multiplier for irreducible trinomial generated finite field is proposed. 摘要 提出了一類(lèi)新的具有高度規則性的部分并行三項式有限域乘法器架構。
- There are two applications to the RB.One is array processing and the other is quaternion finite field transform. 雙復數有兩種運用，一個(gè)用在陣列信號處理，另一個(gè)則用在四元有限場(chǎng)轉換。
- Hardware implementation for the all-erasure RS decoder is proposed, including the finite field arithmetic operation units. 本文并提出純粹抹除式里德所羅門(mén)解碼器的硬體實(shí)現，包括有限體中的算數運算模組。
- To simplify reduction modulo, special polynomials are used to generate finite field GF(2m), such as AOP (all one polynomials) and trinomials. 為了簡(jiǎn)化模不可約多項式f(x)運算,采用特殊多項式AOP(allonepolynomials)和三項式,產(chǎn)生有限域GF(2m)。
- The finite field arithmetic, elliptic curve scalar multiplication and the related algorithms are investigated in this dissertation. 本文主要研究有限域運算算法和橢圓曲線(xiàn)數乘運算算法。
- In this paper we give a classification of elliptic curves over finite field Fp by the cardinality of elliptic curves and deduce some properties. 在這篇文章里;我們利用橢圓曲線(xiàn)的階給出了橢圓曲線(xiàn)的一個(gè)分類(lèi);并推導出一些性質(zhì).
- XTR is a new public key system based on a method to represent elements of a subgroup of a multiplicative group of a finite field. XTR是一種新的基于有限域的乘法群的子群中元素跡的緊致表示的公鑰密碼體制。
- This processor that has choice parameter and high speed can apply to discretional elliptic curve based on finite field GF(m) with m less than 256. 該芯片可以支持m小于256的GF(m)域上任意可變曲線(xiàn)的ECC公鑰密碼算法，是一種系統參數可選擇的高速橢圓曲線(xiàn)密碼芯片。
- The computational intractability of the Elliptic Curve Discrete Logarithm Problem (ECDLP) over a finite field enhances security of the scheme. 利用有限域上橢圓曲線(xiàn)點(diǎn)群中的離散對數問(wèn)題的難解性來(lái)增強協(xié)議的安全性。
- crossed field multiplier phototube 交叉磁界光電放大管
- The base that using elliptic curves as public key cryptosystem is because of the point set of elliptic curve on finite field can construct Abelian group. 使用橢圓曲線(xiàn)作為公鑰密碼體制的基礎,是定義在有限域上橢圓曲線(xiàn)上的點(diǎn)構成的阿貝爾群,并且使定義其上的離散對數問(wèn)題的求解非常困難。
- Finally, a totally new multiplication algorithms in finite field GF(2~n), which is designed according to the sliding-window algorithms used in scalar multiplication in ECC. 本文將原本應用在橢圓曲線(xiàn)標量乘運算中的滑動(dòng)窗口算法應用到有限域GF(2~n)上的乘法運算中，提出了一種有限域GF(2~n)上乘法運算的新算法。
- Secondly, one construction of Cartesian authentication code from norm form of one class of nilpotent matrices over finite field is presented and its size parameters are computed. 第二部分利用有限域F_q上一類(lèi)冪零陣的相似標準形，構作了一個(gè)笛卡爾認證碼，并計算出該碼的所有參數。
- The elliptic curve discrete logarithm of non singular elliptic curve over finite field has no efficient attack up to now, which made it cannot be widely applied in cryptography. 摘要目前，在有限域上非奇異橢圓曲線(xiàn)離散對數問(wèn)題還沒(méi)有有效的攻擊方法，使其在加密技術(shù)中得到了廣泛應用。
- To solve this problem,a FEC algorithm of telemedicine data transmission based on the finite field theory is developed,which has high data recover rate and is easy to realize. 針對該問(wèn)題,基于有限域理論,我們得出一種數據恢復率高、實(shí)現簡(jiǎn)單的遠程醫療數據傳輸FEC算法。
