├── .gitattributes ├── Crypto ├── Endianness.cs ├── ExtendedCipherMode.cs ├── ISymmetricAlgorithm.cs ├── ManagedHashAlgorithmBase.cs ├── ManagedTransformBase.cs ├── NonceCombinationMode.cs ├── Serpent.cs ├── SerpentManaged.cs ├── SerpentManagedTransform.cs ├── SymmetricAlgorithmBase.cs ├── TransformDirection.cs └── Utils.cs ├── License.txt ├── MakeDistribDebug.bat ├── MakeDistribDebug.sh ├── MakeDistribRelease.bat ├── MakeDistribRelease.sh ├── Properties └── AssemblyInfo.cs ├── Readme.txt ├── SerpentCipher.csproj ├── SerpentCipher.sln ├── SerpentCipherEngine.cs └── SerpentCipherExt.cs /.gitattributes: -------------------------------------------------------------------------------- 1 | # Set the default behavior, in case people don't have core.autocrlf set. 2 | * text=auto 3 | 4 | # Declare files that will always have CRLF line endings on checkout. 5 | *.bat text eol=crlf 6 | *.csproj text eol=crlf diff=csharp 7 | *.cs text eol=crlf 8 | *.sln text eol=crlf 9 | *.txt text eol=crlf 10 | -------------------------------------------------------------------------------- /Crypto/Endianness.cs: -------------------------------------------------------------------------------- 1 | namespace DotNetCrypt 2 | { 3 | /// 4 | /// Indicates which endianness convention a cryptographic algorithm 5 | /// follows for conversions between bytes and words. 6 | /// 7 | public enum Endianness 8 | { 9 | /// 10 | /// Coversions are big endian. 11 | /// 12 | Big, 13 | /// 14 | /// Conversions are little endian. 15 | /// 16 | Little 17 | } 18 | } 19 | -------------------------------------------------------------------------------- /Crypto/ExtendedCipherMode.cs: -------------------------------------------------------------------------------- 1 | /* 2 | * DotNetCrypt - an open source library of cryptographic algorithms for .NET 3 | * Copyright (C) 2009 David Musgrove 4 | * 5 | * This file is part of DotNetCrypt. 6 | * 7 | * DotNetCrypt is free software: you can redistribute it and/or modify 8 | * it under the terms of the GNU General Public License as published by 9 | * the Free Software Foundation, either version 3 of the License, or 10 | * (at your option) any later version. 11 | * 12 | * DotNetCrypt is distributed in the hope that it will be useful, 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 | * GNU General Public License for more details. 16 | * 17 | * You should have received a copy of the GNU General Public License 18 | * along with this program. If not, see . 19 | */ 20 | 21 | using System.Security.Cryptography; 22 | 23 | namespace DotNetCrypt 24 | { 25 | /// 26 | /// Specified the block cipher chaining mode to be used for multiple block 27 | /// encryption and decryption. 28 | /// 29 | /// This mirrors the enumeration of the .NET 30 | /// framework's namespace, but 31 | /// additionally adds CTR (counter) mode. 32 | /// 33 | public enum ExtendedCipherMode 34 | { 35 | // ReSharper disable InconsistentNaming 36 | /// 37 | /// The Electronic Codebook () mode encrypts each 38 | /// block individually. This means that any blocks of plain text that 39 | /// are identical and are in the same message, or in a different 40 | /// message encrypted with the same key, will be transformed into 41 | /// identical cipher text blocks. If the plain text to be encrypted 42 | /// contains substantial repetition, it is feasible for the cipher 43 | /// text to be broken one block at a time. Also, it is possible for an 44 | /// active adversary to substitute and exchange individual blocks 45 | /// without detection. If a single bit of the cipher text block is 46 | /// mangled, the entire corresponding plain text block will also be 47 | /// mangled. 48 | /// 49 | ECB = CipherMode.ECB, 50 | /// 51 | /// The Output Feedback () mode processes small 52 | /// increments of plain text into cipher text instead of processing an 53 | /// entire block at a time. This mode is similar to ; 54 | /// the only difference between the two modes is the way that the shift 55 | /// register is filled. If a bit in the cipher text is mangled, the 56 | /// corresponding bit of plain text will be mangled. However, if there 57 | /// are extra or missing bits from the cipher text, the plain text will 58 | /// be mangled from that point on. 59 | /// 60 | OFB = CipherMode.OFB, 61 | /// 62 | /// The Cipher Feedback () mode processes small 63 | /// increments of plain text into cipher text, instead of processing an 64 | /// entire block at a time. This mode uses a shift register that is one 65 | /// block in length and is divided into sections. For example, if the 66 | /// block size is eight bytes, with one byte processed at a time, the 67 | /// shift register is divided into eight sections. If a bit in the 68 | /// cipher text is mangled, one plain text bit is mangled and the shift 69 | /// register is corrupted. This results in the next several plain text 70 | /// increments being mangled until the bad bit is shifted out of the 71 | /// shift register. 72 | /// 73 | CFB = CipherMode.CFB, 74 | /// 75 | /// The Cipher Block Chaining () mode introduces 76 | /// feedback. Before each plain text block is encrypted, it is combined 77 | /// with the cipher text of the previous block by a bitwise exclusive 78 | /// OR operation. This ensures that even if the plain text contains 79 | /// many identical blocks, they will each encrypt to a different cipher 80 | /// text block. The initialization vector is combined with the first 81 | /// plain text block by a bitwise exclusive OR operation before the 82 | /// block is encrypted. If a single bit of the cipher text block is 83 | /// mangled, the corresponding plain text block will also be mangled. 84 | /// In addition, a bit in the subsequent block, in the same position as 85 | /// the original mangled bit, will be mangled. 86 | /// 87 | CBC = CipherMode.CBC, 88 | /// 89 | /// The Cipher Text Stealing () mode handles any 90 | /// length of plain text and produces cipher text whose length matches 91 | /// the plain text length. This mode behaves like the 92 | /// mode for all but the last two blocks of the 93 | /// plain text. 94 | /// 95 | CTS = CipherMode.CTS, 96 | /// 97 | /// The Counter () mode generates a stream of output 98 | /// bits by encrypting a block based on a progressively incrementing 99 | /// counter variable. This counter can be combined with the algorithm's 100 | /// initialization vector (IV) is one of a number of ways specified by 101 | /// the enumeration. The output of 102 | /// this encryption is combined with the plain text blocks by a bitwise 103 | /// exclusive OR operation ot produce the cipher text. Because there is 104 | /// no feedback involved, any individual block can be encrypted out of 105 | /// context, making this mode extremely well suited to parallelized 106 | /// implementations. 107 | /// 108 | CTR 109 | // ReSharper restore InconsistentNaming 110 | } 111 | } 112 | -------------------------------------------------------------------------------- /Crypto/ISymmetricAlgorithm.cs: -------------------------------------------------------------------------------- 1 | /* 2 | * DotNetCrypt - an open source library of cryptographic algorithms for .NET 3 | * Copyright (C) 2009 David Musgrove 4 | * 5 | * This file is part of DotNetCrypt. 6 | * 7 | * DotNetCrypt is free software: you can redistribute it and/or modify 8 | * it under the terms of the GNU General Public License as published by 9 | * the Free Software Foundation, either version 3 of the License, or 10 | * (at your option) any later version. 11 | * 12 | * DotNetCrypt is distributed in the hope that it will be useful, 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 | * GNU General Public License for more details. 16 | * 17 | * You should have received a copy of the GNU General Public License 18 | * along with this program. If not, see . 19 | */ 20 | 21 | using System.Security.Cryptography; 22 | 23 | namespace DotNetCrypt 24 | { 25 | /// 26 | /// Interface defining properties that must be exposed by symmetric 27 | /// algorithm implementations in this library. 28 | /// 29 | /// 30 | /// 31 | /// Some of these are exposed already by the 32 | /// base class in the .NET framework, 33 | /// but this implementation additionally defines properties that are 34 | /// required to support the following enhancements: 35 | /// 36 | /// 37 | /// 38 | /// Counter () block cipher mode, 39 | /// with one of thre methods for combining the counter and nonce values. 40 | /// 41 | /// 42 | /// Variable size cipher feedback () 43 | /// mode. 44 | /// 45 | /// 46 | /// 47 | public interface ISymmetricAlgorithm 48 | { 49 | /// 50 | /// Gets or sets the block size for this instance of the algorithm. 51 | /// 52 | /// 53 | /// Some algorithms allow for a variable block size, which is why this 54 | /// is exposed as an instance and not a static member. 55 | /// 56 | /// 57 | /// The block size for this instance of the algorithm. 58 | /// 59 | int BlockSize { get; set; } 60 | 61 | /// 62 | /// Gets or sets the padding mode to be used by this instance of the 63 | /// algorithm. 64 | /// 65 | /// 66 | /// The padding mode is not one of the 67 | /// values. 68 | /// 69 | /// 70 | /// The padding mode to be used by this instance of the algorithm. 71 | /// 72 | PaddingMode Padding { get; set; } 73 | 74 | /// 75 | /// Gets or sets the block cipher chaining mode to be used by this 76 | /// instance of the algorithm. 77 | /// 78 | /// 79 | /// If compatible, this property's setter also sets the underlying 80 | /// property, which is of the 81 | /// more restrictive type . The default mode 82 | /// is . 83 | /// 84 | /// 85 | /// The cipher mode is not one of the 86 | /// values. 87 | /// 88 | /// 89 | /// The block cipher chaining mode to be used by this instance of the 90 | /// algorithm. 91 | /// 92 | ExtendedCipherMode ExtendedMode { get; set; } 93 | 94 | /// 95 | /// Gets or sets the method used to combine the counter value with the 96 | /// nonce in counter () mode. 97 | /// 98 | /// 99 | /// The mode is not one of the 100 | /// values. 101 | /// 102 | /// 103 | /// The method used to combine the counter value with the nonce in 104 | /// counter () mode. 105 | /// 106 | NonceCombinationMode NonceCombinationMode { get; set; } 107 | 108 | /// 109 | /// Gets or sets the number of bytes to process at a time in cipher or 110 | /// output feedback ( or 111 | /// ) modes. 112 | /// 113 | /// 114 | /// If not set, this value will default to 1 byte, which provides 115 | /// compatibility with the CSP and .NET implementations of the 116 | /// modes. 117 | /// 118 | /// 119 | /// The number of bytes to process at a time in cipher or 120 | /// output feedback ( or 121 | /// ) modes. 122 | /// 123 | int RegisterShiftSize { get; set; } 124 | 125 | /// 126 | /// Returns a random non-weak key 127 | /// () 128 | /// to use for the algorithm. 129 | /// 130 | /// 131 | byte[] GenerateNonWeakKey(); 132 | } 133 | } 134 | -------------------------------------------------------------------------------- /Crypto/ManagedHashAlgorithmBase.cs: -------------------------------------------------------------------------------- 1 | using System; 2 | using System.Security.Cryptography; 3 | 4 | namespace DotNetCrypt 5 | { 6 | /// 7 | /// An abstract base class for managed implementations of 8 | /// . 9 | /// 10 | public abstract class ManagedHashAlgorithmBase : HashAlgorithm 11 | { 12 | internal int Count { get; set; } 13 | internal byte[] FinalBlock { get; set; } 14 | 15 | /// 16 | /// Routes data written to the 17 | /// object into the hash algorithm for computing the hash. 18 | /// 19 | /// 20 | /// The input to compute the hash code for. 21 | /// 22 | /// 23 | /// The offset into the byte array from which to begin using data. 24 | /// 25 | /// 26 | /// The number of bytes in the byte array to use as data. 27 | /// 28 | protected override void HashCore(byte[] array, int ibStart, int cbSize) 29 | { 30 | int count = cbSize; 31 | int index = ibStart; 32 | var partialBlockBytes = (int)(Count & 0x3fL); 33 | Count += count; 34 | if ((partialBlockBytes > 0) && ((partialBlockBytes + count) >= InputBlockSize)) 35 | { 36 | index += InputBlockSize - partialBlockBytes; 37 | count -= InputBlockSize - partialBlockBytes; 38 | TransformBlock(array, index); 39 | } 40 | while (count >= InputBlockSize) 41 | { 42 | TransformBlock(array, index); 43 | index += InputBlockSize; 44 | count -= InputBlockSize; 45 | } 46 | FinalBlock = new byte[0]; 47 | if (count > 0) 48 | { 49 | FinalBlock = new byte[count]; 50 | Array.Copy(array, index, FinalBlock, 0, count); 51 | } 52 | } 53 | 54 | /// 55 | /// When implemented in a derived class, transforms a single block of 56 | /// bytes using the chosen hash algorithm. 57 | /// 58 | /// 59 | /// An array containing the block of bytes. 60 | /// 61 | /// 62 | /// The offset of the start of the block within the array. 63 | /// 64 | protected abstract void TransformBlock(byte[] array, int ibStart); 65 | } 66 | } 67 | -------------------------------------------------------------------------------- /Crypto/ManagedTransformBase.cs: -------------------------------------------------------------------------------- 1 | /* 2 | * DotNetCrypt - an open source library of cryptographic algorithms for .NET 3 | * Copyright (C) 2009 David Musgrove 4 | * 5 | * This file is part of DotNetCrypt. 6 | * 7 | * DotNetCrypt is free software: you can redistribute it and/or modify 8 | * it under the terms of the GNU General Public License as published by 9 | * the Free Software Foundation, either version 3 of the License, or 10 | * (at your option) any later version. 11 | * 12 | * DotNetCrypt is distributed in the hope that it will be useful, 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 | * GNU General Public License for more details. 16 | * 17 | * You should have received a copy of the GNU General Public License 18 | * along with this program. If not, see . 19 | */ 20 | 21 | using System; 22 | using System.Security.Cryptography; 23 | //using DotNetCrypt.Properties; 24 | 25 | namespace DotNetCrypt 26 | { 27 | /// 28 | /// An abstract base class for managed implementations of 29 | /// . 30 | /// 31 | /// 32 | /// 33 | /// This class deals with the various forms of padding available. Unlike 34 | /// the classes built into the .NET framework, however, for modes which 35 | /// effectively operate in stream cipher mode (CFB, OFB), it is 36 | /// permissible to encrypt a message which is not an exact number of 37 | /// bytes without specifying a padding mode other than 38 | /// 39 | /// 40 | /// 41 | /// It also takes into account the cipher mode to be used. For increased 42 | /// compatibility with other systems, counter mode (CTR) is also supported 43 | /// via the enumeration. 44 | /// 45 | /// 46 | public abstract class ManagedTransformBase : ICryptoTransform 47 | { 48 | private delegate uint[] BytesToWords(byte[] bytes); 49 | private delegate void WriteWordsIntoBytes(uint[] words, byte[] bytes); 50 | 51 | private byte[] _depadBuffer; 52 | private byte[] _feedbackValue; 53 | private byte[] _iv; 54 | private byte[] _counter; 55 | private bool _initial; 56 | private int _counterSize; 57 | private readonly TransformDirection _transformDirection; 58 | private readonly int _registerShiftSize; 59 | private readonly BytesToWords _bytesToWords; 60 | private readonly WriteWordsIntoBytes _writeWordsIntoBytes; 61 | 62 | internal Endianness Endianness { get; set; } 63 | 64 | /// 65 | /// Creates a new managed transform instance, reading necessary 66 | /// setting values from the provided 67 | /// instance. 68 | /// 69 | /// 70 | /// A instance from which to take 71 | /// setting values. 72 | /// 73 | /// 74 | /// The initialization vector to use. 75 | /// 76 | /// 77 | /// The direction of the transform (encryption or decryption). 78 | /// 79 | /// 80 | /// The endianness convention for the algorithm. 81 | /// 82 | protected ManagedTransformBase(ISymmetricAlgorithm algorithm, byte[] rgbIv, TransformDirection transformDirection, Endianness endianness) 83 | { 84 | Endianness = endianness; 85 | _bytesToWords = endianness == Endianness.Little 86 | ? (BytesToWords)Utils.BytesToWordsLittleEndian 87 | : Utils.BytesToWordsBigEndian; 88 | _writeWordsIntoBytes = endianness == Endianness.Little 89 | ? (WriteWordsIntoBytes)Utils.WriteWordsIntoBytesLittleEndian 90 | : Utils.WriteWordsIntoBytesBigEndian; 91 | PaddingMode = algorithm.Padding; 92 | BlockSizeBytes = algorithm.BlockSize >> 3; 93 | Mode = algorithm.ExtendedMode; 94 | NonceCombinationMode = algorithm.NonceCombinationMode; 95 | _registerShiftSize = algorithm.RegisterShiftSize; 96 | _feedbackValue = new byte[BlockSizeBytes]; 97 | _iv = new byte[BlockSizeBytes]; 98 | if (rgbIv != null) 99 | { 100 | rgbIv.CopyTo(_feedbackValue, 0); 101 | rgbIv.CopyTo(_iv, 0); 102 | if (Mode == ExtendedCipherMode.CTR) 103 | { 104 | switch (NonceCombinationMode) 105 | { 106 | case NonceCombinationMode.Concatenate: 107 | _counterSize = BlockSizeBytes - rgbIv.Length; 108 | _counter = new byte[_counterSize]; 109 | break; 110 | case NonceCombinationMode.Xor: 111 | _counterSize = BlockSizeBytes; 112 | _counter = new byte[_counterSize]; 113 | break; 114 | case NonceCombinationMode.Add: 115 | _counterSize = BlockSizeBytes; 116 | _counter = (byte[])_feedbackValue.Clone(); 117 | break; 118 | } 119 | _initial = true; 120 | } 121 | } 122 | _transformDirection = transformDirection; 123 | } 124 | 125 | /// 126 | /// Gets or sets the block size for this algorithm, in bytes. 127 | /// 128 | protected int BlockSizeBytes { get; set; } 129 | 130 | /// 131 | /// Gets or sets the padding mode to be used to round a message up to 132 | /// the nearest block boundary. 133 | /// 134 | protected PaddingMode PaddingMode { get; set; } 135 | 136 | /// 137 | /// Gets or sets the block cipher chaining mode used in encrypting 138 | /// messages. 139 | /// 140 | protected ExtendedCipherMode Mode { get; set; } 141 | 142 | /// 143 | /// Gets or sets the method used for combining the counter with the 144 | /// nonce in counter () mode. 145 | /// 146 | protected NonceCombinationMode NonceCombinationMode { get; set; } 147 | 148 | #region ICryptoTransform Members 149 | 150 | /// 151 | /// Performs application-defined tasks associated with freeing, 152 | /// releasing, or resetting unmanaged resources. 153 | /// 154 | /// 2 155 | public void Dispose() 156 | { 157 | Dispose(true); 158 | GC.SuppressFinalize(this); 159 | } 160 | 161 | /// 162 | /// Transforms the specified region of the input byte array and copies 163 | /// the resulting transform to the specified region of the output byte 164 | /// array. 165 | /// 166 | /// 167 | /// The number of bytes written. 168 | /// 169 | /// 170 | /// The input for which to compute the transform. 171 | /// 172 | /// 173 | /// The offset into the input byte array from which to begin using data. 174 | /// 175 | /// 176 | /// The number of bytes in the input byte array to use as data. 177 | /// 178 | /// 179 | /// The output to which to write the transform. 180 | /// 181 | /// 182 | /// The offset into the output byte array from which to begin writing 183 | /// data. 184 | /// 185 | public int TransformBlock(byte[] inputBuffer, int inputOffset, int inputCount, byte[] outputBuffer, 186 | int outputOffset) 187 | { 188 | if (inputBuffer == null) 189 | { 190 | throw new ArgumentNullException("inputBuffer"); 191 | } 192 | if (outputBuffer == null) 193 | { 194 | throw new ArgumentNullException("outputBuffer"); 195 | } 196 | if (inputOffset < 0) 197 | { 198 | throw new ArgumentOutOfRangeException("inputOffset"); 199 | } 200 | if (((inputCount <= 0) || ((inputCount % InputBlockSize) != 0)) || (inputCount > inputBuffer.Length)) 201 | { 202 | throw new ArgumentException(); 203 | } 204 | if ((inputBuffer.Length - inputCount) < inputOffset) 205 | { 206 | throw new ArgumentException(); 207 | } 208 | if (_transformDirection == TransformDirection.Encrypt) 209 | { 210 | return EncryptData(inputBuffer, inputOffset, inputCount, ref outputBuffer, outputOffset, PaddingMode, 211 | false); 212 | } 213 | if ((PaddingMode == PaddingMode.Zeros) || (PaddingMode == PaddingMode.None)) 214 | { 215 | return DecryptData(inputBuffer, inputOffset, inputCount, ref outputBuffer, outputOffset, PaddingMode, 216 | false); 217 | } 218 | if (_depadBuffer == null) 219 | { 220 | _depadBuffer = new byte[InputBlockSize]; 221 | int num = inputCount - InputBlockSize; 222 | Array.Copy(inputBuffer, inputOffset + num, _depadBuffer, 0, InputBlockSize); 223 | return DecryptData(inputBuffer, inputOffset, num, ref outputBuffer, outputOffset, PaddingMode, false); 224 | } 225 | DecryptData(_depadBuffer, 0, _depadBuffer.Length, ref outputBuffer, outputOffset, PaddingMode, false); 226 | outputOffset += OutputBlockSize; 227 | int num3 = inputCount - InputBlockSize; 228 | Array.Copy(inputBuffer, inputOffset + num3, _depadBuffer, 0, InputBlockSize); 229 | int num2 = DecryptData(inputBuffer, inputOffset, num3, ref outputBuffer, outputOffset, PaddingMode, false); 230 | return (OutputBlockSize + num2); 231 | } 232 | 233 | /// 234 | /// Transforms the specified region of the specified byte array. 235 | /// 236 | /// 237 | /// The computed transform. 238 | /// 239 | /// 240 | /// The input for which to compute the transform. 241 | /// 242 | /// 243 | /// The offset into the byte array from which to begin using data. 244 | /// 245 | /// 246 | /// The number of bytes in the byte array to use as data. 247 | /// 248 | public byte[] TransformFinalBlock(byte[] inputBuffer, int inputOffset, int inputCount) 249 | { 250 | if (inputBuffer == null) 251 | { 252 | throw new ArgumentNullException("inputBuffer"); 253 | } 254 | if (inputOffset < 0) 255 | { 256 | throw new ArgumentOutOfRangeException("inputOffset"); 257 | } 258 | if ((inputCount < 0) || (inputCount > inputBuffer.Length)) 259 | { 260 | throw new ArgumentException(); 261 | } 262 | if ((inputBuffer.Length - inputCount) < inputOffset) 263 | { 264 | throw new ArgumentException(); 265 | } 266 | if (_transformDirection == TransformDirection.Encrypt) 267 | { 268 | byte[] buffer = null; 269 | EncryptData(inputBuffer, inputOffset, inputCount, ref buffer, 0, PaddingMode, true); 270 | Reset(); 271 | return buffer; 272 | } 273 | if (!Utils.IsStreamMode(Mode) && (inputCount % InputBlockSize) != 0) 274 | { 275 | throw new CryptographicException("The inputCount must be a multiple of the InputBlockSize"); 276 | } 277 | if (_depadBuffer == null) 278 | { 279 | byte[] buffer2 = null; 280 | DecryptData(inputBuffer, inputOffset, inputCount, ref buffer2, 0, PaddingMode, true); 281 | Reset(); 282 | return buffer2; 283 | } 284 | var dst = new byte[_depadBuffer.Length + inputCount]; 285 | Array.Copy(_depadBuffer, 0, dst, 0, _depadBuffer.Length); 286 | Array.Copy(inputBuffer, inputOffset, dst, _depadBuffer.Length, inputCount); 287 | byte[] outputBuffer = null; 288 | DecryptData(dst, 0, dst.Length, ref outputBuffer, 0, PaddingMode, true); 289 | Reset(); 290 | return outputBuffer; 291 | } 292 | 293 | #endregion 294 | 295 | /// 296 | /// 297 | /// Dispose(bool disposing) executes in two distinct scenarios. 298 | /// If disposing equals true, the method has been called directly 299 | /// or indirectly by a user's code. Managed and unmanaged resources 300 | /// can be disposed. 301 | /// 302 | /// 303 | /// If disposing equals false, the method has been called by the 304 | /// runtime from inside the finalizer and you should not reference 305 | /// other objects. Only unmanaged resources can be disposed. 306 | /// 307 | /// 308 | /// 309 | /// Indicates whether this method is being called by a user's code. 310 | /// 311 | protected virtual void Dispose(bool disposing) 312 | { 313 | } 314 | 315 | private int EncryptData(byte[] inputBuffer, int inputOffset, int inputCount, ref byte[] outputBuffer, 316 | int outputOffset, PaddingMode paddingMode, bool final) 317 | { 318 | if (inputBuffer.Length < (inputOffset + inputCount)) 319 | { 320 | throw new CryptographicException(); 321 | } 322 | 323 | int inputBlockSize = InputBlockSize; 324 | int blockSizeBytes = BlockSizeBytes; 325 | ExtendedCipherMode mode = Mode; 326 | int partialBlockSize = inputCount % inputBlockSize; 327 | int paddingSizeRequired = 0; 328 | byte[] data; 329 | if (final) 330 | { 331 | switch (paddingMode) 332 | { 333 | case PaddingMode.None: 334 | if (partialBlockSize != 0 & !Utils.IsStreamMode(mode)) 335 | { 336 | throw new CryptographicException(); 337 | } 338 | break; 339 | case PaddingMode.PKCS7: 340 | paddingSizeRequired = inputBlockSize - partialBlockSize; 341 | break; 342 | case PaddingMode.Zeros: 343 | if (partialBlockSize != 0) 344 | { 345 | paddingSizeRequired = inputBlockSize - partialBlockSize; 346 | } 347 | break; 348 | case PaddingMode.ANSIX923: 349 | paddingSizeRequired = inputBlockSize - partialBlockSize; 350 | break; 351 | case PaddingMode.ISO10126: 352 | paddingSizeRequired = inputBlockSize - partialBlockSize; 353 | break; 354 | } 355 | 356 | if (paddingSizeRequired != 0) 357 | { 358 | data = new byte[paddingSizeRequired]; 359 | switch (paddingMode) 360 | { 361 | case PaddingMode.PKCS7: 362 | int index = 0; 363 | while (index < paddingSizeRequired) 364 | { 365 | data[index] = (byte)paddingSizeRequired; 366 | index++; 367 | } 368 | break; 369 | 370 | case PaddingMode.ANSIX923: 371 | data[paddingSizeRequired - 1] = (byte)paddingSizeRequired; 372 | break; 373 | 374 | case PaddingMode.ISO10126: 375 | Utils.RandomNumberGeneratorSingleton.GetBytes(data); 376 | data[paddingSizeRequired - 1] = (byte)paddingSizeRequired; 377 | break; 378 | } 379 | var tempBuffer = new byte[inputCount + paddingSizeRequired]; 380 | Array.Copy(inputBuffer, 0, tempBuffer, 0, inputCount); 381 | data.CopyTo(tempBuffer, inputCount); 382 | inputBuffer = tempBuffer; 383 | } 384 | } 385 | if (outputBuffer == null) 386 | { 387 | outputBuffer = new byte[inputCount + paddingSizeRequired]; 388 | outputOffset = 0; 389 | } 390 | else if ((outputBuffer.Length - outputOffset) < (inputCount + paddingSizeRequired)) 391 | { 392 | throw new CryptographicException(); 393 | } 394 | 395 | int byteCount = 0; 396 | var tempState = new byte[blockSizeBytes]; 397 | int count = blockSizeBytes; 398 | if (mode == ExtendedCipherMode.CFB) 399 | { 400 | count = _registerShiftSize == 0 ? 1 : _registerShiftSize; 401 | } 402 | 403 | while (byteCount < inputCount + paddingSizeRequired) 404 | { 405 | var block = new byte[blockSizeBytes]; 406 | int bytesToCopy = count; 407 | if (blockSizeBytes + inputOffset > inputBuffer.Length) bytesToCopy = inputBuffer.Length - inputOffset; 408 | Array.Copy(inputBuffer, inputOffset, block, 0, bytesToCopy); 409 | 410 | switch (mode) 411 | { 412 | case ExtendedCipherMode.ECB: 413 | EncryptBlock(block); 414 | break; 415 | case ExtendedCipherMode.CBC: 416 | for (int i = 0; i < blockSizeBytes; i++) block[i] ^= _feedbackValue[i]; 417 | EncryptBlock(block); 418 | block.CopyTo(_feedbackValue, 0); 419 | break; 420 | case ExtendedCipherMode.CFB: 421 | Array.Copy(_feedbackValue, count, tempState, 0, blockSizeBytes - count); 422 | EncryptBlock(_feedbackValue); 423 | for (int i = 0; i < count; i++) _feedbackValue[i] ^= block[i]; 424 | Array.Copy(_feedbackValue, 0, block, 0, count); 425 | tempState.CopyTo(_feedbackValue, 0); 426 | Array.Copy(block, 0, _feedbackValue, blockSizeBytes - count, count); 427 | break; 428 | case ExtendedCipherMode.OFB: 429 | Array.Copy(_feedbackValue, count, tempState, 0, blockSizeBytes - count); 430 | EncryptBlock(_feedbackValue); 431 | for (int i = 0; i < count; i++) block[i] ^= _feedbackValue[i]; 432 | Array.Copy(_feedbackValue, 0, _feedbackValue, blockSizeBytes - count, count); 433 | Array.Copy(tempState, 0, _feedbackValue, 0, blockSizeBytes - count); 434 | break; 435 | case ExtendedCipherMode.CTS: 436 | throw new NotImplementedException(); 437 | case ExtendedCipherMode.CTR: 438 | if (_initial) 439 | { 440 | _initial = false; 441 | } 442 | else 443 | { 444 | IncrementCounter(); 445 | } 446 | switch (NonceCombinationMode) 447 | { 448 | case NonceCombinationMode.Concatenate: 449 | _iv.CopyTo(_feedbackValue, 0); 450 | _counter.CopyTo(_feedbackValue, blockSizeBytes - _counterSize); 451 | break; 452 | case NonceCombinationMode.Add: 453 | _counter.CopyTo(_feedbackValue, 0); 454 | break; 455 | case NonceCombinationMode.Xor: 456 | _iv.CopyTo(_feedbackValue, 0); 457 | for (int index = 0; index < _counterSize; index++) 458 | { 459 | _feedbackValue[blockSizeBytes - _counterSize + index] ^= _counter[index]; 460 | } 461 | break; 462 | } 463 | EncryptBlock(_feedbackValue); 464 | for (int i = 0; i < blockSizeBytes; i++) block[i] ^= _feedbackValue[i]; 465 | break; 466 | } 467 | 468 | if (outputOffset + count > outputBuffer.Length) count = outputBuffer.Length - outputOffset; 469 | Array.Copy(block, 0, outputBuffer, outputOffset, count); 470 | 471 | byteCount += count; 472 | inputOffset += count; 473 | outputOffset += count; 474 | } 475 | 476 | if (Utils.IsStreamMode(mode) && outputBuffer.Length > inputCount && paddingMode == PaddingMode.None) 477 | { 478 | var result = new byte[inputCount]; 479 | Array.Copy(outputBuffer, 0, result, 0, inputCount); 480 | outputBuffer = result; 481 | } 482 | 483 | return inputCount; 484 | } 485 | 486 | private void IncrementCounter() 487 | { 488 | if (_counter[_counterSize - 1] < 255) 489 | { 490 | _counter[_counterSize - 1]++; 491 | return; 492 | } 493 | int index = _counterSize - 1; 494 | while (_counter[index] == 255) 495 | { 496 | _counter[index--] = 0; 497 | if (index < 0) 498 | { 499 | throw new CryptographicException(); 500 | } 501 | } 502 | _counter[index]++; 503 | } 504 | 505 | /// 506 | /// Encrypts a single block of bytes, writing the result into the 507 | /// provided array. 508 | /// 509 | /// 510 | /// The block of bytes to be encrypted. 511 | /// 512 | protected virtual void EncryptBlock(byte[] block) 513 | { 514 | uint[] words = _bytesToWords(block); 515 | Encrypt(words); 516 | _writeWordsIntoBytes(words, block); 517 | } 518 | 519 | /// 520 | /// When implemented in a derived class, performs the encryption 521 | /// transformation on a block of bytes that have been translated into 522 | /// words using the endianness convention of the algorithm. 523 | /// 524 | /// 525 | /// The words to encrypt. 526 | /// 527 | [CLSCompliant(false)] 528 | protected internal virtual void Encrypt(uint[] plain) {} 529 | 530 | /// 531 | /// Decrypts a single block of bytes, writing the result into the 532 | /// provided array. 533 | /// 534 | /// 535 | /// The block of bytes to be decrypted. 536 | /// 537 | protected virtual void DecryptBlock(byte[] block) 538 | { 539 | uint[] words = _bytesToWords(block); 540 | Decrypt(words); 541 | _writeWordsIntoBytes(words, block); 542 | } 543 | 544 | /// 545 | /// When implemented in a derived class, performs the decryption 546 | /// transformation on a block of bytes that have been translated into 547 | /// words using the endianness convention of the algorithm. 548 | /// 549 | /// 550 | /// The words to decrypt. 551 | /// 552 | [CLSCompliant(false)] 553 | protected internal virtual void Decrypt(uint[] cipher) {} 554 | 555 | private int DecryptData(byte[] inputBuffer, int inputOffset, int inputCount, ref byte[] outputBuffer, 556 | int outputOffset, PaddingMode paddingMode, bool final) 557 | { 558 | if (inputBuffer.Length < (inputOffset + inputCount)) 559 | { 560 | throw new CryptographicException(); 561 | } 562 | if (outputBuffer == null) 563 | { 564 | outputBuffer = new byte[inputCount]; 565 | outputOffset = 0; 566 | } 567 | else if ((outputBuffer.Length - outputOffset) < inputCount) 568 | { 569 | throw new CryptographicException(); 570 | } 571 | 572 | int inputBlockSize = InputBlockSize; 573 | int blockSizeBytes = BlockSizeBytes; 574 | int byteCount = 0; 575 | var tempState = new byte[blockSizeBytes]; 576 | int count = blockSizeBytes; 577 | if (Mode == ExtendedCipherMode.CFB) 578 | { 579 | count = _registerShiftSize == 0 ? 1 : _registerShiftSize; 580 | } 581 | 582 | while (byteCount < inputCount) 583 | { 584 | var block = new byte[blockSizeBytes]; 585 | int bytesToCopy = count; 586 | if (blockSizeBytes + inputOffset > inputBuffer.Length) bytesToCopy = inputBuffer.Length - inputOffset; 587 | Array.Copy(inputBuffer, inputOffset, block, 0, bytesToCopy); 588 | 589 | switch (Mode) 590 | { 591 | case ExtendedCipherMode.ECB: 592 | DecryptBlock(block); 593 | break; 594 | case ExtendedCipherMode.CBC: 595 | block.CopyTo(tempState, 0); 596 | DecryptBlock(block); 597 | for (int i = 0; i < blockSizeBytes; i++) block[i] ^= _feedbackValue[i]; 598 | tempState.CopyTo(_feedbackValue, 0); 599 | break; 600 | case ExtendedCipherMode.CFB: 601 | Array.Copy(block, 0, tempState, blockSizeBytes - count, count); 602 | Array.Copy(_feedbackValue, count, tempState, 0, blockSizeBytes - count); 603 | EncryptBlock(_feedbackValue); 604 | for (int i = 0; i < count; i++) _feedbackValue[i] ^= block[i]; 605 | Array.Copy(_feedbackValue, 0, block, 0, count); 606 | tempState.CopyTo(_feedbackValue, 0); 607 | break; 608 | case ExtendedCipherMode.OFB: 609 | Array.Copy(_feedbackValue, count, tempState, 0, blockSizeBytes - count); 610 | EncryptBlock(_feedbackValue); 611 | for (int i = 0; i < count; i++) block[i] ^= _feedbackValue[i]; 612 | Array.Copy(_feedbackValue, 0, _feedbackValue, blockSizeBytes - count, count); 613 | Array.Copy(tempState, 0, _feedbackValue, 0, blockSizeBytes - count); 614 | break; 615 | case ExtendedCipherMode.CTS: 616 | throw new NotImplementedException(); 617 | case ExtendedCipherMode.CTR: 618 | if (_initial) 619 | { 620 | _initial = false; 621 | } 622 | else 623 | { 624 | IncrementCounter(); 625 | } 626 | switch (NonceCombinationMode) 627 | { 628 | case NonceCombinationMode.Concatenate: 629 | _iv.CopyTo(_feedbackValue, 0); 630 | _counter.CopyTo(_feedbackValue, blockSizeBytes - _counterSize); 631 | break; 632 | case NonceCombinationMode.Add: 633 | _counter.CopyTo(_feedbackValue, 0); 634 | break; 635 | case NonceCombinationMode.Xor: 636 | _iv.CopyTo(_feedbackValue, 0); 637 | for (int index = 0; index < _counterSize; index++) 638 | { 639 | _feedbackValue[blockSizeBytes - _counterSize + index] ^= _counter[index]; 640 | } 641 | break; 642 | } 643 | EncryptBlock(_feedbackValue); 644 | for (int i = 0; i < blockSizeBytes; i++) block[i] ^= _feedbackValue[i]; 645 | break; 646 | } 647 | 648 | if (outputOffset + count > outputBuffer.Length) count = outputBuffer.Length - outputOffset; 649 | Array.Copy(block, 0, outputBuffer, outputOffset, count); 650 | 651 | byteCount += count; 652 | inputOffset += count; 653 | outputOffset += count; 654 | } 655 | 656 | if (Utils.IsStreamMode(Mode) && outputBuffer.Length > inputCount) 657 | { 658 | var tempBuffer = new byte[inputCount]; 659 | Array.Copy(outputBuffer, 0, tempBuffer, 0, inputCount); 660 | outputBuffer = tempBuffer; 661 | } 662 | 663 | int result = inputCount; 664 | if (!final) return inputCount; 665 | int paddingSize = 0; 666 | switch (paddingMode) 667 | { 668 | case PaddingMode.PKCS7: 669 | paddingSize = outputBuffer[inputCount - 1]; 670 | if (((paddingSize > outputBuffer.Length) || (paddingSize > inputBlockSize)) || (paddingSize <= 0)) 671 | { 672 | throw new CryptographicException(); 673 | } 674 | for (int index = 2; index <= paddingSize; index++) 675 | { 676 | if (outputBuffer[inputCount - index] != paddingSize) 677 | { 678 | throw new CryptographicException(); 679 | } 680 | } 681 | break; 682 | case PaddingMode.ANSIX923: 683 | paddingSize = outputBuffer[inputCount - 1]; 684 | if (((paddingSize > outputBuffer.Length) || (paddingSize > inputBlockSize)) || (paddingSize <= 0)) 685 | { 686 | throw new CryptographicException(); 687 | } 688 | for (int index = 2; index <= paddingSize; index++) 689 | { 690 | if (outputBuffer[inputCount - index] != 0) 691 | { 692 | throw new CryptographicException(); 693 | } 694 | } 695 | break; 696 | case PaddingMode.ISO10126: 697 | paddingSize = outputBuffer[inputCount - 1]; 698 | if (((paddingSize > outputBuffer.Length) || (paddingSize > inputBlockSize)) || (paddingSize <= 0)) 699 | { 700 | throw new CryptographicException(); 701 | } 702 | break; 703 | } 704 | if (paddingSize > 0) 705 | { 706 | var tempBuffer = new byte[outputBuffer.Length - paddingSize]; 707 | Array.Copy(outputBuffer, 0, tempBuffer, 0, outputBuffer.Length - paddingSize); 708 | outputBuffer = tempBuffer; 709 | result -= paddingSize; 710 | } 711 | return result; 712 | } 713 | 714 | /// 715 | /// Clears all potentially sensitive data stores. 716 | /// 717 | protected internal virtual void Reset() 718 | { 719 | if (_depadBuffer != null) 720 | { 721 | Array.Clear(_depadBuffer, 0, _depadBuffer.Length); 722 | _depadBuffer = null; 723 | } 724 | if (_feedbackValue != null) 725 | { 726 | Array.Clear(_feedbackValue, 0, _feedbackValue.Length); 727 | _feedbackValue = null; 728 | } 729 | if (_iv != null) 730 | { 731 | Array.Clear(_iv, 0, _iv.Length); 732 | _iv = null; 733 | } 734 | if (_counter != null) 735 | { 736 | Array.Clear(_counter, 0, _counter.Length); 737 | _counter = null; 738 | } 739 | _counterSize = 0; 740 | } 741 | 742 | /// 743 | /// Gets the input block size. 744 | /// 745 | /// 746 | /// The size of the input data blocks in bytes. 747 | /// 748 | public virtual int InputBlockSize 749 | { 750 | get { return BlockSizeBytes; } 751 | } 752 | 753 | /// 754 | /// Gets the output block size. 755 | /// 756 | /// 757 | /// The size of the output data blocks in bytes. 758 | /// 759 | public virtual int OutputBlockSize 760 | { 761 | get { return BlockSizeBytes; } 762 | } 763 | 764 | /// 765 | /// Gets a value indicating whether multiple blocks can be transformed. 766 | /// 767 | /// 768 | /// true if multiple blocks can be transformed; otherwise, false. 769 | /// 770 | public virtual bool CanTransformMultipleBlocks 771 | { 772 | get { return true; } 773 | } 774 | 775 | /// 776 | /// Gets a value indicating whether the current transform can be reused. 777 | /// 778 | /// 779 | /// true if the current transform can be reused; otherwise, false. 780 | /// 781 | public virtual bool CanReuseTransform 782 | { 783 | get { return Mode == ExtendedCipherMode.ECB; } 784 | } 785 | 786 | /// 787 | /// Releases all resources used by the 788 | /// class. 789 | /// 790 | public void Clear() 791 | { 792 | Reset(); 793 | Dispose(); 794 | } 795 | } 796 | } -------------------------------------------------------------------------------- /Crypto/NonceCombinationMode.cs: -------------------------------------------------------------------------------- 1 | /* 2 | * DotNetCrypt - an open source library of cryptographic algorithms for .NET 3 | * Copyright (C) 2009 David Musgrove 4 | * 5 | * This file is part of DotNetCrypt. 6 | * 7 | * DotNetCrypt is free software: you can redistribute it and/or modify 8 | * it under the terms of the GNU General Public License as published by 9 | * the Free Software Foundation, either version 3 of the License, or 10 | * (at your option) any later version. 11 | * 12 | * DotNetCrypt is distributed in the hope that it will be useful, 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 | * GNU General Public License for more details. 16 | * 17 | * You should have received a copy of the GNU General Public License 18 | * along with this program. If not, see . 19 | */ 20 | 21 | namespace DotNetCrypt 22 | { 23 | /// 24 | /// Specfies the method used in counter 25 | /// () mode to combine the counter 26 | /// with the "nonce" (or initialization vector). 27 | /// 28 | public enum NonceCombinationMode 29 | { 30 | /// 31 | /// The counter and the nonce are combined using a bitwise 32 | /// exclusive OR operation. This option, which is the default in this 33 | /// implementation, allows for the greatest length of encrypted 34 | /// message. 35 | /// 36 | Xor = 0, 37 | /// 38 | /// THe counter and the nonce are combined using concatenation This 39 | /// option restricts the length of the message that can be processed 40 | /// in a way that depends onte length of the nonce. 41 | /// 42 | Concatenate, 43 | /// 44 | /// The counter and the nonce are combined using addition. This option 45 | /// restricts the length of the message that can be processed in a way 46 | /// that depends on the actual value of the nonce. 47 | /// 48 | Add 49 | } 50 | } -------------------------------------------------------------------------------- /Crypto/Serpent.cs: -------------------------------------------------------------------------------- 1 | /* 2 | * DotNetCrypt - an open source library of cryptographic algorithms for .NET 3 | * Copyright (C) 2009 David Musgrove 4 | * 5 | * This file is part of DotNetCrypt. 6 | * 7 | * DotNetCrypt is free software: you can redistribute it and/or modify 8 | * it under the terms of the GNU General Public License as published by 9 | * the Free Software Foundation, either version 3 of the License, or 10 | * (at your option) any later version. 11 | * 12 | * DotNetCrypt is distributed in the hope that it will be useful, 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 | * GNU General Public License for more details. 16 | * 17 | * You should have received a copy of the GNU General Public License 18 | * along with this program. If not, see . 19 | */ 20 | 21 | using System.Security.Cryptography; 22 | 23 | namespace DotNetCrypt 24 | { 25 | /// 26 | /// Abstract base class for implementations of Ross Anderson, Eli Biham and 27 | /// Lars Knudsen's Serpent algorithm. 28 | /// 29 | public abstract class Serpent : SymmetricAlgorithmBase 30 | { 31 | static private readonly KeySizes[] _legalBlockSizes = new[] { new KeySizes(0x80, 0x80, 0) }; 32 | static private readonly KeySizes[] _legalKeySizes = new[] { new KeySizes(0x80, 0x100, 0x40) }; 33 | 34 | /// 35 | /// Initializes a new instance of the class. 36 | /// 37 | protected Serpent() 38 | { 39 | KeySizeValue = 0x80; 40 | BlockSizeValue = 0x80; 41 | FeedbackSizeValue = BlockSizeValue; 42 | LegalBlockSizesValue = _legalBlockSizes; 43 | LegalKeySizesValue = _legalKeySizes; 44 | } 45 | 46 | /// 47 | /// Creates an instance of a cryptographic object to perform the 48 | /// algorithm. 49 | /// 50 | /// 51 | /// Creates an instance of a cryptographic object to perform the 52 | /// algorithm. 53 | /// 54 | /// 55 | /// A cryptographic object. 56 | /// 57 | static public new Serpent Create() 58 | { 59 | return Create("DotNetCrypt.Serpent"); 60 | } 61 | 62 | /// 63 | /// Creates an instance of a cryptographic object to perform the 64 | /// specified implementation of the algorithm. 65 | /// 66 | /// 67 | /// The name of the specified implementation of 68 | /// to use. 69 | /// 70 | /// 71 | /// A cryptographic object. 72 | /// 73 | static public new Serpent Create(string algName) 74 | { 75 | return (Serpent)CryptoConfig.CreateFromName(algName); 76 | } 77 | 78 | /// 79 | /// Determines whether the specified key is weak. 80 | /// 81 | /// 82 | /// The secret key to test for weakness. 83 | /// 84 | /// 85 | /// true if the key is weak; otherwise, false. 86 | /// 87 | public override bool IsWeakKey(byte[] rgbKey) 88 | { 89 | return false; 90 | } 91 | } 92 | } 93 | -------------------------------------------------------------------------------- /Crypto/SerpentManaged.cs: -------------------------------------------------------------------------------- 1 | /* 2 | * DotNetCrypt - an open source library of cryptographic algorithms for .NET 3 | * Copyright (C) 2009 David Musgrove 4 | * 5 | * This file is part of DotNetCrypt. 6 | * 7 | * DotNetCrypt is free software: you can redistribute it and/or modify 8 | * it under the terms of the GNU General Public License as published by 9 | * the Free Software Foundation, either version 3 of the License, or 10 | * (at your option) any later version. 11 | * 12 | * DotNetCrypt is distributed in the hope that it will be useful, 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 | * GNU General Public License for more details. 16 | * 17 | * You should have received a copy of the GNU General Public License 18 | * along with this program. If not, see . 19 | */ 20 | 21 | using System.Security.Cryptography; 22 | 23 | namespace DotNetCrypt 24 | { 25 | /// 26 | /// Accesses the managed version of the algorithm. 27 | /// This class cannot be inherited. 28 | /// 29 | public sealed class SerpentManaged : Serpent 30 | { 31 | /// 32 | /// Creates a symmetric decryptor object. 33 | /// 34 | /// 35 | /// Creates a symmetric decryptor object with the specified 36 | /// 37 | /// property and initialization vector 38 | /// (). 39 | /// 40 | /// 41 | /// A symmetric decryptor object. 42 | /// 43 | /// 44 | /// The secret key to use for the symmetric algorithm. 45 | /// 46 | /// 47 | /// The initialization vector to use for the symmetric algorithm. 48 | /// 49 | // ReSharper disable InconsistentNaming 50 | public override ICryptoTransform CreateDecryptor(byte[] rgbKey, byte[] rgbIV) 51 | // ReSharper restore InconsistentNaming 52 | { 53 | return Utils.NewEncryptor(this, typeof(SerpentManagedTransform), rgbKey, ExtendedMode, rgbIV, TransformDirection.Decrypt); 54 | } 55 | 56 | /// 57 | /// Creates a symmetric encryptor object. 58 | /// 59 | /// 60 | /// Creates a symmetric encryptor object with the specified 61 | /// 62 | /// property and initialization vector 63 | /// (). 64 | /// 65 | /// 66 | /// A symmetric encryptor object. 67 | /// 68 | /// 69 | /// The secret key to use for the symmetric algorithm. 70 | /// 71 | /// 72 | /// The initialization vector to use for the symmetric algorithm. 73 | /// 74 | // ReSharper disable InconsistentNaming 75 | public override ICryptoTransform CreateEncryptor(byte[] rgbKey, byte[] rgbIV) 76 | // ReSharper restore InconsistentNaming 77 | { 78 | return Utils.NewEncryptor(this, typeof(SerpentManagedTransform), rgbKey, ExtendedMode, rgbIV, TransformDirection.Encrypt); 79 | } 80 | } 81 | } 82 | -------------------------------------------------------------------------------- /Crypto/SymmetricAlgorithmBase.cs: -------------------------------------------------------------------------------- 1 | /* 2 | * DotNetCrypt - an open source library of cryptographic algorithms for .NET 3 | * Copyright (C) 2009 David Musgrove 4 | * 5 | * This file is part of DotNetCrypt. 6 | * 7 | * DotNetCrypt is free software: you can redistribute it and/or modify 8 | * it under the terms of the GNU General Public License as published by 9 | * the Free Software Foundation, either version 3 of the License, or 10 | * (at your option) any later version. 11 | * 12 | * DotNetCrypt is distributed in the hope that it will be useful, 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 | * GNU General Public License for more details. 16 | * 17 | * You should have received a copy of the GNU General Public License 18 | * along with this program. If not, see . 19 | */ 20 | 21 | using System; 22 | using System.Security.Cryptography; 23 | //using DotNetCrypt.Properties; 24 | 25 | namespace DotNetCrypt 26 | { 27 | #pragma warning disable 612,618 28 | /// 29 | /// An abstract base class for managed implementations of 30 | /// . 31 | /// 32 | /// 33 | /// This class introduces the property, 34 | /// allowing a wider range of block cipher chaining modes to be used. For 35 | /// this reason, the property is now marked with the 36 | /// . 37 | /// 38 | public abstract class SymmetricAlgorithmBase : SymmetricAlgorithm, ISymmetricAlgorithm 39 | #pragma warning restore 612,618 40 | { 41 | /// 42 | /// Gets or sets the mode for operation of the symmetric algorithm. 43 | /// 44 | /// 45 | /// Although this property will still work with this library, the use 46 | /// of the property, which adds support 47 | /// for mode, is preferred. 48 | /// 49 | /// 50 | /// The mode for operation of the symmetric algorithm. The default is 51 | /// . 52 | /// 53 | /// 54 | /// The cipher mode is not one of the values. 55 | /// 56 | #pragma warning disable 809 57 | [Obsolete("Use the ExtendedMode property instead.")] 58 | public override CipherMode Mode 59 | #pragma warning restore 809 60 | { 61 | get 62 | { 63 | if (ExtendedMode == ExtendedCipherMode.CTR) 64 | { 65 | throw new InvalidOperationException (); //Resources.OLD_CIPHER_MODE_CTR); 66 | } 67 | return (CipherMode)ExtendedMode; 68 | } 69 | set 70 | { 71 | ExtendedMode = (ExtendedCipherMode)value; 72 | } 73 | } 74 | 75 | /// 76 | /// Gets or sets the block cipher chaining mode to be used by this 77 | /// instance of the algorithm. 78 | /// 79 | /// 80 | /// If compatible, this property's setter also sets the underlying 81 | /// property, which is of the 82 | /// more restrictive type . The default mode 83 | /// is . 84 | /// 85 | /// 86 | /// The cipher mode is not one of the 87 | /// values. 88 | /// 89 | /// 90 | /// The block cipher chaining mode to be used by this instance of the 91 | /// algorithm. 92 | /// 93 | public ExtendedCipherMode ExtendedMode { get; set; } 94 | 95 | /// 96 | /// Gets or sets the method used to combine the counter value with the 97 | /// nonce in counter () mode. 98 | /// 99 | /// 100 | /// The mode is not one of the 101 | /// values. 102 | /// 103 | /// 104 | /// The method used to combine the counter value with the nonce in 105 | /// counter () mode. 106 | /// 107 | public NonceCombinationMode NonceCombinationMode { get; set; } 108 | 109 | /// 110 | /// Gets or sets the number of bytes to process at a time in cipher or 111 | /// output feedback ( or 112 | /// ) modes. 113 | /// 114 | /// 115 | /// If not set, this value will default to 1 byte, which provides 116 | /// compatibility with the CSP and .NET implementations of the 117 | /// modes. 118 | /// 119 | /// 120 | /// The number of bytes to process at a time in cipher or 121 | /// output feedback ( or 122 | /// ) modes. 123 | /// 124 | public int RegisterShiftSize { get; set; } 125 | 126 | /// 127 | /// Gets or sets the secret key for the symmetric algorithm. 128 | /// 129 | /// 130 | /// The secret key to use for the symmetric algorithm. 131 | /// 132 | /// 133 | /// An attempt was made to set the key to null. 134 | /// 135 | /// 136 | /// The key size is invalid. 137 | /// 138 | public override byte[] Key 139 | { 140 | get 141 | { 142 | if (KeyValue == null) 143 | { 144 | GenerateKey(); 145 | } 146 | // ReSharper disable PossibleNullReferenceException 147 | return (byte[])(KeyValue.Clone()); 148 | // ReSharper restore PossibleNullReferenceException 149 | } 150 | set 151 | { 152 | if (value == null) 153 | { 154 | throw new ArgumentNullException("value"); 155 | } 156 | if (!ValidKeySize(value.Length << 3)) 157 | { 158 | throw new ArgumentException("The specified key size is invalid"); 159 | } 160 | if (IsWeakKey(value)) 161 | { 162 | throw new CryptographicException("The specified key is a weak one", "Blowfish"); 163 | } 164 | KeyValue = (byte[])value.Clone(); 165 | KeySizeValue = value.Length << 3; 166 | } 167 | } 168 | 169 | /// 170 | /// Generates a random non-weak key 171 | /// () 172 | /// to use for the algorithm. 173 | /// 174 | public override void GenerateKey() 175 | { 176 | KeyValue = new byte[KeySizeValue >> 3]; 177 | do 178 | { 179 | Utils.RandomNumberGeneratorSingleton.GetBytes(KeyValue); 180 | } while (IsWeakKey(KeyValue)); 181 | } 182 | 183 | /// 184 | /// Returns a random non-weak key 185 | /// () 186 | /// to use for the algorithm. 187 | /// 188 | public byte[] GenerateNonWeakKey() 189 | { 190 | var key = new byte[KeySizeValue >> 3]; 191 | do 192 | { 193 | Utils.RandomNumberGeneratorSingleton.GetBytes(key); 194 | } while (IsWeakKey(key)); 195 | return key; 196 | } 197 | 198 | /// 199 | /// Generates a random initialization vector 200 | /// () 201 | /// to use for the algorithm. 202 | /// 203 | public override void GenerateIV() 204 | { 205 | IVValue = new byte[BlockSizeValue / 8]; 206 | Utils.RandomNumberGeneratorSingleton.GetBytes(IVValue); 207 | } 208 | 209 | /// 210 | /// Determines whether the specified key is weak. 211 | /// 212 | /// 213 | /// The secret key to test for weakness. 214 | /// 215 | /// 216 | /// true if the key is weak; otherwise, false. 217 | /// 218 | public abstract bool IsWeakKey(byte[] rgbKey); 219 | } 220 | } 221 | -------------------------------------------------------------------------------- /Crypto/TransformDirection.cs: -------------------------------------------------------------------------------- 1 | /* 2 | * DotNetCrypt - an open source library of cryptographic algorithms for .NET 3 | * Copyright (C) 2009 David Musgrove 4 | * 5 | * This file is part of DotNetCrypt. 6 | * 7 | * DotNetCrypt is free software: you can redistribute it and/or modify 8 | * it under the terms of the GNU General Public License as published by 9 | * the Free Software Foundation, either version 3 of the License, or 10 | * (at your option) any later version. 11 | * 12 | * DotNetCrypt is distributed in the hope that it will be useful, 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 | * GNU General Public License for more details. 16 | * 17 | * You should have received a copy of the GNU General Public License 18 | * along with this program. If not, see . 19 | */ 20 | 21 | namespace DotNetCrypt 22 | { 23 | /// 24 | /// Specifies the direction of the cryptographic operation. 25 | /// 26 | public enum TransformDirection 27 | { 28 | /// 29 | /// Data is to be encrypted. 30 | /// 31 | Encrypt, 32 | /// 33 | /// Data is to be decrypted. 34 | /// 35 | Decrypt 36 | } 37 | } 38 | -------------------------------------------------------------------------------- /Crypto/Utils.cs: -------------------------------------------------------------------------------- 1 | /* 2 | * DotNetCrypt - an open source library of cryptographic algorithms for .NET 3 | * Copyright (C) 2009 David Musgrove 4 | * 5 | * This file is part of DotNetCrypt. 6 | * 7 | * DotNetCrypt is free software: you can redistribute it and/or modify 8 | * it under the terms of the GNU General Public License as published by 9 | * the Free Software Foundation, either version 3 of the License, or 10 | * (at your option) any later version. 11 | * 12 | * DotNetCrypt is distributed in the hope that it will be useful, 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 | * GNU General Public License for more details. 16 | * 17 | * You should have received a copy of the GNU General Public License 18 | * along with this program. If not, see . 19 | */ 20 | 21 | using System; 22 | using System.Reflection; 23 | using System.Security.Cryptography; 24 | 25 | namespace DotNetCrypt 26 | { 27 | static internal class Utils 28 | { 29 | static private RNGCryptoServiceProvider _generator; 30 | static private readonly object _generatorSyncObject = new object(); 31 | 32 | static internal RNGCryptoServiceProvider RandomNumberGeneratorSingleton 33 | { 34 | get 35 | { 36 | if (_generator == null) 37 | { 38 | lock (_generatorSyncObject) 39 | { 40 | if (_generator == null) 41 | { 42 | _generator = new RNGCryptoServiceProvider(); 43 | } 44 | } 45 | } 46 | return _generator; 47 | } 48 | } 49 | 50 | static internal byte[] GenerateRandom(int length) 51 | { 52 | var result = new byte[length]; 53 | RandomNumberGeneratorSingleton.GetBytes(result); 54 | return result; 55 | } 56 | 57 | static internal bool IsStreamMode(ExtendedCipherMode mode) 58 | { 59 | return mode == ExtendedCipherMode.CFB || mode == ExtendedCipherMode.OFB || mode == ExtendedCipherMode.CTR; 60 | } 61 | 62 | static internal void Write16BitWordsIntoBytesBigEndian(ushort[] words, byte[] bytes) 63 | { 64 | int byteCount = bytes.Length; 65 | for (int byteIndex = 0, wordIndex = 0; byteIndex < byteCount; ) 66 | { 67 | bytes[byteIndex++] = (byte)(words[wordIndex] >> 8 & 0xff); 68 | bytes[byteIndex++] = (byte)(words[wordIndex++] & 0xff); 69 | } 70 | } 71 | 72 | static internal void Write16BitWordsIntoBytesLittleEndian(ushort[] words, byte[] bytes) 73 | { 74 | int byteCount = bytes.Length; 75 | for (int byteIndex = 0, wordIndex = 0; byteIndex < byteCount; ) 76 | { 77 | bytes[byteIndex++] = (byte)(words[wordIndex] & 0xff); 78 | bytes[byteIndex++] = (byte)(words[wordIndex++] >> 8 & 0xff); 79 | } 80 | } 81 | 82 | static internal void WriteWordsIntoBytesBigEndian(uint[] words, byte[] bytes) 83 | { 84 | int byteCount = bytes.Length; 85 | for (int byteIndex = 0, wordIndex = 0; byteIndex < byteCount; ) 86 | { 87 | bytes[byteIndex++] = (byte)(words[wordIndex] >> 24 & 0xff); 88 | bytes[byteIndex++] = (byte)(words[wordIndex] >> 16 & 0xff); 89 | bytes[byteIndex++] = (byte)(words[wordIndex] >> 8 & 0xff); 90 | bytes[byteIndex++] = (byte)(words[wordIndex++] & 0xff); 91 | } 92 | } 93 | 94 | static internal void Write64BitWordsIntoBytesBigEndian(ulong[] words, byte[] bytes) 95 | { 96 | int byteCount = bytes.Length; 97 | for (int byteIndex = 0, wordIndex = 0; byteIndex < byteCount; ) 98 | { 99 | bytes[byteIndex++] = (byte)(words[wordIndex] >> 56 & 0xff); 100 | bytes[byteIndex++] = (byte)(words[wordIndex] >> 48 & 0xff); 101 | bytes[byteIndex++] = (byte)(words[wordIndex] >> 40 & 0xff); 102 | bytes[byteIndex++] = (byte)(words[wordIndex] >> 32 & 0xff); 103 | bytes[byteIndex++] = (byte)(words[wordIndex] >> 24 & 0xff); 104 | bytes[byteIndex++] = (byte)(words[wordIndex] >> 16 & 0xff); 105 | bytes[byteIndex++] = (byte)(words[wordIndex] >> 8 & 0xff); 106 | bytes[byteIndex++] = (byte)(words[wordIndex++] & 0xff); 107 | } 108 | } 109 | 110 | static internal ushort[] BytesTo16BitWordsBigEndian(byte[] bytes) 111 | { 112 | int count = bytes.Length; 113 | var words = new ushort[count >> 1]; 114 | for (int byteIndex = 0, wordIndex = 0; byteIndex < count; ) 115 | { 116 | words[wordIndex++] = (ushort)((bytes[byteIndex++] << 8) | bytes[byteIndex++]); 117 | } 118 | return words; 119 | } 120 | 121 | static internal ushort[] BytesTo16BitWordsLittleEndian(byte[] bytes) 122 | { 123 | int count = bytes.Length; 124 | var words = new ushort[count >> 1]; 125 | for (int byteIndex = 0, wordIndex = 0; byteIndex < count; ) 126 | { 127 | words[wordIndex++] = (ushort)(bytes[byteIndex++] | (bytes[byteIndex++] << 8)); 128 | } 129 | return words; 130 | } 131 | 132 | static internal uint[] BytesToWordsBigEndian(byte[] bytes) 133 | { 134 | int count = bytes.Length; 135 | var words = new uint[count >> 2]; 136 | for (int byteIndex = 0, wordIndex = 0; byteIndex < count; ) 137 | { 138 | words[wordIndex++] = ((uint)bytes[byteIndex++] << 24) | ((uint)bytes[byteIndex++] << 16) | 139 | ((uint)bytes[byteIndex++] << 8) | bytes[byteIndex++]; 140 | } 141 | return words; 142 | } 143 | 144 | static internal uint[] BytesToWordsBigEndian(byte[] bytes, int start, int count) 145 | { 146 | var words = new uint[count >> 2]; 147 | for (int byteIndex = start, wordIndex = 0; byteIndex < start + count; ) 148 | { 149 | words[wordIndex++] = ((uint)bytes[byteIndex++] << 24) | ((uint)bytes[byteIndex++] << 16) | 150 | ((uint)bytes[byteIndex++] << 8) | bytes[byteIndex++]; 151 | } 152 | return words; 153 | } 154 | 155 | static internal ulong[] BytesTo64BitWordsBigEndian(byte[] bytes) 156 | { 157 | return BytesTo64BitWordsBigEndian(bytes, 0, bytes.Length); 158 | } 159 | 160 | static internal ulong[] BytesTo64BitWordsBigEndian(byte[] bytes, int start, int count) 161 | { 162 | var words = new ulong[count >> 3]; 163 | for (int byteIndex = start, wordIndex = 0; byteIndex < start + count; ) 164 | { 165 | words[wordIndex++] = ((ulong)bytes[byteIndex++] << 56) | ((ulong)bytes[byteIndex++] << 48) | 166 | ((ulong)bytes[byteIndex++] << 40) | ((ulong)bytes[byteIndex++] << 32) | 167 | ((ulong)bytes[byteIndex++] << 24) | ((ulong)bytes[byteIndex++] << 16) | 168 | ((ulong)bytes[byteIndex++] << 8) | bytes[byteIndex++]; 169 | } 170 | return words; 171 | } 172 | 173 | static internal void WriteWordsIntoBytesLittleEndian(uint[] words, byte[] bytes) 174 | { 175 | int byteCount = bytes.Length; 176 | for (int byteIndex = 0, wordIndex = 0; byteIndex < byteCount; ) 177 | { 178 | bytes[byteIndex++] = (byte)(words[wordIndex] & 0xff); 179 | bytes[byteIndex++] = (byte)(words[wordIndex] >> 8 & 0xff); 180 | bytes[byteIndex++] = (byte)(words[wordIndex] >> 16 & 0xff); 181 | bytes[byteIndex++] = (byte)(words[wordIndex++] >> 24 & 0xff); 182 | } 183 | } 184 | 185 | static internal void Write64BitWordsIntoBytesLittleEndian(ulong[] words, byte[] bytes) 186 | { 187 | int byteCount = bytes.Length; 188 | for (int byteIndex = 0, wordIndex = 0; byteIndex < byteCount; ) 189 | { 190 | bytes[byteIndex++] = (byte)(words[wordIndex] & 0xff); 191 | bytes[byteIndex++] = (byte)(words[wordIndex] >> 8 & 0xff); 192 | bytes[byteIndex++] = (byte)(words[wordIndex] >> 16 & 0xff); 193 | bytes[byteIndex++] = (byte)(words[wordIndex] >> 24 & 0xff); 194 | bytes[byteIndex++] = (byte)(words[wordIndex] >> 32 & 0xff); 195 | bytes[byteIndex++] = (byte)(words[wordIndex] >> 40 & 0xff); 196 | bytes[byteIndex++] = (byte)(words[wordIndex] >> 48 & 0xff); 197 | bytes[byteIndex++] = (byte)(words[wordIndex++] >> 56 & 0xff); 198 | } 199 | } 200 | 201 | static internal uint[] BytesToWordsLittleEndian(byte[] bytes) 202 | { 203 | return BytesToWordsLittleEndian(bytes, 0, bytes.Length); 204 | } 205 | 206 | static internal uint[] BytesToWordsLittleEndian(byte[] bytes, int start, int count) 207 | { 208 | var words = new uint[count >> 2]; 209 | for (int byteIndex = start, wordIndex = 0; byteIndex < start + count; ) 210 | { 211 | words[wordIndex++] = bytes[byteIndex++] | ((uint)bytes[byteIndex++] << 8) | 212 | ((uint)bytes[byteIndex++] << 16) | ((uint)bytes[byteIndex++] << 24); 213 | } 214 | return words; 215 | } 216 | 217 | static internal ulong[] BytesTo64BitWordsLittleEndian(byte[] bytes) 218 | { 219 | return BytesTo64BitWordsLittleEndian(bytes, 0, bytes.Length); 220 | } 221 | 222 | static internal ulong[] BytesTo64BitWordsLittleEndian(byte[] bytes, int start, int count) 223 | { 224 | var words = new ulong[count >> 3]; 225 | for (int byteIndex = start, wordIndex = 0; byteIndex < start + count; ) 226 | { 227 | words[wordIndex++] = bytes[byteIndex++] | ((ulong)bytes[byteIndex++] << 8) | 228 | ((ulong)bytes[byteIndex++] << 16) | ((ulong)bytes[byteIndex++] << 24) | 229 | ((ulong)bytes[byteIndex++] << 32) | ((ulong)bytes[byteIndex++] << 40) | 230 | ((ulong)bytes[byteIndex++] << 48) | ((ulong)bytes[byteIndex++] << 56); 231 | } 232 | return words; 233 | } 234 | 235 | static internal ICryptoTransform NewEncryptor(ISymmetricAlgorithm algorithm, Type type, byte[] rgbKey, ExtendedCipherMode mode, byte[] rgbIv, TransformDirection encryptDirection) 236 | { 237 | if (rgbKey == null) 238 | { 239 | rgbKey = algorithm.GenerateNonWeakKey(); 240 | } 241 | if ((mode != ExtendedCipherMode.ECB) && (rgbIv == null)) 242 | { 243 | rgbIv = new byte[algorithm.BlockSize / 8]; 244 | RandomNumberGeneratorSingleton.GetBytes(rgbIv); 245 | } 246 | ConstructorInfo constructor = type.GetConstructor(BindingFlags.Instance | BindingFlags.NonPublic, null, 247 | new[] { typeof(ISymmetricAlgorithm), typeof(byte[]), typeof(byte[]), 248 | typeof(TransformDirection)}, null); 249 | return (ICryptoTransform)constructor.Invoke(new object[] {algorithm, rgbKey, rgbIv, encryptDirection}); 250 | //return (ICryptoTransform)Activator.CreateInstance(type, BindingFlags.NonPublic, null, new object[] { algorithm, rgbKey, rgbIv, encryptDirection }, null); 251 | } 252 | } 253 | } 254 | -------------------------------------------------------------------------------- /License.txt: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /MakeDistribDebug.bat: -------------------------------------------------------------------------------- 1 | KeePass.exe NewDatabase.kdbx -pw:1 2 | CLS 3 | -------------------------------------------------------------------------------- /MakeDistribDebug.sh: -------------------------------------------------------------------------------- 1 | mono KeePass.exe NewDatabase.kdbx -pw:1 2 | -------------------------------------------------------------------------------- /MakeDistribRelease.bat: -------------------------------------------------------------------------------- 1 | SET z=D:\Apps\Core\7-Zip\7z.exe 2 | SET v=1.0 3 | SET foler=SerpentCipher 4 | 5 | mkdir %foler% 6 | xcopy ..\KeePass-SerpentCipher\*.cs %foler% /Y 7 | xcopy ..\KeePass-SerpentCipher\SerpentCipher.csproj %foler%\ /Y 8 | xcopy ..\KeePass-SerpentCipher\Properties %foler%\Properties /I /E /Y 9 | xcopy ..\KeePass-SerpentCipher\Crypto %foler%\Crypto /I /E /Y 10 | 11 | KeePass.exe --plgx-create %foler% 12 | del SerpentCipher.dll 13 | rd /s /q %foler% 14 | 15 | %z% a SerpentCipher-%v%.zip SerpentCipher.plgx 16 | %z% a SerpentCipher-%v%.zip License.txt 17 | %z% a SerpentCipher-%v%.zip Readme.txt 18 | 19 | rd /s /q ..\KeePass-SerpentCipher\obj 20 | %z% a SerpentCipher-%v%-Source.zip ..\KeePass-SerpentCipher 21 | %z% d SerpentCipher-%v%-Source.zip .git -r 22 | 23 | -------------------------------------------------------------------------------- /MakeDistribRelease.sh: -------------------------------------------------------------------------------- 1 | #!/bin/sh 2 | 3 | v=1.0 4 | foler=SerpentCipher 5 | 6 | rm -f *.zip 7 | mkdir -p $foler 8 | cp ../KeePass-SerpentCipher/*.cs ../KeePass-SerpentCipher/*.csproj $foler 9 | cp -r ../KeePass-SerpentCipher/Properties ../KeePass-SerpentCipher/Crypto $foler 10 | 11 | mono KeePass.exe --plgx-create $foler 12 | rm SerpentCipher.dll 13 | rm -rf $foler 14 | 15 | zip SerpentCipher-$v.zip SerpentCipher.plgx License.txt Readme.txt 16 | 17 | rm -rf ../KeePass-SerpentCipher/obj 18 | 19 | cd .. 20 | zip -r Build/SerpentCipher-$v-Source.zip KeePass-SerpentCipher -x '*/.git*' 21 | -------------------------------------------------------------------------------- /Properties/AssemblyInfo.cs: -------------------------------------------------------------------------------- 1 | /* 2 | Serpent Cipher for KeePass Password Safe 3 | Copyright (C) 2015 Timothy Redaelli 4 | 5 | based on TwofishCipher by SEG Tech 6 | 7 | This program is free software; you can redistribute it and/or modify 8 | it under the terms of the GNU General Public License as published by 9 | the Free Software Foundation; either version 2 of the License, or 10 | (at your option) any later version. 11 | 12 | This program is distributed in the hope that it will be useful, 13 | but WITHOUT ANY WARRANTY; without even the implied warranty of 14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 | GNU General Public License for more details. 16 | 17 | You should have received a copy of the GNU General Public License 18 | along with this program; if not, write to the Free Software 19 | Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA 20 | */ 21 | 22 | using System.Reflection; 23 | using System.Runtime.CompilerServices; 24 | using System.Runtime.InteropServices; 25 | 26 | // General assembly properties 27 | [assembly: AssemblyTitle("Serpent Cipher")] 28 | [assembly: AssemblyDescription("Enables KeePass to encrypt databases using the Serpent algorithm.")] 29 | [assembly: AssemblyConfiguration("")] 30 | [assembly: AssemblyCompany("Timothy Redaelli")] 31 | [assembly: AssemblyProduct("KeePass Plugin")] 32 | [assembly: AssemblyCopyright("Copyright © 2015 Timothy Redaelli")] 33 | [assembly: AssemblyTrademark("")] 34 | [assembly: AssemblyCulture("")] 35 | 36 | // COM settings 37 | [assembly: ComVisible(false)] 38 | 39 | // Assembly GUID 40 | [assembly: Guid("098563FF-DDF7-4F98-8619-8079F6DB897A")] 41 | 42 | // Assembly version information 43 | [assembly: AssemblyVersion("2.0.9.*")] 44 | [assembly: AssemblyFileVersion("1.0.0.0")] 45 | -------------------------------------------------------------------------------- /Readme.txt: -------------------------------------------------------------------------------- 1 | Serpent Cipher for KeePass Password Safe 2 | Copyright (C) 2015 Timothy Redaelli 3 | 4 | Based on Twofish Cipher for KeePass Password Safe 5 | Copyright (C) 2009-2010 SEG Tech 6 | 7 | PREFACE 8 | 9 | Enables KeePass to encrypt databases using the Serpent algorithm. 10 | 11 | REQUIREMENTS 12 | 13 | This plugin requires KeePass 2.09 and higher. 14 | 15 | INSTALLATION 16 | 17 | Just copy SerpentCipher.plgx to the same directory where KeePass.exe is located 18 | and KeePass should automatically recognize, compile and load the plugin. 19 | 20 | CREDITS 21 | 22 | Many thanks to Dominik Reichl for creating KeePass Password Safe, without which, 23 | this plugin would not exist. Thanks also goes to DotNetCrypt team for C# 24 | implementation of cryptography algorithms not included in the .NET framework 25 | (in this plugin I only use the Serpent implementation). 26 | -------------------------------------------------------------------------------- /SerpentCipher.csproj: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | Debug 5 | AnyCPU 6 | 8.0.30703 7 | 2.0 8 | {AD68F29F-576F-4BB9-A36A-D47AF965346C} 9 | Library 10 | Properties 11 | SerpentCipher 12 | SerpentCipher 13 | false 14 | 15 | 16 | 2.0 17 | 18 | 19 | False 20 | False 21 | false 22 | False 23 | File 24 | OnBuildSuccess 25 | False 26 | 27 | 28 | true 29 | Full 30 | false 31 | ..\Build\ 32 | DEBUG;TRACE 33 | prompt 34 | 4 35 | False 36 | Auto 37 | 4194304 38 | 4096 39 | AnyCPU 40 | 41 | 42 | pdbonly 43 | true 44 | ..\Build\ 45 | TRACE 46 | prompt 47 | 4 48 | False 49 | Auto 50 | 4194304 51 | 4096 52 | AnyCPU 53 | 54 | 55 | False 56 | 57 | 58 | False 59 | Auto 60 | 4194304 61 | AnyCPU 62 | 4096 63 | 64 | 65 | 66 | 67 | 68 | 69 | ..\Build\KeePass.exe 70 | 71 | 72 | 73 | 74 | 75 | Always 76 | 77 | 78 | 79 | Always 80 | 81 | 82 | Always 83 | 84 | 85 | Always 86 | 87 | 88 | 89 | 90 | 91 | 92 | 93 | 94 | 95 | 96 | 97 | 98 | 99 | 100 | 101 | 102 | 103 | 110 | 111 | ..\KeePass-SerpentCipher\MakeDistribDebug.bat 112 | ..\KeePass-SerpentCipher\MakeDistribDebug.sh 113 | 114 | 115 | 116 | 117 | 118 | 119 | -------------------------------------------------------------------------------- /SerpentCipher.sln: -------------------------------------------------------------------------------- 1 |  2 | Microsoft Visual Studio Solution File, Format Version 11.00 3 | # Visual Studio 2010 4 | Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "SerpentCipher", "SerpentCipher.csproj", "{AD68F29F-576F-4BB9-A36A-D47AF965346C}" 5 | EndProject 6 | Global 7 | GlobalSection(SolutionConfigurationPlatforms) = preSolution 8 | Debug|Any CPU = Debug|Any CPU 9 | Release|Any CPU = Release|Any CPU 10 | EndGlobalSection 11 | GlobalSection(ProjectConfigurationPlatforms) = postSolution 12 | {AD68F29F-576F-4BB9-A36A-D47AF965346C}.Debug|Any CPU.ActiveCfg = Debug|Any CPU 13 | {AD68F29F-576F-4BB9-A36A-D47AF965346C}.Debug|Any CPU.Build.0 = Debug|Any CPU 14 | {AD68F29F-576F-4BB9-A36A-D47AF965346C}.Release|Any CPU.ActiveCfg = Release|Any CPU 15 | {AD68F29F-576F-4BB9-A36A-D47AF965346C}.Release|Any CPU.Build.0 = Release|Any CPU 16 | EndGlobalSection 17 | GlobalSection(SolutionProperties) = preSolution 18 | HideSolutionNode = FALSE 19 | EndGlobalSection 20 | EndGlobal 21 | -------------------------------------------------------------------------------- /SerpentCipherEngine.cs: -------------------------------------------------------------------------------- 1 | /* 2 | Serpent Cipher for KeePass Password Safe 3 | Copyright (C) 2015 Timothy Redaelli 4 | 5 | based on TwofishCipher by SEG Tech 6 | 7 | This program is free software; you can redistribute it and/or modify 8 | it under the terms of the GNU General Public License as published by 9 | the Free Software Foundation; either version 2 of the License, or 10 | (at your option) any later version. 11 | 12 | This program is distributed in the hope that it will be useful, 13 | but WITHOUT ANY WARRANTY; without even the implied warranty of 14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 | GNU General Public License for more details. 16 | 17 | You should have received a copy of the GNU General Public License 18 | along with this program; if not, write to the Free Software 19 | Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA 20 | */ 21 | 22 | using System; 23 | using System.Collections.Generic; 24 | using System.Text; 25 | using System.IO; 26 | using System.Security; 27 | using System.Security.Cryptography; 28 | using System.Diagnostics; 29 | 30 | using KeePassLib; 31 | using KeePassLib.Cryptography.Cipher; 32 | 33 | using DotNetCrypt; 34 | 35 | namespace SerpentCipher 36 | { 37 | public sealed class SerpentCipherEngine : ICipherEngine 38 | { 39 | private const CipherMode m_rCipherMode = CipherMode.CBC; 40 | private const PaddingMode m_rCipherPadding = PaddingMode.PKCS7; 41 | 42 | private PwUuid m_uuidCipher; 43 | 44 | private static readonly byte[] SerpentCipherUuidBytes = new byte[]{ 45 | 0x09, 0x85, 0x63, 0xFF, 0xDD, 0xF7, 0x4F, 0x98, 46 | 0x86, 0x19, 0x80, 0x79, 0xF6, 0xDB, 0x89, 0x7A 47 | }; 48 | 49 | public SerpentCipherEngine() 50 | { 51 | m_uuidCipher = new PwUuid(SerpentCipherUuidBytes); 52 | } 53 | 54 | public PwUuid CipherUuid 55 | { 56 | get 57 | { 58 | Debug.Assert(m_uuidCipher != null); 59 | return m_uuidCipher; 60 | } 61 | } 62 | 63 | public string DisplayName 64 | { 65 | get { return "Serpent (256-Bit Key)"; } 66 | } 67 | 68 | private static void ValidateArguments(Stream stream, bool bEncrypt, byte[] pbKey, byte[] pbIV) 69 | { 70 | Debug.Assert(stream != null); if(stream == null) throw new ArgumentNullException("stream"); 71 | 72 | Debug.Assert(pbKey != null); if(pbKey == null) throw new ArgumentNullException("pbKey"); 73 | Debug.Assert(pbKey.Length == 32); 74 | if(pbKey.Length != 32) throw new ArgumentException("Key must be 256 bits wide!"); 75 | 76 | Debug.Assert(pbIV != null); if(pbIV == null) throw new ArgumentNullException("pbIV"); 77 | Debug.Assert(pbIV.Length == 16); 78 | if(pbIV.Length != 16) throw new ArgumentException("Initialization vector must be 128 bits wide!"); 79 | 80 | if(bEncrypt) 81 | { 82 | Debug.Assert(stream.CanWrite); 83 | if(stream.CanWrite == false) throw new ArgumentException("Stream must be writable!"); 84 | } 85 | else // Decrypt 86 | { 87 | Debug.Assert(stream.CanRead); 88 | if(stream.CanRead == false) throw new ArgumentException("Encrypted stream must be readable!"); 89 | } 90 | } 91 | 92 | private static Stream CreateStream(Stream s, bool bEncrypt, byte[] pbKey, byte[] pbIV) 93 | { 94 | ValidateArguments(s, bEncrypt, pbKey, pbIV); 95 | 96 | Serpent f = new SerpentManaged(); 97 | 98 | byte[] pbLocalIV = new byte[16]; 99 | Array.Copy(pbIV, pbLocalIV, 16); 100 | f.IV = pbLocalIV; 101 | 102 | byte[] pbLocalKey = new byte[32]; 103 | Array.Copy(pbKey, pbLocalKey, 32); 104 | f.KeySize = 256; 105 | f.Key = pbLocalKey; 106 | 107 | f.Mode = m_rCipherMode; 108 | f.Padding = m_rCipherPadding; 109 | 110 | ICryptoTransform iTransform = (bEncrypt ? f.CreateEncryptor() : f.CreateDecryptor()); 111 | Debug.Assert(iTransform != null); 112 | if(iTransform == null) throw new SecurityException("Unable to create Serpent transform!"); 113 | 114 | return new CryptoStream(s, iTransform, bEncrypt ? CryptoStreamMode.Write : 115 | CryptoStreamMode.Read); 116 | } 117 | 118 | public Stream EncryptStream(Stream sPlainText, byte[] pbKey, byte[] pbIV) 119 | { 120 | return CreateStream(sPlainText, true, pbKey, pbIV); 121 | } 122 | 123 | public Stream DecryptStream(Stream sEncrypted, byte[] pbKey, byte[] pbIV) 124 | { 125 | return CreateStream(sEncrypted, false, pbKey, pbIV); 126 | } 127 | 128 | } 129 | } 130 | -------------------------------------------------------------------------------- /SerpentCipherExt.cs: -------------------------------------------------------------------------------- 1 | /* 2 | Serpent Cipher for KeePass Password Safe 3 | Copyright (C) 2015 Timothy Redaelli 4 | 5 | based on TwofishCipher by SEG Tech 6 | 7 | This program is free software; you can redistribute it and/or modify 8 | it under the terms of the GNU General Public License as published by 9 | the Free Software Foundation; either version 2 of the License, or 10 | (at your option) any later version. 11 | 12 | This program is distributed in the hope that it will be useful, 13 | but WITHOUT ANY WARRANTY; without even the implied warranty of 14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 | GNU General Public License for more details. 16 | 17 | You should have received a copy of the GNU General Public License 18 | along with this program; if not, write to the Free Software 19 | Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA 20 | */ 21 | 22 | using System; 23 | using System.Collections.Generic; 24 | using System.Text; 25 | using System.Diagnostics; 26 | 27 | using KeePass.Plugins; 28 | 29 | namespace SerpentCipher 30 | { 31 | public sealed class SerpentCipherExt : Plugin 32 | { 33 | private IPluginHost m_host = null; 34 | private static SerpentCipherEngine m_SerpentCipherEngine = new SerpentCipherEngine(); 35 | 36 | public override bool Initialize(IPluginHost host) 37 | { 38 | if(host == null) return false; 39 | m_host = host; 40 | 41 | Debug.Assert(m_SerpentCipherEngine != null); 42 | if(m_SerpentCipherEngine == null) return false; 43 | 44 | m_host.CipherPool.AddCipher(m_SerpentCipherEngine); 45 | 46 | return true; 47 | } 48 | } 49 | } 50 | --------------------------------------------------------------------------------