diff options
author | lloyd <[email protected]> | 2009-11-18 08:54:45 +0000 |
---|---|---|
committer | lloyd <[email protected]> | 2009-11-18 08:54:45 +0000 |
commit | 7a62a8c05ddf02073108f4117a80065d2d8ae7ec (patch) | |
tree | 2d53d3010e2f36951db035d2fe8bb3b8f4a1c6ff /src/math/numbertheory | |
parent | 6e45f118d112ee55b980a262b8b9ec67e66e9268 (diff) |
Remove to_string, replacing with std::to_string
Convert to_u32bit to use the new C++0x library func stoul instead of
hand-written code.
Diffstat (limited to 'src/math/numbertheory')
-rw-r--r-- | src/math/numbertheory/dsa_gen.cpp | 6 | ||||
-rw-r--r-- | src/math/numbertheory/make_prm.cpp | 4 |
2 files changed, 5 insertions, 5 deletions
diff --git a/src/math/numbertheory/dsa_gen.cpp b/src/math/numbertheory/dsa_gen.cpp index d5f6dc792..39a7cf5fa 100644 --- a/src/math/numbertheory/dsa_gen.cpp +++ b/src/math/numbertheory/dsa_gen.cpp @@ -47,15 +47,15 @@ bool generate_dsa_primes(RandomNumberGenerator& rng, if(!fips186_3_valid_size(pbits, qbits)) throw Invalid_Argument( "FIPS 186-3 does not allow DSA domain parameters of " + - to_string(pbits) + "/" + to_string(qbits) + " bits long"); + std::to_string(pbits) + "/" + std::to_string(qbits) + " bits long"); if(seed_c.size() * 8 < qbits) throw Invalid_Argument( - "Generating a DSA parameter set with a " + to_string(qbits) + + "Generating a DSA parameter set with a " + std::to_string(qbits) + "long q requires a seed at least as many bits long"); std::unique_ptr<HashFunction> hash( - af.make_hash_function("SHA-" + to_string(qbits))); + af.make_hash_function("SHA-" + std::to_string(qbits))); const u32bit HASH_SIZE = hash->OUTPUT_LENGTH; diff --git a/src/math/numbertheory/make_prm.cpp b/src/math/numbertheory/make_prm.cpp index b136b6d25..3eb01cd42 100644 --- a/src/math/numbertheory/make_prm.cpp +++ b/src/math/numbertheory/make_prm.cpp @@ -20,7 +20,7 @@ BigInt random_prime(RandomNumberGenerator& rng, { if(bits <= 1) throw Invalid_Argument("random_prime: Can't make a prime of " + - to_string(bits) + " bits"); + std::to_string(bits) + " bits"); else if(bits == 2) return ((rng.next_byte() % 2) ? 2 : 3); else if(bits == 3) @@ -85,7 +85,7 @@ BigInt random_safe_prime(RandomNumberGenerator& rng, u32bit bits) { if(bits <= 64) throw Invalid_Argument("random_safe_prime: Can't make a prime of " + - to_string(bits) + " bits"); + std::to_string(bits) + " bits"); BigInt p; do |