Hash functions and graphs with large girths

Authors:
G. Zémor
Affiliations:
Dept. Réseaux, E.N.S.T., Paris Cedex 13, France
Venue:
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Year:
1991

Citing 3
Cited 4

The complexity of finding minimum-length generator sequences

Theoretical Computer Science
Can a fast signature scheme without secret key be secure?

Proceedings of the 2nd international conference, AAECC-2 on Applied algebra, algorithmics and error-correcting codes
Manipulations and errors, detection and localization

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88

How to find and avoid collisions for the knapsack hash function

EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Weaknesses in the SL2(IFs2) Hashing Scheme

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Hashing with SL_2

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Preimages for the Tillich-Zémor hash function

SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose and analyse an easily computable cryptographic hash function, for the purpose of signing long variable length texts, which is related to the construction of graphs with large girths.