QCA

hashtest.cpp
1 /*
2  Copyright (C) 2004 Brad Hards <[email protected]>
3 
4  Permission is hereby granted, free of charge, to any person obtaining a copy
5  of this software and associated documentation files (the "Software"), to deal
6  in the Software without restriction, including without limitation the rights
7  to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
8  copies of the Software, and to permit persons to whom the Software is
9  furnished to do so, subject to the following conditions:
10 
11  The above copyright notice and this permission notice shall be included in
12  all copies or substantial portions of the Software.
13 
14  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
15  IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
16  FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
17  AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
18  AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
19  CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
20 */
21 
22 // QtCrypto/QtCrypto has the declarations for all of QCA
23 #include <QtCrypto>
24 
25 #include <QCoreApplication>
26 
27 #include <cstdio>
28 
29 #ifdef QT_STATICPLUGIN
30 #include "import_plugins.h"
31 #endif
32 
33 int main(int argc, char **argv)
34 {
35  // the Initializer object sets things up, and
36  // also does cleanup when it goes out of scope
38 
39  QCoreApplication app(argc, argv);
40 
41  // we use the first argument if provided, or
42  // use "hello" if no arguments
43  QCA::SecureArray arg = (argc >= 2) ? argv[1] : "hello";
44 
45  // must always check that an algorithm is supported before using it
46  if (!QCA::isSupported("sha1"))
47  printf("SHA1 not supported!\n");
48  else {
49  // this shows the "all in one" approach
50  QString result = QCA::Hash(QStringLiteral("sha1")).hashToString(arg);
51  printf("sha1(\"%s\") = [%s]\n", arg.data(), qPrintable(result));
52  }
53 
54  // must always check that an algorithm is supported before using it
55  if (!QCA::isSupported("md5"))
56  printf("MD5 not supported!\n");
57  else {
58  // this shows the incremental approach. Naturally
59  // for this simple job, we could use the "all in one"
60  // approach - this is an example, after all :-)
61  QCA::SecureArray part1(arg.toByteArray().left(3)); // three chars - "hel"
62  QCA::SecureArray part2(arg.toByteArray().mid(3)); // the rest - "lo"
63 
64  // create the required object.
65  QCA::Hash hashObject(QStringLiteral("md5"));
66  // we split it into two parts to show incremental update
67  hashObject.update(part1);
68  hashObject.update(part2);
69  // no more updates after calling final.
70  QCA::SecureArray resultArray = hashObject.final();
71  // convert the result into printable hexadecimal.
72  QString result = QCA::arrayToHex(resultArray.toByteArray());
73  printf("md5(\"%s\") = [%s]\n", arg.data(), qPrintable(result));
74  }
75 
76  return 0;
77 }
QString hashToString(const MemoryRegion &array)
Hash a byte array, returning it as a printable string
char * data()
Pointer to the data in the secure array.
QByteArray toByteArray() const
Copy the contents of the secure array out to a standard QByteArray.
QCA_EXPORT bool isSupported(const char *features, const QString &provider=QString())
Test if a capability (algorithm) is available.
QByteArray mid(int pos, int len) const const
QCA_EXPORT QString arrayToHex(const QByteArray &array)
Convert a byte array to printable hexadecimal representation.
General class for hashing algorithms.
Definition: qca_basic.h:208
QCA_EXPORT void init()
Initialise QCA.
Secure array of bytes.
Definition: qca_tools.h:316
QByteArray left(int len) const const
Convenience method for initialising and cleaning up QCA.
Definition: qca_core.h:659
This file is part of the KDE documentation.
Documentation copyright © 1996-2021 The KDE developers.
Generated on Sat Sep 25 2021 23:05:35 by doxygen 1.8.11 written by Dimitri van Heesch, © 1997-2006

KDE's Doxygen guidelines are available online.