fixing E-Mail-Address & Copyright

[avr-crypto-lib.git] / sha1 / sha1.h

diff --git a/sha1/sha1.h b/sha1/sha1.h
index 6675d20a19182997addf152717d2f5dd44b19974..61cf0a25f5dd004554e108ee489077ebe1de9dc1 100644 (file)
--- a/sha1/sha1.h
+++ b/sha1/sha1.h
@@ -1,7 +1,7 @@
 /* sha1.h */
 /*
     This file is part of the AVR-Crypto-Lib.
-    Copyright (C) 2008  Daniel Otte (daniel.otte@rub.de)
+    Copyright (C) 2006-2015 Daniel Otte (bg@nerilex.org)
 
     This program is free software: you can redistribute it and/or modify
     it under the terms of the GNU General Public License as published by
@@ -19,7 +19,7 @@
 /**
  * \file       sha1.h
  * \author     Daniel Otte
- * \email   daniel.otte@rub.de
+ * \email   bg@nerilex.org
  * \date       2006-10-08
  * \license GPLv3 or later
  * \brief   SHA-1 declaration.
@@ -65,7 +65,9 @@ typedef struct {
  * \brief hash value type
  * A variable of this type may hold a SHA-1 hash value 
  */
+/*
 typedef uint8_t sha1_hash_t[SHA1_HASH_BITS/8];
+*/
 
 /** \fn sha1_init(sha1_ctx_t *state)
  * \brief initializes a SHA-1 context
@@ -75,16 +77,16 @@ typedef uint8_t sha1_hash_t[SHA1_HASH_BITS/8];
  */
 void sha1_init(sha1_ctx_t *state);
 
-/** \fn sha1_nextBlock(sha1_ctx_t *state, const void* block)
+/** \fn sha1_nextBlock(sha1_ctx_t *state, const void *block)
  *  \brief process one input block
  * This function processes one input block and updates the hash context 
  * accordingly
  * \param state pointer to the state variable to update
  * \param block pointer to the message block to process
  */
-void sha1_nextBlock (sha1_ctx_t *state, const void* block);
+void sha1_nextBlock (sha1_ctx_t *state, const void *block);
 
-/** \fn sha1_lastBlock(sha1_ctx_t *state, const void* block, uint16_t length_b)
+/** \fn sha1_lastBlock(sha1_ctx_t *state, const void *block, uint16_t length_b)
  * \brief processes the given block and finalizes the context
  * This function processes the last block in a SHA-1 hashing process.
  * The block should have a maximum length of a single input block.
@@ -92,7 +94,7 @@ void sha1_nextBlock (sha1_ctx_t *state, const void* block);
  * \param block pointer to themessage block to process
  * \param length_b length of the message block in bits  
  */
-void sha1_lastBlock (sha1_ctx_t *state, const void* block, uint16_t length_b);
+void sha1_lastBlock (sha1_ctx_t *state, const void *block, uint16_t length_b);
 
 /** \fn sha1_ctx2hash(sha1_hash_t *dest, sha1_ctx_t *state)
  * \brief convert a state variable into an actual hash value
@@ -100,9 +102,9 @@ void sha1_lastBlock (sha1_ctx_t *state, const void* block, uint16_t length_b);
  * \param dest pointer to the hash value destination
  * \param state pointer to the hash context
  */ 
-void sha1_ctx2hash (sha1_hash_t *dest, sha1_ctx_t *state);
+void sha1_ctx2hash (void *dest, sha1_ctx_t *state);
 
-/** \fn sha1(sha1_hash_t *dest, const void* msg, uint32_t length_b)
+/** \fn sha1(sha1_hash_t *dest, const void *msg, uint32_t length_b)
  * \brief hashing a message which in located entirely in RAM
  * This function automatically hashes a message which is entirely in RAM with
  * the SHA-1 hashing algorithm.
@@ -110,7 +112,7 @@ void sha1_ctx2hash (sha1_hash_t *dest, sha1_ctx_t *state);
  * \param msg  pointer to the message which should be hashed
  * \param length_b length of the message in bits
  */ 
-void sha1(sha1_hash_t *dest, const void* msg, uint32_t length_b);
+void sha1(void *dest, const void *msg, uint32_t length_b);