diff --git a/README.md b/README.md
index 517d8920d..bf19663c6 100644
--- a/README.md
+++ b/README.md
@@ -78,7 +78,7 @@ Import the `galois` package in Python.
 In [1]: import galois
 
 In [2]: galois.__version__
-Out[2]: '0.3.1'
+Out[2]: '0.3.2'
 ```
 
 ### Create a [`FieldArray`](https://mhostetter.github.io/galois/latest/api/galois.FieldArray/) subclass
diff --git a/docs/index.rst b/docs/index.rst
index 51b6e5ea0..0954b5648 100644
--- a/docs/index.rst
+++ b/docs/index.rst
@@ -149,6 +149,7 @@ If this library was useful to you in your research, please cite us. Following th
    :hidden:
 
    release-notes/versioning.rst
+   release-notes/v0.3.2.md
    release-notes/v0.3.1.md
    release-notes/v0.3.0.md
    release-notes/v0.2.0.md
diff --git a/docs/release-notes/v0.3.2.md b/docs/release-notes/v0.3.2.md
new file mode 100644
index 000000000..a50eb55f5
--- /dev/null
+++ b/docs/release-notes/v0.3.2.md
@@ -0,0 +1,52 @@
+# v0.3.2
+
+*Released December 18, 2022*
+
+## Changes
+
+- Added a prime factorization database for $n = b^k \pm 1$, with $b \in \{2, 3, 5, 6, 7, 10, 11, 12\}$.
+  The factorizations are from the [Cunningham Book](https://homes.cerias.purdue.edu/~ssw/cun/third/index.html).
+  This speeds up the creation of large finite fields. ([#452](https://github.com/mhostetter/galois/pull/452))
+  ```ipython
+  In [1]: import galois
+  
+  # v0.3.1
+  In [2]: %time galois.factors(2**256 - 1)
+  # Took forever...
+  
+  # v0.3.2
+  In [2]: %time galois.factors(2**256 - 1)
+  Wall time: 1 ms
+  Out[2]:
+  ([3,
+    5,
+    17,
+    257,
+    641,
+    65537,
+    274177,
+    6700417,
+    67280421310721,
+    59649589127497217,
+    5704689200685129054721],
+   [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1])
+  ```
+- Added speed-up when factoring powers of small primes. This speeds up the creation of large finite fields. ([#454](https://github.com/mhostetter/galois/pull/454))
+  ```ipython
+  In [1]: import galois
+  
+  # v0.3.1
+  In [2]: %time galois.factors(2**471)
+  Wall time: 4.18 s
+  Out[2]: ([2], [471])
+  
+  # v0.3.2
+  In [2]: %time galois.factors(2**471)
+  Wall time: 2 ms
+  Out[2]: ([2], [471])
+  ```
+- Added four additional Mersenne primes that were discovered between 2013-2018. ([#452](https://github.com/mhostetter/galois/pull/452))
+
+## Contributors
+
+- Matt Hostetter ([@mhostetter](https://github.com/mhostetter))