Results 241 to 250 of about 46,179 (288)
Some of the next articles are maybe not open access.
Differential Collisions in SHA-1
2020 International Conference on Information Science and Communications Technologies (ICISCT), 2020In paper highlights of hash functions differential cryptanalysis on an example of algorithm SHA-1 are considered. The technique of carrying out of the differential analysis of SHA-1 hash function and other hash functions having a similar structure is offered.
Abdurakhimov Bakhtiyor +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
2005
We report on the experiments we performed in order to assess the security of SHA-1 against the attack by Chabaud and Joux [5]. We present some ideas for optimizations of the attack and some properties of the message expansion routine. Finally, we show that for a reduced version of SHA-1, with 53 rounds instead of 80, it is possible to find collisions ...
Vincent Rijmen, Elisabeth Oswald
openaire +1 more source
We report on the experiments we performed in order to assess the security of SHA-1 against the attack by Chabaud and Joux [5]. We present some ideas for optimizations of the attack and some properties of the message expansion routine. Finally, we show that for a reduced version of SHA-1, with 53 rounds instead of 80, it is possible to find collisions ...
Vincent Rijmen, Elisabeth Oswald
openaire +1 more source
Throughput Optimized SHA-1 Architecture Using Unfolding Transformation
IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (ASAP'06), 2006In this paper, the authors analyze the theoretical delay bound of the SHA-1 algorithm and propose architectures to achieve high throughput hardware implementations which approach this bound. According to the results of FPGA implementations, 3,541 Mbps with a pipeline and 893 Mbps without a pipeline were achieved.
Yong Lee +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
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