基于字的流密碼的分布式解密
Distributed Decryption of Word-Oriented Stream Ciphers
-
摘要: 該文分析了Magnus berg提出的簡(jiǎn)單加法流密碼的分布式解密方案，指出了其最主要的缺點(diǎn)是：加解密要在不同的有限域內(nèi)進(jìn)行、加解密運(yùn)算所依賴的域的階必須為素?cái)?shù)而且要滿足一定的關(guān)系。提出了基于字的流密碼的分布式解密方案。新提出的方案有兩個(gè)主要優(yōu)點(diǎn)：一是將加解密統(tǒng)一在同一個(gè)有限域內(nèi)進(jìn)行，且域的階不再要求是素?cái)?shù)；二是在安全性和效率兩方面比原有方案均有了明顯的提高。在應(yīng)用方面，新方案可應(yīng)用于諸如數(shù)據(jù)庫(kù)信息的保護(hù)，Ad-hoc網(wǎng)中分布式密鑰管理，等等。
-
關(guān)鍵詞:
- 流密碼;分布式解密;秘密分享;密鑰流
Abstract: The distributed decryption scheme for simple addition stream ciphers proposed by Magnus berg is analyzed. Its main disadvantages, i.e. the operations of encryption and decryption are implemented in different finite fields, and the orders of the two fields must be primes satisfying a certain relation, are pointed out. A new distributed decryption scheme for word-oriented stream ciphers is presented. Compared with Magnus bergs scheme, the proposed scheme has two main advantages. Firstly, in the new scheme, the encryption and decryption operations are implemented in the same finite field, and the size of the field is not required to be a prime. Secondly, the security and efficiency of the new scheme are greatly improved. For applications, the new scheme can be applied in the protection of data confidentiality in a database, distributed key management in Ad-hoc networks, etc. -
計(jì)量
- 文章訪問(wèn)數(shù): 2243
- HTML全文瀏覽量: 118
- PDF下載量: 694
- 被引次數(shù): 0
下載:
