高維D=3 SM陣列編碼構(gòu)造和實現(xiàn)
THE CONSTRUCTION AND REALIZATION OF D=3 SM ARRAY CODES FOR HIGH-DIMENSION
-
摘要: 本文基于第一作者1994年提出的D=2 SM陣列碼的概念體系,進一步給出D=3 SM陣列碼的編碼規(guī)則和存在條件,并討論其結(jié)構(gòu)特點、構(gòu)造步驟和設(shè)計分析。最后指出其編碼性能和用途。
-
關(guān)鍵詞:
- D=3 SM陣列碼; 拓撲條件; 結(jié)構(gòu)模型; 密碼設(shè)計
Abstract: This paper is based on the concept system for D=2 SM array code proposed by the author in 1994. The coding rule and existence condition for D = 3 SM array code are given, and its structure property, construction step, design analysis and some use are also discussed. -
林柏鋼.基于D=2的SM陣列碼構(gòu)造.密碼學(xué)進展--CHINA CRYPT94,第三屆中國密碼學(xué)術(shù)會議論文集,北京:科學(xué)出版社,1994,155-160.[2]林柏鋼.Sbos相鄰邏輯對稱序列構(gòu)造與實現(xiàn)方法.電子科學(xué)學(xué)刊,1991,13(5):502-508.[3]Games R A, Chan A H. A fast algorithm for determining the complexity of a binary sequence with period zn. IEEE Trans. on IT, 1983, IT-29(1): 144-146.[4]Mitchell C. Enumerating Boolean functions of cryptographic significance. J. Cryptology, 1990,2(3): 155-170. -
計量
- 文章訪問數(shù): 1801
- HTML全文瀏覽量: 81
- PDF下載量: 445
- 被引次數(shù): 0
下載:
