Abstract
The choice of a collection of cryptographically strong Boolean functions is crucial in designing a strong hashing algorithm. The paper shows that it is possible to obtain five linearly nonequivalent functions with five Boolean variables which are cryptographically strong and easy to implement. They can be readily used to design hashing algorithms (of the MD5 structure).
Cite
CITATION STYLE
Charnes, C., & Pieprzyk, J. (1993). Linear nonequivalence versus nonlinearity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 718 LNCS, pp. 156–164). Springer Verlag. https://doi.org/10.1007/3-540-57220-1_59
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
