| Message ID | 20220715045007.21447-1-wangborong@cdjrlc.com |
|---|---|
| State | Accepted |
| Commit | 824b94a88320eaa5e3e059b494e457ed25987a63 |
| Headers | show |
| Series | crypto: Fix comment typo | expand |
On Fri, Jul 15, 2022 at 12:50:07PM +0800, Jason Wang wrote: > The double `that' is duplicated in line 301, remove one. > > Signed-off-by: Jason Wang <wangborong@cdjrlc.com> > --- > crypto/twofish_common.c | 2 +- > 1 file changed, 1 insertion(+), 1 deletion(-) Patch applied. Thanks.
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
The double `that' is duplicated in line 301, remove one. Signed-off-by: Jason Wang <wangborong@cdjrlc.com> --- crypto/twofish_common.c | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-)