diff options
| author | Jason Wang <wangborong@cdjrlc.com> | 2022-07-15 12:50:07 +0800 |
|---|---|---|
| committer | Herbert Xu <herbert@gondor.apana.org.au> | 2022-07-22 16:22:04 +0800 |
| commit | 824b94a88320eaa5e3e059b494e457ed25987a63 (patch) | |
| tree | 10c014cd117cad3b2bfd1d8343e2798ba51047e3 | |
| parent | 4cbdecd02fd29eb69a376ffdac47aff441c4d19f (diff) | |
crypto: twofish - Fix comment typo
The double `that' is duplicated in line 301, remove one.
Signed-off-by: Jason Wang <wangborong@cdjrlc.com>
Signed-off-by: Herbert Xu <herbert@gondor.apana.org.au>
| -rw-r--r-- | crypto/twofish_common.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/crypto/twofish_common.c b/crypto/twofish_common.c index d23fa531b91f..f921f30334f4 100644 --- a/crypto/twofish_common.c +++ b/crypto/twofish_common.c @@ -298,7 +298,7 @@ static const u32 mds[4][256] = { * multiplication is inefficient without hardware support. To multiply * faster, I make use of the fact x is a generator for the nonzero elements, * so that every element p of GF(2)[x]/w(x) is either 0 or equal to (x)^n for - * some n in 0..254. Note that that caret is exponentiation in GF(2^8), + * some n in 0..254. Note that caret is exponentiation in GF(2^8), * *not* polynomial notation. So if I want to compute pq where p and q are * in GF(2^8), I can just say: * 1. if p=0 or q=0 then pq=0 |