Wednesday, 22 November 2017

DiceLockSecurity Knowledge

DicelockSecurity (version 9.X)

Apple Mac OS X

XDiceLock 8.0.0.1
Previous Versions
arrow XDiceLock 8.0.0.1 arrow baseRipemd160X.h
baseRipemd160X.h (base Ripemd 160 & 320 hash digest algorithm C++ header source code file) Print E-mail
Get C++ DiceLock cipher architecture source code packages of DiceLock for Microsoft Visual Studio 2013 and DiceLock-x for Linux with Test Driver Programs and Response Test Vector files to verify that both them work as expected.
DiceLock for Windows and Linux
DiceLock Security governing software licenses are Free/Libre Source Code License and Educational and Research License

DiceLock is protected by US patent 7508945 and European Patent 1182777 where applicable.

DiceLock and DiceLock logo are trademarks or registered trademarks in the EC, USA and others.

License information can be obtained at our corporate web site




1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
 
//
//  baseRipemd160X.h
//  XDiceLock
//
//  Created by DiceLock on 1/4/12.
//  Copyright (c) 2009-2012 DiceLock Security, LLC. All rights reserved.
//
 
//
// Creator:    http://www.dicelocksecurity.com
// Version:    vers.8.0.0.1
//
// Copyright (c) 2009-2012 DiceLock Security, LLC. All rights reserved.
//
//                               DISCLAIMER
//
// THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESSED 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
// REGENTS OR CONTRIBUTORS 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.
// 
// DICELOCK IS A REGISTERED TRADEMARK OR TRADEMARK OF THE OWNERS.
// 
 
#ifndef XDiceLock_baseRipemd160X_h
#define XDiceLock_baseRipemd160X_h
 
#include "baseRipemd.h"
 
 
#define RIPEMD_J(x, y, z) ((x) ^ ((y) | ~(z)))
 
#define RIPEMD_Transform160X(f, a, b, c, d, e, x, s, k)\
(*a) += f((*b), (*c), (*d)) + x + k;\
(*a) = RIPEMD_RotateLeft((*a), s) + (*e);\
(*c) = RIPEMD_RotateLeft((*c), 10);
 
 
namespace DiceLockSecurity {
    
    namespace Hash {
        
        class BaseRipemd160X : public BaseRipemd  {
            
    protected:
            
      // Constants for 160 and 320 RIPEMD algorithms
      static const unsigned int constant4;
      static const unsigned int constant8;
            
      // Amounts of rotate left
      static const unsigned short int rl_64_79[16];
      // Amounts of prime rotate left 
      static const unsigned short int prime_rl_64_79[16];
            
      // Initial states of Ripemd 160 and 320 algorithms
      static const unsigned int inistate4;
            
      // First transform set
      void Transform_F0(unsigned int*, unsigned int*, unsigned int*, unsigned int*, unsigned int*, unsigned int*);
            
      // Second transform set
      void Transform_G1(unsigned int*, unsigned int*, unsigned int*, unsigned int*, unsigned int*, unsigned int*);
            
      // Third transform set
      void Transform_H2(unsigned int*, unsigned int*, unsigned int*, unsigned int*, unsigned int*, unsigned int*);
            
      // Fourth transform set
      void Transform_I3(unsigned int*, unsigned int*, unsigned int*, unsigned int*, unsigned int*, unsigned int*);
            
      // Fifth transform set
      void Transform_J4(unsigned int*, unsigned int*, unsigned int*, unsigned int*, unsigned int*, unsigned int*);
            
      // Sixth transform set
      void Transform_J5(unsigned int*, unsigned int*, unsigned int*, unsigned int*, unsigned int*, unsigned int*);
            
      // Seventh transform set
      void Transform_I6(unsigned int*, unsigned int*, unsigned int*, unsigned int*, unsigned int*, unsigned int*);
            
      // Eighth transform set
      void Transform_H7(unsigned int*, unsigned int*, unsigned int*, unsigned int*, unsigned int*, unsigned int*);
            
      // Ninth transform set
      void Transform_G8(unsigned int*, unsigned int*, unsigned int*, unsigned int*, unsigned int*, unsigned int*);
            
      // Tenth transform set
      void Transform_F9(unsigned int*, unsigned int*, unsigned int*, unsigned int*, unsigned int*, unsigned int*);
            
    public:
            
      // Constructor, default 
      BaseRipemd160X();
            
      // Destructor
      ~BaseRipemd160X();
            
      // Initializes state of Ripmed 160 and 320 algorithms
      void Initialize(void);
        };
    }
}
 
#endif