检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王孟钊 WANG Meng-zhao(Heilongjiang Social Credit Office,Harbin 150090,China)
出 处:《信息技术》2018年第8期152-153,158,共3页Information Technology
摘 要:SHA1是一种常见散列算法,算法常用于数字签名。该算法和MD5类似,相较于MD5算法,它修改了MD5中的分组处理函数,分组字节序等部分,从而形成了SHA1算法。该算法安全性高,运行效率较高。该算法在目前互联网环境中应用十分广泛。SHA1发展了很多年,但是在2017年2月谷歌已经发现了对碰撞实例。不同的两个文件在经过SHA1算法计算后出现了同样的散列值。SHA1算法对加密串有一定的要求,它只能对数据比特长度少于2^64次方的数进行加密。输入串在经过该算法计算后,可获取160比特的散列值,文中将详细介绍SHA1算法的具体实现原理和实现步骤。SHA1 is a common hash algorithm. The algorithms are often used for digital signatures. This algorithm is similar to MD5. Compared with MD5 algorithm,it modifies the packet processing function in MD5,packet endian and other parts,thus forming the SHA1 algorithm. The algorithm has high security and high operating efficiency. The algorithm is widely used in the current Internet environment. SHA1 is developed for many years,but in February 2017 Google already discovered a collision example. The two different files appear the same hash value after being calculated by the SHA1 algorithm. The SHA1 algorithm has certain requirements on the encryption string,and it can only encrypt data bits whose length is less than the 2^64 th power. After the input string is calculated by the algorithm,a 160-bit hash value can be obtained. This paper introduced in detail the specific implementation principles and implementation steps of the SHA1 algorithm.
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.37