SHA512Managed.cs :  » 2.6.4-mono-.net-core » System.Security » System » Security » Cryptography » C# / CSharp Open Source

Home
C# / CSharp Open Source
1.2.6.4 mono .net core
2.2.6.4 mono core
3.Aspect Oriented Frameworks
4.Bloggers
5.Build Systems
6.Business Application
7.Charting Reporting Tools
8.Chat Servers
9.Code Coverage Tools
10.Content Management Systems CMS
11.CRM ERP
12.Database
13.Development
14.Email
15.Forum
16.Game
17.GIS
18.GUI
19.IDEs
20.Installers Generators
21.Inversion of Control Dependency Injection
22.Issue Tracking
23.Logging Tools
24.Message
25.Mobile
26.Network Clients
27.Network Servers
28.Office
29.PDF
30.Persistence Frameworks
31.Portals
32.Profilers
33.Project Management
34.RSS RDF
35.Rule Engines
36.Script
37.Search Engines
38.Sound Audio
39.Source Control
40.SQL Clients
41.Template Engines
42.Testing
43.UML
44.Web Frameworks
45.Web Service
46.Web Testing
47.Wiki Engines
48.Windows Presentation Foundation
49.Workflows
50.XML Parsers
C# / C Sharp
C# / C Sharp by API
C# / CSharp Tutorial
C# / CSharp Open Source » 2.6.4 mono .net core » System.Security 
System.Security » System » Security » Cryptography » SHA512Managed.cs
//
// System.Security.Cryptography.SHA512Managed.cs
//
// Authors:
//  Dan Lewis (dihlewis@yahoo.co.uk)
//  Sebastien Pouliot (sebastien@ximian.com)
//
// (C) 2002
// Implementation translated from Bouncy Castle JCE (http://www.bouncycastle.org/)
// See bouncycastle.txt for license.
// Copyright (C) 2004-2005 Novell, Inc (http://www.novell.com)
//
// Permission is hereby granted, free of charge, to any person obtaining
// a copy of this software and associated documentation files (the
// "Software"), to deal in the Software without restriction, including
// without limitation the rights to use, copy, modify, merge, publish,
// distribute, sublicense, and/or sell copies of the Software, and to
// permit persons to whom the Software is furnished to do so, subject to
// the following conditions:
// 
// The above copyright notice and this permission notice shall be
// included in all copies or substantial portions of the Software.
// 
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
// LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
// OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
//

#if !MOONLIGHT

using System.Runtime.InteropServices;

namespace System.Security.Cryptography{
  
[ComVisible (true)]
public class SHA512Managed : SHA512 {

  private byte[] xBuf;
  private int xBufOff;

  private ulong byteCount1;
  private ulong byteCount2;

  private ulong H1, H2, H3, H4, H5, H6, H7, H8;

  private ulong[] W;
  private int wOff;

  public SHA512Managed () 
  {
    xBuf = new byte [8];
    W = new ulong [80];
    Initialize (false); // limited initialization
  }

  private void Initialize (bool reuse) 
  {
    // SHA-512 initial hash value
    // The first 64 bits of the fractional parts of the square roots
    // of the first eight prime numbers
    H1 = 0x6a09e667f3bcc908L;
    H2 = 0xbb67ae8584caa73bL;
    H3 = 0x3c6ef372fe94f82bL;
    H4 = 0xa54ff53a5f1d36f1L;
    H5 = 0x510e527fade682d1L;
    H6 = 0x9b05688c2b3e6c1fL;
    H7 = 0x1f83d9abfb41bd6bL;
    H8 = 0x5be0cd19137e2179L;

    if (reuse) {
      byteCount1 = 0;
      byteCount2 = 0;

      xBufOff = 0;
      for (int i = 0; i < xBuf.Length; i++) 
        xBuf [i] = 0;

      wOff = 0;
      for (int i = 0; i != W.Length; i++)
        W [i] = 0;
    }
  }

  public override void Initialize () 
  {
    Initialize (true); // reuse instance
  }

  // protected

  protected override void HashCore (byte[] rgb, int ibStart, int cbSize) 
  {
    // fill the current word
    while ((xBufOff != 0) && (cbSize > 0)) {
      update (rgb [ibStart]);
      ibStart++;
      cbSize--;
    }

    // process whole words.
    while (cbSize > xBuf.Length) {
      processWord (rgb, ibStart);
      ibStart += xBuf.Length;
      cbSize -= xBuf.Length;
      byteCount1 += (ulong) xBuf.Length;
    }

    // load in the remainder.
    while (cbSize > 0) {
      update (rgb [ibStart]);
      ibStart++;
      cbSize--;
    }
  }

