Results 221 to 230 of about 33,778 (262)
Some of the next articles are maybe not open access.
Analysis of SHA-1 in Encryption Mode
2001This paper analyses the cryptographic hash function SHA- 1 in encryption mode. A detailed analysis is given of the resistance of SHA-1 against the most powerful known attacks today. It is concluded that none of these attacks can be applied successfully in practice to SHA-1.
Helena Handschuh +2 more
openaire +1 more source
Rescheduling for Optimized SHA-1 Calculation
2006This paper proposes the rescheduling of the SHA-1 hash function operations on hardware implementations. The proposal is mapped on the Xilinx Virtex II Pro technology. The proposed rescheduling allows for a manipulation of the critical path in the SHA-1 function computation, facilitating the implementation of a more parallelized structure without an ...
Ricardo Chaves +3 more
openaire +1 more source
FPGA implementation of SHA-1 algorithm
2003 5th International Conference on ASIC Proceedings (IEEE Cat No 03TH8690) ICASIC-03, 2003In information security, message authentication is an essential technique to verify that received messages come from the alleged source and have not been altered. A key element of authentication schemes is the use of a message authentication code (MAC).
null Dai Zibin, null Zhou Ning
openaire +1 more source
Analyze SHA-1 in message schedule
Journal of Discrete Mathematical Sciences and Cryptography, 2007Abstract Wang et al have found a family of collisions in MD5. They reported their method to find a collision efficiently in SHA, and also to find a collision in SHA-1 within 269 hash steps in February 2005. In fact, we can still discover the decay phenomenon with the application of a message schedule’s judgment proposed in this work when inspection how
Yi-Shiung Yeh +3 more
openaire +1 more source
Finding Good Differential Patterns for Attacks on SHA-1
2006In this paper we analyse properties of the message expansion algorithm of SHA-1 and describe a method of finding differential patterns that may be used to attack reduced versions of SHA-1. We show that the problem of finding optimal differential patterns for SHA-1 is equivalent to the problem of finding minimal weight codeword in a large linear code ...
Krystian Matusiewicz, Josef Pieprzyk
openaire +3 more sources
Low area and high speed SHA-1 implementation
2011 International SoC Design Conference, 2011In this paper, a low area and high speed SHA-1 implementation with multi-input addition based on a carry-save adder is proposed. Compared with the fastest SHA-1 design up to date, our implementation reduces the area by 24.5% as well as increases the speed by 13.6%. When the proposed scheme keeps the same clock frequency as the counterpart, it decreases
Eun-Gu Jung, Daewan Han, Jeong-Gun Lee
openaire +1 more source
Classification of disturbance vectors for collision attack in SHA-1
Science China Information Sciences, 2015A good disturbance vector is one of the key techniques to find SHA-1 collisions and to construct valid differential paths. The main work of this paper is to classify the types of the optimal disturbance vectors. First, we improve the EEM disturbance vectors search algorithm by Manuel.
Yuchen Tang, Guang Zeng, Wenbao Han
openaire +2 more sources
Design of SHA-1 Algorithm Based on FPGA
2010 Second International Conference on Networks Security, Wireless Communications and Trusted Computing, 2010SHA (Secure Hash Algorithm) is a famous message compress standard used in computer cryptography, it can compress a long message to become a short message abstract. The algorithm can be used in many protocols or Secure Algorithm, especially for DSS. In this paper, the improved version SHA-1 is analysised, then improved and implemented in HDL (Hardware ...
Cheng Xiao-hui, Deng Jian-zhi
openaire +1 more source
The potential of reconfigurable hardware for HPC cryptanalysis of SHA-1
2011 Design, Automation & Test in Europe, 2011Modern reconfigurable technologies can have a number of inherent advantages for cryptanalytic applications. Aimed at the cryptanalysis of the SHA-1 hash function, this work explores this potential showing new approaches inherently based on hardware reconfigurability, enabling algorithm and architecture exploration, input-dependent system specialization,
openaire +2 more sources
DSA with SHA-1 for space telecommands authentication
2007 15th International Conference on Software, Telecommunications and Computer Networks, 2007The problem of securing data communications in civil and commercial space missions has been debated within the Security Working Group of the Consultative Committee for Space Data Systems since several months. In the context of Telecommand transmissions, the interest is mainly focused on authentication, more than encryption.
Susanna Spinsante +2 more
openaire +1 more source