題名: | On the K-Q Lock Lock Problems of Information Security |
作者: | Shi, Kai-Quan Chen, Tzer-Shyong Chu, Hai-Cheng Wen, Shih-Lin |
關鍵字: | K-Q lock inside lock outside lock ladder encryption algorithm |
期刊名/會議名稱: | 1999 NCS會議 |
摘要: | In this paper, a new concept called "K -Q lock" for ensuring the security of information is proposed. The nomenclature K(kaleidoscope)-Q(queer) lock is itself a combination of a lock and key, which filters the entry of information so that the authorization for information can be performed strictly. There are three parts in the K -Q lock (<GM(1),X(1))>,aSx(1)). The GM(1), a secret key which is expressed as a function. The structures of the inside and outside locks constitute two layers for distinguishing the passing objects. Therefore, the designer can transfer the threshold of entrance according to different demands such as objects or authorization to set up a lock and key in the K-Q lock. In other words, the range in the application of the security area becomes wider. The K-Q lock can produce an encryption ladder for a plaintext document automatically. By protecting the encryption information from being attacked, the order of the encryption ladder accomplishes the necessary requirements for securit. In addition four new concepts are introduced: (1) a bearing-reproduction theorem (2) a resolution and dispersion theorem, (3) a ladder encryption theorem, and (4) a ladder-climbi algorithm. These four offer the K -Q lock a more trustworthy support. |
日期: | 2006-11-13T01:15:23Z |
分類: | 1999年 NCS 全國計算機會議 |
文件中的檔案:
檔案 | 描述 | 大小 | 格式 | |
---|---|---|---|---|
ce07ncs001999000178.pdf | 650.25 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。