Catacomb is a cryptographic library. It covers quite a lot of
- the `standard' cryptgraphic primitives, although there's plenty
+ the `standard' cryptographic primitives, although there's plenty
of scope for improvement, implementing more block ciphers and
hash functions for example. It contains a relatively extensive
multiprecision arithmetic library suitable for implementing a
Modular multiplication and exponentiation
Lots of public-key crypto uses modular multiplication and
- exponentation operations. Doing them efficiently is very
+ exponentiation operations. Doing them efficiently is very
important. Multiplication on its own is easy, and Catacomb's
multiplication algorithms are fairly good (though not up with
the very best). Doing the modular reduction afterwards is the
of adjacent 64-bit blocks being equal.
-Noncryptographic generators
+Non-cryptographic generators
Two pseudorandom-number generators are supplied which have no
cryptographic strength whatever. They are, respectively, a
distributed over the integers in the
interval [0, 2^32).
- r->ops->range(r, l) Returns an integer unformly distributed
+ r->ops->range(r, l) Returns an integer uniformly distributed
in the interval [0, l), l < 2^32.
r->ops->fill(r, p, sz) Fill the sz bytes at address p with
I've not actually included the DIEHARD output files in the
distribution, because they're quite large, and anyone can
- reproduce my results exactly using the publically available
+ reproduce my results exactly using the publicly available
DIEHARD distribution and the code supplied. If you do actually
want them, send me some mail and I'll send you a 60K tar.gz
file by (approximate) return.