 |
This article is an orphan, as few or no other articles link to it. Please introduce links to this page from other articles related to it. (February 2009) |
 |
The introduction to this article provides insufficient context for those unfamiliar with the subject. Please help improve the article with a good introductory style. (October 2009) |
MASH-1 is a hash function based on modular arithmetic.
Contents |
History
Despite many proposals, few hash functions based on modular arithmetic have withstood attack, and most that have tend to be relatively inefficient. MASH-1 evolved from a long line of related proposals successively broken and repaired.
Standard
Committee Draft ISO/IEC 10118-4 (Nov 95)
Description
MASH-1 involves use of an RSA-like modulus M, whose bitlength affects the security. M should be difficult to factor, and for M of unknown factorization, the security is based in part on the difficulty of extracting modular roots. M also determines the block size for processing messages.
MASH-2
There is a new version of the algorithm called MASH-2 with a different exponent (e=2).
References
- A. Menezes, P. van Oorschot, S. Vanstone, Handbook of Applied Cryptography, ISBN 0-8493-8523-7
 |
This cryptography-related article is a stub. You can help Wikipedia by expanding it. |
This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)
