diff options
Diffstat (limited to 'src/math/gfpmath/gfp_element.cpp')
| -rw-r--r-- | src/math/gfpmath/gfp_element.cpp | 22 |
1 files changed, 12 insertions, 10 deletions
diff --git a/src/math/gfpmath/gfp_element.cpp b/src/math/gfpmath/gfp_element.cpp index f5ef28a00..183d7d4ab 100644 --- a/src/math/gfpmath/gfp_element.cpp +++ b/src/math/gfpmath/gfp_element.cpp @@ -1,13 +1,13 @@ -/****************************************************** - * Arithmetic for prime fields GF(p) (source file) * - * * - * (C) 2007 Martin Doering * - * [email protected] * - * Christoph Ludwig * - * [email protected] * - * Falko Strenzke * - * [email protected] * - ******************************************************/ +/****** + * Arithmetic for prime fields GF(p) (source file) + * + * (C) 2007 Martin Doering + * Christoph Ludwig + * Falko Strenzke + ******/ #include <botan/gfp_element.h> #include <botan/numthry.h> @@ -127,6 +127,8 @@ void montg_mult(BigInt& result, BigInt& a_bar, BigInt& b_bar, const BigInt& m, c /** *calculates R=b^n (here b=2) with R>m (and R beeing as small as possible) for an odd modulus m. * no check for oddity is performed! +* +* Distributed under the terms of the Botan license */ BigInt montgm_calc_r_oddmod(const BigInt& prime) { |