LibCrypto: Don't copy the prime test candidates

This was copying a bunch of bigints for no reason.

1 files changed, 1 insertions, 1 deletions

diff --git a/Userland/Libraries/LibCrypto/NumberTheory/ModularFunctions.cpp b/Userland/Libraries/LibCrypto/NumberTheory/ModularFunctions.cpp
index 2bc7445701..ecccd2c60e 100644
--- a/Userland/Libraries/LibCrypto/NumberTheory/ModularFunctions.cpp
+++ b/Userland/Libraries/LibCrypto/NumberTheory/ModularFunctions.cpp
@@ -258,7 +258,7 @@ static bool MR_primality_test(UnsignedBigInteger n, const Vector<UnsignedBigInte
         return n == 2;
     }
 
-    for (auto a : tests) {
+    for (auto& a : tests) {
         // Technically: ASSERT(2 <= a && a <= n - 2)
         ASSERT(a < n);
         auto x = ModularPower(a, d, n);