diff options
| author | Steve Price <steve@FreeBSD.org> | 1998-06-14 16:06:00 +0000 |
|---|---|---|
| committer | Steve Price <steve@FreeBSD.org> | 1998-06-14 16:06:00 +0000 |
| commit | 3630d9abffdc4fee7863b249b81a5816cf8a27a9 (patch) | |
| tree | 16ad9ec9d93c4b2902284263d7109f96dcb46cf5 /contrib | |
| parent | ed9c039078119b9102cf5af036060316a2dbc3d1 (diff) | |
| download | src-3630d9abffdc4fee7863b249b81a5816cf8a27a9.tar.gz src-3630d9abffdc4fee7863b249b81a5816cf8a27a9.zip | |
'They They' -> 'They'
PR: 6912
Submitted by: Stefan Eggers <seggers@semyam.dinoco.de>
Notes
Notes:
svn path=/head/; revision=36982
Diffstat (limited to 'contrib')
| -rw-r--r-- | contrib/opie/opie.4 | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/contrib/opie/opie.4 b/contrib/opie/opie.4 index 92de78f9390d..a68cd1696c55 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 |