Secure Hash Algorithm

Secure Hash Algorithm of improving reliability for railway information transmission among block

提高铁路区间信息传输可靠性的安全散列算法

A Secure Hash Algorithm for Message Authentication Based on IPv6

一种基于IPv6的报文认证安全散列算法

Password Security Mechanism Based on the Secure Hash Algorithm and the Java Implementation

基于安全散列算法的口令安全机制及其java实现

An efficient hardware architecture was developed to speed up the widely used secure hash algorithm SHA-1 . The design shortens the critical path by adjusting the iterative method .

目前最常用的安全散列算法是SHA-1算法，它被广泛地应用于电子商务等信息安全领域。为了满足应用对安全散列算法计算速度的需要，该文提出了一种快速计算SHA-1算法的硬件结构。

Security of an Automatic Block System had been improved by using Secure Hash Algorithm and Digital Signatures , meanwhile it could be defended the dependability of Railway Signal Control System .

运用安全Hash算法及数字签名等技术，提高站间自动闭塞系统的通信安全，进一步保证铁路信号控制系统的可靠性。

Invisible watermarking algorithm introduce a frailty watermarking algorithm base on secure hash algorithm , which can examine the temper image and locate the tamper domain .

不可见水印中介绍了一种利用安全杂凑算法的脆弱水印，图像只要稍有改动就能检测出来，并精确定位出篡改区域。

This paper presents a secure hash algorithm which can be used to design MAC for message authentication based on IPv6 . The algorithm allows a hash value of 160 bits , so it greatly increases the strength of information security .

提出了在IPv6报文认证中，一种用于构建MAC的安全散列算法。该算法散列码长度采用160bit，大大提高了信息安全强度。

The authors first introduce the principles and characteristics of SHA ( Secure Hash Algorithm ) and then discuss the mechanism of password security based on SHA in network environment and lastly present the implementation of the SHA in password security using java language .

介绍了安全散列算法的基本原理及特点.讨论了在网络环境下基于该算法的口令安全机制，并用java语言给出具体的实现方法。

The way hashcash poses a challenge is by asking " minters " to produce strings ( stamps ) that when hashed with the Secure Hash Algorithm , SHA-1 , have a number of leading zeros in their hash .

hashcash提出质询的方式是，当通过安全散列算法（SecureHashAlgorithm）进行散列时，要求“minters”生成一个字符串（戳记，stamps），在它们的散列中有很多前导零。

This paper denotes such a problem as dual problem of hash algorithm . Based on the known result , it is proved that several fast secure block cipher can be constructed if a fast secure hash algorithm is given .

本文把这个问题称为杂凑算法的对偶问题，本文试图用现有的结果证明给定一个安全快速的杂凑算法可以构造一个安全快速的分组加密算法。