If done correctly, it won't matter whether the hash was done with one or multiple calls to the MD5 functions. If you look at the source for the typical "md5sum", it processes a file in blocks (multiple calls).


I've compared md5sum in PASE, ILE C, and ILE C modified to use CIPHER. CIPHER was the fastest with PASE close behind. ILE C (no MI) is a slower. RPG using CIPHER should perform well.

Remember to consider ebcdic/ascii issues if not processing files as binary.


Keith



Tom Liotta wrote:
midrange-l-request@xxxxxxxxxxxx wrote:


 7. RE: MD5 and RPG or...? (Wilt, Charles)

You should be able to find more info in the archives. But there's a couple of parameters that allow you to call CIPHER repeatedly, once for each chunk of an unlimited size file.


Charles:

There are a lot of archive references, but nearly all that I read were 
concerned with individual calls to CIPHER. The only ones that seemed beyond 
that were Leif's and the lone unanswered one (which is what made me wonder how 
fruitful further searching/reading would be).

It'll be interesting to see how a series of CIPHERs matches with md5sum.

Thanks.

Tom Liotta


As an Amazon Associate we earn from qualifying purchases.

This thread ...

Replies:

Follow On AppleNews
Return to Archive home page | Return to MIDRANGE.COM home page

This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].

Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.