Is there an adjustment for Adler32 algorithm so it works well on short messages?
In [1], the authors show that for 1500 bytes, the chance of an undetected collision with Adler32 is less than one in 100 billion.

In that paper, see Figure 13 which states:


  Comparison of 8-, 16-, and 32-bit Fletcher and Adler checksums using random data at a BER of 10-5. The data point values are the mean of 10 trials.


And shows probability of undetected error using Adler32 to below 10-11 for a 1500 byte message.

Therefore, as D.W. suggested above, no adjustment is needed.



[1] Maxino, Theresa C., and Philip J. Koopman. "The effectiveness of checksums for embedded control networks." Dependable and Secure Computing, IEEE Transactions on 6.1 (2009): 59-72.