2
Copyright (C) 1999-2007 The Botan Project. All rights reserved.
4
Redistribution and use in source and binary forms, for any use, with or without
5
modification, is permitted provided that the following conditions are met:
7
1. Redistributions of source code must retain the above copyright notice, this
8
list of conditions, and the following disclaimer.
10
2. Redistributions in binary form must reproduce the above copyright notice,
11
this list of conditions, and the following disclaimer in the documentation
12
and/or other materials provided with the distribution.
14
THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) "AS IS" AND ANY EXPRESS OR IMPLIED
15
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
16
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE, ARE DISCLAIMED.
18
IN NO EVENT SHALL THE AUTHOR(S) OR CONTRIBUTOR(S) BE LIABLE FOR ANY DIRECT,
19
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
20
BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
21
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
22
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
23
OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
24
ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27
namespace QCA { // WRAPNS_LINE
28
/*************************************************
29
* Utility Functions Source File *
30
* (C) 1999-2007 The Botan Project *
31
*************************************************/
34
#include <botan/util.h>
35
namespace QCA { // WRAPNS_LINE
36
#ifndef BOTAN_TOOLS_ONLY
38
#include <botan/bit_ops.h>
39
namespace QCA { // WRAPNS_LINE
43
namespace QCA { // WRAPNS_LINE
46
namespace QCA { // WRAPNS_LINE
50
/*************************************************
51
* Round up n to multiple of align_to *
52
*************************************************/
53
u32bit round_up(u32bit n, u32bit align_to)
55
if(n % align_to || n == 0)
56
n += align_to - (n % align_to);
60
/*************************************************
61
* Round down n to multiple of align_to *
62
*************************************************/
63
u32bit round_down(u32bit n, u32bit align_to)
65
return (n - (n % align_to));
68
#ifndef BOTAN_TOOLS_ONLY
69
/*************************************************
70
* Return the work required for solving DL *
71
*************************************************/
72
u32bit dl_work_factor(u32bit n_bits)
74
const u32bit MIN_ESTIMATE = 64;
79
const double log_x = n_bits / 1.44;
81
u32bit estimate = (u32bit)(2.76 * std::pow(log_x, 1.0/3.0) *
82
std::pow(std::log(log_x), 2.0/3.0));
84
return std::max(estimate, MIN_ESTIMATE);
87
/*************************************************
88
* Estimate the entropy of the buffer *
89
*************************************************/
90
u32bit entropy_estimate(const byte buffer[], u32bit length)
96
byte last = 0, last_delta = 0, last_delta2 = 0;
98
for(u32bit j = 0; j != length; ++j)
100
byte delta = last ^ buffer[j];
103
byte delta2 = delta ^ last_delta;
106
byte delta3 = delta2 ^ last_delta2;
107
last_delta2 = delta2;
109
byte min_delta = delta;
110
if(min_delta > delta2) min_delta = delta2;
111
if(min_delta > delta3) min_delta = delta3;
113
estimate += hamming_weight(min_delta);
116
return (estimate / 2);