Patch for the test classes is attached. It consists of a base test class
and the five TestOf* classes modified to make use of it.
On Tue, 25 Jun 2002, Raif S. Naffah wrote:
Casey Marshall wrote:
I think for the KA tests the number of tests should depend on the length of
the key/text, by (say) using the word 0x80000000 at all the possible word
(dynner, 32 bit) aligned offsets, e.g.
8000000000000000000000000000000000000000
0000000080000000000000000000000000000000
...etc.
just because it is seems less arbitrary and spans the space of keys/texts.
i'm not sure. if the cipher is not correctly implemented, it's highly
unlikely to pass some KATs and fails others.
even if this is the case, a cipher implementation should be deemed
correct iff it passes *all* the tests!
Absolutely. I decided to just use sequential texts (shift one bit to the
right each time) instead of random/arbitrary ones. It is simpler to program
and to produce tests, and the monte carlo tests exercise the algorithms
enough that errors are unlikely to sneak by.