A Simple Related-Key Attack on the Full SHACAL-1

@inproceedings{Biham2007ASR,
  title={A Simple Related-Key Attack on the Full SHACAL-1},
  author={Eli Biham and Orr Dunkelman and Nathan Keller},
  booktitle={CT-RSA},
  year={2007}
}
SHACAL-1 is a 160-bit block cipher with variable key length of up to 512-bit key based on the hash function SHA-1. It was submitted to the NESSIE project and was accepted as a finalist for the 2nd phase of evaluation. Since its introduction, SHACAL-1 withstood extensive cryptanalytic efforts. The best known key recovery attack on the full cipher up to this paper has a time complexity of about 2 encryptions. In this paper we use an observation due to Saarinen to present an elegant related-key… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 14 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 28 references

Finding Collisions in the Full SHA-1

View 4 Excerpts
Highly Influenced

Amplified Boomerang Attack against Reduced-Round SHACAL

ASIACRYPT • 2002
View 5 Excerpts
Highly Influenced

of Standards, Secure Hash Standard, Federal Information Processing Standards Publications No

US National Burea
180-2, • 2002
View 3 Excerpts
Highly Influenced

Related-Key Rectangle Attack on the Full SHACAL-1

Selected Areas in Cryptography • 2006
View 3 Excerpts

Collisions of SHA-0 and Reduced SHA-1

EUROCRYPT • 2005
View 2 Excerpts

Similar Papers

Loading similar papers…