Hash functions and Cayley graphs
- 1 July 1994
- journal article
- research article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 4 (3) , 381-394
- https://doi.org/10.1007/bf01388652
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A Design Principle for Hash FunctionsPublished by Springer Nature ,2001
- Small-diameter Cayley Graphs for Finite Simple GroupsEuropean Journal of Combinatorics, 1989
- Diameters and eigenvaluesJournal of the American Mathematical Society, 1989
- Ramanujan graphsCombinatorica, 1988
- Manipulations and Errors, Detection and LocalizationPublished by Springer Nature ,1988
- λ1, Isoperimetric inequalities for graphs, and superconcentratorsJournal of Combinatorial Theory, Series B, 1985
- The complexity of finding minimum-length generator sequencesTheoretical Computer Science, 1985
- Introduction to Elliptic Curves and Modular FormsPublished by Springer Nature ,1984
- Explicit constructions of graphs without short cycles and low density codesCombinatorica, 1982
- On the estimation of Fourier coefficients of modular formsPublished by American Mathematical Society (AMS) ,1965