Results 171 to 180 of about 152,261,022 (216)
Some of the next articles are maybe not open access.

Chaos-based joint speech encryption scheme using SHA-1

Multimedia tools and applications, 2021
G. Kaur   +2 more
semanticscholar   +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   +2 more
openaire   +1 more source

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

Design of SHA-1 Algorithm Based on FPGA

2010 Second International Conference on Networks Security, Wireless Communications and Trusted Computing, 2010
SHA (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

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   +6 more
openaire   +1 more source

Hardware design for SHA-1 based on FPGA

2011 International Conference on Electronics, Communications and Control (ICECC), 2011
The SHA-1 algorithm in Hash Function was widely used in TPM hardware design. This paper proposes a design of SHA-1 hash function operations on FPGA hardware implementations. Optimized the structure of the module about the algorithm, which implement the simulation and synthesis.
Zhou Hua, Liu Qiao
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

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   +2 more
openaire   +2 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

Home - About - Disclaimer - Privacy