aboutsummaryrefslogtreecommitdiffstats
path: root/doc
diff options
context:
space:
mode:
authorlloyd <[email protected]>2009-11-10 03:52:53 +0000
committerlloyd <[email protected]>2009-11-10 03:52:53 +0000
commit34cb4ecfa3854d4b0985280fa72168e4d3a44948 (patch)
treef19bae461e23a01da1756dc372b2f995f5e39ce4 /doc
parent8a648d1e1d52de55a58de23b669e6796c2aeedf7 (diff)
Cleanups - remove emails from source files, they should only live in
credits.txt and thanks.txt. Remove some various bits of formatting weirdness.
Diffstat (limited to 'doc')
-rw-r--r--doc/thanks.txt7
1 files changed, 4 insertions, 3 deletions
diff --git a/doc/thanks.txt b/doc/thanks.txt
index caa2fb538..def96a16a 100644
--- a/doc/thanks.txt
+++ b/doc/thanks.txt
@@ -23,9 +23,10 @@ has provided financial assistance to the project.
Barry Kavanagh of AEP Systems Ltd kindly provided an AEP2000 crypto card and
drivers, enabling the creation of Botan's AEP engine module.
-In addition, the following people have unknowingly contributed help:
+In addition, the following people have unknowingly contributed help
+via public domain code which has been repurposed into the library:
- Dean Gaudet <[email protected]> wrote the SSE2 implementation of SHA-1
+ Dean Gaudet wrote the SSE2 implementation of SHA-1
The implementation of DES is based off a public domain implementation by Phil
Karn from 1994 (he, in turn, credits Richard Outerbridge and Jim Gillogly).
@@ -42,7 +43,7 @@ In addition, the following people have unknowingly contributed help:
Some of the hash functions (MD5, SHA-1, etc) use an optimized implementation
of one of the boolean functions, which was discovered by Colin Plumb.
- The design of Randpool takes some of it's design principles from those
+ The design of Randpool takes some of its design principles from those
suggested by Eric A. Young in his SSLeay documentation, Peter Gutmann's paper
"Software Generation of Practically Strong Random Numbers", and the paper
"Cryptanalytic Attacks on Pseudorandom Number Generators", by Kelsey,