# Difference between revisions of "SHA-1"

From The ECRYPT Hash Function Website

(→State Update Transformation) |
(→State Update Transformation) |
||

Line 22: | Line 22: | ||

\begin{equation} | \begin{equation} | ||

\label{eqn:a} | \label{eqn:a} | ||

− | \text{this works but is | + | \text{this works but is an ugly hack. click on the equation to see why } |

a = \sum_{i=0}^{n}{2^i} | a = \sum_{i=0}^{n}{2^i} | ||

\end{equation} | \end{equation} |

## Revision as of 15:55, 11 October 2006

## Contents

## 1 General Description

SHA-1 is an iterated hash function.

### 1.1 Compression Function

The compression function takes as input a 512-bit message block and a 160-bit chaining variable, and produces a 160-bit chaining value. The compression function is described as follows:

#### 1.1.1 Message Expansion

#### 1.1.2 State Update Transformation

WikiTeX: latex reported a failure, namely:

/data/www/ehash/html/extensions/wikitex/wikitex.sh: line 59: latex: command not found

WikiTeX: latex reported a failure, namely:

/data/www/ehash/html/extensions/wikitex/wikitex.sh: line 59: latex: command not found

### 1.2 Padding Method

### 1.3 Initial Value and Constants

WikiTeX: latex reported a failure, namely:

/data/www/ehash/html/extensions/wikitex/wikitex.sh: line 59: latex: command not found

## 2 Claimed Security Margins

## 3 Security Anaylsis

- Best know attack: <math>2^{63}</math> by Wang et.al.
- Best known collision example: 64-step collision by De Canniere and Rechberger

something like: best know attack to date: kind of attack, which variant has been looked at (e.g. round-reduced), complexity, and reference to paper and abstract.

may be make here a new page with the other cryptanalysis results.