SHA Hash algorithm. This standard specifies four secure hash algorithms, SHA-11, SHA-256, SHA-384, and SHA- 512.
標簽： SHA algorithms algorithm specifies
上傳時間： 2014-01-01
上傳用戶：teddysha
good document about secure REST
標簽： document secure about good
上傳時間： 2017-07-02
上傳用戶：ZJX5201314
SHA (secure Hash Algorithm，譯作安全散列算法) 是美國國家安全局 (NSA) 設計，美國國家標準與技術研究院 (NIST) 發布的一系列密碼散列函數。正式名稱為 SHA 的家族第一個成員發布于 1993年。然而現在的人們給它取了一個非正式的名稱 SHA-0 以避免與它的后繼者混淆。兩年之后， SHA-1，第一個 SHA 的后繼者發布了。 另外還有四種變體，曾經發布以提升輸出的范圍和變更一些細微設計: SHA-224, SHA-256, SHA-384 和 SHA-512 (這些有時候也被稱做 SHA-2)。
上傳時間： 2014-03-02
上傳用戶：thuyenvinh
journal of secure Distributed Source Coding with Side-Information
標簽： Side-Information Distributed journal secure
上傳時間： 2017-07-03
上傳用戶：zyt
sah-1(secure Hash Algorithm,安全散列算法)算法源程序
上傳時間： 2017-07-19
上傳用戶：梧桐
JPEG 2000 image coding system — Part 8: secure JPEG 2000
上傳時間： 2017-08-22
上傳用戶：chenbhdt
this is the document for the secure development in java. It covers in very good details the aspect of security programming in Java
標簽： the development document details
上傳時間： 2017-09-07
上傳用戶：黑漆漆
this is the document for the secure development in java. It covers in very good details the aspect of security programming in Java
標簽： the development document details
上傳時間： 2013-12-21
上傳用戶：xyipie
Tiny Encryption Algorithm for secure communication.
標簽： communication Encryption Algorithm secure
上傳時間： 2014-01-03
上傳用戶：大三三
Abstract—In the future communication applications, users may obtain their messages that have different importance levels distributively from several available sources, such as distributed storage or even devices belonging to other users. This scenario is the best modeled by the multilevel diversity coding systems (MDCS). To achieve perfect (information-theoretic) secrecy against wiretap channels, this paper investigates the fundamental limits on the secure rate region of the asymmetric MDCS (AMDCS), which include the symmetric case as a special case. Threshold perfect secrecy is added to the AMDCS model. The eavesdropper may have access to any one but not more than one subset of the channels but know nothing about the sources, as long as the size of the subset is not above the security level. The question of whether superposition (source separation) coding is optimal for such an AMDCS with threshold perfect secrecy is answered. A class of secure AMDCS (S-AMDCS) with an arbitrary number of encoders is solved, and it is shown that linear codes are optimal for this class of instances. However, in contrast with the secure symmetric MDCS, superposition is shown to be not optimal for S-AMDCS in general. In addition, necessary conditions on the existence of a secrecy key are determined as a design guideline.
標簽： Fundamental Limits secure Class on of
上傳時間： 2020-01-04
上傳用戶：kddlas
