From ccb6372369955c55469ee10f5c510d3b96ecdbef Mon Sep 17 00:00:00 2001 From: steve Date: Sun, 14 Jun 1998 16:06:00 +0000 Subject: 'They They' -> 'They' PR: 6912 Submitted by: Stefan Eggers --- contrib/opie/opie.4 | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'contrib') 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 -- cgit v1.1