Format: http://www.debian.org/doc/packaging-manuals/copyright-format/1.0
Upstream-Name: sharand
Upstream-Contact: Matt Mahoney <mattmahoneyfl@gmail.com>, <matmahoney@yahoo.com>
Source: http://mattmahoney.net/dc

Files: sharnd.c
Copyright:
  2004, 2012 Matt Mahoney <matmahoney@yahoo.com>
License: MIT-X11

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

Files: sha1.c
Copyright:
  2001 The Internet Society
X-Comment:
 See Bug#659645 by Sam Geeraerts <samgee@elmundolibre.be>:
 .
 To my understanding that means you can extend, but not modify the text/
 code in this file. This violates DFSG.
 .
 It looks like this code was copied straight from RFC 3174. I found a
 discussion [2] on debian-legal from a few years back that says that
 RFC texts are non-free (except for the first 1000 or so). A summary
 about copyright on RFC Editor [3] says that derivative works are
 allowed, but doesn't go into detail.
 .
 [1] http://www.rfc-editor.org/rfc/rfc3174.txt
 [2] http://lists.debian.org/debian-legal/2006/04/msg00223.html
 [3] http://www.rfc-editor.org/copyright.17Feb04.html
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.
  *
  */
License: RFC

Files: sha1.h
Copyright:
  2001 The Internet Society
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: RFC

License: MIT-X11
 <http://spdx.org/licenses/MIT>
 .
 Permission is hereby granted, free of charge, to any person obtaining
 a copy of this software and associated documentation files (the
 "Software"), to deal in the Software without restriction, including
 without limitation the rights to use, copy, modify, merge, publish,
 distribute, sublicense, and/or sell copies of the Software, and to
 permit persons to whom the Software is furnished to do so, subject to
 the following conditions: The above copyright notice and this
 permission notice shall be included in all copies or substantial
 portions of the Software.
 .
 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
 MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
 IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
 CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
 TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
 SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

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.
