else if(algorithm == 14)
bits = 384;
else {
- throw runtime_error("Can't guess key size for algoritm "+lexical_cast<string>(algorithm));
+ throw runtime_error("Can't guess key size for algorithm "+lexical_cast<string>(algorithm));
}
}
}
dsrc.d_digest = dpk->hash(toHash);
}
else
- throw std::runtime_error("Asked to a DS of unkown digest type " + lexical_cast<string>(digest)+"\n");
+ throw std::runtime_error("Asked to a DS of unknown digest type " + lexical_cast<string>(digest)+"\n");
dsrc.d_algorithm= drc.d_algorithm;
dsrc.d_digesttype=digest;
the nameserver of the ISP, it determines which of the 'www.thesite.com'
servers is closest.
-A multitude of algoritms is in use for determining which server is closest.
+A multitude of algorithms is in use for determining which server is closest.
Some of them employ the Border Gateway Protocol, BGP, which is used for
global internet routing. Some use 'ICMP Ping' measurements, some use
modified DNS Queries. The simplest algorithm is to use IP Netmasks, which
else if(algorithm == 14)
bits = 384;
else {
- throw runtime_error("Can't guess key size for algoritm "+lexical_cast<string>(algorithm));
+ throw runtime_error("Can't guess key size for algorithm "+lexical_cast<string>(algorithm));
}
}
}