共查询到18条相似文献,搜索用时 78 毫秒
1.
2.
安全散列算法是数字签名等密码学应用中重要的工具。目前最常用的安全散列算法是SHA-1算法,它被广泛地应用于电子商务等信息安全领域。为了满足对安全散列算法计算速度的需要,本文提出了在GPU平台上快速运算SHA-1算法的方法。为利用GPU强大的并行运算能力,对SHA-1算法进行了并行处理,为快速高效的实现散列算法寻求一条有效的途径。 相似文献
3.
在网络飞速发展的今天,信息安全已经变得越来越重要,信息认证是验证收到信息来源和内容的基本技术。常用的信息验证码是使用单向散列函数生成验证码,安全散列算法SHA-1使用在因特网协议安全性(IPSec)标准中。本程序探讨SHA-1算法在Java程序设计消息摘要中的应用。 相似文献
4.
5.
SHA(即Secure Hash Algorlthm,安全散列算法)是一种常用的数据加密算法.它由美国国家标准与技术局(Natlonal Instituteof Standards and Technology)于1993年作为联邦信息处理标准公布(即第一代SHA算法——SHA-0)。在1995年和2002年.其改进版本SHA-1、SHA-2也分别正式公布(SHA-1和SHA-2具有比SHA-0更高的安全性)。SHA算法与MD5算法的设计原理类似.同样也按2blt数据块为单位来处理输入, 相似文献
6.
针对当前哈希函数算法标准和应用需求不同的现状,以及同一系统对安全性可能有着不同的要求,采用可重构的设计思想,在对SHA-1、SHA-256、SHA-512三种哈希函数的不同特征进行深入分析的基础上,总结归纳出统一的处理模型。根据不同的要求,每一种SHA(SHA-1、SHA-256、SHA-512)系列哈希函数都可以单独灵活地执行。使用流水线,并在关键路径进行加法器的优化,提高了算法的吞吐率。并且使用效能比的概念,与M3服务器对比,可重构平台的效能比比通用服务器高很多。 相似文献
7.
安全哈希算法(Secure Hash Algorithm)诞生之初便作为优秀的签名算法得到安全界的重视,其中SHA-1更是因为其安全性和高效性被全球各个领域普遍采用。但是面对海量的待签信息,传统的算法将不再胜任。该文着力于基于大数据的SHA-1算法研究,通过改造散列计算步骤,提出分布式云计算模型,最终减少算法的空间复杂度提高计算效率。 相似文献
8.
采用PC声卡随机噪声作为随机源,使用安全散列算法(SHA-256)对采集到的随机源序列进行处理,形成一种随机序列产生方法。依照FIPS14022标准对产生的随机序列进行测试,结果表明该随机序列的生成方法可行、实用。 相似文献
9.
一种基于FPGA的可重构密码芯片的设计与实现 总被引:1,自引:0,他引:1
介绍了SHA-1、SHA224及SHA256三种安全杂凑算法的基本流程,采用可重构体系结构的设计思想和方法设计出一款可实现这三种算法的可重构密码芯片,并对关键路径进行了优化设计。最后给出了基于Altera公司的Cyclone系列FPGA的可重构密码芯片的实现结果。 相似文献
10.
数字签名算法MD5和SHA-1的比较及其AVR优化实现 总被引:4,自引:0,他引:4
MD5和SHA-1是目前使用比较广泛的散列(Hash)函数,也是在消息认证和数字签名中普遍使用的两种加密算法。本文基于AVR高速嵌入式单片机,实现了MD5和SHA-1两种加密算法的比较,并对算法进行了汇编语言的优化和改进。根据实验结果,对两种算法的优缺点进行了比较和分析。 相似文献
11.
Imtiaz Ahmad Author Vitae A. Shoba Das Author Vitae 《Computers & Electrical Engineering》2005,31(6):345-360
Hash functions are common and important cryptographic primitives, which are very critical for data integrity assurance and data origin authentication security services. Field programmable gate arrays (FPGAs) being reconfigurable, flexible and physically secure are a natural choice for implementation of hash functions in a broad range of applications with different area-performance requirements. In this paper, we explore alternative architectures for the implementation of hash algorithms of the secure hash standards SHA-256 and SHA-512 on FPGAs and study their area-performance trade-offs. As several 64-bit adders are needed in SHA-512 hash value computation, new architectures proposed in this paper implement modulo-64 addition as modulo-32, modulo-16 and modulo-8 additions with a view to reduce the chip area. Hash function SHA-512 is implemented in different FPGA families of ALTERA to compare their performance metrics such as area, memory, latency, clocking frequency and throughput to guide a designer to select the most suitable FPGA for an application. In addition, a common architecture is designed for implementing SHA-256 and SHA-512 algorithms. 相似文献
12.
Successful attacks against the two most commonly used cryptographic hash functions, MD5 and SHA-1, have triggered a kind of feeding frenzy in the cryptographic community. Many researchers are now working on hash function attacks, and we can expect new results in this area for the next several years. This article discusses the SHA-1 attack and the US National Institute of Standards and Technology's (NIST's) plans for SHA-1 and hash functions in general. 相似文献
13.
Michail Harris Kakarountas Athanasios Milidonis Athanasios Goutis Costas 《Dependable and Secure Computing, IEEE Transactions on》2009,6(4):255-268
Many cryptographic primitives that are used in cryptographic schemes and security protocols such as SET, PKI, IPSec, and VPNs utilize hash functions, which form a special family of cryptographic algorithms. Applications that use these security schemes are becoming very popular as time goes by and this means that some of these applications call for higher throughput either due to their rapid acceptance by the market or due to their nature. In this work, a new methodology is presented for achieving high operating frequency and throughput for the implementations of all widely used—and those expected to be used in the near future—hash functions such as MD-5, SHA-1, RIPEMD (all versions), SHA-256, SHA-384, SHA-512, and so forth. In the proposed methodology, five different techniques have been developed and combined with the finest way so as to achieve the maximum performance. Compared to conventional pipelined implementations of hash functions (in FPGAs), the proposed methodology can lead even to a 160 percent throughput increase. 相似文献
14.
《Journal of Systems Architecture》2007,53(2-3):127-138
We propose an improved implementation of the SHA-2 hash family, with minimal operator latency and reduced hardware requirements. We also propose a high frequency version at the cost of only two cycles of latency per message. Finally we present a multi-mode architecture able to perform either a SHA-384 or SHA-512 hash or to behave as two independent SHA-224 or SHA-256 operators. Such capability adds increased flexibility for applications ranging from a server running multiple streams to independent pseudorandom number generation. We also demonstrate that our architecture achieves a performance comparable to separate implementations while requiring much less hardware. 相似文献
15.
Since the discovery of collision attacks against several well-known cryptographic hash functions in 2004, a rush of new cryptanalytic results cast doubt on the current hash function standards. The relatively new NIST SHA-2 standards aren't yet immediately threatened, but their long-term viability is now in question. The US National Institute of Standards and Technology (NIST) has therefore begun an international competition to select a new SHA-3 standard. This article outlines the competition, its rules, the requirements for the hash function candidates, and the process that NIST will use to select the final winning SHA-3 standard. 相似文献
16.
Many cryptographic primitives that are used in cryptographic schemes and security protocols such as SET, PKI, IPSec and VPN's utilize hash functions - a special family of cryptographic algorithms. Hardware implementations of cryptographic hash functions provide high performance and increased security. However, potential faults during their normal operation cause significant problems in the authentication procedure. Hence, the on-time detection of errors is of great importance, especially when they are used in security-critical applications, such as military or space. In this paper, two Totally Self-Checking (TSC) designs are introduced for the two most-widely used hash functions: SHA-1 and SHA-256. To the best of authors’ knowledge, there is no previously published work presenting TSC hashing cores. The achieved fault coverage is 100% in the case of odd erroneous bits. The same coverage is achieved for even erroneous bits, if they are appropriately spread. Additionally, experimental results in terms of frequency, area, throughput, and power consumption are provided. Compared to the corresponding Duplicated with Checking (DWC) architectures, the proposed TSC-based designs are more efficient in terms of area, throughput/area, and power consumption. Specifically, the introduced TSC SHA-1 and SHA-256 cores are more efficient by 16.1% and 20.8% in terms of area and by 17.7% and 23.3% in terms of throughput/area, respectively. Also, compared to the corresponding DWC architectures, the proposed TSC-based designs are on average almost 20% more efficient in terms of power consumption. 相似文献
17.
密码杂凑函数及其安全性分析 总被引:1,自引:0,他引:1
文章提出了针对密码杂凑函数及其安全性进行研究的重要意义,列举了单向杂凑函数、MD5、SHA-1等技术原理进行了技术分析,并从攻击手段入手,分析了密码杂凑函数的安全性,提出对SHA-1与MD-5的"破解"应客观看待的观点。 相似文献
18.
Elena Andreeva Andrey Bogdanov Bart Mennink Bart Preneel Christian Rechberger 《International Journal of Information Security》2012,11(2):103-120
In 2007, the US National Institute for Standards and Technology (NIST) announced a call for the design of a new cryptographic
hash algorithm in response to vulnerabilities like differential attacks identified in existing hash functions, such as MD5
and SHA-1. NIST received many submissions, 51 of which got accepted to the first round. 14 candidates were left in the second
round, out of which five candidates have been recently chosen for the final round. An important criterion in the selection
process is the SHA-3 hash function security. We identify two important classes of security arguments for the new designs:
(1) the possible reductions of the hash function security to the security of its underlying building blocks and (2) arguments
against differential attack on building blocks. In this paper, we compare the state of the art provable security reductions
for the second round candidates and review arguments and bounds against classes of differential attacks. We discuss all the
SHA-3 candidates at a high functional level, analyze, and summarize the security reduction results and bounds against differential
attacks. Additionally, we generalize the well-known proof of collision resistance preservation, such that all SHA-3 candidates
with a suffix-free padding are covered. 相似文献