查詢結果分析
來源資料
頁籤選單縮合
題 名 | 快速金匙回復式密碼系統之設計與分析=The Design and Analysis of High Efficient Key Recovery Cryptosystem |
---|---|
作 者 | 黃昭平; 張克章; | 書刊名 | 中央警察大學學報 |
卷 期 | 37 2000.10[民89.10] |
頁 次 | 頁399-415 |
分類號 | 312.76 |
關鍵詞 | 公開金匙密碼系統; 三次式公開金匙密碼系統; 金匙回復式密碼系統; 數位簽署; 認證中心; Public key cryptosystem; Cubic polynomial public key cryptosystem; Digital signature; |
語 文 | 中文(Chinese) |
中文摘要 | 在網際網路盛行的今天,公民營企業組織經營管理電子化已是無法抵擋的趨勢,尤其在電子商務及電子資料交換勢必推行的前提下。 CA(CenihcationAuthority]認證中心更是必須建立的一個重要機制。而如何在口建構的CA機制下設計一個在政府須要查緝犯罪時可由CA做秘密金匙回復,且執行加解密更快速的公開金匙密碼系統。以使得在網路交易量日益擴增情況下,能在公權力的保護下更快速的虛理每筆交易資料的加解密動作,此乃本文主要研究動機。 在過去密碼學設計的研究報告中,質因數分解及離散對數定理是較常被應用的,諸如RSA或ElGama1密碼系統。而其他的密碼系統如Merk1e-Hellmar的迷袋式密碼系統(Knapsack Cipher cryptosystem),以及Rabin的公開金匙密碼系統均已被證實不安全。為了設計一個相較於RSA及EIGamal密碼系統運算更為快速之公開金匙密碼系統,作者提出一「三次式公開金匙密碼系統(Cubic Polynomial public key Cryptosystem,CPC)」。主要目的在於加解密時只需用多項式計算即可。 本三次式密碼系統已發展出,加解密明文時只需作乘法及加法運算,解決了傳統密碼演算法用大指數之指數運算而使得加解密速度過慢的問題。部分運算可事先將固定參數先行計算處理後存於記憶體,待對明文作加解密時,只做簡單加乘運算即可執行加解密。本系統之安全度相信是建立於解離散對數的困難度,另一特性在建構於CA機制下,當有交易糾紛必須仲裁或查緝犯罪時,可結合秘密分享技術。以CA認證中心協同政府管理單位或檢調單位的數位簽署同意或運用秘密分享(secret sharing)的技術的方式下,執行交易者之秘密金匙回復,以糾舉出網路交易進行時之欺騙者或犯罪者。且作秘密金匙回復前,CA認證中心無須作另外 的儲存空間將每位註冊使用者之秘密金匙作金匙託管。以省去金匙託管的儲存空間及管理問題。此外亦可將此三次式密碼系統作為加密簽章、數位認證、電子投票、電子招標等應用。 |
英文摘要 | For the popular usage of Internets today, the major trend of enterprise is electronicalmanagement, it made the network shopping and e-business must be pushing up, andCA(Certificate Authority) is the most important function in the networks environment. How todesign a key recovery system in a established CA that made CA can execute key recovery incertain necessary condition, and this cryptosystem must be efficient enough to encipher anddecipher a secret message in the increasingly network transactions, that's our motivation in thisresearch. Past researches in the design of cryptosystems, the theorems of integer factoring anddiscrete logarithm are applied in the popular cryptosystems like RSA or EIGamal. Othercryptosystems like Knapsack or Rabin's are also approved to be insecure. In order to design apublic key cryptosystem in which the algorithms can be faster than that of RSA and EIGamal,we propose a ( Cubic Polynomial public key Cryptosystem, CPC) . The objective is to derivecipherments using only polynomial computation. A theoretic derivation of Cubic Polynomial has been developed to encipher the plaintext, the computations include only multiplication and addition. Some computations can also be derived in advance as the encipher/decipher processes are used. The security of the proposed scheme is believed to be the hard of discrete logarithm; other characteristic of the proposedscheme is to reduce the heavy computation load, and when transaction dissension occur , CAcan execute key recovery by government department's digital signature or by secret sharingtechnology, and in the CA or Trusted Key Recovery Center(TKC) don't store any user's privatekey , that can omit the space of the key storage and management problem .The applications ofthe proposed scheme include digital signature, certificate authentication, electronic vote orelectronic biting. |
本系統中英文摘要資訊取自各篇刊載內容。