線性分組碼 的英文怎麼說

中文拼音 [xiànxìngfēnzǔmǎ]
線性分組碼 英文
linear block codes
  • 線 : 名詞1 （用絲、棉、金屬等製成的細長的東西） thread; string; wire 2 [數學] （一個點任意移動所構成的...
  • 性 : Ⅰ名詞1 （性格） nature; character; disposition 2 （性能; 性質） property; quality 3 （性別） sex ...
  • 分 : 分Ⅰ名詞1. （成分） component 2. （職責和權利的限度） what is within one's duty or rights Ⅱ同 「份」Ⅲ動詞[書面語] （料想） judge
  • 組 : Ⅰ名詞1 （由不多的人員組成的單位） group 2 （姓氏） a surname Ⅱ動詞（組織） organize; form Ⅲ量詞（...
  • 碼 : Ⅰ名詞（表示數目的符號或用具） a sign or object indicating number; code Ⅱ量詞1 （指一件事或一類的...
  • 線性 : [數學] [物理學] linear; linearity線性代數 linear algebra; 線性方程 linear equation; 線性規劃 line...
  1. 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加/解密的效率，並在試驗測試中得到較為滿意的結果。
  2. 4. security of a class of block ciphers based on chaotic maps against differential and linear cryptanalysis is studied. the results show that this kind of cipher structure is not good compared with some famous cipher structure such as cast - 256 cipher structure and common feistel structure

    對一類基於混沌函數的分組密碼結構gfs4 （ gfs8 ）的安全性做了評估，分析結果表明：從抵抗差分密碼分析和線性密碼分析的安全性與所需要的執行代價相比，這類密碼結構不如cast - 256型密碼結構和普通的feistel型密碼結構。
  3. Concentrating on security analysis and design of block ciphers, five principal achievements have been obtained in this dissertation : 1. using differential - nonlinear cryptanalysis, truncated differential - linear cryptanalysis and integral cryptanalysis respectively, three attacks of reduced - round safer + + are given ; 2. based on the survey of provable security and practical security of block ciphers, a block cipher model of spn cipher containing feistel structure is proposed

    分別利用差分-非線性密碼分析、截斷差分-線性密碼分析、積分密碼分析三種不同的密碼分析方法，對safer + +進行了密碼分析； 2在對分組密碼的可證明安全性和實際安全性研究的基礎上，提出了一個嵌套feistd結構的sp型分組密碼的模型。
  4. Ldpc ( low density parity check ) code is a kind of linear block code that defined by very sparse parity matrix or tanner graph, and it is also called gallager code since gallager initially presented it

    Ldpc （ lowdensityparitycheck ）碼是一類用非常稀疏的校驗矩陣或二分圖定義的線性分組糾錯碼，最初由gallager發現，故亦稱gallager碼。
  5. The linear block code is called a binary low - density parity - check code if it is based on a sparse parity - check matrix. this sort of code was originally proposed by dr. gallager in 1962, which cannot attract a large amount of interest at that time

    低密度奇偶校驗（ ldpc ）碼是基於稀疏校驗矩陣的線性分組碼，它最初由gallager於1962年提出，當時並未受到人們的重視。
  6. First we introduce it by presenting the classic 2tx scheme proposed by alamouti. then the orthognal designes for space - time block codes are explored, the detailed analysis of the performance is presented. the link level simulations are performed in the last part

    通過alamouti的2天線方案來理解空時分組碼，接著研究了空時分組碼的正交設計，最後對其性能進行了詳盡的分析，並完成了鏈路級模擬。
  7. Absolute minimal trellis complexities of extended codes and their dual codes of two types of linear block codes whose code length is odd are given

    給出了兩類奇數碼長線性分組碼的擴展碼及其對偶碼的絕對最小網格圖復雜度。
  8. Among the linear block codes, rs code is an important one widely used in modern digital communications, which can correct both random and bursty errors with the most powerful error - correcting capability

    Rs碼是一種典型的糾錯碼，在線性分組碼中，它具有最強的糾錯能力，既能糾正隨機錯誤，也能糾正突發錯誤。
  9. Ldpc code belongs to the linear block code which is encoded by the information sequence multiplies generator matrix. although the parity - check matrix of ldpc code is sparse, the generator matrix is not. the encoding complexity of it is linearly proportional to the square of code length

    Ldpc碼屬于線性分組碼，線性分組碼的通用編碼方法是由信息序列根據碼的生成矩陣來求相應的碼字序列，盡管ldpc碼的校驗矩陣是非常稀疏的，但它的生成矩陣卻並不稀疏，這使得其編碼復雜度往往與其碼長的平方成正比。
  10. 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函數之間的關系;給出了任意有限域上任意。
  11. In traditional block cipher, the s - box is the only one nonlinear core component and it determines the strength of these cryptosystems. therefore, the construction of cryptographically strong s - boxes is of much

    在傳統分組密碼學中， s盒是唯一一個非線性運算部件，它的性能直接影響到整個密碼系統的強度，它的設計一直是密碼設計與密碼分析的研究重點。
  12. Low density parity check codes are a class of linear block error - correcting codes that can be defined by the very sparse parity - check matrix. their error performance approach shannon limits

    Ldpc碼（低密度校驗碼）是一類可以用非常稀疏的奇偶校驗矩陣定義的線性分組糾錯碼，具有逼近香農限的性能。
  13. In this paper, the general structure of block cipher together with its related properties is firstly discussed, then the main non - linear component of s - boxes in block cipher is analyzed. as to the boolean function in binary field, we studied its non - linearity, linearity structure, output bit independence criterion ( big ), balance, completeness, strict avalanche criterion, propagation criterion, correlation immunity, linear approximation table and xor distribution table. we also discussed the pile - up lama used to compute the combination linear probability and showed an instance of its application

    本文首先討論了分組密碼的一般結構及其相關特性，此外還有分組密碼主要的非線性組成部分s盒。對於二元域上的布爾函數主要討論了其非線性性、線性結構、比特獨立準則、平衡性、完整性、雪崩準則、傳播準則、相關免疫性、線性分佈表及異或分佈表等特性。對計算組合線性概率的迭加定理我們也進行了具體的討論，並給出了運用事例。
  14. Since their rediscovery, design, construction, decoding, analysis and applications of ldpc coded have become focal points of research. among them, the decoding algorithm and its implementation design are the focus of this thesis

    Ldpc碼是一種具有稀疏校驗矩陣的線性分組碼，研究結果表明，採用迭代的概率譯碼演算法， ldpc碼可以達到接近香農極限的性能。
  15. This class of codes decoded with soft - in soft - out ( siso ) iterative decoding performs amazingly well. since their rediscovery, design, construction, decoding, analysis and applications of ldpc coded have become focal points of research

    Ldpc碼是一種具有稀疏校驗矩陣的線性分組碼，研究結果表明，採用迭代的概率譯碼演算法， ldpc碼可以達到接近香農極限的性能。
  16. Although the estimation algorithm is carried out by parity check code, but it is also applicable in general linear block codes to estimate the channel ’ s parameter

    本文演算法不僅可以利用偶校驗碼的碼結構去估計通道參數，而且對於一般的線性分組碼也適用。
  17. Study on linear block code

    線性分組碼問題研究
  18. Linear block code

    線性分組碼
  19. Being an important linear block code in error control field, the reed - solomon ( rs ) code has very strong capability of correcting random and burst errors, which is widely used in various modern communication systems to satisfy the requirement of channel reliability

    Rs （ reed - solomon ）碼是差錯控制領域中一類重要的線性分組碼，由於具有很強的糾錯能力，因而被廣泛地應用於各種現代通信系統中，以滿足對通道可靠性的要求。
  20. In next mobile communication system to suffice more and more high - speed data service and demand of qos ( quality of service ) many new wireless link layer transport technologies are going to be used such as mimo ( multiple input multiple output ), ofdm ( orthogonal frequency division multiplexing ), channel coding and acm ( adaptive coding modulation ) etc. low density parity check ( ldpc ) codes were first discovered in 1960 ’ s which belong to linear block codes with their parity matrix being sparse

    下一代移動通信系統為了滿足移動用戶對高速、寬帶數據傳輸業務不斷增長和更高服務質量的要求，採用了許多新的無線鏈路傳輸技術，包括多天線發射和接收技術、正交頻分復用技術、通道糾錯編碼技術和自適應編碼調制技術等。上世紀60年代提出的低密度校驗碼，是一種校驗矩陣為稀疏矩陣的線性分組碼。
分享友人
分享到 Line

分享到臉書