Study on forward secrecy of diffie-hellman key agreement protocol 密鑰建立協(xié)議的前向保密性研究
The key can be used to determine key agreement, such as a key created using the diffie-hellman key agreement algorithm 密鑰可用于確定密鑰協(xié)議,如使用diffie-hellman密鑰協(xié)議算法創(chuàng)建的密鑰。
Numerous diffie-hellamn based ak and akc protocol have been proposed, however, many have subsequently been found to have some security flaws 基于diffie-hellman的ak和akc協(xié)議得到了很大的發(fā)展,但許多協(xié)議仍有一定的安全缺陷。
In this paper, two kinds of public-key cryptography of data transport are presented rsa encryption algorithm and diffie-hellman encryption algorithm 本文介紹了數(shù)據(jù)傳輸中公開密鑰算法中的兩種-rsa加密算法和diffie-hellman加密算法
It includes functions of tonglink / q, using rc5 encryption algorithm, md5 message digesting algorithm, diffie-hellman key exchanging algorism to implement point-to-point security 描述了通過md5消息摘要算法,rc5加密算法,diffie-hellman密鑰交換算法,密鑰保存等方法實現(xiàn)點-點加密的過程。
It investigates the authentication mechanism on diffie-hellman ( dh ), which is why the ike protocol can " t avoid meeting denial-of-service attacks . the weak key confirmation and its key protocol are investigated 最后,本文探討了弱密鑰認(rèn)證方式(weakkeyconfirmation)以及基于這種認(rèn)證方式構(gòu)造的一種密鑰協(xié)商協(xié)議。
Under assumptions of kea3, a decision diffie-hellman and a variant of target collision resistance tcrv, the new scheme is proved secure against indistinguishable adaptive chosen ciphertext attack ind-cca2 rd提出的elgamaldeg方案具有相同的效率和帶寬,而deg方案在2004年亞密會上證明為選擇密文攻擊ind-cca1安全,而新的體制則是ind-cca2安全的。
Recently, several key-exposure-free chameleon hashes have been constructed based on rsa assumption and sdh strong diffie-hellman assumption . in this paper, we propose a factoring-based chameleon hash scheme which is proven to enjoy all advantages of the previous schemes 更具體地講,變色簽名的構(gòu)造遵循了著名的先哈希再簽名的范例hash-and-signparadigm,但是稍有不同
4 . study existing key-exchange protocols, promote and implement a key exchange protocol under the hardness assumption of the decisional diffie-hellman problem as well as the existence of collision-free hash functions . 5 在分析了密鑰交換方法的基礎(chǔ)上設(shè)計并實現(xiàn)了基于離散對數(shù)困難問題(dlp)和diffie-hellman密鑰交換協(xié)議,輔以hash函數(shù)和公鑰證書,進(jìn)行會話密鑰交換方法。
The main results of this thesis are as follows : 1 . based on the thoughts of " diffie-hellman decision problem " and anonymous signature, an unconditionally anonymous sign-cryption algorithm is proposed and its security proof is given 研究成果體現(xiàn)在如下幾個方面:(1)目前的簽密算法要求簽密人的身份是公開的,作者利用無條件匿名簽名的思想,給出了一個無條件匿名的簽密算法,并給出了相應(yīng)的安全性證明。