diff options
| author | Jeffrey Walton <noloader@gmail.com> | 2017-09-20 18:43:51 -0400 |
|---|---|---|
| committer | Jeffrey Walton <noloader@gmail.com> | 2017-09-20 18:43:51 -0400 |
| commit | e4498a105ed292ee9efb1adc9e62b55dd0a110a7 (patch) | |
| tree | 46259e69fe1af8ce6237846bb842c543ddda3bb2 /nbtheory.cpp | |
| parent | 4b7549a990f5bdaddb3b76f6caf4e817a02871f1 (diff) | |
| download | cryptopp-git-e4498a105ed292ee9efb1adc9e62b55dd0a110a7.tar.gz | |
Use ::time() and ::log() instead of std::time() and std::log() (GH #512)
The 35c0fa82fd4c change broke GCC 4.8
Diffstat (limited to 'nbtheory.cpp')
| -rw-r--r-- | nbtheory.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/nbtheory.cpp b/nbtheory.cpp index 010f8e14..c3d43757 100644 --- a/nbtheory.cpp +++ b/nbtheory.cpp @@ -1023,14 +1023,14 @@ unsigned int FactoringWorkFactor(unsigned int n) // extrapolated from the table in Odlyzko's "The Future of Integer Factorization"
// updated to reflect the factoring of RSA-130
if (n<5) return 0;
- else return (unsigned int)(2.4 * std::pow((double)n, 1.0/3.0) * std::pow(std::log(double(n)), 2.0/3.0) - 5);
+ else return (unsigned int)(2.4 * std::pow((double)n, 1.0/3.0) * std::pow(::log(double(n)), 2.0/3.0) - 5);
}
unsigned int DiscreteLogWorkFactor(unsigned int n)
{
// assuming discrete log takes about the same time as factoring
if (n<5) return 0;
- else return (unsigned int)(2.4 * std::pow((double)n, 1.0/3.0) * std::pow(std::log(double(n)), 2.0/3.0) - 5);
+ else return (unsigned int)(2.4 * std::pow((double)n, 1.0/3.0) * std::pow(::log(double(n)), 2.0/3.0) - 5);
}
// ********************************************************
|