Format-Specification: http://dep.debian.net/deps/dep5
Name: sharand
Maintainer: Matt Mahoney <matmahoney@yahoo.com>
Source:  http://mattmahoney.net/dc

Files: sharnd.c
Copyright: (C) 2004-2007 Matt Mahoney <matmahoney@yahoo.com>
License: GPL-2+

Files: debian/*
Copyright: (C) 2010 Jari Aalto <jari.aalto@cante.net>
License: GPL-2+

Files: sha1.c
Copyright: (C) 2001 The Internet Society
License: RFC
X-License-Info:
 The "US Secure Hash Algorithm 1 (SHA1)" as presented in
 http://datatracker.ietf.org/doc/rfc3174. The code also contain
 additional text as follows:
 /*
  *  sha1.c
  *
  *  Description:
  *      This file implements the Secure Hashing Algorithm 1 as
  *      defined in FIPS PUB 180-1 published April 17, 1995.
  *
  *      The SHA-1, produces a 160-bit message digest for a given
  *      data stream.  It should take about 2**n steps to find a
  *      message with the same digest as a given message and
  *      2**(n/2) to find any two messages with the same digest,
  *      when n is the digest size in bits.  Therefore, this
  *      algorithm can serve as a means of providing a
  *      "fingerprint" for a message.
  *
  *  Portability Issues:
  *      SHA-1 is defined in terms of 32-bit "words".  This code
  *      uses <stdint.h> (included via "sha1.h" to define 32 and 8
  *      bit unsigned integer types.  If your C compiler does not
  *      support 32 bit unsigned integers, this code is not
  *      appropriate.
  *
  *  Caveats:
  *      SHA-1 is designed to work with messages less than 2^64 bits
  *      long.  Although SHA-1 allows a message digest to be generated
  *      for messages of any number of bits less than 2^64, this
  *      implementation only works with messages with a length that is
  *      a multiple of the size of an 8-bit character.
  *
  */

Files: sha1.h
Copyright: (C) 2001 The Internet Society
License: RFC
X-License-Info:
 The "US Secure Hash Algorithm 1 (SHA1)" as presented in
 http://datatracker.ietf.org/doc/rfc3174. The code also contain
 additional text as follows:
 /*
  *  sha1.h
  *
  *  Description:
  *      This is the header file for code which implements the Secure
  *      Hashing Algorithm 1 as defined in FIPS PUB 180-1 published
  *      April 17, 1995.
  *
  *      Many of the variable names in this code, especially the
  *      single character names, were used because those were the names
  *      used in the publication.
  *
  *      Please read the file sha1.c for more information.
  *
  */

License: GPL-2+
 This package is free software; you can redistribute it and/or modify
 it under the terms of the GNU General Public License version 2 as
 published by the Free Software Foundation.

 This package is distributed in the hope that it will be useful,
 but WITHOUT ANY WARRANTY; without even the implied warranty of
 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 GNU General Public License for more details.
 .
 You should have received a copy of the GNU General Public License
 along with this program. If not, see <http://www.gnu.org/licenses/>.
X-License-Info:
 On Debian systems, the complete text of the GNU General
 Public License can be found in "/usr/share/common-licenses/GPL-2".

License: RFC
 [from RFC 3174, page 22]
 Full Copyright Statement
 .
    Copyright (C) The Internet Society (2001).  All Rights Reserved.
 .
    This document and translations of it may be copied and furnished to
    others, and derivative works that comment on or otherwise explain it
    or assist in its implementation may be prepared, copied, published
    and distributed, in whole or in part, without restriction of any
    kind, provided that the above copyright notice and this paragraph are
    included on all such copies and derivative works.  However, this
    document itself may not be modified in any way, such as by removing
    the copyright notice or references to the Internet Society or other
    Internet organizations, except as needed for the purpose of
    developing Internet standards in which case the procedures for
    copyrights defined in the Internet Standards process must be
    followed, or as required to translate it into languages other than
    English.
 .
    The limited permissions granted above are perpetual and will not be
    revoked by the Internet Society or its successors or assigns.
 .
    This document and the information contained herein is provided on an
    "AS IS" basis and THE INTERNET SOCIETY AND THE INTERNET ENGINEERING
    TASK FORCE DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED, INCLUDING
    BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF THE INFORMATION
    HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED WARRANTIES OF
    MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
