| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2019-04-20 | powerpc/crypto: Use cheaper random numbers for crc-vpmsum self-test | George Spelvin | |
| This code was filling a 64K buffer from /dev/urandom in order to compute a CRC over (on average half of) it by two different methods, comparing the CRCs, and repeating. This is not a remotely security-critical application, so use the far faster and cheaper prandom_u32() generator. And, while we're at it, only fill as much of the buffer as we plan to use. Signed-off-by: George Spelvin <lkml@sdf.org> Acked-by: Daniel Axtens <dja@axtens.net> Signed-off-by: Michael Ellerman <mpe@ellerman.id.au> | |||
| 2017-03-24 | crypto: powerpc - Stress test for vpmsum implementations | Daniel Axtens | |
| vpmsum implementations often don't kick in for short test vectors. This is a simple test module that does a configurable number of random tests, each up to 64kB and each with random offsets. Both CRC-T10DIF and CRC32C are tested. Cc: Anton Blanchard <anton@samba.org> Signed-off-by: Daniel Axtens <dja@axtens.net> Signed-off-by: Herbert Xu <herbert@gondor.apana.org.au> | |||
 |
index : linux/linux-stable.git | |
| Linux kernel stable tree | kernel.org maintainers |
| summaryrefslogtreecommitdiff |