Improved Collision and Preimage Resistance Bounds on PGV Schemes

@article{Duo2006ImprovedCA,
  title={Improved Collision and Preimage Resistance Bounds on PGV Schemes},
  author={Lei Duo and Chao Li},
  journal={IACR Cryptology ePrint Archive},
  year={2006},
  volume={2006},
  pages={462}
}
Preneel, Govaerts, and Vandewalle[14](PGV) considered 64 most basic ways to construct a hash function from a block cipher, and regarded 12 of those 64 schemes as secure. Black, Pogaway and Shrimpton[3](BRS) provided a formal and quantitative treatment of those 64 constructions and proved that, in black-box model, the 12 schemes ( group − 1 ) that PGV singled out as secure really are secure. By stepping outside of the Merkle-Damg̊ard[4] approach to analysis, an additional 8 (group − 2) of the 64… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Recent Developments in the Design of Conventional Cryptographic Algorithms. In State of the Art and Evolution of Computer Security and Industrial Cryptography

B.Preneel, V. Rijmen, A.Bosselaers
Lecture Notes in Computer Science, • 1998
View 1 Excerpt

Cryptography: a New Dimension in Data Security

C. H. Meyer, S. M. Matyas
1982
View 1 Excerpt

Digitalized Signatures

M. O. Rabin
Foundations of Secure Computation, • 1978
View 2 Excerpts

Communication theory of secrecy systems,

C. E. Shannon
Bell System Technical Journal, • 1949
View 2 Excerpts

Similar Papers

Loading similar papers…