diff --git a/dh/csidh/csidh.go b/dh/csidh/csidh.go
index 9c33554c6..2869edad7 100644
--- a/dh/csidh/csidh.go
+++ b/dh/csidh/csidh.go
@@ -68,7 +68,7 @@ func (s *fpRngGen) randFp(v *fp, rng io.Reader) {
 // if function has finished successfully. In case first return value is true,
 // second return value indicates if curve represented by coffactor 'a' is
 // supersingular.
-// Implemenation uses divide-and-conquer strategy and recursion in order to
+// Implementation uses divide-and-conquer strategy and recursion in order to
 // speed up calculation of Q_i = [(p+1)/l_i] * P.
 // Implementation is not constant time, but it operates on public data only.
 func cofactorMul(p *point, a *coeff, halfL, halfR int, order *fp) (bool, bool) {
diff --git a/dh/sidh/internal/p503/arith_amd64.s b/dh/sidh/internal/p503/arith_amd64.s
index 41022c8a7..02f71470a 100644
--- a/dh/sidh/internal/p503/arith_amd64.s
+++ b/dh/sidh/internal/p503/arith_amd64.s
@@ -37,7 +37,7 @@
 // uses MULX instruction. Macro smashes value in DX.
 // Input: I0 and I1.
 // Output: O
-// All the other arguments are resgisters, used for storing temporary values
+// All the other arguments are registers, used for storing temporary values
 #define MULS256_MULX(O, I0, I1, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9) \
 	MOVQ    I0, DX          \
 	MULXQ   I1, T1, T0      \   // T0:T1 = A0*B0
@@ -353,7 +353,7 @@
 
 // Template for calculating the Montgomery reduction algorithm described in
 // section 5.2.3 of https://eprint.iacr.org/2017/1015.pdf. Template must be
-// customized with schoolbook multiplicaton for 128 x 320-bit number.
+// customized with schoolbook multiplication for 128 x 320-bit number.
 // This macro reuses memory of IN value and *changes* it. Smashes registers
 // R[8-15], BX, CX
 // Input:
diff --git a/dh/sidh/internal/p751/arith_amd64.s b/dh/sidh/internal/p751/arith_amd64.s
index 2ae2094fe..71cd43352 100644
--- a/dh/sidh/internal/p751/arith_amd64.s
+++ b/dh/sidh/internal/p751/arith_amd64.s
@@ -1609,7 +1609,7 @@ TEXT ·mulP751(SB), $96-24
 
 // Template for calculating the Montgomery reduction algorithm described in
 // section 5.2.3 of https://eprint.iacr.org/2017/1015.pdf. Template must be
-// customized with schoolbook multiplicaton for 256 x 448-bit number.
+// customized with schoolbook multiplication for 256 x 448-bit number.
 // This macro reuses memory of IN value and *changes* it. Smashes registers
 // R[8-15], AX, BX, CX, DX, BP.
 // Input:
diff --git a/ecc/goldilocks/constants.go b/ecc/goldilocks/constants.go
index 046deb2af..a027003bb 100644
--- a/ecc/goldilocks/constants.go
+++ b/ecc/goldilocks/constants.go
@@ -3,7 +3,7 @@ package goldilocks
 import fp "github.com/cloudflare/circl/math/fp448"
 
 var (
-	// genX is the x-coordintate of the generator of Goldilocks curve.
+	// genX is the x-coordinate of the generator of Goldilocks curve.
 	genX = fp.Elt{
 		0x5e, 0xc0, 0x0c, 0xc7, 0x2b, 0xa8, 0x26, 0x26,
 		0x8e, 0x93, 0x00, 0x8b, 0xe1, 0x80, 0x3b, 0x43,