hash key 中文意思是什麼

hash key 解釋
散列關鍵碼
  • hash : n 1 切碎的食物〈尤指肉丁和洋芋丁〉。2 拼湊起來的東西；大雜燴。3 重申，復述，推敲。4 〈蘇格蘭語〉...
  • key : n 1 鑰匙。2 要害，關口，要沖。3 關鍵，線索，秘訣；解法。4 （外國書的）直譯本，圖例，題解，圖解，...
  1. Chameleon signature, chameleon hash, key - exposure

    因此，變色簽名又是不可偽造的
  2. If you wish to set such a key you must first remove the leading hash mark that marks it as a comment

    如果您希望設定這些值，您必須先移掉該行首的井字號。
  3. This is because the key signature contains a hash of the file, and modifying the file renders the hash invalid

    這是因為，該密鑰簽名包含該文件的哈希，修改該文件會呈現無效的哈希。
  4. The agent of kdc according to the picture and individual character information which users input, the base key of producing automatically, make the conversation every side produce the self - same main key, has solved the problem of key distribute ingeniously. and it utilize irreversible hash function produce session key realize one - time key. the thesis has also analysed the application of different situations that the agent of kdc among the conversation modes in many ways

    本文提出的個性化kdc代理根據用戶輸入的圖片和個性信息，自動產生基密鑰，分別運用公開密鑰系統進行交換，使通話各方各自產生完全相同的主密鑰，巧妙地解決了密鑰分配和加密解密同步的問題，並利用單向散列函數的性質，基於相同的演算法產生用於加密解密的一次一密會話密鑰。
  5. In the preprocessing stage the method of user and session identification often adopt heuristic algorithm for the being of cache and agent. this induce the uncertainty of data resource. the cppc algorithm avoid the limitation and has no use for complicated hash data structure. in this algorithm, by constructing a userld - url revelant matrix similar customer groups are discovered by measuring similarity between column vectors and relevant web pages are obtained by measuring similarity between row vectors ; frequent access paths can also be discovered by further processing of the latter. experiments show the effectiveness of the algorithm. in the fourth part, this thesis bring some key techniques of data mining into web usage mining, combine the characteristic of relation database design and implement a web usage mining system wlgms with function of visible. lt can provide the user with decision support, and has good practicability

    本文演算法避免了這個缺陷，且不需要復雜的hash數據結構，通過構造一個userid - uel關聯矩陣，對列向量進行相似性分析得到相似客戶群體，對行向量進行相似性度量獲得相關web頁面，對後者再進一步處理得到頻繁訪問路徑。實驗結果表明了演算法的有效性。第四是本文將傳統數據挖掘過程中的各種關鍵技術，引入到對web使用信息的挖掘活動中，結合關系數據庫的特點設計並實現了一個具有可廣西人學頎士學位論義視化功能的web使用挖掘系統wlgms 。
  6. Understand secret key, public key, one - way hash functions

    了解秘鑰、公鑰、單向散列函數
  7. The detail is clarified as follows : l ) based on the chaotic technology and contemporary encryption approach the paper put forward a new chaotic sequence, which introduced the m - sequence and the method of shrink key - the stream generator. the complexity of the sequence was promoted as the random alteration of the parameters of chaotic mapping, and at the same time, the shrinking key was used to enhance the security further more ; 2 ) the performance of one - way hash function was improved and new hash function construction methods are proposed through a novel hash method based on chaotic mapping and the aes - the rijndael algorithm. the algorithm of hashing messages of arbitrary length into 256 bits hash values was designed

    按照這種方法，輸出序列的周期性得以大大提高，理論分析和計算機模擬結果表明，該方法可以產生具有良好統計特性的密鑰流，而且易於軟硬體實現： 2 ）實現了一種基於混沌映射和分組密碼rijndael演算法的單向hash函數的構造方法，即使用logistic混沌映射產生混沌二值序列，序列的分組與明文序列分組進行按位異或后，進入rijndael加密模塊，所得的結果再加入到反饋端，參與下一分組輸入的異或運算，迭代結束時的rijndael加密結果即為所求的hash函數值。
  8. The hash algorithm name to use to derive the key

    用於導出密鑰的哈希演算法名稱。
  9. Gets or sets the key to use in the hash algorithm

    獲取或設置用於哈希演算法的密鑰。
  10. This property is the key for the keyed hash algorithm

    此屬性是鍵控哈希演算法的密鑰。
  11. Gets a hash key for the specified

    獲取一個指定的
  12. In this case, omitting the parentheses would have automatically quoted the hash key, so for instance

    在這種情形下，省略圓括號會自動對散列鍵加引號，因此，舉例來說，
  13. 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

    更具體地講，變色簽名的構造遵循了著名的先哈希再簽名的範例hash - and - sign paradigm ，但是稍有不同
  14. 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

    在分析了密鑰交換方法的基礎上設計並實現了基於離散對數困難問題（ dlp ）和diffie - hellman密鑰交換協議，輔以hash函數和公鑰證書，進行會話密鑰交換方法。
  15. Function used by the key class does not spread values evenly over the hash range or has a large number of hash collisions, certain bucket chains may be much longer than others, and traversing a long hash chain and calling

    函數不能將value均勻地分佈在整個hash表范圍內，或者存在大量的hash沖突，那麼某些bucket鏈就會比其他的鏈長很多，而遍歷一個長的hash鏈以及對該hash鏈上一定百分比的元素調用
  16. May involve more computation than is obvious - when traversing a hash bucket to find a specific key,

    ，可能比表面上要進行更多的處理當遍歷一個hash表的bucket以期找到某一特定的key時，
  17. A hash - based message authentication code hmac can be used to determine whether a message sent over an insecure channel has been tampered with, provided that the sender and receiver share a secret key

    在發送方和接收方共享機密密鑰的前提下，基於哈希的消息驗證代碼（ hmac ）可用於確定通過不安全通道發送的消息是否已被篡改。
  18. First ， we introduce some basic cryptography theories such as secret - key cryptography ， public - key cryptography and hash algorithm. second ， we give the concepts of x. 509 certificate, crl ( certificate revocation list ) and certification path, and following this, we give some examples of certificate and authentication architectures. finally, we present an example of implementation of the certificate and key management system and some application cases of this system

    論文首先簡單介紹了秘密密鑰密碼體制、公開密鑰密碼體制、 hash函數以及基於x . 509的公鑰證書等基礎密碼學理論；其次，論文描述了幾種典型的證書體系和鑒別機制；最後給出了一個電子政務證書管理系統的具體實現例子。
  19. The subject is identified by the hash of the subject key

    通過使用者密鑰的哈希值標識使用者。
  20. It is possible for a hash function to generate the same hash code for two different keys, but a hash function that generates a unique hash code for each unique key results in better performance when retrieving elements from the hash table

    一個哈希函數能夠為兩個不同的鍵生成相同的哈希代碼，但從哈希表檢索元素時，為每一唯一鍵生成唯一哈希代碼的哈希函數將令性能更佳。
分享友人
分享到 Line

分享到臉書