From: Russ Cox <rsc@golang.org>
Date: Mon, 7 May 2012 20:45:34 +0000 (-0400)
Subject: crypto/aes: fix comment
X-Git-Tag: go1.1rc2~3232
X-Git-Url: http://www.git.cypherpunks.su/?a=commitdiff_plain;h=36675daa0f417622ce94b14ccb8de169fa51f295;p=gostls13.git

crypto/aes: fix comment

Fixes #3589.

R=golang-dev, iant
CC=golang-dev
https://golang.org/cl/6190044
---

diff --git a/src/pkg/crypto/aes/const.go b/src/pkg/crypto/aes/const.go
index f0b4eabf6e..aee73a7c52 100644
--- a/src/pkg/crypto/aes/const.go
+++ b/src/pkg/crypto/aes/const.go
@@ -11,11 +11,11 @@ package aes
 // http://www.csrc.nist.gov/publications/fips/fips197/fips-197.pdf
 
 // AES is based on the mathematical behavior of binary polynomials
-// (polynomials over GF(2)) modulo the irreducible polynomial x⁸ + x⁴ + x² + x + 1.
+// (polynomials over GF(2)) modulo the irreducible polynomial x⁸ + x⁴ + x³ + x + 1.
 // Addition of these binary polynomials corresponds to binary xor.
 // Reducing mod poly corresponds to binary xor with poly every
 // time a 0x100 bit appears.
-const poly = 1<<8 | 1<<4 | 1<<3 | 1<<1 | 1<<0 // x⁸ + x⁴ + x² + x + 1
+const poly = 1<<8 | 1<<4 | 1<<3 | 1<<1 | 1<<0 // x⁸ + x⁴ + x³ + x + 1
 
 // Powers of x mod poly in GF(2).
 var powx = [16]byte{