1 files changed, 133 insertions, 0 deletions
diff --git a/SoftHSMv2/src/lib/crypto/BotanHashAlgorithm.cpp b/SoftHSMv2/src/lib/crypto/BotanHashAlgorithm.cpp
new file mode 100644
index 0000000..9630dfc
--- /dev/null
+++ b/SoftHSMv2/src/lib/crypto/BotanHashAlgorithm.cpp
@@ -0,0 +1,133 @@
+/*
+ * Copyright (c) 2010 .SE (The Internet Infrastructure Foundation)
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
+ * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+ * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
+ * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
+ * GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
+ * IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
+ * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
+ * IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+/*****************************************************************************
+ BotanHashAlgorithm.cpp
+
+ Base class for Botan hash algorithm classes
+ *****************************************************************************/
+
+#include "config.h"
+#include "BotanHashAlgorithm.h"
+#include <botan/filters.h>
+
+// Base constructor 
+BotanHashAlgorithm::BotanHashAlgorithm()
+{
+	hash = NULL;
+}
+
+// Destructor
+BotanHashAlgorithm::~BotanHashAlgorithm()
+{
+	delete hash;
+}
+
+// Hashing functions
+bool BotanHashAlgorithm::hashInit()
+{
+	if (!HashAlgorithm::hashInit())
+	{
+		return false;
+	}
+
+	// Initialize digesting
+	try
+	{
+		if (hash == NULL)
+		{
+			hash = getHash();
+		}
+		else
+		{
+			hash->clear();
+		}
+	}
+	catch (...)
+	{
+		ERROR_MSG("Failed to initialize the digesting token");
+
+		ByteString dummy;
+		HashAlgorithm::hashFinal(dummy);
+
+		return false;
+	}
+
+	return true;
+}
+
+bool BotanHashAlgorithm::hashUpdate(const ByteString& data)
+{
+	if (!HashAlgorithm::hashUpdate(data))
+	{
+		return false;
+	}
+
+	// Continue digesting
+	try
+	{
+		if (data.size() != 0)
+		{
+			hash->update(data.const_byte_str(), data.size());
+		}
+	}
+	catch (...)
+	{
+		ERROR_MSG("Failed to buffer data");
+
+		ByteString dummy;
+		HashAlgorithm::hashFinal(dummy);
+
+		return false;
+	}
+
+	return true;
+}
+
+bool BotanHashAlgorithm::hashFinal(ByteString& hashedData)
+{
+	if (!HashAlgorithm::hashFinal(hashedData))
+	{
+		return false;
+	}
+
+	// Resize
+	hashedData.resize(hash->output_length());
+
+	// Read the digest
+	try
+	{
+		hash->final(&hashedData[0]);
+	}
+	catch (...)
+	{
+		ERROR_MSG("Failed to digest the data");
+
+		return false;
+	}
+
+	return true;
+}