Provably Good Codes for Hash Function Design
- 13 September 2007
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Finding Good Differential Patterns for Attacks on SHA-1Published by Springer Nature ,2006
- On the Algebraic Structure of Quasi-Cyclic Codes III: Generator TheoryIEEE Transactions on Information Theory, 2005
- Quasicyclic Codes of Index ℓ over F q Viewed as F q[x]-Submodules of F q ℓ[x]/〈x m−1〉Published by Springer Nature ,2003
- Hardness of approximating the minimum distance of a linear codeIEEE Transactions on Information Theory, 2003
- The intractability of computing the minimum distance of a codeIEEE Transactions on Information Theory, 1997
- The MD5 Message-Digest AlgorithmPublished by RFC Editor ,1992
- New generalizations of the Reed-Muller codes--I: Primitive codesIEEE Transactions on Information Theory, 1968
- Self-orthogonal quasi-cyclic codesIEEE Transactions on Information Theory, 1967