summaryrefslogtreecommitdiffstats
path: root/contrib
diff options
context:
space:
mode:
authorsteve <steve@FreeBSD.org>1998-06-14 16:06:00 +0000
committersteve <steve@FreeBSD.org>1998-06-14 16:06:00 +0000
commitccb6372369955c55469ee10f5c510d3b96ecdbef (patch)
tree1d2626031d4e57b7fbef8afcced7b91b60bbef28 /contrib
parent69e29925cd5a259c1bc33744d63ef6db4317b22f (diff)
downloadFreeBSD-src-ccb6372369955c55469ee10f5c510d3b96ecdbef.zip
FreeBSD-src-ccb6372369955c55469ee10f5c510d3b96ecdbef.tar.gz
'They They' -> 'They'
PR: 6912 Submitted by: Stefan Eggers <seggers@semyam.dinoco.de>
Diffstat (limited to 'contrib')
-rw-r--r--contrib/opie/opie.42
1 files changed, 1 insertions, 1 deletions
diff --git a/contrib/opie/opie.4 b/contrib/opie/opie.4
index 92de78f..a68cd16 100644
--- a/contrib/opie/opie.4
+++ b/contrib/opie/opie.4
@@ -138,7 +138,7 @@ you can still be broken into.
A solution to this whole problem was invented by Lamport in 1981. This
technique was implemented by Haller, Karn, and Walden at Bellcore. They
-They created a free software package called "S/Key" that used an algorithm
+created a free software package called "S/Key" that used an algorithm
called a cryptographic checksum. A cryptographic checksum is a strong one-way
function such that, knowing the result of such a function, an attacker still
cannot feasably determine the input. Further, unlike cyclic redundancy
OpenPOWER on IntegriCloud