From seggers@semyam.dinoco.de  Thu Jun 11 07:23:56 1998
Received: from tim.xenologics.com (tim.xenologics.com [194.77.5.24])
          by hub.freebsd.org (8.8.8/8.8.8) with ESMTP id HAA25893
          for <FreeBSD-gnats-submit@freebsd.org>; Thu, 11 Jun 1998 07:23:54 -0700 (PDT)
          (envelope-from seggers@semyam.dinoco.de)
Received: (from uucp@localhost)
	by tim.xenologics.com (8.8.5/8.8.8) with UUCP id QAA21120
	for FreeBSD-gnats-submit@freebsd.org; Thu, 11 Jun 1998 16:21:50 +0200 (MET DST)
Received: (from seggers@localhost)
	by semyam.dinoco.de (8.8.8/8.8.8) id NAA08251;
	Thu, 11 Jun 1998 13:05:23 +0200 (CEST)
	(envelope-from seggers)
Message-Id: <199806111105.NAA08251@semyam.dinoco.de>
Date: Thu, 11 Jun 1998 13:05:23 +0200 (CEST)
From: Stefan Eggers <seggers@semyam.dinoco.de>
Reply-To: seggers@semyam.dinoco.de
To: FreeBSD-gnats-submit@freebsd.org
Cc: seggers@semyam.dinoco.de
Subject: opie.4 has doubled word in man page
X-Send-Pr-Version: 3.2

>Number:         6912
>Category:       docs
>Synopsis:       opie.4 has doubled word in man page
>Confidential:   no
>Severity:       non-critical
>Priority:       low
>Responsible:    freebsd-doc
>State:          closed
>Quarter:        
>Keywords:       
>Date-Required:  
>Class:          doc-bug
>Submitter-Id:   current-users
>Arrival-Date:   Thu Jun 11 07:30:01 PDT 1998
>Closed-Date:    Sun Jun 14 09:05:40 PDT 1998
>Last-Modified:  Sun Jun 14 09:07:43 PDT 1998
>Originator:     Stefan Eggers
>Release:        FreeBSD 2.2.6-STABLE i386
>Organization:
none
>Environment:

	not applicable

>Description:

	The description of the S/KEY algorithm on this man page has a
sentence starting with "They They" in it.

>How-To-Repeat:

	Read opie(4).

>Fix:
	
*** opie.4.ORIG	Tue Aug 26 22:56:14 1997
--- opie.4	Thu Jun 11 12:59:06 1998
***************
*** 138,144 ****
  
  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
  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
--- 138,144 ----
  
  A solution to this whole problem was invented by Lamport in 1981. This
  technique was implemented by Haller, Karn, and Walden at Bellcore. They
! 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

>Release-Note:
>Audit-Trail:
State-Changed-From-To: open->closed 
State-Changed-By: steve 
State-Changed-When: Sun Jun 14 09:05:40 PDT 1998 
State-Changed-Why:  
Patch committed to both -stable and -current.  Thanks! 
>Unformatted:
