diff --git a/ChaosBenches/CMakeLists.txt b/ChaosBenches/CMakeLists.txt
index dcccb82..3aa601c 100644
--- a/ChaosBenches/CMakeLists.txt
+++ b/ChaosBenches/CMakeLists.txt
@@ -14,7 +14,8 @@ FetchContent_MakeAvailable(googlebenchmark)
 
 set(ChaosBenches_SOURCE BenchmarkMain.cpp
                         Hash/Md4HasherBenches.cpp
-                        Hash/Md5HasherBenches.cpp)
+                        Hash/Md5HasherBenches.cpp
+                        Hash/Sha1HasherBenches.cpp)
 
 add_executable(ChaosBenches ${ChaosBenches_SOURCE})
 target_link_libraries(ChaosBenches benchmark::benchmark)
diff --git a/ChaosBenches/Hash/Sha1HasherBenches.cpp b/ChaosBenches/Hash/Sha1HasherBenches.cpp
new file mode 100644
index 0000000..69c9870
--- /dev/null
+++ b/ChaosBenches/Hash/Sha1HasherBenches.cpp
@@ -0,0 +1,65 @@
+#include <benchmark/benchmark.h>
+#include <cstring>
+
+#include <Hash/Sha1.hpp>
+
+using namespace Chaos::Hash::Sha1;
+
+static const char * DATA_BEGIN
+    = "All states, all powers, that have held and hold rule over men have been and are either republics or principalities.\n"
+      "Principalities are either hereditary, in which the family has been long established; or they are new.\n"
+      "The new are either entirely new, as was Milan to Francesco Sforza, or they are, as it were, members annexed to the hereditary state of the "
+      "prince who has acquired them, as was the kingdom of Naples to that of the King of Spain.\n"
+      "Such dominions thus acquired are either accustomed to live under a prince, or to live in freedom; and are acquired either by the arms of the "
+      "prince himself, or of others, or else by fortune or by ability.";
+static const size_t DATA_LEN = strlen(DATA_BEGIN);
+static const char * DATA_END = DATA_BEGIN + DATA_LEN;
+
+static void Sha1Hasher_CreateComputeDeleteBench(benchmark::State & state)
+{
+    for (auto _ : state)
+    {
+        Sha1Hasher hasher;
+        hasher.Update(DATA_BEGIN, DATA_END);
+        Sha1Hash result = hasher.Finish();
+
+        benchmark::DoNotOptimize(result);
+    }
+}
+
+BENCHMARK(Sha1Hasher_CreateComputeDeleteBench);
+
+static void Sha1Hasher_ReuseBench(benchmark::State & state)
+{
+    Sha1Hasher hasher;
+
+    for (auto _ : state)
+    {
+        hasher.Reset();
+        hasher.Update(DATA_BEGIN, DATA_END);
+        Sha1Hash result = hasher.Finish();
+
+        benchmark::DoNotOptimize(result);
+    }
+}
+
+BENCHMARK(Sha1Hasher_ReuseBench);
+
+static void Sha1Hasher_PartialUpdate100Bench(benchmark::State & state)
+{
+    for (auto _ : state)
+    {
+        Sha1Hasher hasher;
+
+        for (int i = 0; i < 100; ++i)
+        {
+            hasher.Update(DATA_BEGIN, DATA_END);
+        }
+
+        Sha1Hash result = hasher.Finish();
+
+        benchmark::DoNotOptimize(result);
+    }
+}
+
+BENCHMARK(Sha1Hasher_PartialUpdate100Bench);