相對密鑰 的英文怎麼說
中文拼音 [xiāngduìmìyào]
相對密鑰
英文
relative key- 相 : 相Ⅰ名詞1 (相貌; 外貌) looks; appearance 2 (坐、立等的姿態) bearing; posture 3 [物理學] (相位...
- 對 : Ⅰ動詞1 (回答) answer; reply 2 (對待; 對付) treat; cope with; counter 3 (朝; 向; 面對) be tr...
- 密 : Ⅰ名詞1 (秘密) secret 2 [紡織] (密度) density 3 (姓氏) a surname Ⅱ形容詞1 (距離近; 空隙小)...
- 鑰 : 鑰名詞(鑰匙) key
- 相對 : 1. (面對面) opposite; face to face 2. (非絕對的) relative 3. (比較的) relatively; comparatively
-
The most talked about algorithm in asymmetric cyphers is rsa, which uses 2048 - bit keys - equivalent to 128 - bit symmetric keys
非對稱密碼中最常說的rsa使用2048位密鑰,相當於128位的對稱密鑰。Public key algorithms can also be easily broken by chosen plaintext attacks when the domain of the encrypted data is relatively small
如果被加密的數據范圍相對比較小的話,公共密鑰演算法也比較容易受到選擇明文攻擊。The same key is used for both encryption and decryption, hence " symmetric key cryptography. " symmetric key cryptography is sometimes called secret key cryptography, as the security of the ciphertext depends upon the key being kept secret
由於加密和解密都使用相同的密鑰,因此這種演算法被稱作「對稱密鑰加密」 。對稱密鑰加密有時也被稱為秘密密鑰加密,因為密文的安全取決於密鑰能否被保密。We extend the baker transform to k - th system, give the digital image scrambling algorithm based on it and test the algorithm robust ( for example, key space, two adjacent pixels correlation and tolerance of image processing )
特別是,本文對基於麵包師變換的數字圖像置亂演算法的魯棒性進行了分析(如密鑰空間、相鄰像素的相關性、抗圖像處理等) 。The security of the algorithm is analyzed from the randomness, linear complexity of the chaotic sequence and the intensity of initial key. the results show the randomness of the key sequence pass the frequency test, sequential test, poker test, autocorrelation test, runs test, etc. and the total level is better than the binary sequence generated by the prng of delphi 7. 0, logistic chaotic system and rc4, the linear complexity comes up to the expectation, the initial key has very strong intensity
本文最後從混沌序列的隨機性、線性復雜度和初始密鑰的強度三個方面對演算法進行了安全性分析,結果表明演算法產生的密鑰序列的隨機性完全通過了頻數檢驗、序列檢驗、撲克檢驗、自相關檢驗和遊程檢驗等5種統計檢驗方法的檢驗,而且整體水平要好於delphi7 . 0中的偽隨機數發生器、 logistic混沌系統和rc4三種方法產生的二進制序列,線性復雜度達到了數學期望值。My study involves two areas in quantum key distribution protocol. first, in the field of the b92 protocol, it is first calculated and analyzed for the holevo upper bound of b92 protocol to noise and eavesdropping, the fidelity, a lower bound on the guaranteed privacy and the capacity for classical information over phase flip channels. it is computed and validated for that projective measurements increase quantum entropy
本文主要涉及兩個方面:一、 b92量子密鑰分配協議方面,計算分析了b92協議對噪聲和竊聽的holevo上界,以及通過相位翻轉通道的通道保真度,通道可靠的保密性量子熵下界和對經典信息的容量,計算驗證了定理投影測量增加量子熵,分析了測量前後量子狀態的變化,並用計算機模擬繪制了圖形,能夠清楚直觀地分析比較。This is a contradiction to save a gradually longer key in a limit room. we proposed a solution to combine the elliptic curve cryptosystem and digital - image - hiding, the advantage of ecc ’ s shorter key at the same security level will solve the problem in some extent, at the same time make the transfer of document secure and also cryptic
通過對現有商務文檔安全傳輸策略的研究和對比后,本文提出將橢圓曲線密碼體制與圖像隱藏結合,利用ecc在相同安全強度下密鑰長度短的特點在一定程度上解決這一矛盾,同時達到安全性和隱蔽性的結合,能在一定程度上解決第三方的攻擊。Out the strong name token corresponding to the key passed in
的密鑰相對應的強名稱標記。Among the algorithmic design, the corresponding solution to the problems of transforming from the real sequence to binary sequence and precision in the chaotic stream cipher is put forward, and more efficient algorithm and better randomness of key sequence are obtained
在演算法的設計中,我們對混沌序列密碼所面臨的實數序列到二進制序列的轉化和精度等問題採取了相應的解決方法,從而獲得較高的演算法執行效率和良好的密鑰序列隨機性。So the applied single photon detector is concerned by the scientist. in our country research in this field is relatively backward, and no ripple device is realized in this field
在這方面的研究我們國內相對于國外來說還比較落後,還沒有研究出成熟可行的量子密鑰分發系統。During registration, either the client provides the public key, along with some proof of possession of the corresponding private key, or the service provider generates the key pair for the client
在注冊期間,要麼是客戶機提供公鑰以及其他證明其擁有相應私鑰的某些證據,要麼是服務提供程序為客戶機生成密鑰對。Luby and rackoff idealized des by replacing each round function with one large random function
相對于公鑰密碼體制,分組密碼在許多方面還很不成熟。Using the idea of secret - sharing and signature - of - knowledge, a new perfect and strong key - insulated signature scheme based on the assumption of integer factorization problem is proposed. the scheme has a low computation in key updating and signing, thus fitting for the mobile devices
( 6 )對簽名系統中的密鑰泄露問題進行了研究,在分析相關技術的基礎上,利用秘密分享和知識簽名,給出了一個完善的強key - insulated簽名方案。This paper has introduced the principle of isakmp, a protocol used in dynamical key exchange, and has accounted for the theory of ipc ( inter - process communication ) and a kind of new socket type pf _ key, as well as their messaging activity and related operations. the paper has mainly analyzed the procedure of building messages in kernel and its communication with application, the methods of managing messages and sadb. finally, it has presented a design of ipc ( inter - process communication ) between kernel and application according to pf _ key protocol, which makes various users communicate with each other on different channels created dynamically
本文簡要介紹了在ipsec中實現動態密鑰交換使用的通用框架協議? ? isakmp的基本原理;詳細闡述了進程間通信機制和pfkey協議的基本原理、消息行為及相關操作;著重分析了系統內核消息構造及其與應用層通信的過程和系統內核處理消息、管理安全關聯數據庫( sadb )的方法;最終提出了利用pfkey套介面協議在系統內核與應用層之間進行通信,為不同的用戶對動態地建立不同的安全通道的設計方案。A measure of the number of bits in a given key ; note that although increasing the key length gives added security, it s not appropriate to compare the lengths used with one cipher with those in another and, in general, that key lengths in symmetric ciphers do not equate directly with key lengths in asymmetric ciphers
給定密鑰中位數的度量;注:雖然密鑰長度越長,安全性越強,但將一個密碼使用的長度與另一個的長度進行比較是不合適的,通常,對稱密碼中的密鑰長度與非對稱密碼中的密鑰長度不是直接相等的。Asymmetric cryptographic algorithms, also known as public - key algorithms, require that each entity maintains a pair of related keys : a private key and a public key
不對稱加密演算法(也稱為公鑰演算法)要求每個實體都維護一對相關密鑰:私鑰和公鑰。This tends to be demanding because a certificate revocation list must also be maintained for key revocation and update
因為密鑰的撤銷及更新必須有一個證書撤銷列表( certificate revocation list , crl ) ,所以對于發布與管理公用密鑰證書以及相應的專用密鑰的要求也會變得越來越高。So far, the elliptic curve cryptosystem ( ecc ) provides the highest strength - per - bit of any cryptosystem known. in addition to its high security, ecc also has many other merits, such as less computation overheads, shorter key size, considerable bandwidth savings, and so on
同其它非對稱加密體制相比,橢圓曲線密碼系統除了安全性高外,還具有計算負載小,密鑰尺寸短,佔用帶寬少等優點,因此,橢圓曲線密碼系統被認為是下一代最通用的公鑰密碼系統。The real use of authentication services will most likely be found in web shopping ; rather than, for example, secured e - mail
實際上,實現絕對的非否認相當困難,因為很難證明沒有泄露某人的密鑰。First, basic knowledge about key management is introduced ; secondly, after the detailed analysis of ieee 802. 10 standard, some key management protocols are improved, and one of them is applied in newly designed network interface card with encryption ; finally, a new solution of key management is proposed to enable stas to roam between aps
首先介紹了密鑰管理相關的基礎理論知識;其次對ieee802 . 10標準作了較為深入的研究和分析,並對其中的部分密鑰管理協議進行了改進,改進后應用到新設計的加密網卡中;最後提出了無線局域網中移動站實現在ap間漫遊的密鑰管理方案。分享友人