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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
N. Alon, and V.D. Milman, “λ1, isoperimetric inequalities for graphs, and superconcentrators”, J. Comb. Theory. Ser. B, 38 (1985), 73–88.
L. Babai, W.M. Kantor, and A. Lubotsky, “Small-diameter Cayley Graphs for Finite Simple Groups,” Europ. J. Combinatorics, 1989, 10, 507–522.
P. Camion, “Can a Fast Signature Scheme Without Secret Key be Secure?”, in AAECC, Lecture Notes in Computer Science, n 228, Springer-Verlag.
M.R. Jerrum, “The Complexity of Finding Minimum Length Generator Sequences”, Theoretical Computer Science, April 1985.
P. Godlewski and P. Camion, “Manipulations and Errors, Detection and Localization”, Advances in Cryptology, EUROCRYPT-88, Springer-Verlag, pp.96–106.
G.A. Margulis, “Explicit Constructions of Graphs Without Short Cycles and Low Density Codes,” COMBINATORICA 2(1), 1982, 71–78.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zémor, G. (1991). Hash Functions And Graphs With Large Girths. In: Davies, D.W. (eds) Advances in Cryptology — EUROCRYPT ’91. EUROCRYPT 1991. Lecture Notes in Computer Science, vol 547. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46416-6_44
Download citation
DOI: https://doi.org/10.1007/3-540-46416-6_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54620-7
Online ISBN: 978-3-540-46416-7
eBook Packages: Springer Book Archive