diff options
author | lloyd <[email protected]> | 2010-06-16 14:10:27 +0000 |
---|---|---|
committer | lloyd <[email protected]> | 2010-06-16 14:10:27 +0000 |
commit | 155e3146937fec7e93cce7a03f6b3597279a3ec2 (patch) | |
tree | 5a7c31c62d15aed33d20c69a0e0983f869e3da8b /src/math/numbertheory/numthry.h | |
parent | 7671e4eb33b244997c07bd548770b125ddde20d7 (diff) |
More Doxygen
Diffstat (limited to 'src/math/numbertheory/numthry.h')
-rw-r--r-- | src/math/numbertheory/numthry.h | 11 |
1 files changed, 9 insertions, 2 deletions
diff --git a/src/math/numbertheory/numthry.h b/src/math/numbertheory/numthry.h index 146f158b6..9a1005413 100644 --- a/src/math/numbertheory/numthry.h +++ b/src/math/numbertheory/numthry.h @@ -57,9 +57,16 @@ BigInt BOTAN_DLL inverse_mod(const BigInt& x, const BigInt& modulus); /** -* Jacobi function +* Compute the Jacobi symbol. If n is prime, this is equivalent +* to the Legendre symbol. +* @see http://mathworld.wolfram.com/JacobiSymbol.html +* +* @param a is a non-negative integer +* @param n is an odd integer > 1 +* @return (n / m) */ -s32bit BOTAN_DLL jacobi(const BigInt&, const BigInt&); +s32bit BOTAN_DLL jacobi(const BigInt& a, + const BigInt& n); /** * Modular exponentation |