Results 251 to 260 of about 29,768,854 (286)

FPGA implementation of SHA-1 algorithm

2003 5th International Conference on ASIC Proceedings (IEEE Cat No 03TH8690) ICASIC-03, 2003
In 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

Evaluating the Energy Costs of SHA-256 and SHA-3 (KangarooTwelve) in Resource-Constrained IoT Devices [PDF]

IoT
The rapid expansion of Internet of Things (IoT) devices has heightened the demand for lightweight and secure cryptographic mechanisms suitable for resource-constrained environments.
Craig Thomson, Gordon Russell, Isam Wadhaj   +2 more
exaly   +2 more sources

Low area and high speed SHA-1 implementation

2011 International SoC Design Conference, 2011
In 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, 2015
A 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   +3 more sources

A New Strategy for Finding a Differential Path of SHA-1

2007
In this paper, we propose a new construction algorithm for finding differential paths of Round 1 of SHA-1 for use in the collision search attack. Generally, the differential path of Round 1 is very complex, and it takes much time to find one by hand. Therefore, we propose a new search algorithm that consists of three sub searches, naming the forward ...
Jun Yajima, Yu Sasaki 0001, Yusuke Naito 0001, Terutoshi Iwasaki, Takeshi Shimoyama, Noboru Kunihiro, Kazuo Ohta   +6 more
openaire   +1 more source

Visualizing Secure Hash Algorithm (SHA-1) on the Web

2011
Cryptographic hash functions play an important role in modern cryptography. In this paper, we present web-based interactive visualization applets for teaching secure hash algorithm (SHA-1). The visualization applets lead to more efficient learning outcomes.
Dalia B. Nasr, Hatem M. Bahig, Sameh S. Daoud   +2 more
openaire   +1 more source

Exploiting Coding Theory for Collision Attacks on SHA-1

2005
In this article we show that coding theory can be exploited efficiently for the cryptanalysis of hash functions. We will mainly focus on SHA-1. We present different linear codes that are used to find low-weight differences that lead to a collision. We extend existing approaches and include recent results in the cryptanalysis of hash functions. With our
Norbert Pramstaller, Christian Rechberger, Vincent Rijmen   +2 more
openaire   +2 more sources

DSA with SHA-1 for space telecommands authentication

2007 15th International Conference on Software, Telecommunications and Computer Networks, 2007
The 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, Ennio Gambi, Matteo Leggieri   +2 more
openaire   +1 more source

The potential of reconfigurable hardware for HPC cryptanalysis of SHA-1

2011 Design, Automation & Test in Europe, 2011
Modern 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   +3 more sources

Hardware Architecture and Cost Estimates for Breaking SHA-1

2005
The cryptanalysis of hash functions has advanced rapidly, and many hash functions have been broken one after another. The most popular hash function SHA-1 has not been broken yet, but the new collision search techniques proposed by Wang et al. reduced the computational complexity down to 269, which is only 1/2,000 of the 280 operations needed for a ...
openaire   +2 more sources