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
