Data = 2^29 repetitions of 'a'

B9045A71 3CAED5DF F3D3B783 E98D1CE5 778D8BC3 31EE4119
D7070723 12AF06A7

I  think the test with 2^29 (0x20000000) byte repetitions is important
because  it makes the bit count "overflow" into the high 32-bit  word.
That would seem to me to be a key place where an implementation of any
of the Secure Hash Algorithms might fall over.

-- David Ireland

