summaryrefslogtreecommitdiff
path: root/nbtheory.h
diff options
context:
space:
mode:
authorTobias Nießen <tniessen@users.noreply.github.com>2021-03-04 19:17:42 +0100
committerGitHub <noreply@github.com>2021-03-04 13:17:42 -0500
commit0a40a0c3cab53a6cc2d45a084d9c24d39fa97c96 (patch)
tree2204beffa43998a4a50fe6f80417a9585cd7d1d4 /nbtheory.h
parent1f1a7994c85f962954283eb27f1e6d9eb10d7ecb (diff)
downloadcryptopp-git-0a40a0c3cab53a6cc2d45a084d9c24d39fa97c96.tar.gz
Fix typos in documentation and comments (PR #1012)
Diffstat (limited to 'nbtheory.h')
-rw-r--r--nbtheory.h2
1 files changed, 1 insertions, 1 deletions
diff --git a/nbtheory.h b/nbtheory.h
index 2b29c4db..0655afc7 100644
--- a/nbtheory.h
+++ b/nbtheory.h
@@ -105,7 +105,7 @@ CRYPTOPP_DLL bool CRYPTOPP_API IsPrime(const Integer &p);
/// \param level the level of thoroughness of testing
/// \return true if p is a strong probable prime, false otherwise
/// \details VerifyPrime() is suitable for testing candidate primes created by others. Internally,
-/// VerifyPrime() utilizes IsPrime() and one-round RabinMillerTest(). If the candiate passes and
+/// VerifyPrime() utilizes IsPrime() and one-round RabinMillerTest(). If the candidate passes and
/// level is greater than 1, then 10 round RabinMillerTest() primality testing is performed.
CRYPTOPP_DLL bool CRYPTOPP_API VerifyPrime(RandomNumberGenerator &rng, const Integer &p, unsigned int level = 1);