  protected override byte[] HashFinal () 
  {
    adjustByteCounts ();

    ulong lowBitLength = byteCount1 << 3;
    ulong hiBitLength = byteCount2;

    // add the pad bytes.
    update (128);
    while (xBufOff != 0)
      update (0);

    processLength (lowBitLength, hiBitLength);
    processBlock ();
  
    byte[] output = new byte [64];
    unpackWord(H1, output, 0);
    unpackWord(H2, output, 8);
    unpackWord(H3, output, 16);
    unpackWord(H4, output, 24);
    unpackWord(H5, output, 32);
    unpackWord(H6, output, 40);
          unpackWord(H7, output, 48);
    unpackWord(H8, output, 56);

    Initialize ();
    return output;
  }

  private void update (byte input) 
  {
    xBuf [xBufOff++] = input;
    if (xBufOff == xBuf.Length) {
      processWord(xBuf, 0);
      xBufOff = 0;
    }
    byteCount1++;
  }

  private void processWord (byte[] input, int inOff) 
  {
    W [wOff++] = ( (ulong) input [inOff] << 56)
      | ( (ulong) input [inOff + 1] << 48)
      | ( (ulong) input [inOff + 2] << 40)
      | ( (ulong) input [inOff + 3] << 32)
      | ( (ulong) input [inOff + 4] << 24)
      | ( (ulong) input [inOff + 5] << 16)
      | ( (ulong) input [inOff + 6] << 8)
      | ( (ulong) input [inOff + 7]); 
    if (wOff == 16)
      processBlock ();
  }

  private void unpackWord (ulong word, byte[] output, int outOff) 
  {
    output[outOff]     = (byte) (word >> 56);
    output[outOff + 1] = (byte) (word >> 48);
    output[outOff + 2] = (byte) (word >> 40);
    output[outOff + 3] = (byte) (word >> 32);
    output[outOff + 4] = (byte) (word >> 24);
    output[outOff + 5] = (byte) (word >> 16);
    output[outOff + 6] = (byte) (word >> 8);
    output[outOff + 7] = (byte) word;
  }

  // adjust the byte counts so that byteCount2 represents the
  // upper long (less 3 bits) word of the byte count.
  private void adjustByteCounts () 
  {
    if (byteCount1 > 0x1fffffffffffffffL) {
      byteCount2 += (byteCount1 >> 61);
      byteCount1 &= 0x1fffffffffffffffL;
    }
  }

  private void processLength (ulong lowW, ulong hiW) 
  {
    if (wOff > 14)
      processBlock();
    W[14] = hiW;
    W[15] = lowW;
  }

  private void processBlock () 
  {
    adjustByteCounts ();
    // expand 16 word block into 80 word blocks.
    for (int t = 16; t <= 79; t++)
      W[t] = Sigma1 (W [t - 2]) + W [t - 7] + Sigma0 (W [t - 15]) + W [t - 16];

    // set up working variables.
    ulong a = H1;
    ulong b = H2;
    ulong c = H3;
    ulong d = H4;
    ulong e = H5;
    ulong f = H6;
    ulong g = H7;
    ulong h = H8;

    for (int t = 0; t <= 79; t++) {
      ulong T1 = h + Sum1 (e) + Ch (e, f, g) + SHAConstants.K2 [t] + W [t];
      ulong T2 = Sum0 (a) + Maj (a, b, c);
      h = g;
      g = f;
      f = e;
      e = d + T1;
      d = c;
      c = b;
      b = a;
      a = T1 + T2;
    }

    H1 += a;
    H2 += b;
    H3 += c;
    H4 += d;
    H5 += e;
    H6 += f;
    H7 += g;
    H8 += h;
    // reset the offset and clean out the word buffer.
    wOff = 0;
    for (int i = 0; i != W.Length; i++)
      W[i] = 0;
  }

  private ulong rotateRight (ulong x, int n) 
  {
    return (x >> n) | (x << (64 - n));
  }

  /* SHA-512 and SHA-512 functions (as for SHA-256 but for longs) */
  private ulong Ch (ulong x, ulong y, ulong z) 
  {
    return ((x & y) ^ ((~x) & z));
  }

  private ulong Maj (ulong x, ulong y, ulong z) 
  {
    return ((x & y) ^ (x & z) ^ (y & z));
  }

  private ulong Sum0 (ulong x) 
  {
    return rotateRight (x, 28) ^ rotateRight (x, 34) ^ rotateRight (x, 39);
  }

  private ulong Sum1 (ulong x) 
  {
    return rotateRight (x, 14) ^ rotateRight (x, 18) ^ rotateRight (x, 41);
  }

  private ulong Sigma0 (ulong x) 
  {
    return rotateRight (x, 1) ^ rotateRight(x, 8) ^ (x >> 7);
  }

  private ulong Sigma1 (ulong x) 
  {
    return rotateRight (x, 19) ^ rotateRight (x, 61) ^ (x >> 6);
  }
}

}

#endif

www.java2v.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.