The MDC-2 algorithm is a hash function for computing hash value on input data whose length L is a multiple of 64 bits and where L > 128. With the MDC-2 algorithm, outputs computed in each step of the algorithm are used, after being modified slightly, as key values in the next step of the algorithm. More particularyly, the modification consists of fixing certain bits in these values before they are used as keys. This technical report provides the rationale for the bit-fixing operation used within the MDC-2 algorithm
By: Don Coppersmith, Stephen M. Matyas, Mohammad Peyravian
Published in: RC21471 in 1999
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .