mirror of
https://github.com/moparisthebest/keepass2android
synced 2024-12-22 15:08:50 -05:00
support for twofish cipher
This commit is contained in:
Philipp Crocoll
parent
b9dce51afa
commit
48ad2b309b
@ -15,6 +15,8 @@ Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "MonoDroidUnitTesting", "mon
|
||||
EndProject
|
||||
Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "Kp2aUnitTests", "Kp2aUnitTests\Kp2aUnitTests.csproj", "{46B769B8-2C58-4138-9CC0-70E3AE3C9A3A}"
|
||||
EndProject
|
||||
Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "TwofishCipher", "TwofishCipher\TwofishCipher.csproj", "{5CF675A5-9BEE-4720-BED9-D5BF14A2EBF9}"
|
||||
EndProject
|
||||
Global
|
||||
GlobalSection(SolutionConfigurationPlatforms) = preSolution
|
||||
Debug|Any CPU = Debug|Any CPU
|
||||
@ -182,6 +184,24 @@ Global
|
||||
{46B769B8-2C58-4138-9CC0-70E3AE3C9A3A}.ReleaseNoNet|Mixed Platforms.Deploy.0 = ReleaseNoNet|Any CPU
|
||||
{46B769B8-2C58-4138-9CC0-70E3AE3C9A3A}.ReleaseNoNet|Win32.ActiveCfg = Release|Any CPU
|
||||
{46B769B8-2C58-4138-9CC0-70E3AE3C9A3A}.ReleaseNoNet|x64.ActiveCfg = Release|Any CPU
|
||||
{5CF675A5-9BEE-4720-BED9-D5BF14A2EBF9}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
|
||||
{5CF675A5-9BEE-4720-BED9-D5BF14A2EBF9}.Debug|Any CPU.Build.0 = Debug|Any CPU
|
||||
{5CF675A5-9BEE-4720-BED9-D5BF14A2EBF9}.Debug|Mixed Platforms.ActiveCfg = Debug|Any CPU
|
||||
{5CF675A5-9BEE-4720-BED9-D5BF14A2EBF9}.Debug|Mixed Platforms.Build.0 = Debug|Any CPU
|
||||
{5CF675A5-9BEE-4720-BED9-D5BF14A2EBF9}.Debug|Win32.ActiveCfg = Debug|Any CPU
|
||||
{5CF675A5-9BEE-4720-BED9-D5BF14A2EBF9}.Debug|x64.ActiveCfg = Debug|Any CPU
|
||||
{5CF675A5-9BEE-4720-BED9-D5BF14A2EBF9}.Release|Any CPU.ActiveCfg = Release|Any CPU
|
||||
{5CF675A5-9BEE-4720-BED9-D5BF14A2EBF9}.Release|Any CPU.Build.0 = Release|Any CPU
|
||||
{5CF675A5-9BEE-4720-BED9-D5BF14A2EBF9}.Release|Mixed Platforms.ActiveCfg = Release|Any CPU
|
||||
{5CF675A5-9BEE-4720-BED9-D5BF14A2EBF9}.Release|Mixed Platforms.Build.0 = Release|Any CPU
|
||||
{5CF675A5-9BEE-4720-BED9-D5BF14A2EBF9}.Release|Win32.ActiveCfg = Release|Any CPU
|
||||
{5CF675A5-9BEE-4720-BED9-D5BF14A2EBF9}.Release|x64.ActiveCfg = Release|Any CPU
|
||||
{5CF675A5-9BEE-4720-BED9-D5BF14A2EBF9}.ReleaseNoNet|Any CPU.ActiveCfg = Release|Any CPU
|
||||
{5CF675A5-9BEE-4720-BED9-D5BF14A2EBF9}.ReleaseNoNet|Any CPU.Build.0 = Release|Any CPU
|
||||
{5CF675A5-9BEE-4720-BED9-D5BF14A2EBF9}.ReleaseNoNet|Mixed Platforms.ActiveCfg = Release|Any CPU
|
||||
{5CF675A5-9BEE-4720-BED9-D5BF14A2EBF9}.ReleaseNoNet|Mixed Platforms.Build.0 = Release|Any CPU
|
||||
{5CF675A5-9BEE-4720-BED9-D5BF14A2EBF9}.ReleaseNoNet|Win32.ActiveCfg = Release|Any CPU
|
||||
{5CF675A5-9BEE-4720-BED9-D5BF14A2EBF9}.ReleaseNoNet|x64.ActiveCfg = Release|Any CPU
|
||||
EndGlobalSection
|
||||
GlobalSection(SolutionProperties) = preSolution
|
||||
HideSolutionNode = FALSE
|
||||
|
||||
121
src/TwofishCipher/Crypto/Twofish.cs
Normal file
121
src/TwofishCipher/Crypto/Twofish.cs
Normal file
@ -0,0 +1,121 @@
|
||||
/*
|
||||
A C# implementation of the Twofish cipher
|
||||
By Shaun Wilde
|
||||
|
||||
An article on integrating a C# implementation of the Twofish cipher into the
|
||||
.NET framework.
|
||||
|
||||
http://www.codeproject.com/KB/recipes/twofish_csharp.aspx
|
||||
|
||||
The Code Project Open License (CPOL) 1.02
|
||||
http://www.codeproject.com/info/cpol10.aspx
|
||||
|
||||
Download a copy of the CPOL.
|
||||
http://www.codeproject.com/info/CPOL.zip
|
||||
*/
|
||||
|
||||
using System;
|
||||
using System.Diagnostics;
|
||||
using System.Security.Cryptography;
|
||||
|
||||
namespace TwofishCipher.Crypto
|
||||
{
|
||||
/// <summary>
|
||||
/// Summary description for Twofish encryption algorithm of which more information can be found at http://www.counterpane.com/twofish.html.
|
||||
/// This is based on the MS cryptographic framework and can therefore be used in place of the RijndaelManaged classes
|
||||
/// provided by MS in System.Security.Cryptography and the other related classes
|
||||
/// </summary>
|
||||
public sealed class Twofish : SymmetricAlgorithm
|
||||
{
|
||||
/// <summary>
|
||||
/// This is the Twofish constructor.
|
||||
/// </summary>
|
||||
public Twofish()
|
||||
{
|
||||
this.LegalKeySizesValue = new KeySizes[]{new KeySizes(128,256,64)}; // this allows us to have 128,192,256 key sizes
|
||||
|
||||
this.LegalBlockSizesValue = new KeySizes[]{new KeySizes(128,128,0)}; // this is in bits - typical of MS - always 16 bytes
|
||||
|
||||
this.BlockSize = 128; // set this to 16 bytes we cannot have any other value
|
||||
this.KeySize = 128; // in bits - this can be changed to 128,192,256
|
||||
|
||||
this.Padding = PaddingMode.Zeros;
|
||||
|
||||
this.Mode = CipherMode.ECB;
|
||||
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Creates an object that supports ICryptoTransform that can be used to encrypt data using the Twofish encryption algorithm.
|
||||
/// </summary>
|
||||
/// <param name="key">A byte array that contains a key. The length of this key should be equal to the KeySize property</param>
|
||||
/// <param name="iv">A byte array that contains an initialization vector. The length of this IV should be equal to the BlockSize property</param>
|
||||
public override ICryptoTransform CreateEncryptor(byte[] key, byte[] iv)
|
||||
{
|
||||
Key = key; // this appears to make a new copy
|
||||
|
||||
if (Mode == CipherMode.CBC)
|
||||
IV = iv;
|
||||
|
||||
return new TwofishEncryption(KeySize, ref KeyValue, ref IVValue, ModeValue, TwofishBase.EncryptionDirection.Encrypting);
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Creates an object that supports ICryptoTransform that can be used to decrypt data using the Twofish encryption algorithm.
|
||||
/// </summary>
|
||||
/// <param name="key">A byte array that contains a key. The length of this key should be equal to the KeySize property</param>
|
||||
/// <param name="iv">A byte array that contains an initialization vector. The length of this IV should be equal to the BlockSize property</param>
|
||||
public override ICryptoTransform CreateDecryptor(byte[] key, byte[] iv)
|
||||
{
|
||||
Key = key;
|
||||
|
||||
if (Mode == CipherMode.CBC)
|
||||
IV = iv;
|
||||
|
||||
return new TwofishEncryption(KeySize, ref KeyValue, ref IVValue, ModeValue, TwofishBase.EncryptionDirection.Decrypting);
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Generates a random initialization Vector (IV).
|
||||
/// </summary>
|
||||
public override void GenerateIV()
|
||||
{
|
||||
IV = new byte[16]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Generates a random Key. This is only really useful in testing scenarios.
|
||||
/// </summary>
|
||||
public override void GenerateKey()
|
||||
{
|
||||
Key = new byte[KeySize/8];
|
||||
|
||||
// set the array to all 0 - implement a random key generation mechanism later probably based on PRNG
|
||||
for (int i=Key.GetLowerBound(0);i<Key.GetUpperBound(0);i++)
|
||||
{
|
||||
Key[i]=0;
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Override the Set method on this property so that we only support CBC and EBC
|
||||
/// </summary>
|
||||
public override CipherMode Mode
|
||||
{
|
||||
set
|
||||
{
|
||||
switch (value)
|
||||
{
|
||||
case CipherMode.CBC:
|
||||
break;
|
||||
case CipherMode.ECB:
|
||||
break;
|
||||
default:
|
||||
throw (new CryptographicException("Specified CipherMode is not supported."));
|
||||
}
|
||||
this.ModeValue = value;
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
}
|
||||
641
src/TwofishCipher/Crypto/TwofishBase.cs
Normal file
641
src/TwofishCipher/Crypto/TwofishBase.cs
Normal file
@ -0,0 +1,641 @@
|
||||
/*
|
||||
A C# implementation of the Twofish cipher
|
||||
By Shaun Wilde
|
||||
|
||||
An article on integrating a C# implementation of the Twofish cipher into the
|
||||
.NET framework.
|
||||
|
||||
http://www.codeproject.com/KB/recipes/twofish_csharp.aspx
|
||||
|
||||
The Code Project Open License (CPOL) 1.02
|
||||
http://www.codeproject.com/info/cpol10.aspx
|
||||
|
||||
Download a copy of the CPOL.
|
||||
http://www.codeproject.com/info/CPOL.zip
|
||||
*/
|
||||
|
||||
//#define FEISTEL
|
||||
|
||||
using System;
|
||||
using System.Diagnostics;
|
||||
using System.Security.Cryptography;
|
||||
|
||||
namespace TwofishCipher.Crypto
|
||||
{
|
||||
|
||||
/// <summary>
|
||||
/// Summary description for TwofishBase.
|
||||
/// </summary>
|
||||
internal class TwofishBase
|
||||
{
|
||||
public enum EncryptionDirection
|
||||
{
|
||||
Encrypting,
|
||||
Decrypting
|
||||
}
|
||||
|
||||
public TwofishBase()
|
||||
{
|
||||
}
|
||||
|
||||
protected int inputBlockSize = BLOCK_SIZE/8;
|
||||
protected int outputBlockSize = BLOCK_SIZE/8;
|
||||
|
||||
/*
|
||||
+*****************************************************************************
|
||||
*
|
||||
* Function Name: f32
|
||||
*
|
||||
* Function: Run four bytes through keyed S-boxes and apply MDS matrix
|
||||
*
|
||||
* Arguments: x = input to f function
|
||||
* k32 = pointer to key dwords
|
||||
* keyLen = total key length (k32 --> keyLey/2 bits)
|
||||
*
|
||||
* Return: The output of the keyed permutation applied to x.
|
||||
*
|
||||
* Notes:
|
||||
* This function is a keyed 32-bit permutation. It is the major building
|
||||
* block for the Twofish round function, including the four keyed 8x8
|
||||
* permutations and the 4x4 MDS matrix multiply. This function is used
|
||||
* both for generating round subkeys and within the round function on the
|
||||
* block being encrypted.
|
||||
*
|
||||
* This version is fairly slow and pedagogical, although a smartcard would
|
||||
* probably perform the operation exactly this way in firmware. For
|
||||
* ultimate performance, the entire operation can be completed with four
|
||||
* lookups into four 256x32-bit tables, with three dword xors.
|
||||
*
|
||||
* The MDS matrix is defined in TABLE.H. To multiply by Mij, just use the
|
||||
* macro Mij(x).
|
||||
*
|
||||
-****************************************************************************/
|
||||
private static uint f32(uint x,ref uint[] k32,int keyLen)
|
||||
{
|
||||
byte[] b = {b0(x),b1(x),b2(x),b3(x)};
|
||||
|
||||
/* Run each byte thru 8x8 S-boxes, xoring with key byte at each stage. */
|
||||
/* Note that each byte goes through a different combination of S-boxes.*/
|
||||
|
||||
//*((DWORD *)b) = Bswap(x); /* make b[0] = LSB, b[3] = MSB */
|
||||
switch (((keyLen + 63)/64) & 3)
|
||||
{
|
||||
case 0: /* 256 bits of key */
|
||||
b[0] = (byte)(P8x8[P_04,b[0]] ^ b0(k32[3]));
|
||||
b[1] = (byte)(P8x8[P_14,b[1]] ^ b1(k32[3]));
|
||||
b[2] = (byte)(P8x8[P_24,b[2]] ^ b2(k32[3]));
|
||||
b[3] = (byte)(P8x8[P_34,b[3]] ^ b3(k32[3]));
|
||||
/* fall thru, having pre-processed b[0]..b[3] with k32[3] */
|
||||
goto case 3;
|
||||
case 3: /* 192 bits of key */
|
||||
b[0] = (byte)(P8x8[P_03,b[0]] ^ b0(k32[2]));
|
||||
b[1] = (byte)(P8x8[P_13,b[1]] ^ b1(k32[2]));
|
||||
b[2] = (byte)(P8x8[P_23,b[2]] ^ b2(k32[2]));
|
||||
b[3] = (byte)(P8x8[P_33,b[3]] ^ b3(k32[2]));
|
||||
/* fall thru, having pre-processed b[0]..b[3] with k32[2] */
|
||||
goto case 2;
|
||||
case 2: /* 128 bits of key */
|
||||
b[0] = P8x8[P_00, P8x8[P_01, P8x8[P_02, b[0]] ^ b0(k32[1])] ^ b0(k32[0])];
|
||||
b[1] = P8x8[P_10, P8x8[P_11, P8x8[P_12, b[1]] ^ b1(k32[1])] ^ b1(k32[0])];
|
||||
b[2] = P8x8[P_20, P8x8[P_21, P8x8[P_22, b[2]] ^ b2(k32[1])] ^ b2(k32[0])];
|
||||
b[3] = P8x8[P_30, P8x8[P_31, P8x8[P_32, b[3]] ^ b3(k32[1])] ^ b3(k32[0])];
|
||||
break;
|
||||
}
|
||||
|
||||
|
||||
/* Now perform the MDS matrix multiply inline. */
|
||||
return (uint)((M00(b[0]) ^ M01(b[1]) ^ M02(b[2]) ^ M03(b[3]))) ^
|
||||
(uint)((M10(b[0]) ^ M11(b[1]) ^ M12(b[2]) ^ M13(b[3])) << 8) ^
|
||||
(uint)((M20(b[0]) ^ M21(b[1]) ^ M22(b[2]) ^ M23(b[3])) << 16) ^
|
||||
(uint)((M30(b[0]) ^ M31(b[1]) ^ M32(b[2]) ^ M33(b[3])) << 24) ;
|
||||
}
|
||||
|
||||
/*
|
||||
+*****************************************************************************
|
||||
*
|
||||
* Function Name: reKey
|
||||
*
|
||||
* Function: Initialize the Twofish key schedule from key32
|
||||
*
|
||||
* Arguments: key = ptr to keyInstance to be initialized
|
||||
*
|
||||
* Return: TRUE on success
|
||||
*
|
||||
* Notes:
|
||||
* Here we precompute all the round subkeys, although that is not actually
|
||||
* required. For example, on a smartcard, the round subkeys can
|
||||
* be generated on-the-fly using f32()
|
||||
*
|
||||
-****************************************************************************/
|
||||
protected bool reKey(int keyLen, ref uint[] key32)
|
||||
{
|
||||
int i,k64Cnt;
|
||||
keyLength = keyLen;
|
||||
rounds = numRounds[(keyLen-1)/64];
|
||||
int subkeyCnt = ROUND_SUBKEYS + 2*rounds;
|
||||
uint A,B;
|
||||
uint[] k32e = new uint[MAX_KEY_BITS/64];
|
||||
uint[] k32o = new uint[MAX_KEY_BITS/64]; /* even/odd key dwords */
|
||||
|
||||
k64Cnt=(keyLen+63)/64; /* round up to next multiple of 64 bits */
|
||||
for (i=0;i<k64Cnt;i++)
|
||||
{ /* split into even/odd key dwords */
|
||||
k32e[i]=key32[2*i ];
|
||||
k32o[i]=key32[2*i+1];
|
||||
/* compute S-box keys using (12,8) Reed-Solomon code over GF(256) */
|
||||
sboxKeys[k64Cnt-1-i]=RS_MDS_Encode(k32e[i],k32o[i]); /* reverse order */
|
||||
}
|
||||
|
||||
for (i=0;i<subkeyCnt/2;i++) /* compute round subkeys for PHT */
|
||||
{
|
||||
A = f32((uint)(i*SK_STEP) ,ref k32e, keyLen); /* A uses even key dwords */
|
||||
B = f32((uint)(i*SK_STEP+SK_BUMP),ref k32o, keyLen); /* B uses odd key dwords */
|
||||
B = ROL(B,8);
|
||||
subKeys[2*i ] = A+ B; /* combine with a PHT */
|
||||
subKeys[2*i+1] = ROL(A+2*B,SK_ROTL);
|
||||
}
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
protected void blockDecrypt(ref uint[] x)
|
||||
{
|
||||
uint t0,t1;
|
||||
uint[] xtemp = new uint[4];
|
||||
|
||||
if (cipherMode == CipherMode.CBC)
|
||||
{
|
||||
x.CopyTo(xtemp,0);
|
||||
}
|
||||
|
||||
for (int i=0;i<BLOCK_SIZE/32;i++) /* copy in the block, add whitening */
|
||||
x[i] ^= subKeys[OUTPUT_WHITEN+i];
|
||||
|
||||
for (int r=rounds-1;r>=0;r--) /* main Twofish decryption loop */
|
||||
{
|
||||
t0 = f32( x[0] ,ref sboxKeys,keyLength);
|
||||
t1 = f32(ROL(x[1],8),ref sboxKeys,keyLength);
|
||||
|
||||
x[2] = ROL(x[2],1);
|
||||
x[2]^= t0 + t1 + subKeys[ROUND_SUBKEYS+2*r ]; /* PHT, round keys */
|
||||
x[3]^= t0 + 2*t1 + subKeys[ROUND_SUBKEYS+2*r+1];
|
||||
x[3] = ROR(x[3],1);
|
||||
|
||||
if (r>0) /* unswap, except for last round */
|
||||
{
|
||||
t0 = x[0]; x[0]= x[2]; x[2] = t0;
|
||||
t1 = x[1]; x[1]= x[3]; x[3] = t1;
|
||||
}
|
||||
}
|
||||
|
||||
for (int i=0;i<BLOCK_SIZE/32;i++) /* copy out, with whitening */
|
||||
{
|
||||
x[i] ^= subKeys[INPUT_WHITEN+i];
|
||||
if (cipherMode == CipherMode.CBC)
|
||||
{
|
||||
x[i] ^= IV[i];
|
||||
IV[i] = xtemp[i];
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
protected void blockEncrypt(ref uint[] x)
|
||||
{
|
||||
uint t0,t1,tmp;
|
||||
|
||||
for (int i=0;i<BLOCK_SIZE/32;i++) /* copy in the block, add whitening */
|
||||
{
|
||||
x[i] ^= subKeys[INPUT_WHITEN+i];
|
||||
if (cipherMode == CipherMode.CBC)
|
||||
x[i] ^= IV[i];
|
||||
}
|
||||
|
||||
for (int r=0;r<rounds;r++) /* main Twofish encryption loop */ // 16==rounds
|
||||
{
|
||||
#if FEISTEL
|
||||
t0 = f32(ROR(x[0], (r+1)/2),ref sboxKeys,keyLength);
|
||||
t1 = f32(ROL(x[1],8+(r+1)/2),ref sboxKeys,keyLength);
|
||||
/* PHT, round keys */
|
||||
x[2]^= ROL(t0 + t1 + subKeys[ROUND_SUBKEYS+2*r ], r /2);
|
||||
x[3]^= ROR(t0 + 2*t1 + subKeys[ROUND_SUBKEYS+2*r+1],(r+2) /2);
|
||||
|
||||
#else
|
||||
t0 = f32( x[0] ,ref sboxKeys,keyLength);
|
||||
t1 = f32(ROL(x[1],8),ref sboxKeys,keyLength);
|
||||
|
||||
x[3] = ROL(x[3],1);
|
||||
x[2]^= t0 + t1 + subKeys[ROUND_SUBKEYS+2*r ]; /* PHT, round keys */
|
||||
x[3]^= t0 + 2*t1 + subKeys[ROUND_SUBKEYS+2*r+1];
|
||||
x[2] = ROR(x[2],1);
|
||||
|
||||
#endif
|
||||
if (r < rounds-1) /* swap for next round */
|
||||
{
|
||||
tmp = x[0]; x[0]= x[2]; x[2] = tmp;
|
||||
tmp = x[1]; x[1]= x[3]; x[3] = tmp;
|
||||
}
|
||||
}
|
||||
#if FEISTEL
|
||||
x[0] = ROR(x[0],8); /* "final permutation" */
|
||||
x[1] = ROL(x[1],8);
|
||||
x[2] = ROR(x[2],8);
|
||||
x[3] = ROL(x[3],8);
|
||||
#endif
|
||||
for (int i=0;i<BLOCK_SIZE/32;i++) /* copy out, with whitening */
|
||||
{
|
||||
x[i] ^= subKeys[OUTPUT_WHITEN+i];
|
||||
if (cipherMode == CipherMode.CBC)
|
||||
{
|
||||
IV[i] = x[i];
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
private int[] numRounds = {0,ROUNDS_128,ROUNDS_192,ROUNDS_256};
|
||||
|
||||
/*
|
||||
+*****************************************************************************
|
||||
*
|
||||
* Function Name: RS_MDS_Encode
|
||||
*
|
||||
* Function: Use (12,8) Reed-Solomon code over GF(256) to produce
|
||||
* a key S-box dword from two key material dwords.
|
||||
*
|
||||
* Arguments: k0 = 1st dword
|
||||
* k1 = 2nd dword
|
||||
*
|
||||
* Return: Remainder polynomial generated using RS code
|
||||
*
|
||||
* Notes:
|
||||
* Since this computation is done only once per reKey per 64 bits of key,
|
||||
* the performance impact of this routine is imperceptible. The RS code
|
||||
* chosen has "simple" coefficients to allow smartcard/hardware implementation
|
||||
* without lookup tables.
|
||||
*
|
||||
-****************************************************************************/
|
||||
static private uint RS_MDS_Encode(uint k0,uint k1)
|
||||
{
|
||||
uint i,j;
|
||||
uint r;
|
||||
|
||||
for (i=r=0;i<2;i++)
|
||||
{
|
||||
r ^= (i>0) ? k0 : k1; /* merge in 32 more key bits */
|
||||
for (j=0;j<4;j++) /* shift one byte at a time */
|
||||
RS_rem(ref r);
|
||||
}
|
||||
return r;
|
||||
}
|
||||
|
||||
protected uint[] sboxKeys = new uint[MAX_KEY_BITS/64]; /* key bits used for S-boxes */
|
||||
protected uint[] subKeys = new uint[TOTAL_SUBKEYS]; /* round subkeys, input/output whitening bits */
|
||||
protected uint[] Key = {0,0,0,0,0,0,0,0}; //new int[MAX_KEY_BITS/32];
|
||||
protected uint[] IV = {0,0,0,0}; // this should be one block size
|
||||
private int keyLength;
|
||||
private int rounds;
|
||||
protected CipherMode cipherMode = CipherMode.ECB;
|
||||
|
||||
|
||||
#region These are all the definitions that were found in AES.H
|
||||
static private readonly int BLOCK_SIZE = 128; /* number of bits per block */
|
||||
static private readonly int MAX_ROUNDS = 16; /* max # rounds (for allocating subkey array) */
|
||||
static private readonly int ROUNDS_128 = 16; /* default number of rounds for 128-bit keys*/
|
||||
static private readonly int ROUNDS_192 = 16; /* default number of rounds for 192-bit keys*/
|
||||
static private readonly int ROUNDS_256 = 16; /* default number of rounds for 256-bit keys*/
|
||||
static private readonly int MAX_KEY_BITS = 256; /* max number of bits of key */
|
||||
// static private readonly int MIN_KEY_BITS = 128; /* min number of bits of key (zero pad) */
|
||||
|
||||
//#define VALID_SIG 0x48534946 /* initialization signature ('FISH') */
|
||||
//#define MCT_OUTER 400 /* MCT outer loop */
|
||||
//#define MCT_INNER 10000 /* MCT inner loop */
|
||||
//#define REENTRANT 1 /* nonzero forces reentrant code (slightly slower) */
|
||||
|
||||
static private readonly int INPUT_WHITEN = 0; /* subkey array indices */
|
||||
static private readonly int OUTPUT_WHITEN = (INPUT_WHITEN + BLOCK_SIZE/32);
|
||||
static private readonly int ROUND_SUBKEYS = (OUTPUT_WHITEN + BLOCK_SIZE/32); /* use 2 * (# rounds) */
|
||||
static private readonly int TOTAL_SUBKEYS = (ROUND_SUBKEYS + 2*MAX_ROUNDS);
|
||||
|
||||
|
||||
#endregion
|
||||
|
||||
#region These are all the definitions that were found in TABLE.H that we need
|
||||
/* for computing subkeys */
|
||||
static private readonly uint SK_STEP = 0x02020202u;
|
||||
static private readonly uint SK_BUMP = 0x01010101u;
|
||||
static private readonly int SK_ROTL = 9;
|
||||
|
||||
/* Reed-Solomon code parameters: (12,8) reversible code
|
||||
g(x) = x**4 + (a + 1/a) x**3 + a x**2 + (a + 1/a) x + 1
|
||||
where a = primitive root of field generator 0x14D */
|
||||
static private readonly uint RS_GF_FDBK = 0x14D; /* field generator */
|
||||
static private void RS_rem(ref uint x)
|
||||
{
|
||||
byte b = (byte) (x >> 24);
|
||||
// TODO: maybe change g2 and g3 to bytes
|
||||
uint g2 = (uint)(((b << 1) ^ (((b & 0x80)==0x80) ? RS_GF_FDBK : 0 )) & 0xFF);
|
||||
uint g3 = (uint)(((b >> 1) & 0x7F) ^ (((b & 1)==1) ? RS_GF_FDBK >> 1 : 0 ) ^ g2) ;
|
||||
x = (x << 8) ^ (g3 << 24) ^ (g2 << 16) ^ (g3 << 8) ^ b;
|
||||
}
|
||||
|
||||
/* Macros for the MDS matrix
|
||||
* The MDS matrix is (using primitive polynomial 169):
|
||||
* 01 EF 5B 5B
|
||||
* 5B EF EF 01
|
||||
* EF 5B 01 EF
|
||||
* EF 01 EF 5B
|
||||
*----------------------------------------------------------------
|
||||
* More statistical properties of this matrix (from MDS.EXE output):
|
||||
*
|
||||
* Min Hamming weight (one byte difference) = 8. Max=26. Total = 1020.
|
||||
* Prob[8]: 7 23 42 20 52 95 88 94 121 128 91
|
||||
* 102 76 41 24 8 4 1 3 0 0 0
|
||||
* Runs[8]: 2 4 5 6 7 8 9 11
|
||||
* MSBs[8]: 1 4 15 8 18 38 40 43
|
||||
* HW= 8: 05040705 0A080E0A 14101C14 28203828 50407050 01499101 A080E0A0
|
||||
* HW= 9: 04050707 080A0E0E 10141C1C 20283838 40507070 80A0E0E0 C6432020 07070504
|
||||
* 0E0E0A08 1C1C1410 38382820 70705040 E0E0A080 202043C6 05070407 0A0E080E
|
||||
* 141C101C 28382038 50704070 A0E080E0 4320C620 02924B02 089A4508
|
||||
* Min Hamming weight (two byte difference) = 3. Max=28. Total = 390150.
|
||||
* Prob[3]: 7 18 55 149 270 914 2185 5761 11363 20719 32079
|
||||
* 43492 51612 53851 52098 42015 31117 20854 11538 6223 2492 1033
|
||||
* MDS OK, ROR: 6+ 7+ 8+ 9+ 10+ 11+ 12+ 13+ 14+ 15+ 16+
|
||||
* 17+ 18+ 19+ 20+ 21+ 22+ 23+ 24+ 25+ 26+
|
||||
*/
|
||||
static private readonly int MDS_GF_FDBK = 0x169; /* primitive polynomial for GF(256)*/
|
||||
static private int LFSR1(int x)
|
||||
{
|
||||
return ( ((x) >> 1) ^ ((((x) & 0x01)==0x01) ? MDS_GF_FDBK/2 : 0));
|
||||
}
|
||||
|
||||
static private int LFSR2(int x)
|
||||
{
|
||||
return ( ((x) >> 2) ^ ((((x) & 0x02)==0x02) ? MDS_GF_FDBK/2 : 0) ^
|
||||
((((x) & 0x01)==0x01) ? MDS_GF_FDBK/4 : 0));
|
||||
}
|
||||
|
||||
// TODO: not the most efficient use of code but it allows us to update the code a lot quicker we can possibly optimize this code once we have got it all working
|
||||
static private int Mx_1(int x)
|
||||
{
|
||||
return x; /* force result to int so << will work */
|
||||
}
|
||||
|
||||
static private int Mx_X(int x)
|
||||
{
|
||||
return x ^ LFSR2(x); /* 5B */
|
||||
}
|
||||
|
||||
static private int Mx_Y(int x)
|
||||
{
|
||||
return x ^ LFSR1(x) ^ LFSR2(x); /* EF */
|
||||
}
|
||||
|
||||
static private int M00(int x)
|
||||
{
|
||||
return Mul_1(x);
|
||||
}
|
||||
static private int M01(int x)
|
||||
{
|
||||
return Mul_Y(x);
|
||||
}
|
||||
static private int M02(int x)
|
||||
{
|
||||
return Mul_X(x);
|
||||
}
|
||||
static private int M03(int x)
|
||||
{
|
||||
return Mul_X(x);
|
||||
}
|
||||
|
||||
static private int M10(int x)
|
||||
{
|
||||
return Mul_X(x);
|
||||
}
|
||||
static private int M11(int x)
|
||||
{
|
||||
return Mul_Y(x);
|
||||
}
|
||||
static private int M12(int x)
|
||||
{
|
||||
return Mul_Y(x);
|
||||
}
|
||||
static private int M13(int x)
|
||||
{
|
||||
return Mul_1(x);
|
||||
}
|
||||
|
||||
static private int M20(int x)
|
||||
{
|
||||
return Mul_Y(x);
|
||||
}
|
||||
static private int M21(int x)
|
||||
{
|
||||
return Mul_X(x);
|
||||
}
|
||||
static private int M22(int x)
|
||||
{
|
||||
return Mul_1(x);
|
||||
}
|
||||
static private int M23(int x)
|
||||
{
|
||||
return Mul_Y(x);
|
||||
}
|
||||
|
||||
static private int M30(int x)
|
||||
{
|
||||
return Mul_Y(x);
|
||||
}
|
||||
static private int M31(int x)
|
||||
{
|
||||
return Mul_1(x);
|
||||
}
|
||||
static private int M32(int x)
|
||||
{
|
||||
return Mul_Y(x);
|
||||
}
|
||||
static private int M33(int x)
|
||||
{
|
||||
return Mul_X(x);
|
||||
}
|
||||
|
||||
static private int Mul_1(int x)
|
||||
{
|
||||
return Mx_1(x);
|
||||
}
|
||||
static private int Mul_X(int x)
|
||||
{
|
||||
return Mx_X(x);
|
||||
}
|
||||
static private int Mul_Y(int x)
|
||||
{
|
||||
return Mx_Y(x);
|
||||
}
|
||||
/* Define the fixed p0/p1 permutations used in keyed S-box lookup.
|
||||
By changing the following constant definitions for P_ij, the S-boxes will
|
||||
automatically get changed in all the Twofish source code. Note that P_i0 is
|
||||
the "outermost" 8x8 permutation applied. See the f32() function to see
|
||||
how these constants are to be used.
|
||||
*/
|
||||
static private readonly int P_00 = 1; /* "outermost" permutation */
|
||||
static private readonly int P_01 = 0;
|
||||
static private readonly int P_02 = 0;
|
||||
static private readonly int P_03 = (P_01^1); /* "extend" to larger key sizes */
|
||||
static private readonly int P_04 = 1;
|
||||
|
||||
static private readonly int P_10 = 0;
|
||||
static private readonly int P_11 = 0;
|
||||
static private readonly int P_12 = 1;
|
||||
static private readonly int P_13 = (P_11^1);
|
||||
static private readonly int P_14 = 0;
|
||||
|
||||
static private readonly int P_20 = 1;
|
||||
static private readonly int P_21 = 1;
|
||||
static private readonly int P_22 = 0;
|
||||
static private readonly int P_23 = (P_21^1);
|
||||
static private readonly int P_24 = 0;
|
||||
|
||||
static private readonly int P_30 = 0;
|
||||
static private readonly int P_31 = 1;
|
||||
static private readonly int P_32 = 1;
|
||||
static private readonly int P_33 = (P_31^1);
|
||||
static private readonly int P_34 = 1;
|
||||
|
||||
/* fixed 8x8 permutation S-boxes */
|
||||
|
||||
/***********************************************************************
|
||||
* 07:07:14 05/30/98 [4x4] TestCnt=256. keySize=128. CRC=4BD14D9E.
|
||||
* maxKeyed: dpMax = 18. lpMax =100. fixPt = 8. skXor = 0. skDup = 6.
|
||||
* log2(dpMax[ 6..18])= --- 15.42 1.33 0.89 4.05 7.98 12.05
|
||||
* log2(lpMax[ 7..12])= 9.32 1.01 1.16 4.23 8.02 12.45
|
||||
* log2(fixPt[ 0.. 8])= 1.44 1.44 2.44 4.06 6.01 8.21 11.07 14.09 17.00
|
||||
* log2(skXor[ 0.. 0])
|
||||
* log2(skDup[ 0.. 6])= --- 2.37 0.44 3.94 8.36 13.04 17.99
|
||||
***********************************************************************/
|
||||
static private byte[,] P8x8 =
|
||||
{
|
||||
/* p0: */
|
||||
/* dpMax = 10. lpMax = 64. cycleCnt= 1 1 1 0. */
|
||||
/* 817D6F320B59ECA4.ECB81235F4A6709D.BA5E6D90C8F32471.D7F4126E9B3085CA. */
|
||||
/* Karnaugh maps:
|
||||
* 0111 0001 0011 1010. 0001 1001 1100 1111. 1001 1110 0011 1110. 1101 0101 1111 1001.
|
||||
* 0101 1111 1100 0100. 1011 0101 0010 0000. 0101 1000 1100 0101. 1000 0111 0011 0010.
|
||||
* 0000 1001 1110 1101. 1011 1000 1010 0011. 0011 1001 0101 0000. 0100 0010 0101 1011.
|
||||
* 0111 0100 0001 0110. 1000 1011 1110 1001. 0011 0011 1001 1101. 1101 0101 0000 1100.
|
||||
*/
|
||||
{
|
||||
0xA9, 0x67, 0xB3, 0xE8, 0x04, 0xFD, 0xA3, 0x76,
|
||||
0x9A, 0x92, 0x80, 0x78, 0xE4, 0xDD, 0xD1, 0x38,
|
||||
0x0D, 0xC6, 0x35, 0x98, 0x18, 0xF7, 0xEC, 0x6C,
|
||||
0x43, 0x75, 0x37, 0x26, 0xFA, 0x13, 0x94, 0x48,
|
||||
0xF2, 0xD0, 0x8B, 0x30, 0x84, 0x54, 0xDF, 0x23,
|
||||
0x19, 0x5B, 0x3D, 0x59, 0xF3, 0xAE, 0xA2, 0x82,
|
||||
0x63, 0x01, 0x83, 0x2E, 0xD9, 0x51, 0x9B, 0x7C,
|
||||
0xA6, 0xEB, 0xA5, 0xBE, 0x16, 0x0C, 0xE3, 0x61,
|
||||
0xC0, 0x8C, 0x3A, 0xF5, 0x73, 0x2C, 0x25, 0x0B,
|
||||
0xBB, 0x4E, 0x89, 0x6B, 0x53, 0x6A, 0xB4, 0xF1,
|
||||
0xE1, 0xE6, 0xBD, 0x45, 0xE2, 0xF4, 0xB6, 0x66,
|
||||
0xCC, 0x95, 0x03, 0x56, 0xD4, 0x1C, 0x1E, 0xD7,
|
||||
0xFB, 0xC3, 0x8E, 0xB5, 0xE9, 0xCF, 0xBF, 0xBA,
|
||||
0xEA, 0x77, 0x39, 0xAF, 0x33, 0xC9, 0x62, 0x71,
|
||||
0x81, 0x79, 0x09, 0xAD, 0x24, 0xCD, 0xF9, 0xD8,
|
||||
0xE5, 0xC5, 0xB9, 0x4D, 0x44, 0x08, 0x86, 0xE7,
|
||||
0xA1, 0x1D, 0xAA, 0xED, 0x06, 0x70, 0xB2, 0xD2,
|
||||
0x41, 0x7B, 0xA0, 0x11, 0x31, 0xC2, 0x27, 0x90,
|
||||
0x20, 0xF6, 0x60, 0xFF, 0x96, 0x5C, 0xB1, 0xAB,
|
||||
0x9E, 0x9C, 0x52, 0x1B, 0x5F, 0x93, 0x0A, 0xEF,
|
||||
0x91, 0x85, 0x49, 0xEE, 0x2D, 0x4F, 0x8F, 0x3B,
|
||||
0x47, 0x87, 0x6D, 0x46, 0xD6, 0x3E, 0x69, 0x64,
|
||||
0x2A, 0xCE, 0xCB, 0x2F, 0xFC, 0x97, 0x05, 0x7A,
|
||||
0xAC, 0x7F, 0xD5, 0x1A, 0x4B, 0x0E, 0xA7, 0x5A,
|
||||
0x28, 0x14, 0x3F, 0x29, 0x88, 0x3C, 0x4C, 0x02,
|
||||
0xB8, 0xDA, 0xB0, 0x17, 0x55, 0x1F, 0x8A, 0x7D,
|
||||
0x57, 0xC7, 0x8D, 0x74, 0xB7, 0xC4, 0x9F, 0x72,
|
||||
0x7E, 0x15, 0x22, 0x12, 0x58, 0x07, 0x99, 0x34,
|
||||
0x6E, 0x50, 0xDE, 0x68, 0x65, 0xBC, 0xDB, 0xF8,
|
||||
0xC8, 0xA8, 0x2B, 0x40, 0xDC, 0xFE, 0x32, 0xA4,
|
||||
0xCA, 0x10, 0x21, 0xF0, 0xD3, 0x5D, 0x0F, 0x00,
|
||||
0x6F, 0x9D, 0x36, 0x42, 0x4A, 0x5E, 0xC1, 0xE0
|
||||
},
|
||||
/* p1: */
|
||||
/* dpMax = 10. lpMax = 64. cycleCnt= 2 0 0 1. */
|
||||
/* 28BDF76E31940AC5.1E2B4C376DA5F908.4C75169A0ED82B3F.B951C3DE647F208A. */
|
||||
/* Karnaugh maps:
|
||||
* 0011 1001 0010 0111. 1010 0111 0100 0110. 0011 0001 1111 0100. 1111 1000 0001 1100.
|
||||
* 1100 1111 1111 1010. 0011 0011 1110 0100. 1001 0110 0100 0011. 0101 0110 1011 1011.
|
||||
* 0010 0100 0011 0101. 1100 1000 1000 1110. 0111 1111 0010 0110. 0000 1010 0000 0011.
|
||||
* 1101 1000 0010 0001. 0110 1001 1110 0101. 0001 0100 0101 0111. 0011 1011 1111 0010.
|
||||
*/
|
||||
{
|
||||
0x75, 0xF3, 0xC6, 0xF4, 0xDB, 0x7B, 0xFB, 0xC8,
|
||||
0x4A, 0xD3, 0xE6, 0x6B, 0x45, 0x7D, 0xE8, 0x4B,
|
||||
0xD6, 0x32, 0xD8, 0xFD, 0x37, 0x71, 0xF1, 0xE1,
|
||||
0x30, 0x0F, 0xF8, 0x1B, 0x87, 0xFA, 0x06, 0x3F,
|
||||
0x5E, 0xBA, 0xAE, 0x5B, 0x8A, 0x00, 0xBC, 0x9D,
|
||||
0x6D, 0xC1, 0xB1, 0x0E, 0x80, 0x5D, 0xD2, 0xD5,
|
||||
0xA0, 0x84, 0x07, 0x14, 0xB5, 0x90, 0x2C, 0xA3,
|
||||
0xB2, 0x73, 0x4C, 0x54, 0x92, 0x74, 0x36, 0x51,
|
||||
0x38, 0xB0, 0xBD, 0x5A, 0xFC, 0x60, 0x62, 0x96,
|
||||
0x6C, 0x42, 0xF7, 0x10, 0x7C, 0x28, 0x27, 0x8C,
|
||||
0x13, 0x95, 0x9C, 0xC7, 0x24, 0x46, 0x3B, 0x70,
|
||||
0xCA, 0xE3, 0x85, 0xCB, 0x11, 0xD0, 0x93, 0xB8,
|
||||
0xA6, 0x83, 0x20, 0xFF, 0x9F, 0x77, 0xC3, 0xCC,
|
||||
0x03, 0x6F, 0x08, 0xBF, 0x40, 0xE7, 0x2B, 0xE2,
|
||||
0x79, 0x0C, 0xAA, 0x82, 0x41, 0x3A, 0xEA, 0xB9,
|
||||
0xE4, 0x9A, 0xA4, 0x97, 0x7E, 0xDA, 0x7A, 0x17,
|
||||
0x66, 0x94, 0xA1, 0x1D, 0x3D, 0xF0, 0xDE, 0xB3,
|
||||
0x0B, 0x72, 0xA7, 0x1C, 0xEF, 0xD1, 0x53, 0x3E,
|
||||
0x8F, 0x33, 0x26, 0x5F, 0xEC, 0x76, 0x2A, 0x49,
|
||||
0x81, 0x88, 0xEE, 0x21, 0xC4, 0x1A, 0xEB, 0xD9,
|
||||
0xC5, 0x39, 0x99, 0xCD, 0xAD, 0x31, 0x8B, 0x01,
|
||||
0x18, 0x23, 0xDD, 0x1F, 0x4E, 0x2D, 0xF9, 0x48,
|
||||
0x4F, 0xF2, 0x65, 0x8E, 0x78, 0x5C, 0x58, 0x19,
|
||||
0x8D, 0xE5, 0x98, 0x57, 0x67, 0x7F, 0x05, 0x64,
|
||||
0xAF, 0x63, 0xB6, 0xFE, 0xF5, 0xB7, 0x3C, 0xA5,
|
||||
0xCE, 0xE9, 0x68, 0x44, 0xE0, 0x4D, 0x43, 0x69,
|
||||
0x29, 0x2E, 0xAC, 0x15, 0x59, 0xA8, 0x0A, 0x9E,
|
||||
0x6E, 0x47, 0xDF, 0x34, 0x35, 0x6A, 0xCF, 0xDC,
|
||||
0x22, 0xC9, 0xC0, 0x9B, 0x89, 0xD4, 0xED, 0xAB,
|
||||
0x12, 0xA2, 0x0D, 0x52, 0xBB, 0x02, 0x2F, 0xA9,
|
||||
0xD7, 0x61, 0x1E, 0xB4, 0x50, 0x04, 0xF6, 0xC2,
|
||||
0x16, 0x25, 0x86, 0x56, 0x55, 0x09, 0xBE, 0x91
|
||||
}
|
||||
};
|
||||
#endregion
|
||||
|
||||
#region These are all the definitions that were found in PLATFORM.H that we need
|
||||
// left rotation
|
||||
private static uint ROL(uint x, int n)
|
||||
{
|
||||
return ( ((x) << ((n) & 0x1F)) | (x) >> (32-((n) & 0x1F)) );
|
||||
}
|
||||
|
||||
// right rotation
|
||||
private static uint ROR(uint x,int n)
|
||||
{
|
||||
return (((x) >> ((n) & 0x1F)) | ((x) << (32-((n) & 0x1F))));
|
||||
}
|
||||
|
||||
// first byte
|
||||
protected static byte b0(uint x)
|
||||
{
|
||||
return (byte)(x );//& 0xFF);
|
||||
}
|
||||
// second byte
|
||||
protected static byte b1(uint x)
|
||||
{
|
||||
return (byte)((x >> 8));// & (0xFF));
|
||||
}
|
||||
// third byte
|
||||
protected static byte b2(uint x)
|
||||
{
|
||||
return (byte)((x >> 16));// & (0xFF));
|
||||
}
|
||||
// fourth byte
|
||||
protected static byte b3(uint x)
|
||||
{
|
||||
return (byte)((x >> 24));// & (0xFF));
|
||||
}
|
||||
|
||||
#endregion
|
||||
}
|
||||
}
|
||||
193
src/TwofishCipher/Crypto/TwofishEncryption.cs
Normal file
193
src/TwofishCipher/Crypto/TwofishEncryption.cs
Normal file
@ -0,0 +1,193 @@
|
||||
/*
|
||||
A C# implementation of the Twofish cipher
|
||||
By Shaun Wilde
|
||||
|
||||
An article on integrating a C# implementation of the Twofish cipher into the
|
||||
.NET framework.
|
||||
|
||||
http://www.codeproject.com/KB/recipes/twofish_csharp.aspx
|
||||
|
||||
The Code Project Open License (CPOL) 1.02
|
||||
http://www.codeproject.com/info/cpol10.aspx
|
||||
|
||||
Download a copy of the CPOL.
|
||||
http://www.codeproject.com/info/CPOL.zip
|
||||
*/
|
||||
|
||||
using System;
|
||||
using System.Diagnostics;
|
||||
using System.Security.Cryptography;
|
||||
|
||||
namespace TwofishCipher.Crypto
|
||||
{
|
||||
/// <summary>
|
||||
/// Summary description for TwofishEncryption.
|
||||
/// </summary>
|
||||
internal class TwofishEncryption : TwofishBase, ICryptoTransform
|
||||
{
|
||||
public TwofishEncryption(int keyLen, ref byte[] key, ref byte[] iv, CipherMode cMode, EncryptionDirection direction)
|
||||
{
|
||||
// convert our key into an array of ints
|
||||
for (int i=0;i<key.Length/4;i++)
|
||||
{
|
||||
Key[i] = (uint)( key[i*4+3]<<24) | (uint)(key[i*4+2] << 16) | (uint)(key[i*4+1] << 8) | (uint)(key[i*4+0]);
|
||||
}
|
||||
|
||||
cipherMode = cMode;
|
||||
|
||||
// we only need to convert our IV if we are using CBC
|
||||
if (cipherMode == CipherMode.CBC)
|
||||
{
|
||||
for (int i=0;i<4;i++)
|
||||
{
|
||||
IV[i] = (uint)( iv[i*4+3]<<24) | (uint)(iv[i*4+2] << 16) | (uint)(iv[i*4+1] << 8) | (uint)(iv[i*4+0]);
|
||||
}
|
||||
}
|
||||
|
||||
encryptionDirection = direction;
|
||||
reKey(keyLen,ref Key);
|
||||
}
|
||||
|
||||
// need to have this method due to IDisposable - just can't think of a reason to use it for in this class
|
||||
public void Dispose()
|
||||
{
|
||||
}
|
||||
|
||||
|
||||
/// <summary>
|
||||
/// Transform a block depending on whether we are encrypting or decrypting
|
||||
/// </summary>
|
||||
/// <param name="inputBuffer"></param>
|
||||
/// <param name="inputOffset"></param>
|
||||
/// <param name="inputCount"></param>
|
||||
/// <param name="outputBuffer"></param>
|
||||
/// <param name="outputOffset"></param>
|
||||
/// <returns></returns>
|
||||
public int TransformBlock(
|
||||
byte[] inputBuffer,
|
||||
int inputOffset,
|
||||
int inputCount,
|
||||
byte[] outputBuffer,
|
||||
int outputOffset
|
||||
)
|
||||
{
|
||||
uint[] x=new uint[4];
|
||||
|
||||
// load it up
|
||||
for (int i=0;i<4;i++)
|
||||
{
|
||||
x[i]= (uint)(inputBuffer[i*4+3+inputOffset]<<24) | (uint)(inputBuffer[i*4+2+inputOffset] << 16) |
|
||||
(uint)(inputBuffer[i*4+1+inputOffset] << 8) | (uint)(inputBuffer[i*4+0+inputOffset]);
|
||||
|
||||
}
|
||||
|
||||
if (encryptionDirection == EncryptionDirection.Encrypting)
|
||||
{
|
||||
blockEncrypt(ref x);
|
||||
}
|
||||
else
|
||||
{
|
||||
blockDecrypt(ref x);
|
||||
}
|
||||
|
||||
|
||||
// load it up
|
||||
for (int i=0;i<4;i++)
|
||||
{
|
||||
outputBuffer[i*4+0+outputOffset] = b0(x[i]);
|
||||
outputBuffer[i*4+1+outputOffset] = b1(x[i]);
|
||||
outputBuffer[i*4+2+outputOffset] = b2(x[i]);
|
||||
outputBuffer[i*4+3+outputOffset] = b3(x[i]);
|
||||
}
|
||||
|
||||
|
||||
return inputCount;
|
||||
}
|
||||
|
||||
public byte[] TransformFinalBlock(
|
||||
byte[] inputBuffer,
|
||||
int inputOffset,
|
||||
int inputCount
|
||||
)
|
||||
{
|
||||
byte[] outputBuffer;// = new byte[0];
|
||||
|
||||
if (inputCount>0)
|
||||
{
|
||||
outputBuffer = new byte[16]; // blocksize
|
||||
uint[] x=new uint[4];
|
||||
|
||||
// load it up
|
||||
for (int i=0;i<4;i++) // should be okay as we have already said to pad with zeros
|
||||
{
|
||||
x[i]= (uint)(inputBuffer[i*4+3+inputOffset]<<24) | (uint)(inputBuffer[i*4+2+inputOffset] << 16) |
|
||||
(uint)(inputBuffer[i*4+1+inputOffset] << 8) | (uint)(inputBuffer[i*4+0+inputOffset]);
|
||||
|
||||
}
|
||||
|
||||
if (encryptionDirection == EncryptionDirection.Encrypting)
|
||||
{
|
||||
blockEncrypt(ref x);
|
||||
}
|
||||
else
|
||||
{
|
||||
blockDecrypt(ref x);
|
||||
}
|
||||
|
||||
// load it up
|
||||
for (int i=0;i<4;i++)
|
||||
{
|
||||
outputBuffer[i*4+0] = b0(x[i]);
|
||||
outputBuffer[i*4+1] = b1(x[i]);
|
||||
outputBuffer[i*4+2] = b2(x[i]);
|
||||
outputBuffer[i*4+3] = b3(x[i]);
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
outputBuffer = new byte[0]; // the .NET framework doesn't like it if you return null - this calms it down
|
||||
}
|
||||
|
||||
return outputBuffer;
|
||||
}
|
||||
|
||||
// not worked out this property yet - placing break points here just don't get caught.
|
||||
private bool canReuseTransform = true;
|
||||
public bool CanReuseTransform
|
||||
{
|
||||
get
|
||||
{
|
||||
return canReuseTransform;
|
||||
}
|
||||
}
|
||||
|
||||
// I normally set this to false when block encrypting so that I can work on one block at a time
|
||||
// but for compression and stream type ciphers this can be set to true so that you get all the data
|
||||
private bool canTransformMultipleBlocks = false;
|
||||
public bool CanTransformMultipleBlocks
|
||||
{
|
||||
get
|
||||
{
|
||||
return canTransformMultipleBlocks;
|
||||
}
|
||||
}
|
||||
|
||||
public int InputBlockSize
|
||||
{
|
||||
get
|
||||
{
|
||||
return inputBlockSize;
|
||||
}
|
||||
}
|
||||
|
||||
public int OutputBlockSize
|
||||
{
|
||||
get
|
||||
{
|
||||
return outputBlockSize;
|
||||
}
|
||||
}
|
||||
|
||||
private EncryptionDirection encryptionDirection;
|
||||
}
|
||||
}
|
||||
674
src/TwofishCipher/License.txt
Normal file
674
src/TwofishCipher/License.txt
Normal file
@ -0,0 +1,674 @@
|
||||
GNU GENERAL PUBLIC LICENSE
|
||||
Version 3, 29 June 2007
|
||||
|
||||
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
|
||||
Everyone is permitted to copy and distribute verbatim copies
|
||||
of this license document, but changing it is not allowed.
|
||||
|
||||
Preamble
|
||||
|
||||
The GNU General Public License is a free, copyleft license for
|
||||
software and other kinds of works.
|
||||
|
||||
The licenses for most software and other practical works are designed
|
||||
to take away your freedom to share and change the works. By contrast,
|
||||
the GNU General Public License is intended to guarantee your freedom to
|
||||
share and change all versions of a program--to make sure it remains free
|
||||
software for all its users. We, the Free Software Foundation, use the
|
||||
GNU General Public License for most of our software; it applies also to
|
||||
any other work released this way by its authors. You can apply it to
|
||||
your programs, too.
|
||||
|
||||
When we speak of free software, we are referring to freedom, not
|
||||
price. Our General Public Licenses are designed to make sure that you
|
||||
have the freedom to distribute copies of free software (and charge for
|
||||
them if you wish), that you receive source code or can get it if you
|
||||
want it, that you can change the software or use pieces of it in new
|
||||
free programs, and that you know you can do these things.
|
||||
|
||||
To protect your rights, we need to prevent others from denying you
|
||||
these rights or asking you to surrender the rights. Therefore, you have
|
||||
certain responsibilities if you distribute copies of the software, or if
|
||||
you modify it: responsibilities to respect the freedom of others.
|
||||
|
||||
For example, if you distribute copies of such a program, whether
|
||||
gratis or for a fee, you must pass on to the recipients the same
|
||||
freedoms that you received. You must make sure that they, too, receive
|
||||
or can get the source code. And you must show them these terms so they
|
||||
know their rights.
|
||||
|
||||
Developers that use the GNU GPL protect your rights with two steps:
|
||||
(1) assert copyright on the software, and (2) offer you this License
|
||||
giving you legal permission to copy, distribute and/or modify it.
|
||||
|
||||
For the developers' and authors' protection, the GPL clearly explains
|
||||
that there is no warranty for this free software. For both users' and
|
||||
authors' sake, the GPL requires that modified versions be marked as
|
||||
changed, so that their problems will not be attributed erroneously to
|
||||
authors of previous versions.
|
||||
|
||||
Some devices are designed to deny users access to install or run
|
||||
modified versions of the software inside them, although the manufacturer
|
||||
can do so. This is fundamentally incompatible with the aim of
|
||||
protecting users' freedom to change the software. The systematic
|
||||
pattern of such abuse occurs in the area of products for individuals to
|
||||
use, which is precisely where it is most unacceptable. Therefore, we
|
||||
have designed this version of the GPL to prohibit the practice for those
|
||||
products. If such problems arise substantially in other domains, we
|
||||
stand ready to extend this provision to those domains in future versions
|
||||
of the GPL, as needed to protect the freedom of users.
|
||||
|
||||
Finally, every program is threatened constantly by software patents.
|
||||
States should not allow patents to restrict development and use of
|
||||
software on general-purpose computers, but in those that do, we wish to
|
||||
avoid the special danger that patents applied to a free program could
|
||||
make it effectively proprietary. To prevent this, the GPL assures that
|
||||
patents cannot be used to render the program non-free.
|
||||
|
||||
The precise terms and conditions for copying, distribution and
|
||||
modification follow.
|
||||
|
||||
TERMS AND CONDITIONS
|
||||
|
||||
0. Definitions.
|
||||
|
||||
"This License" refers to version 3 of the GNU General Public License.
|
||||
|
||||
"Copyright" also means copyright-like laws that apply to other kinds of
|
||||
works, such as semiconductor masks.
|
||||
|
||||
"The Program" refers to any copyrightable work licensed under this
|
||||
License. Each licensee is addressed as "you". "Licensees" and
|
||||
"recipients" may be individuals or organizations.
|
||||
|
||||
To "modify" a work means to copy from or adapt all or part of the work
|
||||
in a fashion requiring copyright permission, other than the making of an
|
||||
exact copy. The resulting work is called a "modified version" of the
|
||||
earlier work or a work "based on" the earlier work.
|
||||
|
||||
A "covered work" means either the unmodified Program or a work based
|
||||
on the Program.
|
||||
|
||||
To "propagate" a work means to do anything with it that, without
|
||||
permission, would make you directly or secondarily liable for
|
||||
infringement under applicable copyright law, except executing it on a
|
||||
computer or modifying a private copy. Propagation includes copying,
|
||||
distribution (with or without modification), making available to the
|
||||
public, and in some countries other activities as well.
|
||||
|
||||
To "convey" a work means any kind of propagation that enables other
|
||||
parties to make or receive copies. Mere interaction with a user through
|
||||
a computer network, with no transfer of a copy, is not conveying.
|
||||
|
||||
An interactive user interface displays "Appropriate Legal Notices"
|
||||
to the extent that it includes a convenient and prominently visible
|
||||
feature that (1) displays an appropriate copyright notice, and (2)
|
||||
tells the user that there is no warranty for the work (except to the
|
||||
extent that warranties are provided), that licensees may convey the
|
||||
work under this License, and how to view a copy of this License. If
|
||||
the interface presents a list of user commands or options, such as a
|
||||
menu, a prominent item in the list meets this criterion.
|
||||
|
||||
1. Source Code.
|
||||
|
||||
The "source code" for a work means the preferred form of the work
|
||||
for making modifications to it. "Object code" means any non-source
|
||||
form of a work.
|
||||
|
||||
A "Standard Interface" means an interface that either is an official
|
||||
standard defined by a recognized standards body, or, in the case of
|
||||
interfaces specified for a particular programming language, one that
|
||||
is widely used among developers working in that language.
|
||||
|
||||
The "System Libraries" of an executable work include anything, other
|
||||
than the work as a whole, that (a) is included in the normal form of
|
||||
packaging a Major Component, but which is not part of that Major
|
||||
Component, and (b) serves only to enable use of the work with that
|
||||
Major Component, or to implement a Standard Interface for which an
|
||||
implementation is available to the public in source code form. A
|
||||
"Major Component", in this context, means a major essential component
|
||||
(kernel, window system, and so on) of the specific operating system
|
||||
(if any) on which the executable work runs, or a compiler used to
|
||||
produce the work, or an object code interpreter used to run it.
|
||||
|
||||
The "Corresponding Source" for a work in object code form means all
|
||||
the source code needed to generate, install, and (for an executable
|
||||
work) run the object code and to modify the work, including scripts to
|
||||
control those activities. However, it does not include the work's
|
||||
System Libraries, or general-purpose tools or generally available free
|
||||
programs which are used unmodified in performing those activities but
|
||||
which are not part of the work. For example, Corresponding Source
|
||||
includes interface definition files associated with source files for
|
||||
the work, and the source code for shared libraries and dynamically
|
||||
linked subprograms that the work is specifically designed to require,
|
||||
such as by intimate data communication or control flow between those
|
||||
subprograms and other parts of the work.
|
||||
|
||||
The Corresponding Source need not include anything that users
|
||||
can regenerate automatically from other parts of the Corresponding
|
||||
Source.
|
||||
|
||||
The Corresponding Source for a work in source code form is that
|
||||
same work.
|
||||
|
||||
2. Basic Permissions.
|
||||
|
||||
All rights granted under this License are granted for the term of
|
||||
copyright on the Program, and are irrevocable provided the stated
|
||||
conditions are met. This License explicitly affirms your unlimited
|
||||
permission to run the unmodified Program. The output from running a
|
||||
covered work is covered by this License only if the output, given its
|
||||
content, constitutes a covered work. This License acknowledges your
|
||||
rights of fair use or other equivalent, as provided by copyright law.
|
||||
|
||||
You may make, run and propagate covered works that you do not
|
||||
convey, without conditions so long as your license otherwise remains
|
||||
in force. You may convey covered works to others for the sole purpose
|
||||
of having them make modifications exclusively for you, or provide you
|
||||
with facilities for running those works, provided that you comply with
|
||||
the terms of this License in conveying all material for which you do
|
||||
not control copyright. Those thus making or running the covered works
|
||||
for you must do so exclusively on your behalf, under your direction
|
||||
and control, on terms that prohibit them from making any copies of
|
||||
your copyrighted material outside their relationship with you.
|
||||
|
||||
Conveying under any other circumstances is permitted solely under
|
||||
the conditions stated below. Sublicensing is not allowed; section 10
|
||||
makes it unnecessary.
|
||||
|
||||
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
||||
|
||||
No covered work shall be deemed part of an effective technological
|
||||
measure under any applicable law fulfilling obligations under article
|
||||
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
||||
similar laws prohibiting or restricting circumvention of such
|
||||
measures.
|
||||
|
||||
When you convey a covered work, you waive any legal power to forbid
|
||||
circumvention of technological measures to the extent such circumvention
|
||||
is effected by exercising rights under this License with respect to
|
||||
the covered work, and you disclaim any intention to limit operation or
|
||||
modification of the work as a means of enforcing, against the work's
|
||||
users, your or third parties' legal rights to forbid circumvention of
|
||||
technological measures.
|
||||
|
||||
4. Conveying Verbatim Copies.
|
||||
|
||||
You may convey verbatim copies of the Program's source code as you
|
||||
receive it, in any medium, provided that you conspicuously and
|
||||
appropriately publish on each copy an appropriate copyright notice;
|
||||
keep intact all notices stating that this License and any
|
||||
non-permissive terms added in accord with section 7 apply to the code;
|
||||
keep intact all notices of the absence of any warranty; and give all
|
||||
recipients a copy of this License along with the Program.
|
||||
|
||||
You may charge any price or no price for each copy that you convey,
|
||||
and you may offer support or warranty protection for a fee.
|
||||
|
||||
5. Conveying Modified Source Versions.
|
||||
|
||||
You may convey a work based on the Program, or the modifications to
|
||||
produce it from the Program, in the form of source code under the
|
||||
terms of section 4, provided that you also meet all of these conditions:
|
||||
|
||||
a) The work must carry prominent notices stating that you modified
|
||||
it, and giving a relevant date.
|
||||
|
||||
b) The work must carry prominent notices stating that it is
|
||||
released under this License and any conditions added under section
|
||||
7. This requirement modifies the requirement in section 4 to
|
||||
"keep intact all notices".
|
||||
|
||||
c) You must license the entire work, as a whole, under this
|
||||
License to anyone who comes into possession of a copy. This
|
||||
License will therefore apply, along with any applicable section 7
|
||||
additional terms, to the whole of the work, and all its parts,
|
||||
regardless of how they are packaged. This License gives no
|
||||
permission to license the work in any other way, but it does not
|
||||
invalidate such permission if you have separately received it.
|
||||
|
||||
d) If the work has interactive user interfaces, each must display
|
||||
Appropriate Legal Notices; however, if the Program has interactive
|
||||
interfaces that do not display Appropriate Legal Notices, your
|
||||
work need not make them do so.
|
||||
|
||||
A compilation of a covered work with other separate and independent
|
||||
works, which are not by their nature extensions of the covered work,
|
||||
and which are not combined with it such as to form a larger program,
|
||||
in or on a volume of a storage or distribution medium, is called an
|
||||
"aggregate" if the compilation and its resulting copyright are not
|
||||
used to limit the access or legal rights of the compilation's users
|
||||
beyond what the individual works permit. Inclusion of a covered work
|
||||
in an aggregate does not cause this License to apply to the other
|
||||
parts of the aggregate.
|
||||
|
||||
6. Conveying Non-Source Forms.
|
||||
|
||||
You may convey a covered work in object code form under the terms
|
||||
of sections 4 and 5, provided that you also convey the
|
||||
machine-readable Corresponding Source under the terms of this License,
|
||||
in one of these ways:
|
||||
|
||||
a) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by the
|
||||
Corresponding Source fixed on a durable physical medium
|
||||
customarily used for software interchange.
|
||||
|
||||
b) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by a
|
||||
written offer, valid for at least three years and valid for as
|
||||
long as you offer spare parts or customer support for that product
|
||||
model, to give anyone who possesses the object code either (1) a
|
||||
copy of the Corresponding Source for all the software in the
|
||||
product that is covered by this License, on a durable physical
|
||||
medium customarily used for software interchange, for a price no
|
||||
more than your reasonable cost of physically performing this
|
||||
conveying of source, or (2) access to copy the
|
||||
Corresponding Source from a network server at no charge.
|
||||
|
||||
c) Convey individual copies of the object code with a copy of the
|
||||
written offer to provide the Corresponding Source. This
|
||||
alternative is allowed only occasionally and noncommercially, and
|
||||
only if you received the object code with such an offer, in accord
|
||||
with subsection 6b.
|
||||
|
||||
d) Convey the object code by offering access from a designated
|
||||
place (gratis or for a charge), and offer equivalent access to the
|
||||
Corresponding Source in the same way through the same place at no
|
||||
further charge. You need not require recipients to copy the
|
||||
Corresponding Source along with the object code. If the place to
|
||||
copy the object code is a network server, the Corresponding Source
|
||||
may be on a different server (operated by you or a third party)
|
||||
that supports equivalent copying facilities, provided you maintain
|
||||
clear directions next to the object code saying where to find the
|
||||
Corresponding Source. Regardless of what server hosts the
|
||||
Corresponding Source, you remain obligated to ensure that it is
|
||||
available for as long as needed to satisfy these requirements.
|
||||
|
||||
e) Convey the object code using peer-to-peer transmission, provided
|
||||
you inform other peers where the object code and Corresponding
|
||||
Source of the work are being offered to the general public at no
|
||||
charge under subsection 6d.
|
||||
|
||||
A separable portion of the object code, whose source code is excluded
|
||||
from the Corresponding Source as a System Library, need not be
|
||||
included in conveying the object code work.
|
||||
|
||||
A "User Product" is either (1) a "consumer product", which means any
|
||||
tangible personal property which is normally used for personal, family,
|
||||
or household purposes, or (2) anything designed or sold for incorporation
|
||||
into a dwelling. In determining whether a product is a consumer product,
|
||||
doubtful cases shall be resolved in favor of coverage. For a particular
|
||||
product received by a particular user, "normally used" refers to a
|
||||
typical or common use of that class of product, regardless of the status
|
||||
of the particular user or of the way in which the particular user
|
||||
actually uses, or expects or is expected to use, the product. A product
|
||||
is a consumer product regardless of whether the product has substantial
|
||||
commercial, industrial or non-consumer uses, unless such uses represent
|
||||
the only significant mode of use of the product.
|
||||
|
||||
"Installation Information" for a User Product means any methods,
|
||||
procedures, authorization keys, or other information required to install
|
||||
and execute modified versions of a covered work in that User Product from
|
||||
a modified version of its Corresponding Source. The information must
|
||||
suffice to ensure that the continued functioning of the modified object
|
||||
code is in no case prevented or interfered with solely because
|
||||
modification has been made.
|
||||
|
||||
If you convey an object code work under this section in, or with, or
|
||||
specifically for use in, a User Product, and the conveying occurs as
|
||||
part of a transaction in which the right of possession and use of the
|
||||
User Product is transferred to the recipient in perpetuity or for a
|
||||
fixed term (regardless of how the transaction is characterized), the
|
||||
Corresponding Source conveyed under this section must be accompanied
|
||||
by the Installation Information. But this requirement does not apply
|
||||
if neither you nor any third party retains the ability to install
|
||||
modified object code on the User Product (for example, the work has
|
||||
been installed in ROM).
|
||||
|
||||
The requirement to provide Installation Information does not include a
|
||||
requirement to continue to provide support service, warranty, or updates
|
||||
for a work that has been modified or installed by the recipient, or for
|
||||
the User Product in which it has been modified or installed. Access to a
|
||||
network may be denied when the modification itself materially and
|
||||
adversely affects the operation of the network or violates the rules and
|
||||
protocols for communication across the network.
|
||||
|
||||
Corresponding Source conveyed, and Installation Information provided,
|
||||
in accord with this section must be in a format that is publicly
|
||||
documented (and with an implementation available to the public in
|
||||
source code form), and must require no special password or key for
|
||||
unpacking, reading or copying.
|
||||
|
||||
7. Additional Terms.
|
||||
|
||||
"Additional permissions" are terms that supplement the terms of this
|
||||
License by making exceptions from one or more of its conditions.
|
||||
Additional permissions that are applicable to the entire Program shall
|
||||
be treated as though they were included in this License, to the extent
|
||||
that they are valid under applicable law. If additional permissions
|
||||
apply only to part of the Program, that part may be used separately
|
||||
under those permissions, but the entire Program remains governed by
|
||||
this License without regard to the additional permissions.
|
||||
|
||||
When you convey a copy of a covered work, you may at your option
|
||||
remove any additional permissions from that copy, or from any part of
|
||||
it. (Additional permissions may be written to require their own
|
||||
removal in certain cases when you modify the work.) You may place
|
||||
additional permissions on material, added by you to a covered work,
|
||||
for which you have or can give appropriate copyright permission.
|
||||
|
||||
Notwithstanding any other provision of this License, for material you
|
||||
add to a covered work, you may (if authorized by the copyright holders of
|
||||
that material) supplement the terms of this License with terms:
|
||||
|
||||
a) Disclaiming warranty or limiting liability differently from the
|
||||
terms of sections 15 and 16 of this License; or
|
||||
|
||||
b) Requiring preservation of specified reasonable legal notices or
|
||||
author attributions in that material or in the Appropriate Legal
|
||||
Notices displayed by works containing it; or
|
||||
|
||||
c) Prohibiting misrepresentation of the origin of that material, or
|
||||
requiring that modified versions of such material be marked in
|
||||
reasonable ways as different from the original version; or
|
||||
|
||||
d) Limiting the use for publicity purposes of names of licensors or
|
||||
authors of the material; or
|
||||
|
||||
e) Declining to grant rights under trademark law for use of some
|
||||
trade names, trademarks, or service marks; or
|
||||
|
||||
f) Requiring indemnification of licensors and authors of that
|
||||
material by anyone who conveys the material (or modified versions of
|
||||
it) with contractual assumptions of liability to the recipient, for
|
||||
any liability that these contractual assumptions directly impose on
|
||||
those licensors and authors.
|
||||
|
||||
All other non-permissive additional terms are considered "further
|
||||
restrictions" within the meaning of section 10. If the Program as you
|
||||
received it, or any part of it, contains a notice stating that it is
|
||||
governed by this License along with a term that is a further
|
||||
restriction, you may remove that term. If a license document contains
|
||||
a further restriction but permits relicensing or conveying under this
|
||||
License, you may add to a covered work material governed by the terms
|
||||
of that license document, provided that the further restriction does
|
||||
not survive such relicensing or conveying.
|
||||
|
||||
If you add terms to a covered work in accord with this section, you
|
||||
must place, in the relevant source files, a statement of the
|
||||
additional terms that apply to those files, or a notice indicating
|
||||
where to find the applicable terms.
|
||||
|
||||
Additional terms, permissive or non-permissive, may be stated in the
|
||||
form of a separately written license, or stated as exceptions;
|
||||
the above requirements apply either way.
|
||||
|
||||
8. Termination.
|
||||
|
||||
You may not propagate or modify a covered work except as expressly
|
||||
provided under this License. Any attempt otherwise to propagate or
|
||||
modify it is void, and will automatically terminate your rights under
|
||||
this License (including any patent licenses granted under the third
|
||||
paragraph of section 11).
|
||||
|
||||
However, if you cease all violation of this License, then your
|
||||
license from a particular copyright holder is reinstated (a)
|
||||
provisionally, unless and until the copyright holder explicitly and
|
||||
finally terminates your license, and (b) permanently, if the copyright
|
||||
holder fails to notify you of the violation by some reasonable means
|
||||
prior to 60 days after the cessation.
|
||||
|
||||
Moreover, your license from a particular copyright holder is
|
||||
reinstated permanently if the copyright holder notifies you of the
|
||||
violation by some reasonable means, this is the first time you have
|
||||
received notice of violation of this License (for any work) from that
|
||||
copyright holder, and you cure the violation prior to 30 days after
|
||||
your receipt of the notice.
|
||||
|
||||
Termination of your rights under this section does not terminate the
|
||||
licenses of parties who have received copies or rights from you under
|
||||
this License. If your rights have been terminated and not permanently
|
||||
reinstated, you do not qualify to receive new licenses for the same
|
||||
material under section 10.
|
||||
|
||||
9. Acceptance Not Required for Having Copies.
|
||||
|
||||
You are not required to accept this License in order to receive or
|
||||
run a copy of the Program. Ancillary propagation of a covered work
|
||||
occurring solely as a consequence of using peer-to-peer transmission
|
||||
to receive a copy likewise does not require acceptance. However,
|
||||
nothing other than this License grants you permission to propagate or
|
||||
modify any covered work. These actions infringe copyright if you do
|
||||
not accept this License. Therefore, by modifying or propagating a
|
||||
covered work, you indicate your acceptance of this License to do so.
|
||||
|
||||
10. Automatic Licensing of Downstream Recipients.
|
||||
|
||||
Each time you convey a covered work, the recipient automatically
|
||||
receives a license from the original licensors, to run, modify and
|
||||
propagate that work, subject to this License. You are not responsible
|
||||
for enforcing compliance by third parties with this License.
|
||||
|
||||
An "entity transaction" is a transaction transferring control of an
|
||||
organization, or substantially all assets of one, or subdividing an
|
||||
organization, or merging organizations. If propagation of a covered
|
||||
work results from an entity transaction, each party to that
|
||||
transaction who receives a copy of the work also receives whatever
|
||||
licenses to the work the party's predecessor in interest had or could
|
||||
give under the previous paragraph, plus a right to possession of the
|
||||
Corresponding Source of the work from the predecessor in interest, if
|
||||
the predecessor has it or can get it with reasonable efforts.
|
||||
|
||||
You may not impose any further restrictions on the exercise of the
|
||||
rights granted or affirmed under this License. For example, you may
|
||||
not impose a license fee, royalty, or other charge for exercise of
|
||||
rights granted under this License, and you may not initiate litigation
|
||||
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
||||
any patent claim is infringed by making, using, selling, offering for
|
||||
sale, or importing the Program or any portion of it.
|
||||
|
||||
11. Patents.
|
||||
|
||||
A "contributor" is a copyright holder who authorizes use under this
|
||||
License of the Program or a work on which the Program is based. The
|
||||
work thus licensed is called the contributor's "contributor version".
|
||||
|
||||
A contributor's "essential patent claims" are all patent claims
|
||||
owned or controlled by the contributor, whether already acquired or
|
||||
hereafter acquired, that would be infringed by some manner, permitted
|
||||
by this License, of making, using, or selling its contributor version,
|
||||
but do not include claims that would be infringed only as a
|
||||
consequence of further modification of the contributor version. For
|
||||
purposes of this definition, "control" includes the right to grant
|
||||
patent sublicenses in a manner consistent with the requirements of
|
||||
this License.
|
||||
|
||||
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
||||
patent license under the contributor's essential patent claims, to
|
||||
make, use, sell, offer for sale, import and otherwise run, modify and
|
||||
propagate the contents of its contributor version.
|
||||
|
||||
In the following three paragraphs, a "patent license" is any express
|
||||
agreement or commitment, however denominated, not to enforce a patent
|
||||
(such as an express permission to practice a patent or covenant not to
|
||||
sue for patent infringement). To "grant" such a patent license to a
|
||||
party means to make such an agreement or commitment not to enforce a
|
||||
patent against the party.
|
||||
|
||||
If you convey a covered work, knowingly relying on a patent license,
|
||||
and the Corresponding Source of the work is not available for anyone
|
||||
to copy, free of charge and under the terms of this License, through a
|
||||
publicly available network server or other readily accessible means,
|
||||
then you must either (1) cause the Corresponding Source to be so
|
||||
available, or (2) arrange to deprive yourself of the benefit of the
|
||||
patent license for this particular work, or (3) arrange, in a manner
|
||||
consistent with the requirements of this License, to extend the patent
|
||||
license to downstream recipients. "Knowingly relying" means you have
|
||||
actual knowledge that, but for the patent license, your conveying the
|
||||
covered work in a country, or your recipient's use of the covered work
|
||||
in a country, would infringe one or more identifiable patents in that
|
||||
country that you have reason to believe are valid.
|
||||
|
||||
If, pursuant to or in connection with a single transaction or
|
||||
arrangement, you convey, or propagate by procuring conveyance of, a
|
||||
covered work, and grant a patent license to some of the parties
|
||||
receiving the covered work authorizing them to use, propagate, modify
|
||||
or convey a specific copy of the covered work, then the patent license
|
||||
you grant is automatically extended to all recipients of the covered
|
||||
work and works based on it.
|
||||
|
||||
A patent license is "discriminatory" if it does not include within
|
||||
the scope of its coverage, prohibits the exercise of, or is
|
||||
conditioned on the non-exercise of one or more of the rights that are
|
||||
specifically granted under this License. You may not convey a covered
|
||||
work if you are a party to an arrangement with a third party that is
|
||||
in the business of distributing software, under which you make payment
|
||||
to the third party based on the extent of your activity of conveying
|
||||
the work, and under which the third party grants, to any of the
|
||||
parties who would receive the covered work from you, a discriminatory
|
||||
patent license (a) in connection with copies of the covered work
|
||||
conveyed by you (or copies made from those copies), or (b) primarily
|
||||
for and in connection with specific products or compilations that
|
||||
contain the covered work, unless you entered into that arrangement,
|
||||
or that patent license was granted, prior to 28 March 2007.
|
||||
|
||||
Nothing in this License shall be construed as excluding or limiting
|
||||
any implied license or other defenses to infringement that may
|
||||
otherwise be available to you under applicable patent law.
|
||||
|
||||
12. No Surrender of Others' Freedom.
|
||||
|
||||
If conditions are imposed on you (whether by court order, agreement or
|
||||
otherwise) that contradict the conditions of this License, they do not
|
||||
excuse you from the conditions of this License. If you cannot convey a
|
||||
covered work so as to satisfy simultaneously your obligations under this
|
||||
License and any other pertinent obligations, then as a consequence you may
|
||||
not convey it at all. For example, if you agree to terms that obligate you
|
||||
to collect a royalty for further conveying from those to whom you convey
|
||||
the Program, the only way you could satisfy both those terms and this
|
||||
License would be to refrain entirely from conveying the Program.
|
||||
|
||||
13. Use with the GNU Affero General Public License.
|
||||
|
||||
Notwithstanding any other provision of this License, you have
|
||||
permission to link or combine any covered work with a work licensed
|
||||
under version 3 of the GNU Affero General Public License into a single
|
||||
combined work, and to convey the resulting work. The terms of this
|
||||
License will continue to apply to the part which is the covered work,
|
||||
but the special requirements of the GNU Affero General Public License,
|
||||
section 13, concerning interaction through a network will apply to the
|
||||
combination as such.
|
||||
|
||||
14. Revised Versions of this License.
|
||||
|
||||
The Free Software Foundation may publish revised and/or new versions of
|
||||
the GNU General Public License from time to time. Such new versions will
|
||||
be similar in spirit to the present version, but may differ in detail to
|
||||
address new problems or concerns.
|
||||
|
||||
Each version is given a distinguishing version number. If the
|
||||
Program specifies that a certain numbered version of the GNU General
|
||||
Public License "or any later version" applies to it, you have the
|
||||
option of following the terms and conditions either of that numbered
|
||||
version or of any later version published by the Free Software
|
||||
Foundation. If the Program does not specify a version number of the
|
||||
GNU General Public License, you may choose any version ever published
|
||||
by the Free Software Foundation.
|
||||
|
||||
If the Program specifies that a proxy can decide which future
|
||||
versions of the GNU General Public License can be used, that proxy's
|
||||
public statement of acceptance of a version permanently authorizes you
|
||||
to choose that version for the Program.
|
||||
|
||||
Later license versions may give you additional or different
|
||||
permissions. However, no additional obligations are imposed on any
|
||||
author or copyright holder as a result of your choosing to follow a
|
||||
later version.
|
||||
|
||||
15. Disclaimer of Warranty.
|
||||
|
||||
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
||||
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
||||
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
||||
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
||||
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
||||
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
||||
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
||||
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
||||
|
||||
16. Limitation of Liability.
|
||||
|
||||
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
||||
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
||||
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
||||
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
||||
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
||||
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
||||
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
||||
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
||||
SUCH DAMAGES.
|
||||
|
||||
17. Interpretation of Sections 15 and 16.
|
||||
|
||||
If the disclaimer of warranty and limitation of liability provided
|
||||
above cannot be given local legal effect according to their terms,
|
||||
reviewing courts shall apply local law that most closely approximates
|
||||
an absolute waiver of all civil liability in connection with the
|
||||
Program, unless a warranty or assumption of liability accompanies a
|
||||
copy of the Program in return for a fee.
|
||||
|
||||
END OF TERMS AND CONDITIONS
|
||||
|
||||
How to Apply These Terms to Your New Programs
|
||||
|
||||
If you develop a new program, and you want it to be of the greatest
|
||||
possible use to the public, the best way to achieve this is to make it
|
||||
free software which everyone can redistribute and change under these terms.
|
||||
|
||||
To do so, attach the following notices to the program. It is safest
|
||||
to attach them to the start of each source file to most effectively
|
||||
state the exclusion of warranty; and each file should have at least
|
||||
the "copyright" line and a pointer to where the full notice is found.
|
||||
|
||||
<one line to give the program's name and a brief idea of what it does.>
|
||||
Copyright (C) <year> <name of author>
|
||||
|
||||
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
|
||||
the Free Software Foundation, either version 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
|
||||
Also add information on how to contact you by electronic and paper mail.
|
||||
|
||||
If the program does terminal interaction, make it output a short
|
||||
notice like this when it starts in an interactive mode:
|
||||
|
||||
<program> Copyright (C) <year> <name of author>
|
||||
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
||||
This is free software, and you are welcome to redistribute it
|
||||
under certain conditions; type `show c' for details.
|
||||
|
||||
The hypothetical commands `show w' and `show c' should show the appropriate
|
||||
parts of the General Public License. Of course, your program's commands
|
||||
might be different; for a GUI interface, you would use an "about box".
|
||||
|
||||
You should also get your employer (if you work as a programmer) or school,
|
||||
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
||||
For more information on this, and how to apply and follow the GNU GPL, see
|
||||
<http://www.gnu.org/licenses/>.
|
||||
|
||||
The GNU General Public License does not permit incorporating your program
|
||||
into proprietary programs. If your program is a subroutine library, you
|
||||
may consider it more useful to permit linking proprietary applications with
|
||||
the library. If this is what you want to do, use the GNU Lesser General
|
||||
Public License instead of this License. But first, please read
|
||||
<http://www.gnu.org/philosophy/why-not-lgpl.html>.
|
||||
34
src/TwofishCipher/Properties/AssemblyInfo.cs
Normal file
34
src/TwofishCipher/Properties/AssemblyInfo.cs
Normal file
@ -0,0 +1,34 @@
|
||||
using System.Reflection;
|
||||
using System.Runtime.CompilerServices;
|
||||
using System.Runtime.InteropServices;
|
||||
using Android.App;
|
||||
|
||||
// General Information about an assembly is controlled through the following
|
||||
// set of attributes. Change these attribute values to modify the information
|
||||
// associated with an assembly.
|
||||
[assembly: AssemblyTitle("TwofishCipher")]
|
||||
[assembly: AssemblyDescription("")]
|
||||
[assembly: AssemblyConfiguration("")]
|
||||
[assembly: AssemblyCompany("")]
|
||||
[assembly: AssemblyProduct("TwofishCipher")]
|
||||
[assembly: AssemblyCopyright("Copyright © 2013")]
|
||||
[assembly: AssemblyTrademark("")]
|
||||
[assembly: AssemblyCulture("")]
|
||||
[assembly: ComVisible(false)]
|
||||
|
||||
// Version information for an assembly consists of the following four values:
|
||||
//
|
||||
// Major Version
|
||||
// Minor Version
|
||||
// Build Number
|
||||
// Revision
|
||||
//
|
||||
// You can specify all the values or you can default the Build and Revision Numbers
|
||||
// by using the '*' as shown below:
|
||||
// [assembly: AssemblyVersion("1.0.*")]
|
||||
[assembly: AssemblyVersion("1.0.0.0")]
|
||||
[assembly: AssemblyFileVersion("1.0.0.0")]
|
||||
|
||||
// Add some common permissions, these can be removed if not needed
|
||||
[assembly: UsesPermission(Android.Manifest.Permission.Internet)]
|
||||
[assembly: UsesPermission(Android.Manifest.Permission.WriteExternalStorage)]
|
||||
21
src/TwofishCipher/Readme.txt
Normal file
21
src/TwofishCipher/Readme.txt
Normal file
@ -0,0 +1,21 @@
|
||||
Twofish Cipher for KeePass Password Safe
|
||||
Copyright (C) 2009-2010 SEG Tech <me@gogogadgetscott.info>
|
||||
|
||||
PREFACE
|
||||
|
||||
Enables KeePass to encrypt databases using the Twofish algorithm.
|
||||
|
||||
REQUIREMENTS
|
||||
|
||||
This plugin requires KeePass 2.0x.
|
||||
|
||||
INSTALLATION
|
||||
|
||||
Just copy TwofishCipher.dll to the same directory where KeePass.exe is located
|
||||
and KeePass should automatically recognize and load the plugin.
|
||||
|
||||
CREDITS
|
||||
|
||||
Many thanks to Dominik Reichl for creating KeePass Password Safe, without which,
|
||||
this plugin would not exist. Thanks also goes to Shaun Wilde for C#
|
||||
implementation of the Twofish cipher as posted on The Code Project.
|
||||
50
src/TwofishCipher/Resources/AboutResources.txt
Normal file
50
src/TwofishCipher/Resources/AboutResources.txt
Normal file
@ -0,0 +1,50 @@
|
||||
Images, layout descriptions, binary blobs and string dictionaries can be included
|
||||
in your application as resource files. Various Android APIs are designed to
|
||||
operate on the resource IDs instead of dealing with images, strings or binary blobs
|
||||
directly.
|
||||
|
||||
For example, a sample Android app that contains a user interface layout (main.xml),
|
||||
an internationalization string table (strings.xml) and some icons (drawable-XXX/icon.png)
|
||||
would keep its resources in the "Resources" directory of the application:
|
||||
|
||||
Resources/
|
||||
drawable-hdpi/
|
||||
icon.png
|
||||
|
||||
drawable-ldpi/
|
||||
icon.png
|
||||
|
||||
drawable-mdpi/
|
||||
icon.png
|
||||
|
||||
layout/
|
||||
main.xml
|
||||
|
||||
values/
|
||||
strings.xml
|
||||
|
||||
In order to get the build system to recognize Android resources, set the build action to
|
||||
"AndroidResource". The native Android APIs do not operate directly with filenames, but
|
||||
instead operate on resource IDs. When you compile an Android application that uses resources,
|
||||
the build system will package the resources for distribution and generate a class called
|
||||
"Resource" that contains the tokens for each one of the resources included. For example,
|
||||
for the above Resources layout, this is what the Resource class would expose:
|
||||
|
||||
public class Resource {
|
||||
public class drawable {
|
||||
public const int icon = 0x123;
|
||||
}
|
||||
|
||||
public class layout {
|
||||
public const int main = 0x456;
|
||||
}
|
||||
|
||||
public class strings {
|
||||
public const int first_string = 0xabc;
|
||||
public const int second_string = 0xbcd;
|
||||
}
|
||||
}
|
||||
|
||||
You would then use R.drawable.icon to reference the drawable/icon.png file, or Resource.layout.main
|
||||
to reference the layout/main.xml file, or Resource.strings.first_string to reference the first
|
||||
string in the dictionary file values/strings.xml.
|
||||
4
src/TwofishCipher/Resources/Values/Strings.xml
Normal file
4
src/TwofishCipher/Resources/Values/Strings.xml
Normal file
@ -0,0 +1,4 @@
|
||||
<?xml version="1.0" encoding="utf-8"?>
|
||||
<resources>
|
||||
<string name="ApplicationName">$projectname$</string>
|
||||
</resources>
|
||||
121
src/TwofishCipher/Twofish.cs
Normal file
121
src/TwofishCipher/Twofish.cs
Normal file
@ -0,0 +1,121 @@
|
||||
/*
|
||||
A C# implementation of the Twofish cipher
|
||||
By Shaun Wilde
|
||||
|
||||
An article on integrating a C# implementation of the Twofish cipher into the
|
||||
.NET framework.
|
||||
|
||||
http://www.codeproject.com/KB/recipes/twofish_csharp.aspx
|
||||
|
||||
The Code Project Open License (CPOL) 1.02
|
||||
http://www.codeproject.com/info/cpol10.aspx
|
||||
|
||||
Download a copy of the CPOL.
|
||||
http://www.codeproject.com/info/CPOL.zip
|
||||
*/
|
||||
|
||||
using System;
|
||||
using System.Diagnostics;
|
||||
using System.Security.Cryptography;
|
||||
|
||||
namespace TwofishCipher.Crypto
|
||||
{
|
||||
/// <summary>
|
||||
/// Summary description for Twofish encryption algorithm of which more information can be found at http://www.counterpane.com/twofish.html.
|
||||
/// This is based on the MS cryptographic framework and can therefore be used in place of the RijndaelManaged classes
|
||||
/// provided by MS in System.Security.Cryptography and the other related classes
|
||||
/// </summary>
|
||||
public sealed class Twofish : SymmetricAlgorithm
|
||||
{
|
||||
/// <summary>
|
||||
/// This is the Twofish constructor.
|
||||
/// </summary>
|
||||
public Twofish()
|
||||
{
|
||||
this.LegalKeySizesValue = new KeySizes[]{new KeySizes(128,256,64)}; // this allows us to have 128,192,256 key sizes
|
||||
|
||||
this.LegalBlockSizesValue = new KeySizes[]{new KeySizes(128,128,0)}; // this is in bits - typical of MS - always 16 bytes
|
||||
|
||||
this.BlockSize = 128; // set this to 16 bytes we cannot have any other value
|
||||
this.KeySize = 128; // in bits - this can be changed to 128,192,256
|
||||
|
||||
this.Padding = PaddingMode.Zeros;
|
||||
|
||||
this.Mode = CipherMode.ECB;
|
||||
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Creates an object that supports ICryptoTransform that can be used to encrypt data using the Twofish encryption algorithm.
|
||||
/// </summary>
|
||||
/// <param name="key">A byte array that contains a key. The length of this key should be equal to the KeySize property</param>
|
||||
/// <param name="iv">A byte array that contains an initialization vector. The length of this IV should be equal to the BlockSize property</param>
|
||||
public override ICryptoTransform CreateEncryptor(byte[] key, byte[] iv)
|
||||
{
|
||||
Key = key; // this appears to make a new copy
|
||||
|
||||
if (Mode == CipherMode.CBC)
|
||||
IV = iv;
|
||||
|
||||
return new TwofishEncryption(KeySize, ref KeyValue, ref IVValue, ModeValue, TwofishBase.EncryptionDirection.Encrypting);
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Creates an object that supports ICryptoTransform that can be used to decrypt data using the Twofish encryption algorithm.
|
||||
/// </summary>
|
||||
/// <param name="key">A byte array that contains a key. The length of this key should be equal to the KeySize property</param>
|
||||
/// <param name="iv">A byte array that contains an initialization vector. The length of this IV should be equal to the BlockSize property</param>
|
||||
public override ICryptoTransform CreateDecryptor(byte[] key, byte[] iv)
|
||||
{
|
||||
Key = key;
|
||||
|
||||
if (Mode == CipherMode.CBC)
|
||||
IV = iv;
|
||||
|
||||
return new TwofishEncryption(KeySize, ref KeyValue, ref IVValue, ModeValue, TwofishBase.EncryptionDirection.Decrypting);
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Generates a random initialization Vector (IV).
|
||||
/// </summary>
|
||||
public override void GenerateIV()
|
||||
{
|
||||
IV = new byte[16]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Generates a random Key. This is only really useful in testing scenarios.
|
||||
/// </summary>
|
||||
public override void GenerateKey()
|
||||
{
|
||||
Key = new byte[KeySize/8];
|
||||
|
||||
// set the array to all 0 - implement a random key generation mechanism later probably based on PRNG
|
||||
for (int i=Key.GetLowerBound(0);i<Key.GetUpperBound(0);i++)
|
||||
{
|
||||
Key[i]=0;
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Override the Set method on this property so that we only support CBC and EBC
|
||||
/// </summary>
|
||||
public override CipherMode Mode
|
||||
{
|
||||
set
|
||||
{
|
||||
switch (value)
|
||||
{
|
||||
case CipherMode.CBC:
|
||||
break;
|
||||
case CipherMode.ECB:
|
||||
break;
|
||||
default:
|
||||
throw (new CryptographicException("Specified CipherMode is not supported."));
|
||||
}
|
||||
this.ModeValue = value;
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
}
|
||||
641
src/TwofishCipher/TwofishBase.cs
Normal file
641
src/TwofishCipher/TwofishBase.cs
Normal file
@ -0,0 +1,641 @@
|
||||
/*
|
||||
A C# implementation of the Twofish cipher
|
||||
By Shaun Wilde
|
||||
|
||||
An article on integrating a C# implementation of the Twofish cipher into the
|
||||
.NET framework.
|
||||
|
||||
http://www.codeproject.com/KB/recipes/twofish_csharp.aspx
|
||||
|
||||
The Code Project Open License (CPOL) 1.02
|
||||
http://www.codeproject.com/info/cpol10.aspx
|
||||
|
||||
Download a copy of the CPOL.
|
||||
http://www.codeproject.com/info/CPOL.zip
|
||||
*/
|
||||
|
||||
//#define FEISTEL
|
||||
|
||||
using System;
|
||||
using System.Diagnostics;
|
||||
using System.Security.Cryptography;
|
||||
|
||||
namespace TwofishCipher.Crypto
|
||||
{
|
||||
|
||||
/// <summary>
|
||||
/// Summary description for TwofishBase.
|
||||
/// </summary>
|
||||
internal class TwofishBase
|
||||
{
|
||||
public enum EncryptionDirection
|
||||
{
|
||||
Encrypting,
|
||||
Decrypting
|
||||
}
|
||||
|
||||
public TwofishBase()
|
||||
{
|
||||
}
|
||||
|
||||
protected int inputBlockSize = BLOCK_SIZE/8;
|
||||
protected int outputBlockSize = BLOCK_SIZE/8;
|
||||
|
||||
/*
|
||||
+*****************************************************************************
|
||||
*
|
||||
* Function Name: f32
|
||||
*
|
||||
* Function: Run four bytes through keyed S-boxes and apply MDS matrix
|
||||
*
|
||||
* Arguments: x = input to f function
|
||||
* k32 = pointer to key dwords
|
||||
* keyLen = total key length (k32 --> keyLey/2 bits)
|
||||
*
|
||||
* Return: The output of the keyed permutation applied to x.
|
||||
*
|
||||
* Notes:
|
||||
* This function is a keyed 32-bit permutation. It is the major building
|
||||
* block for the Twofish round function, including the four keyed 8x8
|
||||
* permutations and the 4x4 MDS matrix multiply. This function is used
|
||||
* both for generating round subkeys and within the round function on the
|
||||
* block being encrypted.
|
||||
*
|
||||
* This version is fairly slow and pedagogical, although a smartcard would
|
||||
* probably perform the operation exactly this way in firmware. For
|
||||
* ultimate performance, the entire operation can be completed with four
|
||||
* lookups into four 256x32-bit tables, with three dword xors.
|
||||
*
|
||||
* The MDS matrix is defined in TABLE.H. To multiply by Mij, just use the
|
||||
* macro Mij(x).
|
||||
*
|
||||
-****************************************************************************/
|
||||
private static uint f32(uint x,ref uint[] k32,int keyLen)
|
||||
{
|
||||
byte[] b = {b0(x),b1(x),b2(x),b3(x)};
|
||||
|
||||
/* Run each byte thru 8x8 S-boxes, xoring with key byte at each stage. */
|
||||
/* Note that each byte goes through a different combination of S-boxes.*/
|
||||
|
||||
//*((DWORD *)b) = Bswap(x); /* make b[0] = LSB, b[3] = MSB */
|
||||
switch (((keyLen + 63)/64) & 3)
|
||||
{
|
||||
case 0: /* 256 bits of key */
|
||||
b[0] = (byte)(P8x8[P_04,b[0]] ^ b0(k32[3]));
|
||||
b[1] = (byte)(P8x8[P_14,b[1]] ^ b1(k32[3]));
|
||||
b[2] = (byte)(P8x8[P_24,b[2]] ^ b2(k32[3]));
|
||||
b[3] = (byte)(P8x8[P_34,b[3]] ^ b3(k32[3]));
|
||||
/* fall thru, having pre-processed b[0]..b[3] with k32[3] */
|
||||
goto case 3;
|
||||
case 3: /* 192 bits of key */
|
||||
b[0] = (byte)(P8x8[P_03,b[0]] ^ b0(k32[2]));
|
||||
b[1] = (byte)(P8x8[P_13,b[1]] ^ b1(k32[2]));
|
||||
b[2] = (byte)(P8x8[P_23,b[2]] ^ b2(k32[2]));
|
||||
b[3] = (byte)(P8x8[P_33,b[3]] ^ b3(k32[2]));
|
||||
/* fall thru, having pre-processed b[0]..b[3] with k32[2] */
|
||||
goto case 2;
|
||||
case 2: /* 128 bits of key */
|
||||
b[0] = P8x8[P_00, P8x8[P_01, P8x8[P_02, b[0]] ^ b0(k32[1])] ^ b0(k32[0])];
|
||||
b[1] = P8x8[P_10, P8x8[P_11, P8x8[P_12, b[1]] ^ b1(k32[1])] ^ b1(k32[0])];
|
||||
b[2] = P8x8[P_20, P8x8[P_21, P8x8[P_22, b[2]] ^ b2(k32[1])] ^ b2(k32[0])];
|
||||
b[3] = P8x8[P_30, P8x8[P_31, P8x8[P_32, b[3]] ^ b3(k32[1])] ^ b3(k32[0])];
|
||||
break;
|
||||
}
|
||||
|
||||
|
||||
/* Now perform the MDS matrix multiply inline. */
|
||||
return (uint)((M00(b[0]) ^ M01(b[1]) ^ M02(b[2]) ^ M03(b[3]))) ^
|
||||
(uint)((M10(b[0]) ^ M11(b[1]) ^ M12(b[2]) ^ M13(b[3])) << 8) ^
|
||||
(uint)((M20(b[0]) ^ M21(b[1]) ^ M22(b[2]) ^ M23(b[3])) << 16) ^
|
||||
(uint)((M30(b[0]) ^ M31(b[1]) ^ M32(b[2]) ^ M33(b[3])) << 24) ;
|
||||
}
|
||||
|
||||
/*
|
||||
+*****************************************************************************
|
||||
*
|
||||
* Function Name: reKey
|
||||
*
|
||||
* Function: Initialize the Twofish key schedule from key32
|
||||
*
|
||||
* Arguments: key = ptr to keyInstance to be initialized
|
||||
*
|
||||
* Return: TRUE on success
|
||||
*
|
||||
* Notes:
|
||||
* Here we precompute all the round subkeys, although that is not actually
|
||||
* required. For example, on a smartcard, the round subkeys can
|
||||
* be generated on-the-fly using f32()
|
||||
*
|
||||
-****************************************************************************/
|
||||
protected bool reKey(int keyLen, ref uint[] key32)
|
||||
{
|
||||
int i,k64Cnt;
|
||||
keyLength = keyLen;
|
||||
rounds = numRounds[(keyLen-1)/64];
|
||||
int subkeyCnt = ROUND_SUBKEYS + 2*rounds;
|
||||
uint A,B;
|
||||
uint[] k32e = new uint[MAX_KEY_BITS/64];
|
||||
uint[] k32o = new uint[MAX_KEY_BITS/64]; /* even/odd key dwords */
|
||||
|
||||
k64Cnt=(keyLen+63)/64; /* round up to next multiple of 64 bits */
|
||||
for (i=0;i<k64Cnt;i++)
|
||||
{ /* split into even/odd key dwords */
|
||||
k32e[i]=key32[2*i ];
|
||||
k32o[i]=key32[2*i+1];
|
||||
/* compute S-box keys using (12,8) Reed-Solomon code over GF(256) */
|
||||
sboxKeys[k64Cnt-1-i]=RS_MDS_Encode(k32e[i],k32o[i]); /* reverse order */
|
||||
}
|
||||
|
||||
for (i=0;i<subkeyCnt/2;i++) /* compute round subkeys for PHT */
|
||||
{
|
||||
A = f32((uint)(i*SK_STEP) ,ref k32e, keyLen); /* A uses even key dwords */
|
||||
B = f32((uint)(i*SK_STEP+SK_BUMP),ref k32o, keyLen); /* B uses odd key dwords */
|
||||
B = ROL(B,8);
|
||||
subKeys[2*i ] = A+ B; /* combine with a PHT */
|
||||
subKeys[2*i+1] = ROL(A+2*B,SK_ROTL);
|
||||
}
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
protected void blockDecrypt(ref uint[] x)
|
||||
{
|
||||
uint t0,t1;
|
||||
uint[] xtemp = new uint[4];
|
||||
|
||||
if (cipherMode == CipherMode.CBC)
|
||||
{
|
||||
x.CopyTo(xtemp,0);
|
||||
}
|
||||
|
||||
for (int i=0;i<BLOCK_SIZE/32;i++) /* copy in the block, add whitening */
|
||||
x[i] ^= subKeys[OUTPUT_WHITEN+i];
|
||||
|
||||
for (int r=rounds-1;r>=0;r--) /* main Twofish decryption loop */
|
||||
{
|
||||
t0 = f32( x[0] ,ref sboxKeys,keyLength);
|
||||
t1 = f32(ROL(x[1],8),ref sboxKeys,keyLength);
|
||||
|
||||
x[2] = ROL(x[2],1);
|
||||
x[2]^= t0 + t1 + subKeys[ROUND_SUBKEYS+2*r ]; /* PHT, round keys */
|
||||
x[3]^= t0 + 2*t1 + subKeys[ROUND_SUBKEYS+2*r+1];
|
||||
x[3] = ROR(x[3],1);
|
||||
|
||||
if (r>0) /* unswap, except for last round */
|
||||
{
|
||||
t0 = x[0]; x[0]= x[2]; x[2] = t0;
|
||||
t1 = x[1]; x[1]= x[3]; x[3] = t1;
|
||||
}
|
||||
}
|
||||
|
||||
for (int i=0;i<BLOCK_SIZE/32;i++) /* copy out, with whitening */
|
||||
{
|
||||
x[i] ^= subKeys[INPUT_WHITEN+i];
|
||||
if (cipherMode == CipherMode.CBC)
|
||||
{
|
||||
x[i] ^= IV[i];
|
||||
IV[i] = xtemp[i];
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
protected void blockEncrypt(ref uint[] x)
|
||||
{
|
||||
uint t0,t1,tmp;
|
||||
|
||||
for (int i=0;i<BLOCK_SIZE/32;i++) /* copy in the block, add whitening */
|
||||
{
|
||||
x[i] ^= subKeys[INPUT_WHITEN+i];
|
||||
if (cipherMode == CipherMode.CBC)
|
||||
x[i] ^= IV[i];
|
||||
}
|
||||
|
||||
for (int r=0;r<rounds;r++) /* main Twofish encryption loop */ // 16==rounds
|
||||
{
|
||||
#if FEISTEL
|
||||
t0 = f32(ROR(x[0], (r+1)/2),ref sboxKeys,keyLength);
|
||||
t1 = f32(ROL(x[1],8+(r+1)/2),ref sboxKeys,keyLength);
|
||||
/* PHT, round keys */
|
||||
x[2]^= ROL(t0 + t1 + subKeys[ROUND_SUBKEYS+2*r ], r /2);
|
||||
x[3]^= ROR(t0 + 2*t1 + subKeys[ROUND_SUBKEYS+2*r+1],(r+2) /2);
|
||||
|
||||
#else
|
||||
t0 = f32( x[0] ,ref sboxKeys,keyLength);
|
||||
t1 = f32(ROL(x[1],8),ref sboxKeys,keyLength);
|
||||
|
||||
x[3] = ROL(x[3],1);
|
||||
x[2]^= t0 + t1 + subKeys[ROUND_SUBKEYS+2*r ]; /* PHT, round keys */
|
||||
x[3]^= t0 + 2*t1 + subKeys[ROUND_SUBKEYS+2*r+1];
|
||||
x[2] = ROR(x[2],1);
|
||||
|
||||
#endif
|
||||
if (r < rounds-1) /* swap for next round */
|
||||
{
|
||||
tmp = x[0]; x[0]= x[2]; x[2] = tmp;
|
||||
tmp = x[1]; x[1]= x[3]; x[3] = tmp;
|
||||
}
|
||||
}
|
||||
#if FEISTEL
|
||||
x[0] = ROR(x[0],8); /* "final permutation" */
|
||||
x[1] = ROL(x[1],8);
|
||||
x[2] = ROR(x[2],8);
|
||||
x[3] = ROL(x[3],8);
|
||||
#endif
|
||||
for (int i=0;i<BLOCK_SIZE/32;i++) /* copy out, with whitening */
|
||||
{
|
||||
x[i] ^= subKeys[OUTPUT_WHITEN+i];
|
||||
if (cipherMode == CipherMode.CBC)
|
||||
{
|
||||
IV[i] = x[i];
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
private int[] numRounds = {0,ROUNDS_128,ROUNDS_192,ROUNDS_256};
|
||||
|
||||
/*
|
||||
+*****************************************************************************
|
||||
*
|
||||
* Function Name: RS_MDS_Encode
|
||||
*
|
||||
* Function: Use (12,8) Reed-Solomon code over GF(256) to produce
|
||||
* a key S-box dword from two key material dwords.
|
||||
*
|
||||
* Arguments: k0 = 1st dword
|
||||
* k1 = 2nd dword
|
||||
*
|
||||
* Return: Remainder polynomial generated using RS code
|
||||
*
|
||||
* Notes:
|
||||
* Since this computation is done only once per reKey per 64 bits of key,
|
||||
* the performance impact of this routine is imperceptible. The RS code
|
||||
* chosen has "simple" coefficients to allow smartcard/hardware implementation
|
||||
* without lookup tables.
|
||||
*
|
||||
-****************************************************************************/
|
||||
static private uint RS_MDS_Encode(uint k0,uint k1)
|
||||
{
|
||||
uint i,j;
|
||||
uint r;
|
||||
|
||||
for (i=r=0;i<2;i++)
|
||||
{
|
||||
r ^= (i>0) ? k0 : k1; /* merge in 32 more key bits */
|
||||
for (j=0;j<4;j++) /* shift one byte at a time */
|
||||
RS_rem(ref r);
|
||||
}
|
||||
return r;
|
||||
}
|
||||
|
||||
protected uint[] sboxKeys = new uint[MAX_KEY_BITS/64]; /* key bits used for S-boxes */
|
||||
protected uint[] subKeys = new uint[TOTAL_SUBKEYS]; /* round subkeys, input/output whitening bits */
|
||||
protected uint[] Key = {0,0,0,0,0,0,0,0}; //new int[MAX_KEY_BITS/32];
|
||||
protected uint[] IV = {0,0,0,0}; // this should be one block size
|
||||
private int keyLength;
|
||||
private int rounds;
|
||||
protected CipherMode cipherMode = CipherMode.ECB;
|
||||
|
||||
|
||||
#region These are all the definitions that were found in AES.H
|
||||
static private readonly int BLOCK_SIZE = 128; /* number of bits per block */
|
||||
static private readonly int MAX_ROUNDS = 16; /* max # rounds (for allocating subkey array) */
|
||||
static private readonly int ROUNDS_128 = 16; /* default number of rounds for 128-bit keys*/
|
||||
static private readonly int ROUNDS_192 = 16; /* default number of rounds for 192-bit keys*/
|
||||
static private readonly int ROUNDS_256 = 16; /* default number of rounds for 256-bit keys*/
|
||||
static private readonly int MAX_KEY_BITS = 256; /* max number of bits of key */
|
||||
// static private readonly int MIN_KEY_BITS = 128; /* min number of bits of key (zero pad) */
|
||||
|
||||
//#define VALID_SIG 0x48534946 /* initialization signature ('FISH') */
|
||||
//#define MCT_OUTER 400 /* MCT outer loop */
|
||||
//#define MCT_INNER 10000 /* MCT inner loop */
|
||||
//#define REENTRANT 1 /* nonzero forces reentrant code (slightly slower) */
|
||||
|
||||
static private readonly int INPUT_WHITEN = 0; /* subkey array indices */
|
||||
static private readonly int OUTPUT_WHITEN = (INPUT_WHITEN + BLOCK_SIZE/32);
|
||||
static private readonly int ROUND_SUBKEYS = (OUTPUT_WHITEN + BLOCK_SIZE/32); /* use 2 * (# rounds) */
|
||||
static private readonly int TOTAL_SUBKEYS = (ROUND_SUBKEYS + 2*MAX_ROUNDS);
|
||||
|
||||
|
||||
#endregion
|
||||
|
||||
#region These are all the definitions that were found in TABLE.H that we need
|
||||
/* for computing subkeys */
|
||||
static private readonly uint SK_STEP = 0x02020202u;
|
||||
static private readonly uint SK_BUMP = 0x01010101u;
|
||||
static private readonly int SK_ROTL = 9;
|
||||
|
||||
/* Reed-Solomon code parameters: (12,8) reversible code
|
||||
g(x) = x**4 + (a + 1/a) x**3 + a x**2 + (a + 1/a) x + 1
|
||||
where a = primitive root of field generator 0x14D */
|
||||
static private readonly uint RS_GF_FDBK = 0x14D; /* field generator */
|
||||
static private void RS_rem(ref uint x)
|
||||
{
|
||||
byte b = (byte) (x >> 24);
|
||||
// TODO: maybe change g2 and g3 to bytes
|
||||
uint g2 = (uint)(((b << 1) ^ (((b & 0x80)==0x80) ? RS_GF_FDBK : 0 )) & 0xFF);
|
||||
uint g3 = (uint)(((b >> 1) & 0x7F) ^ (((b & 1)==1) ? RS_GF_FDBK >> 1 : 0 ) ^ g2) ;
|
||||
x = (x << 8) ^ (g3 << 24) ^ (g2 << 16) ^ (g3 << 8) ^ b;
|
||||
}
|
||||
|
||||
/* Macros for the MDS matrix
|
||||
* The MDS matrix is (using primitive polynomial 169):
|
||||
* 01 EF 5B 5B
|
||||
* 5B EF EF 01
|
||||
* EF 5B 01 EF
|
||||
* EF 01 EF 5B
|
||||
*----------------------------------------------------------------
|
||||
* More statistical properties of this matrix (from MDS.EXE output):
|
||||
*
|
||||
* Min Hamming weight (one byte difference) = 8. Max=26. Total = 1020.
|
||||
* Prob[8]: 7 23 42 20 52 95 88 94 121 128 91
|
||||
* 102 76 41 24 8 4 1 3 0 0 0
|
||||
* Runs[8]: 2 4 5 6 7 8 9 11
|
||||
* MSBs[8]: 1 4 15 8 18 38 40 43
|
||||
* HW= 8: 05040705 0A080E0A 14101C14 28203828 50407050 01499101 A080E0A0
|
||||
* HW= 9: 04050707 080A0E0E 10141C1C 20283838 40507070 80A0E0E0 C6432020 07070504
|
||||
* 0E0E0A08 1C1C1410 38382820 70705040 E0E0A080 202043C6 05070407 0A0E080E
|
||||
* 141C101C 28382038 50704070 A0E080E0 4320C620 02924B02 089A4508
|
||||
* Min Hamming weight (two byte difference) = 3. Max=28. Total = 390150.
|
||||
* Prob[3]: 7 18 55 149 270 914 2185 5761 11363 20719 32079
|
||||
* 43492 51612 53851 52098 42015 31117 20854 11538 6223 2492 1033
|
||||
* MDS OK, ROR: 6+ 7+ 8+ 9+ 10+ 11+ 12+ 13+ 14+ 15+ 16+
|
||||
* 17+ 18+ 19+ 20+ 21+ 22+ 23+ 24+ 25+ 26+
|
||||
*/
|
||||
static private readonly int MDS_GF_FDBK = 0x169; /* primitive polynomial for GF(256)*/
|
||||
static private int LFSR1(int x)
|
||||
{
|
||||
return ( ((x) >> 1) ^ ((((x) & 0x01)==0x01) ? MDS_GF_FDBK/2 : 0));
|
||||
}
|
||||
|
||||
static private int LFSR2(int x)
|
||||
{
|
||||
return ( ((x) >> 2) ^ ((((x) & 0x02)==0x02) ? MDS_GF_FDBK/2 : 0) ^
|
||||
((((x) & 0x01)==0x01) ? MDS_GF_FDBK/4 : 0));
|
||||
}
|
||||
|
||||
// TODO: not the most efficient use of code but it allows us to update the code a lot quicker we can possibly optimize this code once we have got it all working
|
||||
static private int Mx_1(int x)
|
||||
{
|
||||
return x; /* force result to int so << will work */
|
||||
}
|
||||
|
||||
static private int Mx_X(int x)
|
||||
{
|
||||
return x ^ LFSR2(x); /* 5B */
|
||||
}
|
||||
|
||||
static private int Mx_Y(int x)
|
||||
{
|
||||
return x ^ LFSR1(x) ^ LFSR2(x); /* EF */
|
||||
}
|
||||
|
||||
static private int M00(int x)
|
||||
{
|
||||
return Mul_1(x);
|
||||
}
|
||||
static private int M01(int x)
|
||||
{
|
||||
return Mul_Y(x);
|
||||
}
|
||||
static private int M02(int x)
|
||||
{
|
||||
return Mul_X(x);
|
||||
}
|
||||
static private int M03(int x)
|
||||
{
|
||||
return Mul_X(x);
|
||||
}
|
||||
|
||||
static private int M10(int x)
|
||||
{
|
||||
return Mul_X(x);
|
||||
}
|
||||
static private int M11(int x)
|
||||
{
|
||||
return Mul_Y(x);
|
||||
}
|
||||
static private int M12(int x)
|
||||
{
|
||||
return Mul_Y(x);
|
||||
}
|
||||
static private int M13(int x)
|
||||
{
|
||||
return Mul_1(x);
|
||||
}
|
||||
|
||||
static private int M20(int x)
|
||||
{
|
||||
return Mul_Y(x);
|
||||
}
|
||||
static private int M21(int x)
|
||||
{
|
||||
return Mul_X(x);
|
||||
}
|
||||
static private int M22(int x)
|
||||
{
|
||||
return Mul_1(x);
|
||||
}
|
||||
static private int M23(int x)
|
||||
{
|
||||
return Mul_Y(x);
|
||||
}
|
||||
|
||||
static private int M30(int x)
|
||||
{
|
||||
return Mul_Y(x);
|
||||
}
|
||||
static private int M31(int x)
|
||||
{
|
||||
return Mul_1(x);
|
||||
}
|
||||
static private int M32(int x)
|
||||
{
|
||||
return Mul_Y(x);
|
||||
}
|
||||
static private int M33(int x)
|
||||
{
|
||||
return Mul_X(x);
|
||||
}
|
||||
|
||||
static private int Mul_1(int x)
|
||||
{
|
||||
return Mx_1(x);
|
||||
}
|
||||
static private int Mul_X(int x)
|
||||
{
|
||||
return Mx_X(x);
|
||||
}
|
||||
static private int Mul_Y(int x)
|
||||
{
|
||||
return Mx_Y(x);
|
||||
}
|
||||
/* Define the fixed p0/p1 permutations used in keyed S-box lookup.
|
||||
By changing the following constant definitions for P_ij, the S-boxes will
|
||||
automatically get changed in all the Twofish source code. Note that P_i0 is
|
||||
the "outermost" 8x8 permutation applied. See the f32() function to see
|
||||
how these constants are to be used.
|
||||
*/
|
||||
static private readonly int P_00 = 1; /* "outermost" permutation */
|
||||
static private readonly int P_01 = 0;
|
||||
static private readonly int P_02 = 0;
|
||||
static private readonly int P_03 = (P_01^1); /* "extend" to larger key sizes */
|
||||
static private readonly int P_04 = 1;
|
||||
|
||||
static private readonly int P_10 = 0;
|
||||
static private readonly int P_11 = 0;
|
||||
static private readonly int P_12 = 1;
|
||||
static private readonly int P_13 = (P_11^1);
|
||||
static private readonly int P_14 = 0;
|
||||
|
||||
static private readonly int P_20 = 1;
|
||||
static private readonly int P_21 = 1;
|
||||
static private readonly int P_22 = 0;
|
||||
static private readonly int P_23 = (P_21^1);
|
||||
static private readonly int P_24 = 0;
|
||||
|
||||
static private readonly int P_30 = 0;
|
||||
static private readonly int P_31 = 1;
|
||||
static private readonly int P_32 = 1;
|
||||
static private readonly int P_33 = (P_31^1);
|
||||
static private readonly int P_34 = 1;
|
||||
|
||||
/* fixed 8x8 permutation S-boxes */
|
||||
|
||||
/***********************************************************************
|
||||
* 07:07:14 05/30/98 [4x4] TestCnt=256. keySize=128. CRC=4BD14D9E.
|
||||
* maxKeyed: dpMax = 18. lpMax =100. fixPt = 8. skXor = 0. skDup = 6.
|
||||
* log2(dpMax[ 6..18])= --- 15.42 1.33 0.89 4.05 7.98 12.05
|
||||
* log2(lpMax[ 7..12])= 9.32 1.01 1.16 4.23 8.02 12.45
|
||||
* log2(fixPt[ 0.. 8])= 1.44 1.44 2.44 4.06 6.01 8.21 11.07 14.09 17.00
|
||||
* log2(skXor[ 0.. 0])
|
||||
* log2(skDup[ 0.. 6])= --- 2.37 0.44 3.94 8.36 13.04 17.99
|
||||
***********************************************************************/
|
||||
static private byte[,] P8x8 =
|
||||
{
|
||||
/* p0: */
|
||||
/* dpMax = 10. lpMax = 64. cycleCnt= 1 1 1 0. */
|
||||
/* 817D6F320B59ECA4.ECB81235F4A6709D.BA5E6D90C8F32471.D7F4126E9B3085CA. */
|
||||
/* Karnaugh maps:
|
||||
* 0111 0001 0011 1010. 0001 1001 1100 1111. 1001 1110 0011 1110. 1101 0101 1111 1001.
|
||||
* 0101 1111 1100 0100. 1011 0101 0010 0000. 0101 1000 1100 0101. 1000 0111 0011 0010.
|
||||
* 0000 1001 1110 1101. 1011 1000 1010 0011. 0011 1001 0101 0000. 0100 0010 0101 1011.
|
||||
* 0111 0100 0001 0110. 1000 1011 1110 1001. 0011 0011 1001 1101. 1101 0101 0000 1100.
|
||||
*/
|
||||
{
|
||||
0xA9, 0x67, 0xB3, 0xE8, 0x04, 0xFD, 0xA3, 0x76,
|
||||
0x9A, 0x92, 0x80, 0x78, 0xE4, 0xDD, 0xD1, 0x38,
|
||||
0x0D, 0xC6, 0x35, 0x98, 0x18, 0xF7, 0xEC, 0x6C,
|
||||
0x43, 0x75, 0x37, 0x26, 0xFA, 0x13, 0x94, 0x48,
|
||||
0xF2, 0xD0, 0x8B, 0x30, 0x84, 0x54, 0xDF, 0x23,
|
||||
0x19, 0x5B, 0x3D, 0x59, 0xF3, 0xAE, 0xA2, 0x82,
|
||||
0x63, 0x01, 0x83, 0x2E, 0xD9, 0x51, 0x9B, 0x7C,
|
||||
0xA6, 0xEB, 0xA5, 0xBE, 0x16, 0x0C, 0xE3, 0x61,
|
||||
0xC0, 0x8C, 0x3A, 0xF5, 0x73, 0x2C, 0x25, 0x0B,
|
||||
0xBB, 0x4E, 0x89, 0x6B, 0x53, 0x6A, 0xB4, 0xF1,
|
||||
0xE1, 0xE6, 0xBD, 0x45, 0xE2, 0xF4, 0xB6, 0x66,
|
||||
0xCC, 0x95, 0x03, 0x56, 0xD4, 0x1C, 0x1E, 0xD7,
|
||||
0xFB, 0xC3, 0x8E, 0xB5, 0xE9, 0xCF, 0xBF, 0xBA,
|
||||
0xEA, 0x77, 0x39, 0xAF, 0x33, 0xC9, 0x62, 0x71,
|
||||
0x81, 0x79, 0x09, 0xAD, 0x24, 0xCD, 0xF9, 0xD8,
|
||||
0xE5, 0xC5, 0xB9, 0x4D, 0x44, 0x08, 0x86, 0xE7,
|
||||
0xA1, 0x1D, 0xAA, 0xED, 0x06, 0x70, 0xB2, 0xD2,
|
||||
0x41, 0x7B, 0xA0, 0x11, 0x31, 0xC2, 0x27, 0x90,
|
||||
0x20, 0xF6, 0x60, 0xFF, 0x96, 0x5C, 0xB1, 0xAB,
|
||||
0x9E, 0x9C, 0x52, 0x1B, 0x5F, 0x93, 0x0A, 0xEF,
|
||||
0x91, 0x85, 0x49, 0xEE, 0x2D, 0x4F, 0x8F, 0x3B,
|
||||
0x47, 0x87, 0x6D, 0x46, 0xD6, 0x3E, 0x69, 0x64,
|
||||
0x2A, 0xCE, 0xCB, 0x2F, 0xFC, 0x97, 0x05, 0x7A,
|
||||
0xAC, 0x7F, 0xD5, 0x1A, 0x4B, 0x0E, 0xA7, 0x5A,
|
||||
0x28, 0x14, 0x3F, 0x29, 0x88, 0x3C, 0x4C, 0x02,
|
||||
0xB8, 0xDA, 0xB0, 0x17, 0x55, 0x1F, 0x8A, 0x7D,
|
||||
0x57, 0xC7, 0x8D, 0x74, 0xB7, 0xC4, 0x9F, 0x72,
|
||||
0x7E, 0x15, 0x22, 0x12, 0x58, 0x07, 0x99, 0x34,
|
||||
0x6E, 0x50, 0xDE, 0x68, 0x65, 0xBC, 0xDB, 0xF8,
|
||||
0xC8, 0xA8, 0x2B, 0x40, 0xDC, 0xFE, 0x32, 0xA4,
|
||||
0xCA, 0x10, 0x21, 0xF0, 0xD3, 0x5D, 0x0F, 0x00,
|
||||
0x6F, 0x9D, 0x36, 0x42, 0x4A, 0x5E, 0xC1, 0xE0
|
||||
},
|
||||
/* p1: */
|
||||
/* dpMax = 10. lpMax = 64. cycleCnt= 2 0 0 1. */
|
||||
/* 28BDF76E31940AC5.1E2B4C376DA5F908.4C75169A0ED82B3F.B951C3DE647F208A. */
|
||||
/* Karnaugh maps:
|
||||
* 0011 1001 0010 0111. 1010 0111 0100 0110. 0011 0001 1111 0100. 1111 1000 0001 1100.
|
||||
* 1100 1111 1111 1010. 0011 0011 1110 0100. 1001 0110 0100 0011. 0101 0110 1011 1011.
|
||||
* 0010 0100 0011 0101. 1100 1000 1000 1110. 0111 1111 0010 0110. 0000 1010 0000 0011.
|
||||
* 1101 1000 0010 0001. 0110 1001 1110 0101. 0001 0100 0101 0111. 0011 1011 1111 0010.
|
||||
*/
|
||||
{
|
||||
0x75, 0xF3, 0xC6, 0xF4, 0xDB, 0x7B, 0xFB, 0xC8,
|
||||
0x4A, 0xD3, 0xE6, 0x6B, 0x45, 0x7D, 0xE8, 0x4B,
|
||||
0xD6, 0x32, 0xD8, 0xFD, 0x37, 0x71, 0xF1, 0xE1,
|
||||
0x30, 0x0F, 0xF8, 0x1B, 0x87, 0xFA, 0x06, 0x3F,
|
||||
0x5E, 0xBA, 0xAE, 0x5B, 0x8A, 0x00, 0xBC, 0x9D,
|
||||
0x6D, 0xC1, 0xB1, 0x0E, 0x80, 0x5D, 0xD2, 0xD5,
|
||||
0xA0, 0x84, 0x07, 0x14, 0xB5, 0x90, 0x2C, 0xA3,
|
||||
0xB2, 0x73, 0x4C, 0x54, 0x92, 0x74, 0x36, 0x51,
|
||||
0x38, 0xB0, 0xBD, 0x5A, 0xFC, 0x60, 0x62, 0x96,
|
||||
0x6C, 0x42, 0xF7, 0x10, 0x7C, 0x28, 0x27, 0x8C,
|
||||
0x13, 0x95, 0x9C, 0xC7, 0x24, 0x46, 0x3B, 0x70,
|
||||
0xCA, 0xE3, 0x85, 0xCB, 0x11, 0xD0, 0x93, 0xB8,
|
||||
0xA6, 0x83, 0x20, 0xFF, 0x9F, 0x77, 0xC3, 0xCC,
|
||||
0x03, 0x6F, 0x08, 0xBF, 0x40, 0xE7, 0x2B, 0xE2,
|
||||
0x79, 0x0C, 0xAA, 0x82, 0x41, 0x3A, 0xEA, 0xB9,
|
||||
0xE4, 0x9A, 0xA4, 0x97, 0x7E, 0xDA, 0x7A, 0x17,
|
||||
0x66, 0x94, 0xA1, 0x1D, 0x3D, 0xF0, 0xDE, 0xB3,
|
||||
0x0B, 0x72, 0xA7, 0x1C, 0xEF, 0xD1, 0x53, 0x3E,
|
||||
0x8F, 0x33, 0x26, 0x5F, 0xEC, 0x76, 0x2A, 0x49,
|
||||
0x81, 0x88, 0xEE, 0x21, 0xC4, 0x1A, 0xEB, 0xD9,
|
||||
0xC5, 0x39, 0x99, 0xCD, 0xAD, 0x31, 0x8B, 0x01,
|
||||
0x18, 0x23, 0xDD, 0x1F, 0x4E, 0x2D, 0xF9, 0x48,
|
||||
0x4F, 0xF2, 0x65, 0x8E, 0x78, 0x5C, 0x58, 0x19,
|
||||
0x8D, 0xE5, 0x98, 0x57, 0x67, 0x7F, 0x05, 0x64,
|
||||
0xAF, 0x63, 0xB6, 0xFE, 0xF5, 0xB7, 0x3C, 0xA5,
|
||||
0xCE, 0xE9, 0x68, 0x44, 0xE0, 0x4D, 0x43, 0x69,
|
||||
0x29, 0x2E, 0xAC, 0x15, 0x59, 0xA8, 0x0A, 0x9E,
|
||||
0x6E, 0x47, 0xDF, 0x34, 0x35, 0x6A, 0xCF, 0xDC,
|
||||
0x22, 0xC9, 0xC0, 0x9B, 0x89, 0xD4, 0xED, 0xAB,
|
||||
0x12, 0xA2, 0x0D, 0x52, 0xBB, 0x02, 0x2F, 0xA9,
|
||||
0xD7, 0x61, 0x1E, 0xB4, 0x50, 0x04, 0xF6, 0xC2,
|
||||
0x16, 0x25, 0x86, 0x56, 0x55, 0x09, 0xBE, 0x91
|
||||
}
|
||||
};
|
||||
#endregion
|
||||
|
||||
#region These are all the definitions that were found in PLATFORM.H that we need
|
||||
// left rotation
|
||||
private static uint ROL(uint x, int n)
|
||||
{
|
||||
return ( ((x) << ((n) & 0x1F)) | (x) >> (32-((n) & 0x1F)) );
|
||||
}
|
||||
|
||||
// right rotation
|
||||
private static uint ROR(uint x,int n)
|
||||
{
|
||||
return (((x) >> ((n) & 0x1F)) | ((x) << (32-((n) & 0x1F))));
|
||||
}
|
||||
|
||||
// first byte
|
||||
protected static byte b0(uint x)
|
||||
{
|
||||
return (byte)(x );//& 0xFF);
|
||||
}
|
||||
// second byte
|
||||
protected static byte b1(uint x)
|
||||
{
|
||||
return (byte)((x >> 8));// & (0xFF));
|
||||
}
|
||||
// third byte
|
||||
protected static byte b2(uint x)
|
||||
{
|
||||
return (byte)((x >> 16));// & (0xFF));
|
||||
}
|
||||
// fourth byte
|
||||
protected static byte b3(uint x)
|
||||
{
|
||||
return (byte)((x >> 24));// & (0xFF));
|
||||
}
|
||||
|
||||
#endregion
|
||||
}
|
||||
}
|
||||
71
src/TwofishCipher/TwofishCipher.csproj
Normal file
71
src/TwofishCipher/TwofishCipher.csproj
Normal file
@ -0,0 +1,71 @@
|
||||
<?xml version="1.0" encoding="utf-8"?>
|
||||
<Project ToolsVersion="4.0" DefaultTargets="Build" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
|
||||
<PropertyGroup>
|
||||
<Configuration Condition=" '$(Configuration)' == '' ">Debug</Configuration>
|
||||
<Platform Condition=" '$(Platform)' == '' ">AnyCPU</Platform>
|
||||
<ProductVersion>8.0.30703</ProductVersion>
|
||||
<SchemaVersion>2.0</SchemaVersion>
|
||||
<ProjectGuid>{5CF675A5-9BEE-4720-BED9-D5BF14A2EBF9}</ProjectGuid>
|
||||
<ProjectTypeGuids>{EFBA0AD7-5A72-4C68-AF49-83D382785DCF};{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}</ProjectTypeGuids>
|
||||
<OutputType>Library</OutputType>
|
||||
<AppDesignerFolder>Properties</AppDesignerFolder>
|
||||
<RootNamespace>TwofishCipher</RootNamespace>
|
||||
<AssemblyName>TwofishCipher</AssemblyName>
|
||||
<FileAlignment>512</FileAlignment>
|
||||
<AndroidResgenFile>Resources\Resource.Designer.cs</AndroidResgenFile>
|
||||
<GenerateSerializationAssemblies>Off</GenerateSerializationAssemblies>
|
||||
</PropertyGroup>
|
||||
<PropertyGroup Condition=" '$(Configuration)|$(Platform)' == 'Debug|AnyCPU' ">
|
||||
<DebugSymbols>true</DebugSymbols>
|
||||
<DebugType>full</DebugType>
|
||||
<Optimize>false</Optimize>
|
||||
<OutputPath>bin\Debug\</OutputPath>
|
||||
<DefineConstants>DEBUG;TRACE</DefineConstants>
|
||||
<ErrorReport>prompt</ErrorReport>
|
||||
<WarningLevel>4</WarningLevel>
|
||||
</PropertyGroup>
|
||||
<PropertyGroup Condition=" '$(Configuration)|$(Platform)' == 'Release|AnyCPU' ">
|
||||
<DebugType>pdbonly</DebugType>
|
||||
<Optimize>true</Optimize>
|
||||
<OutputPath>bin\Release\</OutputPath>
|
||||
<DefineConstants>TRACE</DefineConstants>
|
||||
<ErrorReport>prompt</ErrorReport>
|
||||
<WarningLevel>4</WarningLevel>
|
||||
</PropertyGroup>
|
||||
<ItemGroup>
|
||||
<Reference Include="Mono.Android" />
|
||||
<Reference Include="mscorlib" />
|
||||
<Reference Include="System" />
|
||||
<Reference Include="System.Core" />
|
||||
<Reference Include="System.Xml.Linq" />
|
||||
<Reference Include="System.Xml" />
|
||||
</ItemGroup>
|
||||
<ItemGroup>
|
||||
<Compile Include="Resources\Resource.Designer.cs" />
|
||||
<Compile Include="Properties\AssemblyInfo.cs" />
|
||||
<Compile Include="Twofish.cs" />
|
||||
<Compile Include="TwofishBase.cs" />
|
||||
<Compile Include="TwofishCipherEngine.cs" />
|
||||
<Compile Include="TwofishEncryption.cs" />
|
||||
</ItemGroup>
|
||||
<ItemGroup>
|
||||
<None Include="Resources\AboutResources.txt" />
|
||||
</ItemGroup>
|
||||
<ItemGroup>
|
||||
<AndroidResource Include="Resources\Values\Strings.xml" />
|
||||
</ItemGroup>
|
||||
<ItemGroup>
|
||||
<ProjectReference Include="..\KeePassLib2Android\KeePassLib2Android.csproj">
|
||||
<Project>{545b4a6b-8bba-4fbe-92fc-4ac060122a54}</Project>
|
||||
<Name>KeePassLib2Android</Name>
|
||||
</ProjectReference>
|
||||
</ItemGroup>
|
||||
<Import Project="$(MSBuildExtensionsPath)\Xamarin\Android\Xamarin.Android.CSharp.targets" />
|
||||
<!-- To modify your build process, add your task inside one of the targets below and uncomment it.
|
||||
Other similar extension points exist, see Microsoft.Common.targets.
|
||||
<Target Name="BeforeBuild">
|
||||
</Target>
|
||||
<Target Name="AfterBuild">
|
||||
</Target>
|
||||
-->
|
||||
</Project>
|
||||
127
src/TwofishCipher/TwofishCipherEngine.cs
Normal file
127
src/TwofishCipher/TwofishCipherEngine.cs
Normal file
@ -0,0 +1,127 @@
|
||||
/*
|
||||
Twofish Cipher for KeePass Password Safe
|
||||
Copyright (C) 2009-2010 SEG Tech <me@gogogadgetscott.info>
|
||||
|
||||
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
|
||||
the Free Software Foundation; either version 2 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program; if not, write to the Free Software
|
||||
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
using System;
|
||||
using System.Collections.Generic;
|
||||
using System.Text;
|
||||
using System.IO;
|
||||
using System.Security;
|
||||
using System.Security.Cryptography;
|
||||
using System.Diagnostics;
|
||||
|
||||
using KeePassLib;
|
||||
using KeePassLib.Cryptography.Cipher;
|
||||
|
||||
using TwofishCipher.Crypto;
|
||||
|
||||
namespace TwofishCipher
|
||||
{
|
||||
public sealed class TwofishCipherEngine : ICipherEngine
|
||||
{
|
||||
private const CipherMode m_rCipherMode = CipherMode.CBC;
|
||||
private const PaddingMode m_rCipherPadding = PaddingMode.PKCS7;
|
||||
|
||||
private PwUuid m_uuidCipher;
|
||||
|
||||
private static readonly byte[] TwofishCipherUuidBytes = new byte[]{
|
||||
0xAD, 0x68, 0xF2, 0x9F, 0x57, 0x6F, 0x4B, 0xB9,
|
||||
0xA3, 0x6A, 0xD4, 0x7A, 0xF9, 0x65, 0x34, 0x6C
|
||||
};
|
||||
|
||||
public TwofishCipherEngine()
|
||||
{
|
||||
m_uuidCipher = new PwUuid(TwofishCipherUuidBytes);
|
||||
}
|
||||
|
||||
public PwUuid CipherUuid
|
||||
{
|
||||
get
|
||||
{
|
||||
Debug.Assert(m_uuidCipher != null);
|
||||
return m_uuidCipher;
|
||||
}
|
||||
}
|
||||
|
||||
public string DisplayName
|
||||
{
|
||||
get { return "Twofish (256-Bit Key)"; }
|
||||
}
|
||||
|
||||
private static void ValidateArguments(Stream stream, bool bEncrypt, byte[] pbKey, byte[] pbIV)
|
||||
{
|
||||
Debug.Assert(stream != null); if(stream == null) throw new ArgumentNullException("stream");
|
||||
|
||||
Debug.Assert(pbKey != null); if(pbKey == null) throw new ArgumentNullException("pbKey");
|
||||
Debug.Assert(pbKey.Length == 32);
|
||||
if(pbKey.Length != 32) throw new ArgumentException("Key must be 256 bits wide!");
|
||||
|
||||
Debug.Assert(pbIV != null); if(pbIV == null) throw new ArgumentNullException("pbIV");
|
||||
Debug.Assert(pbIV.Length == 16);
|
||||
if(pbIV.Length != 16) throw new ArgumentException("Initialization vector must be 128 bits wide!");
|
||||
|
||||
if(bEncrypt)
|
||||
{
|
||||
Debug.Assert(stream.CanWrite);
|
||||
if(stream.CanWrite == false) throw new ArgumentException("Stream must be writable!");
|
||||
}
|
||||
else // Decrypt
|
||||
{
|
||||
Debug.Assert(stream.CanRead);
|
||||
if(stream.CanRead == false) throw new ArgumentException("Encrypted stream must be readable!");
|
||||
}
|
||||
}
|
||||
|
||||
private static Stream CreateStream(Stream s, bool bEncrypt, byte[] pbKey, byte[] pbIV)
|
||||
{
|
||||
ValidateArguments(s, bEncrypt, pbKey, pbIV);
|
||||
|
||||
Twofish f = new Twofish();
|
||||
|
||||
byte[] pbLocalIV = new byte[16];
|
||||
Array.Copy(pbIV, pbLocalIV, 16);
|
||||
f.IV = pbLocalIV;
|
||||
|
||||
byte[] pbLocalKey = new byte[32];
|
||||
Array.Copy(pbKey, pbLocalKey, 32);
|
||||
f.KeySize = 256;
|
||||
f.Key = pbLocalKey;
|
||||
|
||||
f.Mode = m_rCipherMode;
|
||||
f.Padding = m_rCipherPadding;
|
||||
|
||||
ICryptoTransform iTransform = (bEncrypt ? f.CreateEncryptor() : f.CreateDecryptor());
|
||||
Debug.Assert(iTransform != null);
|
||||
if(iTransform == null) throw new SecurityException("Unable to create Twofish transform!");
|
||||
|
||||
return new CryptoStream(s, iTransform, bEncrypt ? CryptoStreamMode.Write :
|
||||
CryptoStreamMode.Read);
|
||||
}
|
||||
|
||||
public Stream EncryptStream(Stream sPlainText, byte[] pbKey, byte[] pbIV)
|
||||
{
|
||||
return CreateStream(sPlainText, true, pbKey, pbIV);
|
||||
}
|
||||
|
||||
public Stream DecryptStream(Stream sEncrypted, byte[] pbKey, byte[] pbIV)
|
||||
{
|
||||
return CreateStream(sEncrypted, false, pbKey, pbIV);
|
||||
}
|
||||
|
||||
}
|
||||
}
|
||||
193
src/TwofishCipher/TwofishEncryption.cs
Normal file
193
src/TwofishCipher/TwofishEncryption.cs
Normal file
@ -0,0 +1,193 @@
|
||||
/*
|
||||
A C# implementation of the Twofish cipher
|
||||
By Shaun Wilde
|
||||
|
||||
An article on integrating a C# implementation of the Twofish cipher into the
|
||||
.NET framework.
|
||||
|
||||
http://www.codeproject.com/KB/recipes/twofish_csharp.aspx
|
||||
|
||||
The Code Project Open License (CPOL) 1.02
|
||||
http://www.codeproject.com/info/cpol10.aspx
|
||||
|
||||
Download a copy of the CPOL.
|
||||
http://www.codeproject.com/info/CPOL.zip
|
||||
*/
|
||||
|
||||
using System;
|
||||
using System.Diagnostics;
|
||||
using System.Security.Cryptography;
|
||||
|
||||
namespace TwofishCipher.Crypto
|
||||
{
|
||||
/// <summary>
|
||||
/// Summary description for TwofishEncryption.
|
||||
/// </summary>
|
||||
internal class TwofishEncryption : TwofishBase, ICryptoTransform
|
||||
{
|
||||
public TwofishEncryption(int keyLen, ref byte[] key, ref byte[] iv, CipherMode cMode, EncryptionDirection direction)
|
||||
{
|
||||
// convert our key into an array of ints
|
||||
for (int i=0;i<key.Length/4;i++)
|
||||
{
|
||||
Key[i] = (uint)( key[i*4+3]<<24) | (uint)(key[i*4+2] << 16) | (uint)(key[i*4+1] << 8) | (uint)(key[i*4+0]);
|
||||
}
|
||||
|
||||
cipherMode = cMode;
|
||||
|
||||
// we only need to convert our IV if we are using CBC
|
||||
if (cipherMode == CipherMode.CBC)
|
||||
{
|
||||
for (int i=0;i<4;i++)
|
||||
{
|
||||
IV[i] = (uint)( iv[i*4+3]<<24) | (uint)(iv[i*4+2] << 16) | (uint)(iv[i*4+1] << 8) | (uint)(iv[i*4+0]);
|
||||
}
|
||||
}
|
||||
|
||||
encryptionDirection = direction;
|
||||
reKey(keyLen,ref Key);
|
||||
}
|
||||
|
||||
// need to have this method due to IDisposable - just can't think of a reason to use it for in this class
|
||||
public void Dispose()
|
||||
{
|
||||
}
|
||||
|
||||
|
||||
/// <summary>
|
||||
/// Transform a block depending on whether we are encrypting or decrypting
|
||||
/// </summary>
|
||||
/// <param name="inputBuffer"></param>
|
||||
/// <param name="inputOffset"></param>
|
||||
/// <param name="inputCount"></param>
|
||||
/// <param name="outputBuffer"></param>
|
||||
/// <param name="outputOffset"></param>
|
||||
/// <returns></returns>
|
||||
public int TransformBlock(
|
||||
byte[] inputBuffer,
|
||||
int inputOffset,
|
||||
int inputCount,
|
||||
byte[] outputBuffer,
|
||||
int outputOffset
|
||||
)
|
||||
{
|
||||
uint[] x=new uint[4];
|
||||
|
||||
// load it up
|
||||
for (int i=0;i<4;i++)
|
||||
{
|
||||
x[i]= (uint)(inputBuffer[i*4+3+inputOffset]<<24) | (uint)(inputBuffer[i*4+2+inputOffset] << 16) |
|
||||
(uint)(inputBuffer[i*4+1+inputOffset] << 8) | (uint)(inputBuffer[i*4+0+inputOffset]);
|
||||
|
||||
}
|
||||
|
||||
if (encryptionDirection == EncryptionDirection.Encrypting)
|
||||
{
|
||||
blockEncrypt(ref x);
|
||||
}
|
||||
else
|
||||
{
|
||||
blockDecrypt(ref x);
|
||||
}
|
||||
|
||||
|
||||
// load it up
|
||||
for (int i=0;i<4;i++)
|
||||
{
|
||||
outputBuffer[i*4+0+outputOffset] = b0(x[i]);
|
||||
outputBuffer[i*4+1+outputOffset] = b1(x[i]);
|
||||
outputBuffer[i*4+2+outputOffset] = b2(x[i]);
|
||||
outputBuffer[i*4+3+outputOffset] = b3(x[i]);
|
||||
}
|
||||
|
||||
|
||||
return inputCount;
|
||||
}
|
||||
|
||||
public byte[] TransformFinalBlock(
|
||||
byte[] inputBuffer,
|
||||
int inputOffset,
|
||||
int inputCount
|
||||
)
|
||||
{
|
||||
byte[] outputBuffer;// = new byte[0];
|
||||
|
||||
if (inputCount>0)
|
||||
{
|
||||
outputBuffer = new byte[16]; // blocksize
|
||||
uint[] x=new uint[4];
|
||||
|
||||
// load it up
|
||||
for (int i=0;i<4;i++) // should be okay as we have already said to pad with zeros
|
||||
{
|
||||
x[i]= (uint)(inputBuffer[i*4+3+inputOffset]<<24) | (uint)(inputBuffer[i*4+2+inputOffset] << 16) |
|
||||
(uint)(inputBuffer[i*4+1+inputOffset] << 8) | (uint)(inputBuffer[i*4+0+inputOffset]);
|
||||
|
||||
}
|
||||
|
||||
if (encryptionDirection == EncryptionDirection.Encrypting)
|
||||
{
|
||||
blockEncrypt(ref x);
|
||||
}
|
||||
else
|
||||
{
|
||||
blockDecrypt(ref x);
|
||||
}
|
||||
|
||||
// load it up
|
||||
for (int i=0;i<4;i++)
|
||||
{
|
||||
outputBuffer[i*4+0] = b0(x[i]);
|
||||
outputBuffer[i*4+1] = b1(x[i]);
|
||||
outputBuffer[i*4+2] = b2(x[i]);
|
||||
outputBuffer[i*4+3] = b3(x[i]);
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
outputBuffer = new byte[0]; // the .NET framework doesn't like it if you return null - this calms it down
|
||||
}
|
||||
|
||||
return outputBuffer;
|
||||
}
|
||||
|
||||
// not worked out this property yet - placing break points here just don't get caught.
|
||||
private bool canReuseTransform = true;
|
||||
public bool CanReuseTransform
|
||||
{
|
||||
get
|
||||
{
|
||||
return canReuseTransform;
|
||||
}
|
||||
}
|
||||
|
||||
// I normally set this to false when block encrypting so that I can work on one block at a time
|
||||
// but for compression and stream type ciphers this can be set to true so that you get all the data
|
||||
private bool canTransformMultipleBlocks = false;
|
||||
public bool CanTransformMultipleBlocks
|
||||
{
|
||||
get
|
||||
{
|
||||
return canTransformMultipleBlocks;
|
||||
}
|
||||
}
|
||||
|
||||
public int InputBlockSize
|
||||
{
|
||||
get
|
||||
{
|
||||
return inputBlockSize;
|
||||
}
|
||||
}
|
||||
|
||||
public int OutputBlockSize
|
||||
{
|
||||
get
|
||||
{
|
||||
return outputBlockSize;
|
||||
}
|
||||
}
|
||||
|
||||
private EncryptionDirection encryptionDirection;
|
||||
}
|
||||
}
|
||||
1481
src/keepass2android/Resources/Resource.designer.cs
generated
1481
src/keepass2android/Resources/Resource.designer.cs
generated
File diff suppressed because it is too large
Load Diff
@ -23,9 +23,11 @@ using Android.Content;
|
||||
using Android.OS;
|
||||
using Android.Runtime;
|
||||
using Android.Widget;
|
||||
using KeePassLib.Cryptography.Cipher;
|
||||
using KeePassLib.Keys;
|
||||
using KeePassLib.Serialization;
|
||||
using Android.Preferences;
|
||||
using TwofishCipher;
|
||||
using keepass2android.Io;
|
||||
|
||||
namespace keepass2android
|
||||
@ -379,6 +381,7 @@ namespace keepass2android
|
||||
GetResourceString(key);
|
||||
}
|
||||
#endif
|
||||
CipherPool.GlobalPool.AddCipher(new TwofishCipherEngine());
|
||||
}
|
||||
|
||||
|
||||
|
||||
@ -666,6 +666,10 @@
|
||||
<Project>{A8779D4D-7C49-4C2F-82BD-2CDC448391DA}</Project>
|
||||
<Name>Kp2aKeyboardBinding</Name>
|
||||
</ProjectReference>
|
||||
<ProjectReference Include="..\TwofishCipher\TwofishCipher.csproj">
|
||||
<Project>{5cf675a5-9bee-4720-bed9-d5bf14a2ebf9}</Project>
|
||||
<Name>TwofishCipher</Name>
|
||||
</ProjectReference>
|
||||
</ItemGroup>
|
||||
<ProjectExtensions>
|
||||
<MonoDevelop>
|
||||
|
||||
Loading…
Reference in New Issue
Block a user