From c41af99536c9a1278880952cef4ff8150b113f0e Mon Sep 17 00:00:00 2001 From: lukeIam Date: Thu, 10 Oct 2013 14:56:34 +0200 Subject: [PATCH] ServerLib Cleanup: removed unused classes + rename --- ClientServerLib/ClientServerLib/CClient.cs | 405 --- .../ClientServerLib/CConnection.cs | 307 -- ClientServerLib/ClientServerLib/CDiscover.cs | 250 +- ClientServerLib/ClientServerLib/CServer.cs | 2 +- .../ClientServerLib/CWebservice.cs | 564 ++-- .../ClientServerLib/DataStructs.cs | 248 +- .../ClientServerLib/DeffieHellman/BigInt.cs | 2975 ----------------- .../DeffieHellman/DeffieHellman.cs | 179 - .../DeffieHellman/StrongNumberProvider.cs | 33 - ...lientServerLib.csproj => ServerLib.csproj} | 8 +- ClientServerLib/ClientServerLib/Structs.cs | 21 - Vocaluxe.sln | 2 +- Vocaluxe/Base/Server/CVocaluxeServer.cs | 2 +- Vocaluxe/Vocaluxe.csproj | 4 +- 14 files changed, 537 insertions(+), 4463 deletions(-) delete mode 100644 ClientServerLib/ClientServerLib/CClient.cs delete mode 100644 ClientServerLib/ClientServerLib/CConnection.cs delete mode 100644 ClientServerLib/ClientServerLib/DeffieHellman/BigInt.cs delete mode 100644 ClientServerLib/ClientServerLib/DeffieHellman/DeffieHellman.cs delete mode 100644 ClientServerLib/ClientServerLib/DeffieHellman/StrongNumberProvider.cs rename ClientServerLib/ClientServerLib/{ClientServerLib.csproj => ServerLib.csproj} (88%) delete mode 100644 ClientServerLib/ClientServerLib/Structs.cs diff --git a/ClientServerLib/ClientServerLib/CClient.cs b/ClientServerLib/ClientServerLib/CClient.cs deleted file mode 100644 index 6dc64669..00000000 --- a/ClientServerLib/ClientServerLib/CClient.cs +++ /dev/null @@ -1,405 +0,0 @@ -using System; -using System.Collections.Generic; -using System.Linq; -using System.Net; -using System.Net.Sockets; -using System.Text; -using System.Threading; - - -namespace ClientServerLib -{ - public class CClient - { - private bool doConnect; - private bool connected; - private bool running; - private int bufferLength = 8192; - - private Thread clientThread; - private IPEndPoint serverEndPoint; - private string ip; - private int port; - - private CConnection connection; - private List requests; - private List responses; - private Object mutexRequests = new Object(); - private OnConnectionChanged onConnectionChanged; - private OnSend onSend; - private OnReceived onReceived; - - private byte[] data; - - public bool Connected - { - get { return connected; } - } - - public CClient() - { - doConnect = false; - connected = false; - running = true; - requests = new List(); - responses = new List(); - data = new byte[bufferLength]; - - connection = new CConnection(new TcpClient(), -1); - } - - public void Connect(string IP = "127.0.0.1", int Port = 3000, string Password = null, - OnConnectionChanged OnConnectionChanged = null, - OnSend OnSend = null, - OnReceived OnReceived = null) - { - if (!doConnect) - { - onConnectionChanged = OnConnectionChanged; - onSend = OnSend; - onReceived = OnReceived; - - ip = IP; - port = Port; - connection.Password = Password; - doConnect = true; - - if (clientThread == null) - { - running = true; - clientThread = new Thread(new ThreadStart(Runner)); - clientThread.Start(); - } - } - } - - public void Disconnect() - { - if (doConnect) - { - doConnect = false; - - lock (mutexRequests) - { - requests.Clear(); - } - - lock (responses) - { - responses.Clear(); - } - } - } - - public void Close() - { - running = false; - - if (clientThread != null) - clientThread.Join(100); - - clientThread = null; - DoDisconnect(); - } - - public void SendMessage(byte[] Message, ResponseCallback Callback) - { - SRequest req = new SRequest(); - req.Command = Message; - req.Callback = Callback; - req.Response = null; - - lock (mutexRequests) - { - requests.Add(req); - } - } - - private void Runner() - { - while (running) - { - if (!connected && doConnect) - { - try - { - IPAddress resolvedIP; - if (TryResolveIPAddress(ip, out resolvedIP)) - { - serverEndPoint = new IPEndPoint(resolvedIP, port); - connection.TcpClient.Connect(serverEndPoint); - connected = true; - RaiseOnConnectionChanged(); - } - } - catch - { - DoDisconnect(); - - for (int i = 0; i < 500; i++) - { - if (running && doConnect) - Thread.Sleep(10); - else - break; - } - - } - } - - if (connected && !doConnect) - { - DoDisconnect(); - } - - if (doConnect && connected) - { - try - { - Communicate(); - Thread.Sleep(10); - } - catch - { - DoDisconnect(); - } - - } - - if (!doConnect && !connected) - { - for (int i = 0; i < 500; i++) - { - if (running && !doConnect) - Thread.Sleep(10); - else - break; - } - } - } - } - - public bool TryResolveIPAddress(string serverNameOrURL, out IPAddress resolvedIPAddress) - { - bool isResolved = false; - IPHostEntry hostEntry = null; - IPAddress resolvIP = null; - try - { - if (!IPAddress.TryParse(serverNameOrURL, out resolvIP)) - { - hostEntry = Dns.GetHostEntry(serverNameOrURL); - if (hostEntry != null && hostEntry.AddressList != null && hostEntry.AddressList.Length > 0) - { - if (hostEntry.AddressList.Length == 1) - { - resolvIP = hostEntry.AddressList[0]; - isResolved = true; - } - else - { - foreach (IPAddress var in hostEntry.AddressList) - { - if (var.AddressFamily == AddressFamily.InterNetwork) - { - resolvIP = var; - isResolved = true; - break; - } - } - } - } - } - else - isResolved = true; - } - catch (Exception) {} - finally - { - resolvedIPAddress = resolvIP; - } - return isResolved; - } - - private void DoDisconnect() - { - try - { - connection.TcpClient.Close(); - } - catch { } - - connection = new CConnection(new TcpClient(), -1); - connected = false; - doConnect = false; - RaiseOnConnectionChanged(); - } - - private void Communicate() - { - if (connection.TcpClient == null || !connection.TcpClient.Connected) - DoDisconnect(); - - NetworkStream clientStream = connection.TcpClient.GetStream(); - - int bytesRead; - - if (!connection.KeySet) - { - bytesRead = 0; - - try - { - bytesRead = clientStream.Read(data, 0, bufferLength); - } - catch - { - return; - } - - if (bytesRead == 0) - return; - - byte[] serverParam = new byte[bytesRead]; - Array.Copy(data, serverParam, bytesRead); - RaiseOnReceived(serverParam); - - byte[] clientResponse = connection.CreateClientKey(serverParam); - RaiseOnSend(clientResponse); - clientStream.Write(clientResponse, 0, clientResponse.Length); - clientStream.Flush(); - } - else - { - try - { - while (requests.Count > 0) - { - SRequest res = HandleRequest(requests[0]); - lock (responses) - { - responses.Add(res); - } - - lock (mutexRequests) - { - requests.RemoveAt(0); - } - } - } - catch { }; - - lock (responses) - { - while (responses.Count > 0) - { - try - { - if (responses[0].Callback != null) - responses[0].Callback(responses[0].Response); - } - finally - { - responses.RemoveAt(0); - } - } - } - - } - } - - private SRequest HandleRequest(SRequest request) - { - SRequest response = new SRequest(); - response.Command = request.Command; - response.Callback = request.Callback; - response.Response = null; - - NetworkStream clientStream = connection.TcpClient.GetStream(); - - RaiseOnSend(request.Command); - byte[] encrypted = connection.Encrypt(request.Command); - - int sendBytes = 0; - while(sendBytes < encrypted.Length) - { - int bytesToSend = encrypted.Length - sendBytes; - if (bytesToSend > bufferLength) - bytesToSend = bufferLength; - - clientStream.Write(encrypted, sendBytes, bytesToSend); - sendBytes += bytesToSend; - } - clientStream.Flush(); - - byte[] data = new byte[bufferLength]; - int bytesRead = 0; - - try - { - bytesRead = clientStream.Read(data, 0, bufferLength); - } - catch - { - return response; - } - - if (bytesRead == 0) - return response; - - int messageLength = BitConverter.ToInt32(data, 0); - while (messageLength > bytesRead) - { - if (data.Length < messageLength + bufferLength) - Array.Resize(ref data, messageLength + bufferLength); - bytesRead += clientStream.Read(data, bytesRead, bufferLength); - } - - encrypted = new byte[bytesRead]; - Array.Copy(data, encrypted, bytesRead); - response.Response = connection.Decrypt(encrypted); - RaiseOnReceived(response.Response); - - return response; - } - - private void RaiseOnConnectionChanged() - { - if (onConnectionChanged == null) - return; - - try - { - onConnectionChanged(connected); - } - catch (Exception e) - { - Console.WriteLine (e.Message); - } - } - - private void RaiseOnSend(byte[] Message) - { - if (onSend == null) - return; - - try - { - onSend(Message); - } - catch { } - } - - private void RaiseOnReceived(byte[] Message) - { - if (onReceived == null) - return; - - try - { - onReceived(Message); - } - catch { } - } - } -} diff --git a/ClientServerLib/ClientServerLib/CConnection.cs b/ClientServerLib/ClientServerLib/CConnection.cs deleted file mode 100644 index d6bb8bdb..00000000 --- a/ClientServerLib/ClientServerLib/CConnection.cs +++ /dev/null @@ -1,307 +0,0 @@ -using System; -using System.Collections.Generic; -using System.Linq; -using System.Net.Sockets; -using System.IO; -using System.IO.Compression; -using System.Security.Cryptography; -using System.Text; - -using DiffieHellman; - -namespace ClientServerLib -{ - internal class CConnection - { - private bool keySet; - private byte[] key; - private bool encryption; - private string password; - private CDiffieHellman dh; - private UTF8Encoding encoder; - private int connectionID; - private static SHA256Managed SHA256 = new SHA256Managed(); - - public TcpClient TcpClient; - - public bool KeySet - { - get { return keySet; } - } - - public int ConnectionID - { - get { return connectionID; } - } - - public string Password - { - set - { - password = value; - encryption = value != null; - keySet = false; - } - } - - public CConnection(TcpClient client, int ConnectionID, string Password = null) - { - TcpClient = client; - client.NoDelay = true; - keySet = false; - encryption = Password != null; - password = Password; - connectionID = ConnectionID; - encoder = new UTF8Encoding(); - key = null; - } - - public byte[] GetKeyParams() - { - if (!encryption) - { - return encoder.GetBytes("NO ENCRYPTION"); - } - - if (dh == null) - dh = new CDiffieHellman(256).GenerateRequest(); - - return encoder.GetBytes(dh.ToString()); - } - - public byte[] CreateClientKey(byte[] serverParam) - { - if (serverParam == null) - return null; - - string response = encoder.GetString(serverParam, 0, serverParam.Length); - if (response == "NO ENCRYPTION") - { - encryption = false; - keySet = true; - key = null; - return encoder.GetBytes(response); - } - - dh = new CDiffieHellman(256).GenerateResponse(response); - key = _BuildHash(dh.Key, password); - keySet = true; - encryption = true; - return encoder.GetBytes(dh.ToString()); - } - - public void CreateServerKey(byte[] clientResponse) - { - string response = encoder.GetString(clientResponse, 0, clientResponse.Length); - - if (response == "NO ENCRYPTION") - { - keySet = true; - key = null; - return; - } - - if (dh == null) - return; - - dh.HandleResponse(response); - key = _BuildHash(dh.Key, password); - keySet = true; - } - - public byte[] Encrypt(byte[] Data) - { - return _Encrypt(_Compress(Data)); - } - - public byte[] Decrypt(byte[] Data) - { - return _Decompress(_Decrypt(Data)); - } - - private byte[] _BuildHash(byte[] Key, string Password) - { - if (Key == null || Password == null) - return null; - - byte[] hash = SHA256.ComputeHash(encoder.GetBytes(Password)); - byte[] serial = new byte[Key.Length + hash.Length]; - Array.Copy(Key, serial, Key.Length); - Array.Copy(hash, 0, serial, Key.Length, hash.Length); - - return SHA256.ComputeHash(serial); - } - - private byte[] _Encrypt(byte[] Data) - { - if (Data == null || (!keySet && encryption)) - return Data; - - byte[] dataLength = BitConverter.GetBytes(Data.Length); - - if (!encryption) - { - int len = 4 + dataLength.Length + Data.Length; - byte[] messageLength = BitConverter.GetBytes(len); - - using (var stream = new MemoryStream()) - { - stream.Write(messageLength, 0, messageLength.Length); - stream.Write(dataLength, 0, dataLength.Length); - stream.Write(Data, 0, Data.Length); - - return stream.ToArray(); - } - } - - using (Aes aes = new AesManaged()) - { - aes.Key = key; - aes.GenerateIV(); - - using (var encryptor = aes.CreateEncryptor(aes.Key, aes.IV)) - using (var memoryStream = new MemoryStream()) - using (var cryptoStream = new CryptoStream(memoryStream, encryptor, CryptoStreamMode.Write)) - { - cryptoStream.Write(Data, 0, Data.Length); - cryptoStream.FlushFinalBlock(); - - byte[] encrypted = memoryStream.ToArray(); - - int len = 4 + aes.IV.Length + dataLength.Length + encrypted.Length; - byte[] messageLength = BitConverter.GetBytes(len); - - using (var stream = new MemoryStream()) - { - stream.Write(messageLength, 0, messageLength.Length); - stream.Write(aes.IV, 0, aes.IV.Length); - stream.Write(dataLength, 0, dataLength.Length); - stream.Write(encrypted, 0, encrypted.Length); - - return stream.ToArray(); - } - } - } - } - - private byte[] _Decrypt(byte[] Data) - { - if (Data == null || (!keySet && encryption)) - return Data; - - - int messageLength = BitConverter.ToInt32(Data, 0); - if (messageLength > Data.Length) - return null; - - int dataLength; - - if (!encryption) - { - dataLength = BitConverter.ToInt32(Data, 4); - - byte[] message = new byte[dataLength]; - Array.Copy(Data, 8, message, 0, dataLength); - return message; - } - - if (Data.Length < 25) - return null; - - byte[] IV = new byte[16]; - Array.Copy(Data, 4, IV, 0, 16); - - dataLength = BitConverter.ToInt32(Data, 20); - - using (Aes aes = new AesManaged()) - { - aes.Key = key; - aes.IV = IV; - - byte[] encrypted = new byte[messageLength - 24]; - Array.Copy(Data, 24, encrypted, 0, encrypted.Length); - - try - { - using (var decryptor = aes.CreateDecryptor(aes.Key, aes.IV)) - using (var memoryStream = new MemoryStream()) - using (var cryptoStream = new CryptoStream(memoryStream, decryptor, CryptoStreamMode.Write)) - { - cryptoStream.Write(encrypted, 0, encrypted.Length); - cryptoStream.FlushFinalBlock(); - cryptoStream.Close(); - - byte[] decrypted = memoryStream.ToArray(); - byte[] message = new byte[dataLength]; - Array.Copy(decrypted, message, dataLength); - - return message; - } - } - catch - { - return null; - } - } - } - - private byte[] _Compress(byte[] Data) - { - if (Data == null) - return Data; - - using (var compressed = new MemoryStream()) - { - using (var gz = new GZipStream(compressed, CompressionMode.Compress, true)) - { - gz.Write(Data, 0, Data.Length); - } - - byte[] result = null; - - if (compressed.Length < Data.Length) - { - result = new byte[compressed.Length + 1]; - result[0] = 1; //data stream is compressed - compressed.Position = 0; - compressed.Read(result, 1, (int)compressed.Length); - } - else - { - result = new byte[Data.Length + 1]; - result[0] = 0; //data stream is not compressed - Array.Copy(Data, 0, result, 1, Data.Length); - } - - return result; - } - } - - private byte[] _Decompress(byte[] Data) - { - if (Data == null) - return Data; - - if (Data[0] == 0) //not compressed - { - byte[] result = new byte[Data.Length - 1]; - Array.Copy(Data, 1, result, 0, result.Length); - return result; - } - - using (var inStream = new MemoryStream()) - { - inStream.Write(Data, 1, Data.Length - 1); - inStream.Position = 0; - - using (var outStream = new MemoryStream()) - { - using (var gz = new GZipStream(inStream, CompressionMode.Decompress, true)) - gz.CopyTo(outStream); - - return outStream.ToArray(); - } - } - } - } -} diff --git a/ClientServerLib/ClientServerLib/CDiscover.cs b/ClientServerLib/ClientServerLib/CDiscover.cs index 75df21bf..ba327e2d 100644 --- a/ClientServerLib/ClientServerLib/CDiscover.cs +++ b/ClientServerLib/ClientServerLib/CDiscover.cs @@ -1,125 +1,125 @@ -using System; -using System.Collections.Generic; -using System.Diagnostics; -using System.Linq; -using System.Net; -using System.Net.Sockets; -using System.Text; -using System.Threading; -using System.Timers; - -namespace ClientServerLib -{ - public delegate void OnServerDiscovered(string IPAddress, string Hostname); - - public class CDiscover - { - public static readonly string sTimeout = "Timeout"; - public static readonly string sFinished = "Finished"; - - private string _Keyword; - private string _BroadcastAddress; - private int _Port; - - private Thread _DiscoverThread; - private bool _DiscoverRunning; - private OnServerDiscovered _OnDiscovered; - - - private System.Timers.Timer _BroadcastTimer; - - public CDiscover(int Port, string Keyword, string BroadcastAddress = "255.255.255.255") - { - _BroadcastAddress = BroadcastAddress; - _Port = Port; - _Keyword = Keyword; - - _DiscoverRunning = false; - _BroadcastTimer = new System.Timers.Timer(); - _BroadcastTimer.Elapsed += new ElapsedEventHandler(OnBroadcastEvent); - _BroadcastTimer.Interval = 2500; - } - - public void StartBroadcasting() - { - _BroadcastTimer.Start(); - } - - public void Stop() - { - _BroadcastTimer.Stop(); - _DiscoverRunning = false; - } - - public void Discover(OnServerDiscovered OnDiscovered, int Timeout = 5000) - { - if (_DiscoverRunning) - return; - - _DiscoverRunning = true; - _DiscoverThread = new Thread(() => _Discover(Timeout)); - _OnDiscovered = OnDiscovered; - _DiscoverThread.Start(); - } - - private void OnBroadcastEvent(object source, ElapsedEventArgs e) - { - Socket s = new Socket(AddressFamily.InterNetwork, SocketType.Dgram, ProtocolType.Udp); - s.EnableBroadcast = true; - IPAddress broadcast = IPAddress.Parse(_BroadcastAddress); - byte[] sendbuf = Encoding.UTF8.GetBytes(_Keyword); - IPEndPoint ep = new IPEndPoint(broadcast, _Port); - - s.SendTo(sendbuf, ep); - s.Close(); - } - - private void _Discover(int Timeout) - { - UdpClient listener = null; - Stopwatch timer = new Stopwatch(); - - List knownServer = new List(); - bool foundSomething = false; - timer.Start(); - while (_DiscoverRunning && timer.ElapsedMilliseconds < Timeout * 2) - { - try - { - listener = new UdpClient(_Port); - IPEndPoint groupEP = new IPEndPoint(IPAddress.Any, _Port); - listener.Client.ReceiveTimeout = Timeout; - - byte[] bytes = listener.Receive(ref groupEP); - string message = Encoding.UTF8.GetString(bytes, 0, bytes.Length); - - foundSomething = true; - if (!knownServer.Contains(groupEP.Address.ToString())) - { - knownServer.Add(groupEP.Address.ToString()); - if (_OnDiscovered != null) - { - IPHostEntry e = Dns.GetHostEntry(groupEP.Address); - string hostname = e.HostName; - - _OnDiscovered(groupEP.Address.ToString(), hostname); - } - } - - listener.Close(); - } - catch (Exception) - { - if (listener != null) - listener.Close(); - } - } - _DiscoverRunning = false; - - if (!foundSomething) - _OnDiscovered(sTimeout, String.Empty); - else - _OnDiscovered(sFinished, String.Empty); - } - } -} +using System; +using System.Collections.Generic; +using System.Diagnostics; +using System.Linq; +using System.Net; +using System.Net.Sockets; +using System.Text; +using System.Threading; +using System.Timers; + +namespace ServerLib +{ + public delegate void OnServerDiscovered(string IPAddress, string Hostname); + + public class CDiscover + { + public static readonly string sTimeout = "Timeout"; + public static readonly string sFinished = "Finished"; + + private string _Keyword; + private string _BroadcastAddress; + private int _Port; + + private Thread _DiscoverThread; + private bool _DiscoverRunning; + private OnServerDiscovered _OnDiscovered; + + + private System.Timers.Timer _BroadcastTimer; + + public CDiscover(int Port, string Keyword, string BroadcastAddress = "255.255.255.255") + { + _BroadcastAddress = BroadcastAddress; + _Port = Port; + _Keyword = Keyword; + + _DiscoverRunning = false; + _BroadcastTimer = new System.Timers.Timer(); + _BroadcastTimer.Elapsed += new ElapsedEventHandler(OnBroadcastEvent); + _BroadcastTimer.Interval = 2500; + } + + public void StartBroadcasting() + { + _BroadcastTimer.Start(); + } + + public void Stop() + { + _BroadcastTimer.Stop(); + _DiscoverRunning = false; + } + + public void Discover(OnServerDiscovered OnDiscovered, int Timeout = 5000) + { + if (_DiscoverRunning) + return; + + _DiscoverRunning = true; + _DiscoverThread = new Thread(() => _Discover(Timeout)); + _OnDiscovered = OnDiscovered; + _DiscoverThread.Start(); + } + + private void OnBroadcastEvent(object source, ElapsedEventArgs e) + { + Socket s = new Socket(AddressFamily.InterNetwork, SocketType.Dgram, ProtocolType.Udp); + s.EnableBroadcast = true; + IPAddress broadcast = IPAddress.Parse(_BroadcastAddress); + byte[] sendbuf = Encoding.UTF8.GetBytes(_Keyword); + IPEndPoint ep = new IPEndPoint(broadcast, _Port); + + s.SendTo(sendbuf, ep); + s.Close(); + } + + private void _Discover(int Timeout) + { + UdpClient listener = null; + Stopwatch timer = new Stopwatch(); + + List knownServer = new List(); + bool foundSomething = false; + timer.Start(); + while (_DiscoverRunning && timer.ElapsedMilliseconds < Timeout * 2) + { + try + { + listener = new UdpClient(_Port); + IPEndPoint groupEP = new IPEndPoint(IPAddress.Any, _Port); + listener.Client.ReceiveTimeout = Timeout; + + byte[] bytes = listener.Receive(ref groupEP); + string message = Encoding.UTF8.GetString(bytes, 0, bytes.Length); + + foundSomething = true; + if (!knownServer.Contains(groupEP.Address.ToString())) + { + knownServer.Add(groupEP.Address.ToString()); + if (_OnDiscovered != null) + { + IPHostEntry e = Dns.GetHostEntry(groupEP.Address); + string hostname = e.HostName; + + _OnDiscovered(groupEP.Address.ToString(), hostname); + } + } + + listener.Close(); + } + catch (Exception) + { + if (listener != null) + listener.Close(); + } + } + _DiscoverRunning = false; + + if (!foundSomething) + _OnDiscovered(sTimeout, String.Empty); + else + _OnDiscovered(sFinished, String.Empty); + } + } +} diff --git a/ClientServerLib/ClientServerLib/CServer.cs b/ClientServerLib/ClientServerLib/CServer.cs index d1a566c1..4bd9e39e 100644 --- a/ClientServerLib/ClientServerLib/CServer.cs +++ b/ClientServerLib/ClientServerLib/CServer.cs @@ -9,7 +9,7 @@ using System.Security.Cryptography.X509Certificates; using System.Diagnostics; using System.Net; -namespace ClientServerLib +namespace ServerLib { public class CServer { diff --git a/ClientServerLib/ClientServerLib/CWebservice.cs b/ClientServerLib/ClientServerLib/CWebservice.cs index 332426f2..e812491e 100644 --- a/ClientServerLib/ClientServerLib/CWebservice.cs +++ b/ClientServerLib/ClientServerLib/CWebservice.cs @@ -1,282 +1,282 @@ -using System; -using System.Collections.Generic; -using System.Linq; -using System.ServiceModel; -using System.Text; -using System.ServiceModel.Web; -using System.Web.Services; -using System.IO; - -namespace ClientServerLib -{ - [ServiceContract] - public interface ICWebservice - { - [OperationContract] - [WebInvoke(Method = "GET", - ResponseFormat = WebMessageFormat.Json, - UriTemplate = "/sendKeyEvent?key={key}")] - bool sendKeyEvent(string key); - - #region profile - - [OperationContract] - [WebInvoke(Method = "POST", - ResponseFormat = WebMessageFormat.Json, - UriTemplate = "/sendProfile")] - bool sendProfile(ProfileData profile); - - [OperationContract] - [WebInvoke(Method = "GET", - ResponseFormat = WebMessageFormat.Json, - UriTemplate = "/getProfile?profileId={profileId}")] - ProfileData getProfile(int profileId); - - [OperationContract] - [WebInvoke(Method = "GET", - ResponseFormat = WebMessageFormat.Json, - UriTemplate = "/getProfileList")] - ProfileData[] getProfileList(); - - #endregion - - #region photo - - [OperationContract] - [WebInvoke(Method = "POST", - RequestFormat = WebMessageFormat.Json, - ResponseFormat = WebMessageFormat.Json, - UriTemplate = "/sendPhoto")] - bool sendPhoto(PhotoData photo); - - #endregion - - #region website - - [OperationContract] - [WebInvoke(Method = "GET", - ResponseFormat = WebMessageFormat.Json, - UriTemplate = "")] - Stream Index(); - - [OperationContract] - [WebInvoke(Method = "GET", - ResponseFormat = WebMessageFormat.Json, - UriTemplate = "/js/{filename}")] - Stream GetJsFile(String filename); - - [OperationContract] - [WebInvoke(Method = "GET", - ResponseFormat = WebMessageFormat.Json, - UriTemplate = "/css/{filename}")] - Stream GetCssFile(String filename); - - [OperationContract] - [WebInvoke(Method = "GET", - ResponseFormat = WebMessageFormat.Json, - UriTemplate = "/css/images/{filename}")] - Stream GetCssImageFile(String filename); - - [OperationContract] - [WebInvoke(Method = "GET", - ResponseFormat = WebMessageFormat.Json, - UriTemplate = "/img/{filename}")] - Stream GetImgFile(String filename); - - #endregion - - #region songs - - [OperationContract] - [WebInvoke(Method = "GET", - ResponseFormat = WebMessageFormat.Json, - UriTemplate = "/getSong?songId={songId}")] - SongInfo getSong(int songId); - - [OperationContract] - [WebInvoke(Method = "GET", - ResponseFormat = WebMessageFormat.Json, - UriTemplate = "/getCurrentSongId")] - int getCurrentSongId(); - - [OperationContract] - [WebInvoke(Method = "GET", - ResponseFormat = WebMessageFormat.Json, - UriTemplate = "/getAllSongs")] - SongInfo[] getAllSongs(); - - #endregion - } - - class CWebservice : ICWebservice - { - public CWebservice() - { - } - - public bool sendKeyEvent(string key) - { - if (CServer.SendKeyEvent == null) - { - return false; - } - return CServer.SendKeyEvent(key); - } - - #region profile - - public bool sendProfile(ProfileData profile) - { - if (CServer.SendProfileData == null) - { - return false; - } - return CServer.SendProfileData(profile); - } - - public ProfileData getProfile(int profileId) - { - if (CServer.GetProfileData == null) - { - return new ProfileData(); - } - return CServer.GetProfileData(profileId); - } - - public ProfileData[] getProfileList() - { - if (CServer.GetProfileList == null) - { - return new ProfileData[] { }; - } - return CServer.GetProfileList(); - } - - #endregion - - #region photo - - public bool sendPhoto(PhotoData photo) - { - return CServer.SendPhoto(photo); - } - - #endregion - - #region website - - public Stream Index() - { - if (WebOperationContext.Current != null) - { - WebOperationContext.Current.OutgoingResponse.ContentType = "text/html"; - } - - return new MemoryStream(CServer.GetSiteFile("index.html")); - } - - public Stream GetJsFile(string filename) - { - if (WebOperationContext.Current != null) - { - WebOperationContext.Current.OutgoingResponse.ContentType = "text/javascript"; - } - - byte[] data = CServer.GetSiteFile("js/" + filename); - - if (data != null) - { - return new MemoryStream(data); - } - else - { - WebOperationContext.Current.OutgoingResponse.StatusCode = System.Net.HttpStatusCode.NotFound; - return null; - } - } - - public Stream GetCssFile(string filename) - { - if (WebOperationContext.Current != null) - { - WebOperationContext.Current.OutgoingResponse.ContentType = "text/css"; - } - - byte[] data = CServer.GetSiteFile("css/" + filename); - - if (data != null) - { - return new MemoryStream(data); - } - else - { - WebOperationContext.Current.OutgoingResponse.StatusCode = System.Net.HttpStatusCode.NotFound; - return null; - } - - - } - - public Stream GetCssImageFile(string filename) - { - if (WebOperationContext.Current != null) - { - WebOperationContext.Current.OutgoingResponse.ContentType = "image/png"; - } - - byte[] data = CServer.GetSiteFile("css\\images\\" + filename); - - if (data != null) - { - return new MemoryStream(data); - } - else - { - WebOperationContext.Current.OutgoingResponse.StatusCode = System.Net.HttpStatusCode.NotFound; - return null; - } - } - - public Stream GetImgFile(string filename) - { - if (WebOperationContext.Current != null) - { - WebOperationContext.Current.OutgoingResponse.ContentType = "image/png"; - } - - byte[] data = CServer.GetSiteFile("img/" + filename); - - if (data != null) - { - return new MemoryStream(data); - } - else - { - WebOperationContext.Current.OutgoingResponse.StatusCode = System.Net.HttpStatusCode.NotFound; - return null; - } - } - - #endregion - - #region songs - - public SongInfo getSong(int songId) - { - return CServer.GetSong(songId); - } - - public int getCurrentSongId() - { - return CServer.GetCurrentSongId(); - } - - public SongInfo[] getAllSongs() - { - return CServer.GetAllSongs(); - } - - #endregion - - } -} +using System; +using System.Collections.Generic; +using System.Linq; +using System.ServiceModel; +using System.Text; +using System.ServiceModel.Web; +using System.Web.Services; +using System.IO; + +namespace ServerLib +{ + [ServiceContract] + public interface ICWebservice + { + [OperationContract] + [WebInvoke(Method = "GET", + ResponseFormat = WebMessageFormat.Json, + UriTemplate = "/sendKeyEvent?key={key}")] + bool sendKeyEvent(string key); + + #region profile + + [OperationContract] + [WebInvoke(Method = "POST", + ResponseFormat = WebMessageFormat.Json, + UriTemplate = "/sendProfile")] + bool sendProfile(ProfileData profile); + + [OperationContract] + [WebInvoke(Method = "GET", + ResponseFormat = WebMessageFormat.Json, + UriTemplate = "/getProfile?profileId={profileId}")] + ProfileData getProfile(int profileId); + + [OperationContract] + [WebInvoke(Method = "GET", + ResponseFormat = WebMessageFormat.Json, + UriTemplate = "/getProfileList")] + ProfileData[] getProfileList(); + + #endregion + + #region photo + + [OperationContract] + [WebInvoke(Method = "POST", + RequestFormat = WebMessageFormat.Json, + ResponseFormat = WebMessageFormat.Json, + UriTemplate = "/sendPhoto")] + bool sendPhoto(PhotoData photo); + + #endregion + + #region website + + [OperationContract] + [WebInvoke(Method = "GET", + ResponseFormat = WebMessageFormat.Json, + UriTemplate = "")] + Stream Index(); + + [OperationContract] + [WebInvoke(Method = "GET", + ResponseFormat = WebMessageFormat.Json, + UriTemplate = "/js/{filename}")] + Stream GetJsFile(String filename); + + [OperationContract] + [WebInvoke(Method = "GET", + ResponseFormat = WebMessageFormat.Json, + UriTemplate = "/css/{filename}")] + Stream GetCssFile(String filename); + + [OperationContract] + [WebInvoke(Method = "GET", + ResponseFormat = WebMessageFormat.Json, + UriTemplate = "/css/images/{filename}")] + Stream GetCssImageFile(String filename); + + [OperationContract] + [WebInvoke(Method = "GET", + ResponseFormat = WebMessageFormat.Json, + UriTemplate = "/img/{filename}")] + Stream GetImgFile(String filename); + + #endregion + + #region songs + + [OperationContract] + [WebInvoke(Method = "GET", + ResponseFormat = WebMessageFormat.Json, + UriTemplate = "/getSong?songId={songId}")] + SongInfo getSong(int songId); + + [OperationContract] + [WebInvoke(Method = "GET", + ResponseFormat = WebMessageFormat.Json, + UriTemplate = "/getCurrentSongId")] + int getCurrentSongId(); + + [OperationContract] + [WebInvoke(Method = "GET", + ResponseFormat = WebMessageFormat.Json, + UriTemplate = "/getAllSongs")] + SongInfo[] getAllSongs(); + + #endregion + } + + class CWebservice : ICWebservice + { + public CWebservice() + { + } + + public bool sendKeyEvent(string key) + { + if (CServer.SendKeyEvent == null) + { + return false; + } + return CServer.SendKeyEvent(key); + } + + #region profile + + public bool sendProfile(ProfileData profile) + { + if (CServer.SendProfileData == null) + { + return false; + } + return CServer.SendProfileData(profile); + } + + public ProfileData getProfile(int profileId) + { + if (CServer.GetProfileData == null) + { + return new ProfileData(); + } + return CServer.GetProfileData(profileId); + } + + public ProfileData[] getProfileList() + { + if (CServer.GetProfileList == null) + { + return new ProfileData[] { }; + } + return CServer.GetProfileList(); + } + + #endregion + + #region photo + + public bool sendPhoto(PhotoData photo) + { + return CServer.SendPhoto(photo); + } + + #endregion + + #region website + + public Stream Index() + { + if (WebOperationContext.Current != null) + { + WebOperationContext.Current.OutgoingResponse.ContentType = "text/html"; + } + + return new MemoryStream(CServer.GetSiteFile("index.html")); + } + + public Stream GetJsFile(string filename) + { + if (WebOperationContext.Current != null) + { + WebOperationContext.Current.OutgoingResponse.ContentType = "text/javascript"; + } + + byte[] data = CServer.GetSiteFile("js/" + filename); + + if (data != null) + { + return new MemoryStream(data); + } + else + { + WebOperationContext.Current.OutgoingResponse.StatusCode = System.Net.HttpStatusCode.NotFound; + return null; + } + } + + public Stream GetCssFile(string filename) + { + if (WebOperationContext.Current != null) + { + WebOperationContext.Current.OutgoingResponse.ContentType = "text/css"; + } + + byte[] data = CServer.GetSiteFile("css/" + filename); + + if (data != null) + { + return new MemoryStream(data); + } + else + { + WebOperationContext.Current.OutgoingResponse.StatusCode = System.Net.HttpStatusCode.NotFound; + return null; + } + + + } + + public Stream GetCssImageFile(string filename) + { + if (WebOperationContext.Current != null) + { + WebOperationContext.Current.OutgoingResponse.ContentType = "image/png"; + } + + byte[] data = CServer.GetSiteFile("css\\images\\" + filename); + + if (data != null) + { + return new MemoryStream(data); + } + else + { + WebOperationContext.Current.OutgoingResponse.StatusCode = System.Net.HttpStatusCode.NotFound; + return null; + } + } + + public Stream GetImgFile(string filename) + { + if (WebOperationContext.Current != null) + { + WebOperationContext.Current.OutgoingResponse.ContentType = "image/png"; + } + + byte[] data = CServer.GetSiteFile("img/" + filename); + + if (data != null) + { + return new MemoryStream(data); + } + else + { + WebOperationContext.Current.OutgoingResponse.StatusCode = System.Net.HttpStatusCode.NotFound; + return null; + } + } + + #endregion + + #region songs + + public SongInfo getSong(int songId) + { + return CServer.GetSong(songId); + } + + public int getCurrentSongId() + { + return CServer.GetCurrentSongId(); + } + + public SongInfo[] getAllSongs() + { + return CServer.GetAllSongs(); + } + + #endregion + + } +} diff --git a/ClientServerLib/ClientServerLib/DataStructs.cs b/ClientServerLib/ClientServerLib/DataStructs.cs index c93a89e3..a32f6498 100644 --- a/ClientServerLib/ClientServerLib/DataStructs.cs +++ b/ClientServerLib/ClientServerLib/DataStructs.cs @@ -1,124 +1,124 @@ -using System; -using System.Collections.Generic; -using System.Linq; -using System.Text; -using System.Runtime.Serialization; -using System.Drawing; -using System.IO; -using System.Drawing.Imaging; -using System.Text.RegularExpressions; - -namespace ClientServerLib -{ - public delegate bool SendKeyEventDelegate(string key); - - - #region profile - - public delegate ProfileData GetProfileDataDelegate(int profileId); - public delegate bool SendProfileDataDelegate(ProfileData profile); - public delegate ProfileData[] GetProfileListDelegate(); - - [DataContract] - public struct ProfileData - { - [DataMember] - public Base64Image Avatar; - [DataMember] - public string PlayerName; - [DataMember] - public int Type; - [DataMember] - public int Difficulty; - [DataMember] - public int ProfileId; - [DataMember] - public bool IsEditable; - } - - #endregion - - #region photo - - public delegate bool SendPhotoDelegate(PhotoData photo); - - [DataContract] - public struct PhotoData - { - [DataMember] - public Base64Image Photo; - //Add infomation about the user who took this image?? - } - - #endregion - - #region website - - public delegate byte[] GetSiteFileDelegate(string filename); - - #endregion - - [DataContract] - public class Base64Image - { - [DataMember] - private string base64Data = ""; - - public Base64Image(Image img, ImageFormat format) - { - MemoryStream ms = new MemoryStream(); - img.Save(ms, format); - string formatString = ImageCodecInfo.GetImageEncoders().FirstOrDefault(x => x.FormatID == format.Guid).FilenameExtension.Replace("*.", "").ToLower(); - base64Data = "data:image/" + formatString + ";base64," + Convert.ToBase64String(ms.ToArray()); - } - - public Image getImage() - { - string onlyBase64Data = base64Data.Substring(base64Data.IndexOf(";base64,") + (";base64,").Length); - byte[] imageData = Convert.FromBase64String(onlyBase64Data); - MemoryStream ms = new MemoryStream(imageData, 0, imageData.Length); - ms.Write(imageData, 0, imageData.Length); - Image image = Image.FromStream(ms, true); - return image; - } - - public string getImageType() - { - Match match = Regex.Match(base64Data, "(?<=data:image/)[a-zA-Z]+(?=;base64)"); - return match.Success ? match.Groups[0].Value : ""; - } - - - } - - #region songs - - public delegate SongInfo GetSongDelegate(int songId); - - public delegate SongInfo[] GetAllSongsDelegate(); - - public delegate int GetCurrentSongIdDelegate(); - - [DataContract] - public struct SongInfo - { - [DataMember] - public string Title; - [DataMember] - public string Artist; - [DataMember] - public Base64Image Cover; - [DataMember] - public string Genre { get; set; } - [DataMember] - public string Language { get; set; } - [DataMember] - public string Year { get; set; } - [DataMember] - public bool IsDuet { get; set; } - [DataMember] - public int SongId { get; set; } - } - - #endregion -} +using System; +using System.Collections.Generic; +using System.Linq; +using System.Text; +using System.Runtime.Serialization; +using System.Drawing; +using System.IO; +using System.Drawing.Imaging; +using System.Text.RegularExpressions; + +namespace ServerLib +{ + public delegate bool SendKeyEventDelegate(string key); + + + #region profile + + public delegate ProfileData GetProfileDataDelegate(int profileId); + public delegate bool SendProfileDataDelegate(ProfileData profile); + public delegate ProfileData[] GetProfileListDelegate(); + + [DataContract] + public struct ProfileData + { + [DataMember] + public Base64Image Avatar; + [DataMember] + public string PlayerName; + [DataMember] + public int Type; + [DataMember] + public int Difficulty; + [DataMember] + public int ProfileId; + [DataMember] + public bool IsEditable; + } + + #endregion + + #region photo + + public delegate bool SendPhotoDelegate(PhotoData photo); + + [DataContract] + public struct PhotoData + { + [DataMember] + public Base64Image Photo; + //Add infomation about the user who took this image?? + } + + #endregion + + #region website + + public delegate byte[] GetSiteFileDelegate(string filename); + + #endregion + + [DataContract] + public class Base64Image + { + [DataMember] + private string base64Data = ""; + + public Base64Image(Image img, ImageFormat format) + { + MemoryStream ms = new MemoryStream(); + img.Save(ms, format); + string formatString = ImageCodecInfo.GetImageEncoders().FirstOrDefault(x => x.FormatID == format.Guid).FilenameExtension.Replace("*.", "").ToLower(); + base64Data = "data:image/" + formatString + ";base64," + Convert.ToBase64String(ms.ToArray()); + } + + public Image getImage() + { + string onlyBase64Data = base64Data.Substring(base64Data.IndexOf(";base64,") + (";base64,").Length); + byte[] imageData = Convert.FromBase64String(onlyBase64Data); + MemoryStream ms = new MemoryStream(imageData, 0, imageData.Length); + ms.Write(imageData, 0, imageData.Length); + Image image = Image.FromStream(ms, true); + return image; + } + + public string getImageType() + { + Match match = Regex.Match(base64Data, "(?<=data:image/)[a-zA-Z]+(?=;base64)"); + return match.Success ? match.Groups[0].Value : ""; + } + + + } + + #region songs + + public delegate SongInfo GetSongDelegate(int songId); + + public delegate SongInfo[] GetAllSongsDelegate(); + + public delegate int GetCurrentSongIdDelegate(); + + [DataContract] + public struct SongInfo + { + [DataMember] + public string Title; + [DataMember] + public string Artist; + [DataMember] + public Base64Image Cover; + [DataMember] + public string Genre { get; set; } + [DataMember] + public string Language { get; set; } + [DataMember] + public string Year { get; set; } + [DataMember] + public bool IsDuet { get; set; } + [DataMember] + public int SongId { get; set; } + } + + #endregion +} diff --git a/ClientServerLib/ClientServerLib/DeffieHellman/BigInt.cs b/ClientServerLib/ClientServerLib/DeffieHellman/BigInt.cs deleted file mode 100644 index c667644f..00000000 --- a/ClientServerLib/ClientServerLib/DeffieHellman/BigInt.cs +++ /dev/null @@ -1,2975 +0,0 @@ -//************************************************************************************ -// BigInteger Class Version 1.03 -// -// Copyright (c) 2002 Chew Keong TAN -// All rights reserved. -// -// 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, and/or sell copies of the Software, and to permit persons -// to whom the Software is furnished to do so, provided that the above -// copyright notice(s) and this permission notice appear in all copies of -// the Software and that both the above copyright notice(s) and this -// permission notice appear in supporting documentation. -// -// 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 -// OF THIRD PARTY RIGHTS. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR -// HOLDERS INCLUDED IN THIS NOTICE BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL -// INDIRECT OR CONSEQUENTIAL DAMAGES, OR ANY DAMAGES WHATSOEVER RESULTING -// FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, -// NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION -// WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. -// -// -// Disclaimer -// ---------- -// Although reasonable care has been taken to ensure the correctness of this -// implementation, this code should never be used in any application without -// proper verification and testing. I disclaim all liability and responsibility -// to any person or entity with respect to any loss or damage caused, or alleged -// to be caused, directly or indirectly, by the use of this BigInteger class. -// -// Comments, bugs and suggestions to -// (http://www.codeproject.com/csharp/biginteger.asp) -// -// -// Overloaded Operators +, -, *, /, %, >>, <<, ==, !=, >, <, >=, <=, &, |, ^, ++, --, ~ -// -// Features -// -------- -// 1) Arithmetic operations involving large signed integers (2's complement). -// 2) Primality test using Fermat little theorm, Rabin Miller's method, -// Solovay Strassen's method and Lucas strong pseudoprime. -// 3) Modulo exponential with Barrett's reduction. -// 4) Inverse modulo. -// 5) Pseudo prime generation. -// 6) Co-prime generation. -// -// -// Known Problem -// ------------- -// This pseudoprime passes my implementation of -// primality test but failed in JDK's isProbablePrime test. -// -// byte[] pseudoPrime1 = { (byte)0x00, -// (byte)0x85, (byte)0x84, (byte)0x64, (byte)0xFD, (byte)0x70, (byte)0x6A, -// (byte)0x9F, (byte)0xF0, (byte)0x94, (byte)0x0C, (byte)0x3E, (byte)0x2C, -// (byte)0x74, (byte)0x34, (byte)0x05, (byte)0xC9, (byte)0x55, (byte)0xB3, -// (byte)0x85, (byte)0x32, (byte)0x98, (byte)0x71, (byte)0xF9, (byte)0x41, -// (byte)0x21, (byte)0x5F, (byte)0x02, (byte)0x9E, (byte)0xEA, (byte)0x56, -// (byte)0x8D, (byte)0x8C, (byte)0x44, (byte)0xCC, (byte)0xEE, (byte)0xEE, -// (byte)0x3D, (byte)0x2C, (byte)0x9D, (byte)0x2C, (byte)0x12, (byte)0x41, -// (byte)0x1E, (byte)0xF1, (byte)0xC5, (byte)0x32, (byte)0xC3, (byte)0xAA, -// (byte)0x31, (byte)0x4A, (byte)0x52, (byte)0xD8, (byte)0xE8, (byte)0xAF, -// (byte)0x42, (byte)0xF4, (byte)0x72, (byte)0xA1, (byte)0x2A, (byte)0x0D, -// (byte)0x97, (byte)0xB1, (byte)0x31, (byte)0xB3, -// }; -// -// -// Change Log -// ---------- -// 1) September 23, 2002 (Version 1.03) -// - Fixed operator- to give correct data length. -// - Added Lucas sequence generation. -// - Added Strong Lucas Primality test. -// - Added integer square root method. -// - Added setBit/unsetBit methods. -// - New isProbablePrime() method which do not require the -// confident parameter. -// -// 2) August 29, 2002 (Version 1.02) -// - Fixed bug in the exponentiation of negative numbers. -// - Faster modular exponentiation using Barrett reduction. -// - Added getBytes() method. -// - Fixed bug in ToHexString method. -// - Added overloading of ^ operator. -// - Faster computation of Jacobi symbol. -// -// 3) August 19, 2002 (Version 1.01) -// - Big integer is stored and manipulated as unsigned integers (4 bytes) instead of -// individual bytes this gives significant performance improvement. -// - Updated Fermat's Little Theorem test to use a^(p-1) mod p = 1 -// - Added isProbablePrime method. -// - Updated documentation. -// -// 4) August 9, 2002 (Version 1.0) -// - Initial Release. -// -// -// References -// [1] D. E. Knuth, "Seminumerical Algorithms", The Art of Computer Programming Vol. 2, -// 3rd Edition, Addison-Wesley, 1998. -// -// [2] K. H. Rosen, "Elementary Number Theory and Its Applications", 3rd Ed, -// Addison-Wesley, 1993. -// -// [3] B. Schneier, "Applied Cryptography", 2nd Ed, John Wiley & Sons, 1996. -// -// [4] A. Menezes, P. van Oorschot, and S. Vanstone, "Handbook of Applied Cryptography", -// CRC Press, 1996, www.cacr.math.uwaterloo.ca/hac -// -// [5] A. Bosselaers, R. Govaerts, and J. Vandewalle, "Comparison of Three Modular -// Reduction Functions," Proc. CRYPTO'93, pp.175-186. -// -// [6] R. Baillie and S. S. Wagstaff Jr, "Lucas Pseudoprimes", Mathematics of Computation, -// Vol. 35, No. 152, Oct 1980, pp. 1391-1417. -// -// [7] H. C. Williams, "Édouard Lucas and Primality Testing", Canadian Mathematical -// Society Series of Monographs and Advance Texts, vol. 22, John Wiley & Sons, New York, -// NY, 1998. -// -// [8] P. Ribenboim, "The new book of prime number records", 3rd edition, Springer-Verlag, -// New York, NY, 1995. -// -// [9] M. Joye and J.-J. Quisquater, "Efficient computation of full Lucas sequences", -// Electronics Letters, 32(6), 1996, pp 537-538. -// -//************************************************************************************ - -using System; -using System.Collections.Generic; -using System.Text; - -namespace DiffieHellman -{ - internal class BigInteger : IDisposable - { - // maximum length of the BigInteger in uint (4 bytes) - // change this to suit the required level of precision. - - private const int maxLength = 50; - - // primes smaller than 2000 to test the generated prime number - - public static readonly int[] primesBelow2000 = { - 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, - 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, - 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, - 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, - 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, - 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, - 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, - 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, - 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, - 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, - 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, - 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, - 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, - 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, - 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, - 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, - 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, - 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, - 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, - 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999 }; - - - private uint[] data = null; // stores bytes from the Big Integer - public int dataLength; // number of actual chars used - - - //*********************************************************************** - // Constructor (Default value for BigInteger is 0 - //*********************************************************************** - - public BigInteger() - { - data = new uint[maxLength]; - dataLength = 1; - } - - - //*********************************************************************** - // Constructor (Default value provided by long) - //*********************************************************************** - - public BigInteger(long value) - { - data = new uint[maxLength]; - long tempVal = value; - - // copy bytes from long to BigInteger without any assumption of - // the length of the long datatype - - dataLength = 0; - while (value != 0 && dataLength < maxLength) - { - data[dataLength] = (uint)(value & 0xFFFFFFFF); - value >>= 32; - dataLength++; - } - - if (tempVal > 0) // overflow check for +ve value - { - if (value != 0 || (data[maxLength - 1] & 0x80000000) != 0) - throw (new ArithmeticException("Positive overflow in constructor.")); - } - else if (tempVal < 0) // underflow check for -ve value - { - if (value != -1 || (data[dataLength - 1] & 0x80000000) == 0) - throw (new ArithmeticException("Negative underflow in constructor.")); - } - - if (dataLength == 0) - dataLength = 1; - } - - - //*********************************************************************** - // Constructor (Default value provided by ulong) - //*********************************************************************** - - public BigInteger(ulong value) - { - data = new uint[maxLength]; - - // copy bytes from ulong to BigInteger without any assumption of - // the length of the ulong datatype - - dataLength = 0; - while (value != 0 && dataLength < maxLength) - { - data[dataLength] = (uint)(value & 0xFFFFFFFF); - value >>= 32; - dataLength++; - } - - if (value != 0 || (data[maxLength - 1] & 0x80000000) != 0) - throw (new ArithmeticException("Positive overflow in constructor.")); - - if (dataLength == 0) - dataLength = 1; - } - - - - //*********************************************************************** - // Constructor (Default value provided by BigInteger) - //*********************************************************************** - - public BigInteger(BigInteger bi) - { - data = new uint[maxLength]; - - dataLength = bi.dataLength; - - for (int i = 0; i < dataLength; i++) - data[i] = bi.data[i]; - } - - - //*********************************************************************** - // Constructor (Default value provided by a string of digits of the - // specified base) - // - // Example (base 10) - // ----------------- - // To initialize "a" with the default value of 1234 in base 10 - // BigInteger a = new BigInteger("1234", 10) - // - // To initialize "a" with the default value of -1234 - // BigInteger a = new BigInteger("-1234", 10) - // - // Example (base 16) - // ----------------- - // To initialize "a" with the default value of 0x1D4F in base 16 - // BigInteger a = new BigInteger("1D4F", 16) - // - // To initialize "a" with the default value of -0x1D4F - // BigInteger a = new BigInteger("-1D4F", 16) - // - // Note that string values are specified in the - // format. - // - //*********************************************************************** - - public BigInteger(string value, int radix) - { - BigInteger multiplier = new BigInteger(1); - BigInteger result = new BigInteger(); - value = (value.ToUpper()).Trim(); - int limit = 0; - - if (value[0] == '-') - limit = 1; - - for (int i = value.Length - 1; i >= limit; i--) - { - int posVal = (int)value[i]; - - if (posVal >= '0' && posVal <= '9') - posVal -= '0'; - else if (posVal >= 'A' && posVal <= 'Z') - posVal = (posVal - 'A') + 10; - else - posVal = 9999999; // arbitrary large - - - if (posVal >= radix) - throw (new ArithmeticException("Invalid string in constructor.")); - else - { - if (value[0] == '-') - posVal = -posVal; - - result = result + (multiplier * posVal); - - if ((i - 1) >= limit) - multiplier = multiplier * radix; - } - } - - if (value[0] == '-') // negative values - { - if ((result.data[maxLength - 1] & 0x80000000) == 0) - throw (new ArithmeticException("Negative underflow in constructor.")); - } - else // positive values - { - if ((result.data[maxLength - 1] & 0x80000000) != 0) - throw (new ArithmeticException("Positive overflow in constructor.")); - } - - data = new uint[maxLength]; - for (int i = 0; i < result.dataLength; i++) - data[i] = result.data[i]; - - dataLength = result.dataLength; - } - - - //*********************************************************************** - // Constructor (Default value provided by an array of bytes) - // - // The lowest index of the input byte array (i.e [0]) should contain the - // most significant byte of the number, and the highest index should - // contain the least significant byte. - // - // E.g. - // To initialize "a" with the default value of 0x1D4F in base 16 - // byte[] temp = { 0x1D, 0x4F }; - // BigInteger a = new BigInteger(temp) - // - // Note that this method of initialization does not allow the - // sign to be specified. - // - //*********************************************************************** - - public BigInteger(byte[] inData) - { - dataLength = inData.Length >> 2; - - int leftOver = inData.Length & 0x3; - if (leftOver != 0) // length not multiples of 4 - dataLength++; - - - if (dataLength > maxLength) - throw (new ArithmeticException("Byte overflow in constructor.")); - - data = new uint[maxLength]; - - for (int i = inData.Length - 1, j = 0; i >= 3; i -= 4, j++) - { - data[j] = (uint)((inData[i - 3] << 24) + (inData[i - 2] << 16) + - (inData[i - 1] << 8) + inData[i]); - } - - if (leftOver == 1) - data[dataLength - 1] = (uint)inData[0]; - else if (leftOver == 2) - data[dataLength - 1] = (uint)((inData[0] << 8) + inData[1]); - else if (leftOver == 3) - data[dataLength - 1] = (uint)((inData[0] << 16) + (inData[1] << 8) + inData[2]); - - - while (dataLength > 1 && data[dataLength - 1] == 0) - dataLength--; - - //Console.WriteLine("Len = " + dataLength); - } - - - //*********************************************************************** - // Constructor (Default value provided by an array of bytes of the - // specified length.) - //*********************************************************************** - - public BigInteger(byte[] inData, int inLen) - { - dataLength = inLen >> 2; - - int leftOver = inLen & 0x3; - if (leftOver != 0) // length not multiples of 4 - dataLength++; - - if (dataLength > maxLength || inLen > inData.Length) - throw (new ArithmeticException("Byte overflow in constructor.")); - - - data = new uint[maxLength]; - - for (int i = inLen - 1, j = 0; i >= 3; i -= 4, j++) - { - data[j] = (uint)((inData[i - 3] << 24) + (inData[i - 2] << 16) + - (inData[i - 1] << 8) + inData[i]); - } - - if (leftOver == 1) - data[dataLength - 1] = (uint)inData[0]; - else if (leftOver == 2) - data[dataLength - 1] = (uint)((inData[0] << 8) + inData[1]); - else if (leftOver == 3) - data[dataLength - 1] = (uint)((inData[0] << 16) + (inData[1] << 8) + inData[2]); - - - if (dataLength == 0) - dataLength = 1; - - while (dataLength > 1 && data[dataLength - 1] == 0) - dataLength--; - - //Console.WriteLine("Len = " + dataLength); - } - - - //*********************************************************************** - // Constructor (Default value provided by an array of unsigned integers) - //********************************************************************* - - public BigInteger(uint[] inData) - { - dataLength = inData.Length; - - if (dataLength > maxLength) - throw (new ArithmeticException("Byte overflow in constructor.")); - - data = new uint[maxLength]; - - for (int i = dataLength - 1, j = 0; i >= 0; i--, j++) - data[j] = inData[i]; - - while (dataLength > 1 && data[dataLength - 1] == 0) - dataLength--; - - //Console.WriteLine("Len = " + dataLength); - } - - - //*********************************************************************** - // Overloading of the typecast operator. - // For BigInteger bi = 10; - //*********************************************************************** - - public static implicit operator BigInteger(long value) - { - return (new BigInteger(value)); - } - - public static implicit operator BigInteger(ulong value) - { - return (new BigInteger(value)); - } - - public static implicit operator BigInteger(int value) - { - return (new BigInteger((long)value)); - } - - public static implicit operator BigInteger(uint value) - { - return (new BigInteger((ulong)value)); - } - - - //*********************************************************************** - // Overloading of addition operator - //*********************************************************************** - - public static BigInteger operator +(BigInteger bi1, BigInteger bi2) - { - BigInteger result = new BigInteger(); - - result.dataLength = (bi1.dataLength > bi2.dataLength) ? bi1.dataLength : bi2.dataLength; - - long carry = 0; - for (int i = 0; i < result.dataLength; i++) - { - long sum = (long)bi1.data[i] + (long)bi2.data[i] + carry; - carry = sum >> 32; - result.data[i] = (uint)(sum & 0xFFFFFFFF); - } - - if (carry != 0 && result.dataLength < maxLength) - { - result.data[result.dataLength] = (uint)(carry); - result.dataLength++; - } - - while (result.dataLength > 1 && result.data[result.dataLength - 1] == 0) - result.dataLength--; - - - // overflow check - int lastPos = maxLength - 1; - if ((bi1.data[lastPos] & 0x80000000) == (bi2.data[lastPos] & 0x80000000) && - (result.data[lastPos] & 0x80000000) != (bi1.data[lastPos] & 0x80000000)) - { - throw (new ArithmeticException()); - } - - return result; - } - - - //*********************************************************************** - // Overloading of the unary ++ operator - //*********************************************************************** - - public static BigInteger operator ++(BigInteger bi1) - { - BigInteger result = new BigInteger(bi1); - - long val, carry = 1; - int index = 0; - - while (carry != 0 && index < maxLength) - { - val = (long)(result.data[index]); - val++; - - result.data[index] = (uint)(val & 0xFFFFFFFF); - carry = val >> 32; - - index++; - } - - if (index > result.dataLength) - result.dataLength = index; - else - { - while (result.dataLength > 1 && result.data[result.dataLength - 1] == 0) - result.dataLength--; - } - - // overflow check - int lastPos = maxLength - 1; - - // overflow if initial value was +ve but ++ caused a sign - // change to negative. - - if ((bi1.data[lastPos] & 0x80000000) == 0 && - (result.data[lastPos] & 0x80000000) != (bi1.data[lastPos] & 0x80000000)) - { - throw (new ArithmeticException("Overflow in ++.")); - } - return result; - } - - - //*********************************************************************** - // Overloading of subtraction operator - //*********************************************************************** - - public static BigInteger operator -(BigInteger bi1, BigInteger bi2) - { - BigInteger result = new BigInteger(); - - result.dataLength = (bi1.dataLength > bi2.dataLength) ? bi1.dataLength : bi2.dataLength; - - long carryIn = 0; - for (int i = 0; i < result.dataLength; i++) - { - long diff; - - diff = (long)bi1.data[i] - (long)bi2.data[i] - carryIn; - result.data[i] = (uint)(diff & 0xFFFFFFFF); - - if (diff < 0) - carryIn = 1; - else - carryIn = 0; - } - - // roll over to negative - if (carryIn != 0) - { - for (int i = result.dataLength; i < maxLength; i++) - result.data[i] = 0xFFFFFFFF; - result.dataLength = maxLength; - } - - // fixed in v1.03 to give correct datalength for a - (-b) - while (result.dataLength > 1 && result.data[result.dataLength - 1] == 0) - result.dataLength--; - - // overflow check - - int lastPos = maxLength - 1; - if ((bi1.data[lastPos] & 0x80000000) != (bi2.data[lastPos] & 0x80000000) && - (result.data[lastPos] & 0x80000000) != (bi1.data[lastPos] & 0x80000000)) - { - throw (new ArithmeticException()); - } - - return result; - } - - - //*********************************************************************** - // Overloading of the unary -- operator - //*********************************************************************** - - public static BigInteger operator --(BigInteger bi1) - { - BigInteger result = new BigInteger(bi1); - - long val; - bool carryIn = true; - int index = 0; - - while (carryIn && index < maxLength) - { - val = (long)(result.data[index]); - val--; - - result.data[index] = (uint)(val & 0xFFFFFFFF); - - if (val >= 0) - carryIn = false; - - index++; - } - - if (index > result.dataLength) - result.dataLength = index; - - while (result.dataLength > 1 && result.data[result.dataLength - 1] == 0) - result.dataLength--; - - // overflow check - int lastPos = maxLength - 1; - - // overflow if initial value was -ve but -- caused a sign - // change to positive. - - if ((bi1.data[lastPos] & 0x80000000) != 0 && - (result.data[lastPos] & 0x80000000) != (bi1.data[lastPos] & 0x80000000)) - { - throw (new ArithmeticException("Underflow in --.")); - } - - return result; - } - - - //*********************************************************************** - // Overloading of multiplication operator - //*********************************************************************** - - public static BigInteger operator *(BigInteger bi1, BigInteger bi2) - { - int lastPos = maxLength - 1; - bool bi1Neg = false, bi2Neg = false; - - // take the absolute value of the inputs - try - { - if ((bi1.data[lastPos] & 0x80000000) != 0) // bi1 negative - { - bi1Neg = true; bi1 = -bi1; - } - if ((bi2.data[lastPos] & 0x80000000) != 0) // bi2 negative - { - bi2Neg = true; bi2 = -bi2; - } - } - catch (Exception) { } - - BigInteger result = new BigInteger(); - - // multiply the absolute values - try - { - for (int i = 0; i < bi1.dataLength; i++) - { - if (bi1.data[i] == 0) continue; - - ulong mcarry = 0; - for (int j = 0, k = i; j < bi2.dataLength; j++, k++) - { - // k = i + j - ulong val = ((ulong)bi1.data[i] * (ulong)bi2.data[j]) + - (ulong)result.data[k] + mcarry; - - result.data[k] = (uint)(val & 0xFFFFFFFF); - mcarry = (val >> 32); - } - - if (mcarry != 0) - result.data[i + bi2.dataLength] = (uint)mcarry; - } - } - catch (Exception) - { - throw (new ArithmeticException("Multiplication overflow.")); - } - - - result.dataLength = bi1.dataLength + bi2.dataLength; - if (result.dataLength > maxLength) - result.dataLength = maxLength; - - while (result.dataLength > 1 && result.data[result.dataLength - 1] == 0) - result.dataLength--; - - // overflow check (result is -ve) - if ((result.data[lastPos] & 0x80000000) != 0) - { - if (bi1Neg != bi2Neg && result.data[lastPos] == 0x80000000) // different sign - { - // handle the special case where multiplication produces - // a max negative number in 2's complement. - - if (result.dataLength == 1) - return result; - else - { - bool isMaxNeg = true; - for (int i = 0; i < result.dataLength - 1 && isMaxNeg; i++) - { - if (result.data[i] != 0) - isMaxNeg = false; - } - - if (isMaxNeg) - return result; - } - } - - throw (new ArithmeticException("Multiplication overflow.")); - } - - // if input has different signs, then result is -ve - if (bi1Neg != bi2Neg) - return -result; - - return result; - } - - - - //*********************************************************************** - // Overloading of unary << operators - //*********************************************************************** - - public static BigInteger operator <<(BigInteger bi1, int shiftVal) - { - BigInteger result = new BigInteger(bi1); - result.dataLength = ShiftLeft(result.data, shiftVal); - - return result; - } - - - // least significant bits at lower part of buffer - - private static int ShiftLeft(uint[] buffer, int shiftVal) - { - int shiftAmount = 32; - int bufLen = buffer.Length; - - while (bufLen > 1 && buffer[bufLen - 1] == 0) - bufLen--; - - for (int count = shiftVal; count > 0; ) - { - if (count < shiftAmount) - shiftAmount = count; - - //Console.WriteLine("shiftAmount = {0}", shiftAmount); - - ulong carry = 0; - for (int i = 0; i < bufLen; i++) - { - ulong val = ((ulong)buffer[i]) << shiftAmount; - val |= carry; - - buffer[i] = (uint)(val & 0xFFFFFFFF); - carry = val >> 32; - } - - if (carry != 0) - { - if (bufLen + 1 <= buffer.Length) - { - buffer[bufLen] = (uint)carry; - bufLen++; - } - } - count -= shiftAmount; - } - return bufLen; - } - - - //*********************************************************************** - // Overloading of unary >> operators - //*********************************************************************** - - public static BigInteger operator >>(BigInteger bi1, int shiftVal) - { - BigInteger result = new BigInteger(bi1); - result.dataLength = ShiftRight(result.data, shiftVal); - - - if ((bi1.data[maxLength - 1] & 0x80000000) != 0) // negative - { - for (int i = maxLength - 1; i >= result.dataLength; i--) - result.data[i] = 0xFFFFFFFF; - - uint mask = 0x80000000; - for (int i = 0; i < 32; i++) - { - if ((result.data[result.dataLength - 1] & mask) != 0) - break; - - result.data[result.dataLength - 1] |= mask; - mask >>= 1; - } - result.dataLength = maxLength; - } - - return result; - } - - - private static int ShiftRight(uint[] buffer, int shiftVal) - { - int shiftAmount = 32; - int invShift = 0; - int bufLen = buffer.Length; - - while (bufLen > 1 && buffer[bufLen - 1] == 0) - bufLen--; - - //Console.WriteLine("bufLen = " + bufLen + " buffer.Length = " + buffer.Length); - - for (int count = shiftVal; count > 0; ) - { - if (count < shiftAmount) - { - shiftAmount = count; - invShift = 32 - shiftAmount; - } - - //Console.WriteLine("shiftAmount = {0}", shiftAmount); - - ulong carry = 0; - for (int i = bufLen - 1; i >= 0; i--) - { - ulong val = ((ulong)buffer[i]) >> shiftAmount; - val |= carry; - - carry = ((ulong)buffer[i]) << invShift; - buffer[i] = (uint)(val); - } - - count -= shiftAmount; - } - - while (bufLen > 1 && buffer[bufLen - 1] == 0) - bufLen--; - - return bufLen; - } - - - //*********************************************************************** - // Overloading of the NOT operator (1's complement) - //*********************************************************************** - - public static BigInteger operator ~(BigInteger bi1) - { - BigInteger result = new BigInteger(bi1); - - for (int i = 0; i < maxLength; i++) - result.data[i] = (uint)(~(bi1.data[i])); - - result.dataLength = maxLength; - - while (result.dataLength > 1 && result.data[result.dataLength - 1] == 0) - result.dataLength--; - - return result; - } - - - //*********************************************************************** - // Overloading of the NEGATE operator (2's complement) - //*********************************************************************** - - public static BigInteger operator -(BigInteger bi1) - { - // handle neg of zero separately since it'll cause an overflow - // if we proceed. - - if (bi1.dataLength == 1 && bi1.data[0] == 0) - return (new BigInteger()); - - BigInteger result = new BigInteger(bi1); - - // 1's complement - for (int i = 0; i < maxLength; i++) - result.data[i] = (uint)(~(bi1.data[i])); - - // add one to result of 1's complement - long val, carry = 1; - int index = 0; - - while (carry != 0 && index < maxLength) - { - val = (long)(result.data[index]); - val++; - - result.data[index] = (uint)(val & 0xFFFFFFFF); - carry = val >> 32; - - index++; - } - - if ((bi1.data[maxLength - 1] & 0x80000000) == (result.data[maxLength - 1] & 0x80000000)) - throw (new ArithmeticException("Overflow in negation.\n")); - - result.dataLength = maxLength; - - while (result.dataLength > 1 && result.data[result.dataLength - 1] == 0) - result.dataLength--; - return result; - } - - - //*********************************************************************** - // Overloading of equality operator - //*********************************************************************** - - public static bool operator ==(BigInteger bi1, BigInteger bi2) - { - return bi1.Equals(bi2); - } - - - public static bool operator !=(BigInteger bi1, BigInteger bi2) - { - return !(bi1.Equals(bi2)); - } - - - public override bool Equals(object o) - { - if (o == null) - return false; - - BigInteger bi = (BigInteger)o; - - if (this.dataLength != bi.dataLength) - return false; - - for (int i = 0; i < this.dataLength; i++) - { - if (this.data[i] != bi.data[i]) - return false; - } - return true; - } - - - public override int GetHashCode() - { - return this.ToString().GetHashCode(); - } - - - //*********************************************************************** - // Overloading of inequality operator - //*********************************************************************** - - public static bool operator >(BigInteger bi1, BigInteger bi2) - { - int pos = maxLength - 1; - - // bi1 is negative, bi2 is positive - if ((bi1.data[pos] & 0x80000000) != 0 && (bi2.data[pos] & 0x80000000) == 0) - return false; - - // bi1 is positive, bi2 is negative - else if ((bi1.data[pos] & 0x80000000) == 0 && (bi2.data[pos] & 0x80000000) != 0) - return true; - - // same sign - int len = (bi1.dataLength > bi2.dataLength) ? bi1.dataLength : bi2.dataLength; - for (pos = len - 1; pos >= 0 && bi1.data[pos] == bi2.data[pos]; pos--) ; - - if (pos >= 0) - { - if (bi1.data[pos] > bi2.data[pos]) - return true; - return false; - } - return false; - } - - - public static bool operator <(BigInteger bi1, BigInteger bi2) - { - int pos = maxLength - 1; - - // bi1 is negative, bi2 is positive - if ((bi1.data[pos] & 0x80000000) != 0 && (bi2.data[pos] & 0x80000000) == 0) - return true; - - // bi1 is positive, bi2 is negative - else if ((bi1.data[pos] & 0x80000000) == 0 && (bi2.data[pos] & 0x80000000) != 0) - return false; - - // same sign - int len = (bi1.dataLength > bi2.dataLength) ? bi1.dataLength : bi2.dataLength; - for (pos = len - 1; pos >= 0 && bi1.data[pos] == bi2.data[pos]; pos--) ; - - if (pos >= 0) - { - if (bi1.data[pos] < bi2.data[pos]) - return true; - return false; - } - return false; - } - - - public static bool operator >=(BigInteger bi1, BigInteger bi2) - { - return (bi1 == bi2 || bi1 > bi2); - } - - - public static bool operator <=(BigInteger bi1, BigInteger bi2) - { - return (bi1 == bi2 || bi1 < bi2); - } - - - //*********************************************************************** - // Private function that supports the division of two numbers with - // a divisor that has more than 1 digit. - // - // Algorithm taken from [1] - //*********************************************************************** - - private static void MultiByteDivide(BigInteger bi1, BigInteger bi2, - BigInteger outQuotient, BigInteger outRemainder) - { - uint[] result = new uint[maxLength]; - - int remainderLen = bi1.dataLength + 1; - uint[] remainder = new uint[remainderLen]; - - uint mask = 0x80000000; - uint val = bi2.data[bi2.dataLength - 1]; - int shift = 0, resultPos = 0; - - while (mask != 0 && (val & mask) == 0) - { - shift++; mask >>= 1; - } - - //Console.WriteLine("shift = {0}", shift); - //Console.WriteLine("Before bi1 Len = {0}, bi2 Len = {1}", bi1.dataLength, bi2.dataLength); - - for (int i = 0; i < bi1.dataLength; i++) - remainder[i] = bi1.data[i]; - ShiftLeft(remainder, shift); - bi2 = bi2 << shift; - - /* - Console.WriteLine("bi1 Len = {0}, bi2 Len = {1}", bi1.dataLength, bi2.dataLength); - Console.WriteLine("dividend = " + bi1 + "\ndivisor = " + bi2); - for(int q = remainderLen - 1; q >= 0; q--) - Console.Write("{0:x2}", remainder[q]); - Console.WriteLine(); - */ - - int j = remainderLen - bi2.dataLength; - int pos = remainderLen - 1; - - ulong firstDivisorByte = bi2.data[bi2.dataLength - 1]; - ulong secondDivisorByte = bi2.data[bi2.dataLength - 2]; - - int divisorLen = bi2.dataLength + 1; - uint[] dividendPart = new uint[divisorLen]; - - while (j > 0) - { - ulong dividend = ((ulong)remainder[pos] << 32) + (ulong)remainder[pos - 1]; - //Console.WriteLine("dividend = {0}", dividend); - - ulong q_hat = dividend / firstDivisorByte; - ulong r_hat = dividend % firstDivisorByte; - - //Console.WriteLine("q_hat = {0:X}, r_hat = {1:X}", q_hat, r_hat); - - bool done = false; - while (!done) - { - done = true; - - if (q_hat == 0x100000000 || - (q_hat * secondDivisorByte) > ((r_hat << 32) + remainder[pos - 2])) - { - q_hat--; - r_hat += firstDivisorByte; - - if (r_hat < 0x100000000) - done = false; - } - } - - for (int h = 0; h < divisorLen; h++) - dividendPart[h] = remainder[pos - h]; - - BigInteger kk = new BigInteger(dividendPart); - BigInteger ss = bi2 * (long)q_hat; - - //Console.WriteLine("ss before = " + ss); - while (ss > kk) - { - q_hat--; - ss -= bi2; - //Console.WriteLine(ss); - } - BigInteger yy = kk - ss; - - //Console.WriteLine("ss = " + ss); - //Console.WriteLine("kk = " + kk); - //Console.WriteLine("yy = " + yy); - - for (int h = 0; h < divisorLen; h++) - remainder[pos - h] = yy.data[bi2.dataLength - h]; - - /* - Console.WriteLine("dividend = "); - for(int q = remainderLen - 1; q >= 0; q--) - Console.Write("{0:x2}", remainder[q]); - Console.WriteLine("\n************ q_hat = {0:X}\n", q_hat); - */ - - result[resultPos++] = (uint)q_hat; - - pos--; - j--; - } - - outQuotient.dataLength = resultPos; - int y = 0; - for (int x = outQuotient.dataLength - 1; x >= 0; x--, y++) - outQuotient.data[y] = result[x]; - for (; y < maxLength; y++) - outQuotient.data[y] = 0; - - while (outQuotient.dataLength > 1 && outQuotient.data[outQuotient.dataLength - 1] == 0) - outQuotient.dataLength--; - - if (outQuotient.dataLength == 0) - outQuotient.dataLength = 1; - - outRemainder.dataLength = ShiftRight(remainder, shift); - - for (y = 0; y < outRemainder.dataLength; y++) - outRemainder.data[y] = remainder[y]; - for (; y < maxLength; y++) - outRemainder.data[y] = 0; - } - - - //*********************************************************************** - // Private function that supports the division of two numbers with - // a divisor that has only 1 digit. - //*********************************************************************** - - private static void SingleByteDivide(BigInteger bi1, BigInteger bi2, - BigInteger outQuotient, BigInteger outRemainder) - { - uint[] result = new uint[maxLength]; - int resultPos = 0; - - // copy dividend to reminder - for (int i = 0; i < maxLength; i++) - outRemainder.data[i] = bi1.data[i]; - outRemainder.dataLength = bi1.dataLength; - - while (outRemainder.dataLength > 1 && outRemainder.data[outRemainder.dataLength - 1] == 0) - outRemainder.dataLength--; - - ulong divisor = (ulong)bi2.data[0]; - int pos = outRemainder.dataLength - 1; - ulong dividend = (ulong)outRemainder.data[pos]; - - //Console.WriteLine("divisor = " + divisor + " dividend = " + dividend); - //Console.WriteLine("divisor = " + bi2 + "\ndividend = " + bi1); - - if (dividend >= divisor) - { - ulong quotient = dividend / divisor; - result[resultPos++] = (uint)quotient; - - outRemainder.data[pos] = (uint)(dividend % divisor); - } - pos--; - - while (pos >= 0) - { - //Console.WriteLine(pos); - - dividend = ((ulong)outRemainder.data[pos + 1] << 32) + (ulong)outRemainder.data[pos]; - ulong quotient = dividend / divisor; - result[resultPos++] = (uint)quotient; - - outRemainder.data[pos + 1] = 0; - outRemainder.data[pos--] = (uint)(dividend % divisor); - //Console.WriteLine(">>>> " + bi1); - } - - outQuotient.dataLength = resultPos; - int j = 0; - for (int i = outQuotient.dataLength - 1; i >= 0; i--, j++) - outQuotient.data[j] = result[i]; - for (; j < maxLength; j++) - outQuotient.data[j] = 0; - - while (outQuotient.dataLength > 1 && outQuotient.data[outQuotient.dataLength - 1] == 0) - outQuotient.dataLength--; - - if (outQuotient.dataLength == 0) - outQuotient.dataLength = 1; - - while (outRemainder.dataLength > 1 && outRemainder.data[outRemainder.dataLength - 1] == 0) - outRemainder.dataLength--; - } - - - //*********************************************************************** - // Overloading of division operator - //*********************************************************************** - - public static BigInteger operator /(BigInteger bi1, BigInteger bi2) - { - BigInteger quotient = new BigInteger(); - BigInteger remainder = new BigInteger(); - - int lastPos = maxLength - 1; - bool divisorNeg = false, dividendNeg = false; - - if ((bi1.data[lastPos] & 0x80000000) != 0) // bi1 negative - { - bi1 = -bi1; - dividendNeg = true; - } - if ((bi2.data[lastPos] & 0x80000000) != 0) // bi2 negative - { - bi2 = -bi2; - divisorNeg = true; - } - - if (bi1 < bi2) - { - return quotient; - } - - else - { - if (bi2.dataLength == 1) - SingleByteDivide(bi1, bi2, quotient, remainder); - else - MultiByteDivide(bi1, bi2, quotient, remainder); - - if (dividendNeg != divisorNeg) - return -quotient; - - return quotient; - } - } - - - //*********************************************************************** - // Overloading of modulus operator - //*********************************************************************** - - public static BigInteger operator %(BigInteger bi1, BigInteger bi2) - { - BigInteger quotient = new BigInteger(); - BigInteger remainder = new BigInteger(bi1); - - int lastPos = maxLength - 1; - bool dividendNeg = false; - - if ((bi1.data[lastPos] & 0x80000000) != 0) // bi1 negative - { - bi1 = -bi1; - dividendNeg = true; - } - if ((bi2.data[lastPos] & 0x80000000) != 0) // bi2 negative - bi2 = -bi2; - - if (bi1 < bi2) - { - return remainder; - } - - else - { - if (bi2.dataLength == 1) - SingleByteDivide(bi1, bi2, quotient, remainder); - else - MultiByteDivide(bi1, bi2, quotient, remainder); - - if (dividendNeg) - return -remainder; - - return remainder; - } - } - - - //*********************************************************************** - // Overloading of bitwise AND operator - //*********************************************************************** - - public static BigInteger operator &(BigInteger bi1, BigInteger bi2) - { - BigInteger result = new BigInteger(); - - int len = (bi1.dataLength > bi2.dataLength) ? bi1.dataLength : bi2.dataLength; - - for (int i = 0; i < len; i++) - { - uint sum = (uint)(bi1.data[i] & bi2.data[i]); - result.data[i] = sum; - } - - result.dataLength = maxLength; - - while (result.dataLength > 1 && result.data[result.dataLength - 1] == 0) - result.dataLength--; - - return result; - } - - - //*********************************************************************** - // Overloading of bitwise OR operator - //*********************************************************************** - - public static BigInteger operator |(BigInteger bi1, BigInteger bi2) - { - BigInteger result = new BigInteger(); - - int len = (bi1.dataLength > bi2.dataLength) ? bi1.dataLength : bi2.dataLength; - - for (int i = 0; i < len; i++) - { - uint sum = (uint)(bi1.data[i] | bi2.data[i]); - result.data[i] = sum; - } - - result.dataLength = maxLength; - - while (result.dataLength > 1 && result.data[result.dataLength - 1] == 0) - result.dataLength--; - - return result; - } - - - //*********************************************************************** - // Overloading of bitwise XOR operator - //*********************************************************************** - - public static BigInteger operator ^(BigInteger bi1, BigInteger bi2) - { - BigInteger result = new BigInteger(); - - int len = (bi1.dataLength > bi2.dataLength) ? bi1.dataLength : bi2.dataLength; - - for (int i = 0; i < len; i++) - { - uint sum = (uint)(bi1.data[i] ^ bi2.data[i]); - result.data[i] = sum; - } - - result.dataLength = maxLength; - - while (result.dataLength > 1 && result.data[result.dataLength - 1] == 0) - result.dataLength--; - - return result; - } - - - //*********************************************************************** - // Returns max(this, bi) - //*********************************************************************** - - public BigInteger Max(BigInteger bi) - { - if (this > bi) - return (new BigInteger(this)); - else - return (new BigInteger(bi)); - } - - - //*********************************************************************** - // Returns min(this, bi) - //*********************************************************************** - - public BigInteger Min(BigInteger bi) - { - if (this < bi) - return (new BigInteger(this)); - else - return (new BigInteger(bi)); - - } - - - //*********************************************************************** - // Returns the absolute value - //*********************************************************************** - - public BigInteger Abs() - { - if ((this.data[maxLength - 1] & 0x80000000) != 0) - return (-this); - else - return (new BigInteger(this)); - } - - - //*********************************************************************** - // Returns a string representing the BigInteger in base 10. - //*********************************************************************** - - public override string ToString() - { - return ToString(10); - } - - - //*********************************************************************** - // Returns a string representing the BigInteger in sign-and-magnitude - // format in the specified radix. - // - // Example - // ------- - // If the value of BigInteger is -255 in base 10, then - // ToString(16) returns "-FF" - // - //*********************************************************************** - - public string ToString(int radix) - { - if (radix < 2 || radix > 36) - throw (new ArgumentException("Radix must be >= 2 and <= 36")); - - string charSet = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; - string result = ""; - - BigInteger a = this; - - bool negative = false; - if ((a.data[maxLength - 1] & 0x80000000) != 0) - { - negative = true; - try - { - a = -a; - } - catch (Exception) { } - } - - BigInteger quotient = new BigInteger(); - BigInteger remainder = new BigInteger(); - BigInteger biRadix = new BigInteger(radix); - - if (a.dataLength == 1 && a.data[0] == 0) - result = "0"; - else - { - while (a.dataLength > 1 || (a.dataLength == 1 && a.data[0] != 0)) - { - SingleByteDivide(a, biRadix, quotient, remainder); - - if (remainder.data[0] < 10) - result = remainder.data[0] + result; - else - result = charSet[(int)remainder.data[0] - 10] + result; - - a = quotient; - } - if (negative) - result = "-" + result; - } - - return result; - } - - - //*********************************************************************** - // Returns a hex string showing the contains of the BigInteger - // - // Examples - // ------- - // 1) If the value of BigInteger is 255 in base 10, then - // ToHexString() returns "FF" - // - // 2) If the value of BigInteger is -255 in base 10, then - // ToHexString() returns ".....FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF01", - // which is the 2's complement representation of -255. - // - //*********************************************************************** - - public string ToHexString() - { - string result = data[dataLength - 1].ToString("X"); - - for (int i = dataLength - 2; i >= 0; i--) - { - result += data[i].ToString("X8"); - } - - return result; - } - - - - //*********************************************************************** - // Modulo Exponentiation - //*********************************************************************** - - public BigInteger ModPow(BigInteger exp, BigInteger n) - { - if ((exp.data[maxLength - 1] & 0x80000000) != 0) - throw (new ArithmeticException("Positive exponents only.")); - - BigInteger resultNum = 1; - BigInteger tempNum; - bool thisNegative = false; - - if ((this.data[maxLength - 1] & 0x80000000) != 0) // negative this - { - tempNum = -this % n; - thisNegative = true; - } - else - tempNum = this % n; // ensures (tempNum * tempNum) < b^(2k) - - if ((n.data[maxLength - 1] & 0x80000000) != 0) // negative n - n = -n; - - // calculate constant = b^(2k) / m - BigInteger constant = new BigInteger(); - - int i = n.dataLength << 1; - constant.data[i] = 0x00000001; - constant.dataLength = i + 1; - - constant = constant / n; - int totalBits = exp.BitCount(); - int count = 0; - - // perform squaring and multiply exponentiation - for (int pos = 0; pos < exp.dataLength; pos++) - { - uint mask = 0x01; - //Console.WriteLine("pos = " + pos); - - for (int index = 0; index < 32; index++) - { - if ((exp.data[pos] & mask) != 0) - resultNum = BarrettReduction(resultNum * tempNum, n, constant); - - mask <<= 1; - - tempNum = BarrettReduction(tempNum * tempNum, n, constant); - - - if (tempNum.dataLength == 1 && tempNum.data[0] == 1) - { - if (thisNegative && (exp.data[0] & 0x1) != 0) //odd exp - return -resultNum; - return resultNum; - } - count++; - if (count == totalBits) - break; - } - } - - if (thisNegative && (exp.data[0] & 0x1) != 0) //odd exp - return -resultNum; - - return resultNum; - } - - - - //*********************************************************************** - // Fast calculation of modular reduction using Barrett's reduction. - // Requires x < b^(2k), where b is the base. In this case, base is - // 2^32 (uint). - // - // Reference [4] - //*********************************************************************** - - private BigInteger BarrettReduction(BigInteger x, BigInteger n, BigInteger constant) - { - int k = n.dataLength, - kPlusOne = k + 1, - kMinusOne = k - 1; - - BigInteger q1 = new BigInteger(); - - // q1 = x / b^(k-1) - for (int i = kMinusOne, j = 0; i < x.dataLength; i++, j++) - q1.data[j] = x.data[i]; - q1.dataLength = x.dataLength - kMinusOne; - if (q1.dataLength <= 0) - q1.dataLength = 1; - - - BigInteger q2 = q1 * constant; - BigInteger q3 = new BigInteger(); - - // q3 = q2 / b^(k+1) - for (int i = kPlusOne, j = 0; i < q2.dataLength; i++, j++) - q3.data[j] = q2.data[i]; - q3.dataLength = q2.dataLength - kPlusOne; - if (q3.dataLength <= 0) - q3.dataLength = 1; - - - // r1 = x mod b^(k+1) - // i.e. keep the lowest (k+1) words - BigInteger r1 = new BigInteger(); - int lengthToCopy = (x.dataLength > kPlusOne) ? kPlusOne : x.dataLength; - for (int i = 0; i < lengthToCopy; i++) - r1.data[i] = x.data[i]; - r1.dataLength = lengthToCopy; - - - // r2 = (q3 * n) mod b^(k+1) - // partial multiplication of q3 and n - - BigInteger r2 = new BigInteger(); - for (int i = 0; i < q3.dataLength; i++) - { - if (q3.data[i] == 0) continue; - - ulong mcarry = 0; - int t = i; - for (int j = 0; j < n.dataLength && t < kPlusOne; j++, t++) - { - // t = i + j - ulong val = ((ulong)q3.data[i] * (ulong)n.data[j]) + - (ulong)r2.data[t] + mcarry; - - r2.data[t] = (uint)(val & 0xFFFFFFFF); - mcarry = (val >> 32); - } - - if (t < kPlusOne) - r2.data[t] = (uint)mcarry; - } - r2.dataLength = kPlusOne; - while (r2.dataLength > 1 && r2.data[r2.dataLength - 1] == 0) - r2.dataLength--; - - r1 -= r2; - if ((r1.data[maxLength - 1] & 0x80000000) != 0) // negative - { - BigInteger val = new BigInteger(); - val.data[kPlusOne] = 0x00000001; - val.dataLength = kPlusOne + 1; - r1 += val; - } - - while (r1 >= n) - r1 -= n; - - return r1; - } - - - //*********************************************************************** - // Returns gcd(this, bi) - //*********************************************************************** - - public BigInteger Gcd(BigInteger bi) - { - BigInteger x; - BigInteger y; - - if ((data[maxLength - 1] & 0x80000000) != 0) // negative - x = -this; - else - x = this; - - if ((bi.data[maxLength - 1] & 0x80000000) != 0) // negative - y = -bi; - else - y = bi; - - BigInteger g = y; - - while (x.dataLength > 1 || (x.dataLength == 1 && x.data[0] != 0)) - { - g = x; - x = y % x; - y = g; - } - - return g; - } - - - //*********************************************************************** - // Populates "this" with the specified amount of random bits - //*********************************************************************** - - public void GenRandomBits(int bits, StrongNumberProvider rand) - { - int dwords = bits >> 5; - int remBits = bits & 0x1F; - - if (remBits != 0) - dwords++; - - if (dwords > maxLength) - throw (new ArithmeticException("Number of required bits > maxLength.")); - - for (int i = 0; i < dwords; i++) - data[i] = (uint)rand.NextUInt32(); - - for (int i = dwords; i < maxLength; i++) - data[i] = 0; - - if (remBits != 0) - { - uint mask = (uint)(0x01 << (remBits - 1)); - data[dwords - 1] |= mask; - - mask = (uint)(0xFFFFFFFF >> (32 - remBits)); - data[dwords - 1] &= mask; - } - else - data[dwords - 1] |= 0x80000000; - - dataLength = dwords; - - if (dataLength == 0) - dataLength = 1; - } - - - //*********************************************************************** - // Returns the position of the most significant bit in the BigInteger. - // - // Eg. The result is 0, if the value of BigInteger is 0...0000 0000 - // The result is 1, if the value of BigInteger is 0...0000 0001 - // The result is 2, if the value of BigInteger is 0...0000 0010 - // The result is 2, if the value of BigInteger is 0...0000 0011 - // - //*********************************************************************** - - public int BitCount() - { - while (dataLength > 1 && data[dataLength - 1] == 0) - dataLength--; - - uint value = data[dataLength - 1]; - uint mask = 0x80000000; - int bits = 32; - - while (bits > 0 && (value & mask) == 0) - { - bits--; - mask >>= 1; - } - bits += ((dataLength - 1) << 5); - - return bits; - } - - - //*********************************************************************** - // Probabilistic prime test based on Fermat's little theorem - // - // for any a < p (p does not divide a) if - // a^(p-1) mod p != 1 then p is not prime. - // - // Otherwise, p is probably prime (pseudoprime to the chosen base). - // - // Returns - // ------- - // True if "this" is a pseudoprime to randomly chosen - // bases. The number of chosen bases is given by the "confidence" - // parameter. - // - // False if "this" is definitely NOT prime. - // - // Note - this method is fast but fails for Carmichael numbers except - // when the randomly chosen base is a factor of the number. - // - //*********************************************************************** - - public bool FermatLittleTest(int confidence) - { - BigInteger thisVal; - if ((this.data[maxLength - 1] & 0x80000000) != 0) // negative - thisVal = -this; - else - thisVal = this; - - if (thisVal.dataLength == 1) - { - // test small numbers - if (thisVal.data[0] == 0 || thisVal.data[0] == 1) - return false; - else if (thisVal.data[0] == 2 || thisVal.data[0] == 3) - return true; - } - - if ((thisVal.data[0] & 0x1) == 0) // even numbers - return false; - - int bits = thisVal.BitCount(); - BigInteger a = new BigInteger(); - BigInteger p_sub1 = thisVal - (new BigInteger(1)); - StrongNumberProvider rand = new StrongNumberProvider(); - - for (int round = 0; round < confidence; round++) - { - bool done = false; - - while (!done) // generate a < n - { - int testBits = 0; - - // make sure "a" has at least 2 bits - while (testBits < 2) - testBits = rand.NextInt() * bits; - - a.GenRandomBits(testBits, rand); - - int byteLen = a.dataLength; - - // make sure "a" is not 0 - if (byteLen > 1 || (byteLen == 1 && a.data[0] != 1)) - done = true; - } - - // check whether a factor exists (fix for version 1.03) - BigInteger gcdTest = a.Gcd(thisVal); - if (gcdTest.dataLength == 1 && gcdTest.data[0] != 1) - return false; - - // calculate a^(p-1) mod p - BigInteger expResult = a.ModPow(p_sub1, thisVal); - - int resultLen = expResult.dataLength; - - // is NOT prime is a^(p-1) mod p != 1 - - if (resultLen > 1 || (resultLen == 1 && expResult.data[0] != 1)) - { - //Console.WriteLine("a = " + a.ToString()); - return false; - } - } - - return true; - } - - - //*********************************************************************** - // Probabilistic prime test based on Rabin-Miller's - // - // for any p > 0 with p - 1 = 2^s * t - // - // p is probably prime (strong pseudoprime) if for any a < p, - // 1) a^t mod p = 1 or - // 2) a^((2^j)*t) mod p = p-1 for some 0 <= j <= s-1 - // - // Otherwise, p is composite. - // - // Returns - // ------- - // True if "this" is a strong pseudoprime to randomly chosen - // bases. The number of chosen bases is given by the "confidence" - // parameter. - // - // False if "this" is definitely NOT prime. - // - //*********************************************************************** - - public bool RabinMillerTest(int confidence) - { - BigInteger thisVal; - if ((this.data[maxLength - 1] & 0x80000000) != 0) // negative - thisVal = -this; - else - thisVal = this; - - if (thisVal.dataLength == 1) - { - // test small numbers - if (thisVal.data[0] == 0 || thisVal.data[0] == 1) - return false; - else if (thisVal.data[0] == 2 || thisVal.data[0] == 3) - return true; - } - - if ((thisVal.data[0] & 0x1) == 0) // even numbers - return false; - - - // calculate values of s and t - BigInteger p_sub1 = thisVal - (new BigInteger(1)); - int s = 0; - - for (int index = 0; index < p_sub1.dataLength; index++) - { - uint mask = 0x01; - - for (int i = 0; i < 32; i++) - { - if ((p_sub1.data[index] & mask) != 0) - { - index = p_sub1.dataLength; // to break the outer loop - break; - } - mask <<= 1; - s++; - } - } - - BigInteger t = p_sub1 >> s; - - int bits = thisVal.BitCount(); - BigInteger a = new BigInteger(); - StrongNumberProvider rand = new StrongNumberProvider(); - - for (int round = 0; round < confidence; round++) - { - bool done = false; - - while (!done) // generate a < n - { - int testBits = 0; - - // make sure "a" has at least 2 bits - while (testBits < 2) - testBits = (int)(rand.NextSingle() * bits); - - a.GenRandomBits(testBits, rand); - - int byteLen = a.dataLength; - - // make sure "a" is not 0 - if (byteLen > 1 || (byteLen == 1 && a.data[0] != 1)) - done = true; - } - - // check whether a factor exists (fix for version 1.03) - BigInteger gcdTest = a.Gcd(thisVal); - if (gcdTest.dataLength == 1 && gcdTest.data[0] != 1) - return false; - - BigInteger b = a.ModPow(t, thisVal); - - bool result = false; - - if (b.dataLength == 1 && b.data[0] == 1) // a^t mod p = 1 - result = true; - - for (int j = 0; result == false && j < s; j++) - { - if (b == p_sub1) // a^((2^j)*t) mod p = p-1 for some 0 <= j <= s-1 - { - result = true; - break; - } - - b = (b * b) % thisVal; - } - - if (result == false) - return false; - } - return true; - } - - - //*********************************************************************** - // Probabilistic prime test based on Solovay-Strassen (Euler Criterion) - // - // p is probably prime if for any a < p (a is not multiple of p), - // a^((p-1)/2) mod p = J(a, p) - // - // where J is the Jacobi symbol. - // - // Otherwise, p is composite. - // - // Returns - // ------- - // True if "this" is a Euler pseudoprime to randomly chosen - // bases. The number of chosen bases is given by the "confidence" - // parameter. - // - // False if "this" is definitely NOT prime. - // - //*********************************************************************** - - public bool SolovayStrassenTest(int confidence) - { - BigInteger thisVal; - if ((this.data[maxLength - 1] & 0x80000000) != 0) // negative - thisVal = -this; - else - thisVal = this; - - if (thisVal.dataLength == 1) - { - // test small numbers - if (thisVal.data[0] == 0 || thisVal.data[0] == 1) - return false; - else if (thisVal.data[0] == 2 || thisVal.data[0] == 3) - return true; - } - - if ((thisVal.data[0] & 0x1) == 0) // even numbers - return false; - - - int bits = thisVal.BitCount(); - BigInteger a = new BigInteger(); - BigInteger p_sub1 = thisVal - 1; - BigInteger p_sub1_shift = p_sub1 >> 1; - - StrongNumberProvider rand = new StrongNumberProvider(); - - for (int round = 0; round < confidence; round++) - { - bool done = false; - - while (!done) // generate a < n - { - int testBits = 0; - - // make sure "a" has at least 2 bits - while (testBits < 2) - testBits = (int)(rand.NextSingle() * bits); - - a.GenRandomBits(testBits, rand); - - int byteLen = a.dataLength; - - // make sure "a" is not 0 - if (byteLen > 1 || (byteLen == 1 && a.data[0] != 1)) - done = true; - } - - // check whether a factor exists (fix for version 1.03) - BigInteger gcdTest = a.Gcd(thisVal); - if (gcdTest.dataLength == 1 && gcdTest.data[0] != 1) - return false; - - // calculate a^((p-1)/2) mod p - - BigInteger expResult = a.ModPow(p_sub1_shift, thisVal); - if (expResult == p_sub1) - expResult = -1; - - // calculate Jacobi symbol - BigInteger jacob = Jacobi(a, thisVal); - - //Console.WriteLine("a = " + a.ToString(10) + " b = " + thisVal.ToString(10)); - //Console.WriteLine("expResult = " + expResult.ToString(10) + " Jacob = " + jacob.ToString(10)); - - // if they are different then it is not prime - if (expResult != jacob) - return false; - } - - return true; - } - - - //*********************************************************************** - // Implementation of the Lucas Strong Pseudo Prime test. - // - // Let n be an odd number with gcd(n,D) = 1, and n - J(D, n) = 2^s * d - // with d odd and s >= 0. - // - // If Ud mod n = 0 or V2^r*d mod n = 0 for some 0 <= r < s, then n - // is a strong Lucas pseudoprime with parameters (P, Q). We select - // P and Q based on Selfridge. - // - // Returns True if number is a strong Lucus pseudo prime. - // Otherwise, returns False indicating that number is composite. - //*********************************************************************** - - public bool LucasStrongTest() - { - BigInteger thisVal; - if ((this.data[maxLength - 1] & 0x80000000) != 0) // negative - thisVal = -this; - else - thisVal = this; - - if (thisVal.dataLength == 1) - { - // test small numbers - if (thisVal.data[0] == 0 || thisVal.data[0] == 1) - return false; - else if (thisVal.data[0] == 2 || thisVal.data[0] == 3) - return true; - } - - if ((thisVal.data[0] & 0x1) == 0) // even numbers - return false; - - return LucasStrongTestHelper(thisVal); - } - - - private bool LucasStrongTestHelper(BigInteger thisVal) - { - // Do the test (selects D based on Selfridge) - // Let D be the first element of the sequence - // 5, -7, 9, -11, 13, ... for which J(D,n) = -1 - // Let P = 1, Q = (1-D) / 4 - - long D = 5, sign = -1, dCount = 0; - bool done = false; - - while (!done) - { - int Jresult = BigInteger.Jacobi(D, thisVal); - - if (Jresult == -1) - done = true; // J(D, this) = 1 - else - { - if (Jresult == 0 && Math.Abs(D) < thisVal) // divisor found - return false; - - if (dCount == 20) - { - // check for square - BigInteger root = thisVal.Sqrt(); - if (root * root == thisVal) - return false; - } - - //Console.WriteLine(D); - D = (Math.Abs(D) + 2) * sign; - sign = -sign; - } - dCount++; - } - - long Q = (1 - D) >> 2; - - BigInteger p_add1 = thisVal + 1; - int s = 0; - - for (int index = 0; index < p_add1.dataLength; index++) - { - uint mask = 0x01; - - for (int i = 0; i < 32; i++) - { - if ((p_add1.data[index] & mask) != 0) - { - index = p_add1.dataLength; // to break the outer loop - break; - } - mask <<= 1; - s++; - } - } - - BigInteger t = p_add1 >> s; - - // calculate constant = b^(2k) / m - // for Barrett Reduction - BigInteger constant = new BigInteger(); - - int nLen = thisVal.dataLength << 1; - constant.data[nLen] = 0x00000001; - constant.dataLength = nLen + 1; - - constant = constant / thisVal; - - BigInteger[] lucas = LucasSequenceHelper(1, Q, t, thisVal, constant, 0); - bool isPrime = false; - - if ((lucas[0].dataLength == 1 && lucas[0].data[0] == 0) || - (lucas[1].dataLength == 1 && lucas[1].data[0] == 0)) - { - // u(t) = 0 or V(t) = 0 - isPrime = true; - } - - for (int i = 1; i < s; i++) - { - if (!isPrime) - { - // doubling of index - lucas[1] = thisVal.BarrettReduction(lucas[1] * lucas[1], thisVal, constant); - lucas[1] = (lucas[1] - (lucas[2] << 1)) % thisVal; - - //lucas[1] = ((lucas[1] * lucas[1]) - (lucas[2] << 1)) % thisVal; - - if ((lucas[1].dataLength == 1 && lucas[1].data[0] == 0)) - isPrime = true; - } - - lucas[2] = thisVal.BarrettReduction(lucas[2] * lucas[2], thisVal, constant); //Q^k - } - - - if (isPrime) // additional checks for composite numbers - { - // If n is prime and gcd(n, Q) == 1, then - // Q^((n+1)/2) = Q * Q^((n-1)/2) is congruent to (Q * J(Q, n)) mod n - - BigInteger g = thisVal.Gcd(Q); - if (g.dataLength == 1 && g.data[0] == 1) // gcd(this, Q) == 1 - { - if ((lucas[2].data[maxLength - 1] & 0x80000000) != 0) - lucas[2] += thisVal; - - BigInteger temp = (Q * BigInteger.Jacobi(Q, thisVal)) % thisVal; - if ((temp.data[maxLength - 1] & 0x80000000) != 0) - temp += thisVal; - - if (lucas[2] != temp) - isPrime = false; - } - } - - return isPrime; - } - - - //*********************************************************************** - // Determines whether a number is probably prime, using the Rabin-Miller's - // test. Before applying the test, the number is tested for divisibility - // by primes < 2000 - // - // Returns true if number is probably prime. - //*********************************************************************** - - public bool IsProbablePrime(int confidence) - { - BigInteger thisVal; - if ((this.data[maxLength - 1] & 0x80000000) != 0) // negative - thisVal = -this; - else - thisVal = this; - - - // test for divisibility by primes < 2000 - for (int p = 0; p < primesBelow2000.Length; p++) - { - BigInteger divisor = primesBelow2000[p]; - - if (divisor >= thisVal) - break; - - BigInteger resultNum = thisVal % divisor; - if (resultNum.IntValue() == 0) - { - /* - Console.WriteLine("Not prime! Divisible by {0}\n", - primesBelow2000[p]); - */ - return false; - } - } - - if (thisVal.RabinMillerTest(confidence)) - return true; - else - { - //Console.WriteLine("Not prime! Failed primality test\n"); - return false; - } - } - - - //*********************************************************************** - // Determines whether this BigInteger is probably prime using a - // combination of base 2 strong pseudoprime test and Lucas strong - // pseudoprime test. - // - // The sequence of the primality test is as follows, - // - // 1) Trial divisions are carried out using prime numbers below 2000. - // if any of the primes divides this BigInteger, then it is not prime. - // - // 2) Perform base 2 strong pseudoprime test. If this BigInteger is a - // base 2 strong pseudoprime, proceed on to the next step. - // - // 3) Perform strong Lucas pseudoprime test. - // - // Returns True if this BigInteger is both a base 2 strong pseudoprime - // and a strong Lucas pseudoprime. - // - // For a detailed discussion of this primality test, see [6]. - // - //*********************************************************************** - - public bool IsProbablePrime() - { - BigInteger thisVal; - if ((this.data[maxLength - 1] & 0x80000000) != 0) // negative - thisVal = -this; - else - thisVal = this; - - if (thisVal.dataLength == 1) - { - // test small numbers - if (thisVal.data[0] == 0 || thisVal.data[0] == 1) - return false; - else if (thisVal.data[0] == 2 || thisVal.data[0] == 3) - return true; - } - - if ((thisVal.data[0] & 0x1) == 0) // even numbers - return false; - - - // test for divisibility by primes < 2000 - for (int p = 0; p < primesBelow2000.Length; p++) - { - BigInteger divisor = primesBelow2000[p]; - - if (divisor >= thisVal) - break; - - BigInteger resultNum = thisVal % divisor; - if (resultNum.IntValue() == 0) - { - //Console.WriteLine("Not prime! Divisible by {0}\n", - // primesBelow2000[p]); - - return false; - } - } - - // Perform BASE 2 Rabin-Miller Test - - // calculate values of s and t - BigInteger p_sub1 = thisVal - (new BigInteger(1)); - int s = 0; - - for (int index = 0; index < p_sub1.dataLength; index++) - { - uint mask = 0x01; - - for (int i = 0; i < 32; i++) - { - if ((p_sub1.data[index] & mask) != 0) - { - index = p_sub1.dataLength; // to break the outer loop - break; - } - mask <<= 1; - s++; - } - } - - BigInteger t = p_sub1 >> s; - - int bits = thisVal.BitCount(); - BigInteger a = 2; - - // b = a^t mod p - BigInteger b = a.ModPow(t, thisVal); - bool result = false; - - if (b.dataLength == 1 && b.data[0] == 1) // a^t mod p = 1 - result = true; - - for (int j = 0; result == false && j < s; j++) - { - if (b == p_sub1) // a^((2^j)*t) mod p = p-1 for some 0 <= j <= s-1 - { - result = true; - break; - } - - b = (b * b) % thisVal; - } - - // if number is strong pseudoprime to base 2, then do a strong lucas test - if (result) - result = LucasStrongTestHelper(thisVal); - - return result; - } - - - - //*********************************************************************** - // Returns the lowest 4 bytes of the BigInteger as an int. - //*********************************************************************** - - public int IntValue() - { - return (int)data[0]; - } - - - //*********************************************************************** - // Returns the lowest 8 bytes of the BigInteger as a long. - //*********************************************************************** - - public long LongValue() - { - long val = 0; - - val = (long)data[0]; - try - { // exception if maxLength = 1 - val |= (long)data[1] << 32; - } - catch (Exception) - { - if ((data[0] & 0x80000000) != 0) // negative - val = (int)data[0]; - } - - return val; - } - - - //*********************************************************************** - // Computes the Jacobi Symbol for a and b. - // Algorithm adapted from [3] and [4] with some optimizations - //*********************************************************************** - - public static int Jacobi(BigInteger a, BigInteger b) - { - // Jacobi defined only for odd integers - if ((b.data[0] & 0x1) == 0) - throw (new ArgumentException("Jacobi defined only for odd integers.")); - - if (a >= b) a %= b; - if (a.dataLength == 1 && a.data[0] == 0) return 0; // a == 0 - if (a.dataLength == 1 && a.data[0] == 1) return 1; // a == 1 - - if (a < 0) - { - if ((((b - 1).data[0]) & 0x2) == 0) //if( (((b-1) >> 1).data[0] & 0x1) == 0) - return Jacobi(-a, b); - else - return -Jacobi(-a, b); - } - - int e = 0; - for (int index = 0; index < a.dataLength; index++) - { - uint mask = 0x01; - - for (int i = 0; i < 32; i++) - { - if ((a.data[index] & mask) != 0) - { - index = a.dataLength; // to break the outer loop - break; - } - mask <<= 1; - e++; - } - } - - BigInteger a1 = a >> e; - - int s = 1; - if ((e & 0x1) != 0 && ((b.data[0] & 0x7) == 3 || (b.data[0] & 0x7) == 5)) - s = -1; - - if ((b.data[0] & 0x3) == 3 && (a1.data[0] & 0x3) == 3) - s = -s; - - if (a1.dataLength == 1 && a1.data[0] == 1) - return s; - else - return (s * Jacobi(b % a1, a1)); - } - - - - //*********************************************************************** - // Generates a positive BigInteger that is probably prime. - //*********************************************************************** - - public static BigInteger GenPseudoPrime(int bits, int confidence, StrongNumberProvider rand) - { - BigInteger result = new BigInteger(); - bool done = false; - - while (!done) - { - result.GenRandomBits(bits, rand); - result.data[0] |= 0x01; // make it odd - - // prime test - done = result.IsProbablePrime(confidence); - } - return result; - } - - - //*********************************************************************** - // Generates a random number with the specified number of bits such - // that gcd(number, this) = 1 - //*********************************************************************** - - public BigInteger GenCoPrime(int bits, StrongNumberProvider rand) - { - bool done = false; - BigInteger result = new BigInteger(); - - while (!done) - { - result.GenRandomBits(bits, rand); - //Console.WriteLine(result.ToString(16)); - - // gcd test - BigInteger g = result.Gcd(this); - if (g.dataLength == 1 && g.data[0] == 1) - done = true; - } - - return result; - } - - - //*********************************************************************** - // Returns the modulo inverse of this. Throws ArithmeticException if - // the inverse does not exist. (i.e. gcd(this, modulus) != 1) - //*********************************************************************** - - public BigInteger ModInverse(BigInteger modulus) - { - BigInteger[] p = { 0, 1 }; - BigInteger[] q = new BigInteger[2]; // quotients - BigInteger[] r = { 0, 0 }; // remainders - - int step = 0; - - BigInteger a = modulus; - BigInteger b = this; - - while (b.dataLength > 1 || (b.dataLength == 1 && b.data[0] != 0)) - { - BigInteger quotient = new BigInteger(); - BigInteger remainder = new BigInteger(); - - if (step > 1) - { - BigInteger pval = (p[0] - (p[1] * q[0])) % modulus; - p[0] = p[1]; - p[1] = pval; - } - - if (b.dataLength == 1) - SingleByteDivide(a, b, quotient, remainder); - else - MultiByteDivide(a, b, quotient, remainder); - - /* - Console.WriteLine(quotient.dataLength); - Console.WriteLine("{0} = {1}({2}) + {3} p = {4}", a.ToString(10), - b.ToString(10), quotient.ToString(10), remainder.ToString(10), - p[1].ToString(10)); - */ - - q[0] = q[1]; - r[0] = r[1]; - q[1] = quotient; r[1] = remainder; - - a = b; - b = remainder; - - step++; - } - - if (r[0].dataLength > 1 || (r[0].dataLength == 1 && r[0].data[0] != 1)) - throw (new ArithmeticException("No inverse!")); - - BigInteger result = ((p[0] - (p[1] * q[0])) % modulus); - - if ((result.data[maxLength - 1] & 0x80000000) != 0) - result += modulus; // get the least positive modulus - - return result; - } - - - //*********************************************************************** - // Returns the value of the BigInteger as a byte array. The lowest - // index contains the MSB. - //*********************************************************************** - - public byte[] GetBytes() - { - int numBits = BitCount(); - - int numBytes = numBits >> 3; - if ((numBits & 0x7) != 0) - numBytes++; - - byte[] result = new byte[numBytes]; - - //Console.WriteLine(result.Length); - - int pos = 0; - uint tempVal, val = data[dataLength - 1]; - - if ((tempVal = (val >> 24 & 0xFF)) != 0) - result[pos++] = (byte)tempVal; - if ((tempVal = (val >> 16 & 0xFF)) != 0) - result[pos++] = (byte)tempVal; - if ((tempVal = (val >> 8 & 0xFF)) != 0) - result[pos++] = (byte)tempVal; - if ((tempVal = (val & 0xFF)) != 0) - result[pos++] = (byte)tempVal; - - for (int i = dataLength - 2; i >= 0; i--, pos += 4) - { - val = data[i]; - result[pos + 3] = (byte)(val & 0xFF); - val >>= 8; - result[pos + 2] = (byte)(val & 0xFF); - val >>= 8; - result[pos + 1] = (byte)(val & 0xFF); - val >>= 8; - result[pos] = (byte)(val & 0xFF); - } - - return result; - } - - - //*********************************************************************** - // Sets the value of the specified bit to 1 - // The Least Significant Bit position is 0. - //*********************************************************************** - - public void SetBit(uint bitNum) - { - uint bytePos = bitNum >> 5; // divide by 32 - byte bitPos = (byte)(bitNum & 0x1F); // get the lowest 5 bits - - uint mask = (uint)1 << bitPos; - this.data[bytePos] |= mask; - - if (bytePos >= this.dataLength) - this.dataLength = (int)bytePos + 1; - } - - - //*********************************************************************** - // Sets the value of the specified bit to 0 - // The Least Significant Bit position is 0. - //*********************************************************************** - - public void UnsetBit(uint bitNum) - { - uint bytePos = bitNum >> 5; - - if (bytePos < this.dataLength) - { - byte bitPos = (byte)(bitNum & 0x1F); - - uint mask = (uint)1 << bitPos; - uint mask2 = 0xFFFFFFFF ^ mask; - - this.data[bytePos] &= mask2; - - if (this.dataLength > 1 && this.data[this.dataLength - 1] == 0) - this.dataLength--; - } - } - - - //*********************************************************************** - // Returns a value that is equivalent to the integer square root - // of the BigInteger. - // - // The integer square root of "this" is defined as the largest integer n - // such that (n * n) <= this - // - //*********************************************************************** - - public BigInteger Sqrt() - { - uint numBits = (uint)this.BitCount(); - - if ((numBits & 0x1) != 0) // odd number of bits - numBits = (numBits >> 1) + 1; - else - numBits = (numBits >> 1); - - uint bytePos = numBits >> 5; - byte bitPos = (byte)(numBits & 0x1F); - - uint mask; - - BigInteger result = new BigInteger(); - if (bitPos == 0) - mask = 0x80000000; - else - { - mask = (uint)1 << bitPos; - bytePos++; - } - result.dataLength = (int)bytePos; - - for (int i = (int)bytePos - 1; i >= 0; i--) - { - while (mask != 0) - { - // guess - result.data[i] ^= mask; - - // undo the guess if its square is larger than this - if ((result * result) > this) - result.data[i] ^= mask; - - mask >>= 1; - } - mask = 0x80000000; - } - return result; - } - - - //*********************************************************************** - // Returns the k_th number in the Lucas Sequence reduced modulo n. - // - // Uses index doubling to speed up the process. For example, to calculate V(k), - // we maintain two numbers in the sequence V(n) and V(n+1). - // - // To obtain V(2n), we use the identity - // V(2n) = (V(n) * V(n)) - (2 * Q^n) - // To obtain V(2n+1), we first write it as - // V(2n+1) = V((n+1) + n) - // and use the identity - // V(m+n) = V(m) * V(n) - Q * V(m-n) - // Hence, - // V((n+1) + n) = V(n+1) * V(n) - Q^n * V((n+1) - n) - // = V(n+1) * V(n) - Q^n * V(1) - // = V(n+1) * V(n) - Q^n * P - // - // We use k in its binary expansion and perform index doubling for each - // bit position. For each bit position that is set, we perform an - // index doubling followed by an index addition. This means that for V(n), - // we need to update it to V(2n+1). For V(n+1), we need to update it to - // V((2n+1)+1) = V(2*(n+1)) - // - // This function returns - // [0] = U(k) - // [1] = V(k) - // [2] = Q^n - // - // Where U(0) = 0 % n, U(1) = 1 % n - // V(0) = 2 % n, V(1) = P % n - //*********************************************************************** - - public static BigInteger[] LucasSequence(BigInteger P, BigInteger Q, - BigInteger k, BigInteger n) - { - if (k.dataLength == 1 && k.data[0] == 0) - { - BigInteger[] result = new BigInteger[3]; - - result[0] = 0; result[1] = 2 % n; result[2] = 1 % n; - return result; - } - - // calculate constant = b^(2k) / m - // for Barrett Reduction - BigInteger constant = new BigInteger(); - - int nLen = n.dataLength << 1; - constant.data[nLen] = 0x00000001; - constant.dataLength = nLen + 1; - - constant = constant / n; - - // calculate values of s and t - int s = 0; - - for (int index = 0; index < k.dataLength; index++) - { - uint mask = 0x01; - - for (int i = 0; i < 32; i++) - { - if ((k.data[index] & mask) != 0) - { - index = k.dataLength; // to break the outer loop - break; - } - mask <<= 1; - s++; - } - } - - BigInteger t = k >> s; - - //Console.WriteLine("s = " + s + " t = " + t); - return LucasSequenceHelper(P, Q, t, n, constant, s); - } - - - //*********************************************************************** - // Performs the calculation of the kth term in the Lucas Sequence. - // For details of the algorithm, see reference [9]. - // - // k must be odd. i.e LSB == 1 - //*********************************************************************** - - private static BigInteger[] LucasSequenceHelper(BigInteger P, BigInteger Q, - BigInteger k, BigInteger n, - BigInteger constant, int s) - { - BigInteger[] result = new BigInteger[3]; - - if ((k.data[0] & 0x00000001) == 0) - throw (new ArgumentException("Argument k must be odd.")); - - int numbits = k.BitCount(); - uint mask = (uint)0x1 << ((numbits & 0x1F) - 1); - - // v = v0, v1 = v1, u1 = u1, Q_k = Q^0 - - BigInteger v = 2 % n, Q_k = 1 % n, - v1 = P % n, u1 = Q_k; - bool flag = true; - - for (int i = k.dataLength - 1; i >= 0; i--) // iterate on the binary expansion of k - { - //Console.WriteLine("round"); - while (mask != 0) - { - if (i == 0 && mask == 0x00000001) // last bit - break; - - if ((k.data[i] & mask) != 0) // bit is set - { - // index doubling with addition - - u1 = (u1 * v1) % n; - - v = ((v * v1) - (P * Q_k)) % n; - v1 = n.BarrettReduction(v1 * v1, n, constant); - v1 = (v1 - ((Q_k * Q) << 1)) % n; - - if (flag) - flag = false; - else - Q_k = n.BarrettReduction(Q_k * Q_k, n, constant); - - Q_k = (Q_k * Q) % n; - } - else - { - // index doubling - u1 = ((u1 * v) - Q_k) % n; - - v1 = ((v * v1) - (P * Q_k)) % n; - v = n.BarrettReduction(v * v, n, constant); - v = (v - (Q_k << 1)) % n; - - if (flag) - { - Q_k = Q % n; - flag = false; - } - else - Q_k = n.BarrettReduction(Q_k * Q_k, n, constant); - } - - mask >>= 1; - } - mask = 0x80000000; - } - - // at this point u1 = u(n+1) and v = v(n) - // since the last bit always 1, we need to transform u1 to u(2n+1) and v to v(2n+1) - - u1 = ((u1 * v) - Q_k) % n; - v = ((v * v1) - (P * Q_k)) % n; - if (flag) - flag = false; - else - Q_k = n.BarrettReduction(Q_k * Q_k, n, constant); - - Q_k = (Q_k * Q) % n; - - - for (int i = 0; i < s; i++) - { - // index doubling - u1 = (u1 * v) % n; - v = ((v * v) - (Q_k << 1)) % n; - - if (flag) - { - Q_k = Q % n; - flag = false; - } - else - Q_k = n.BarrettReduction(Q_k * Q_k, n, constant); - } - - result[0] = u1; - result[1] = v; - result[2] = Q_k; - - return result; - } - - #region IDisposable Members - - public void Dispose() - { - data = new uint[0]; - data = null; - } - - #endregion - } -} diff --git a/ClientServerLib/ClientServerLib/DeffieHellman/DeffieHellman.cs b/ClientServerLib/ClientServerLib/DeffieHellman/DeffieHellman.cs deleted file mode 100644 index fd8543fb..00000000 --- a/ClientServerLib/ClientServerLib/DeffieHellman/DeffieHellman.cs +++ /dev/null @@ -1,179 +0,0 @@ -using System; -using System.Collections.Generic; -using System.Text; -using System.Security.Cryptography; - -namespace DiffieHellman -{ - /// - /// Represents the Diffie-Hellman algorithm. - /// - public class CDiffieHellman : IDisposable - { - #region - Util - - static StrongNumberProvider _strongRng = new StrongNumberProvider(); - #endregion - - #region - Fields - - /// - /// The number of bits to generate. - /// - private int bits = 256; - - /// - /// The shared prime. - /// - BigInteger prime; - /// - /// The shared base. - /// - BigInteger g; - /// - /// The private prime. - /// - BigInteger mine; - - /// - /// The final key. - /// - byte[] key; - /// - /// The string representation/packet. - /// - string representation; - #endregion - - #region - Properties - - /// - /// Gets the final key to use for encryption. - /// - public byte[] Key - { - get { return key; } - } - #endregion - - #region - Ctor - - public CDiffieHellman() - { - } - - public CDiffieHellman(int bits) - { - this.bits = bits; - } - - ~CDiffieHellman() - { - Dispose(); - } - #endregion - - #region - Implementation Methods - - #region Flow - /// - /// Generates a request packet. - /// - /// - public CDiffieHellman GenerateRequest() - { - // Generate the parameters. - prime = BigInteger.GenPseudoPrime(bits, 30, _strongRng); - mine = BigInteger.GenPseudoPrime(bits, 30, _strongRng); - g = (BigInteger)5; - - // Gemerate the string. - StringBuilder rep = new StringBuilder(); - rep.Append(prime.ToString(36)); - rep.Append("|"); - rep.Append(g.ToString(36)); - rep.Append("|"); - - // Generate the send BigInt. - using (BigInteger send = g.ModPow(mine, prime)) - { - rep.Append(send.ToString(36)); - } - - representation = rep.ToString(); - return this; - } - - /// - /// Generate a response packet. - /// - /// The string representation of the request. - /// - public CDiffieHellman GenerateResponse(string request) - { - string[] parts = request.Split('|'); - - // Generate the would-be fields. - using (BigInteger prime = new BigInteger(parts[0], 36)) - using (BigInteger g = new BigInteger(parts[1], 36)) - using (BigInteger mine = BigInteger.GenPseudoPrime(bits, 30, _strongRng)) - { - // Generate the key. - using (BigInteger given = new BigInteger(parts[2], 36)) - using (BigInteger key = given.ModPow(mine, prime)) - { - this.key = key.GetBytes(); - } - - // Generate the response. - using (BigInteger send = g.ModPow(mine, prime)) - { - this.representation = send.ToString(36); - } - } - - return this; - } - - /// - /// Generates the key after a response is received. - /// - /// The string representation of the response. - public void HandleResponse(string response) - { - // Get the response and modpow it with the stored prime. - using (BigInteger given = new BigInteger(response, 36)) - using (BigInteger key = given.ModPow(mine, prime)) - { - this.key = key.GetBytes(); - } - Dispose(); - } - #endregion - - public override string ToString() - { - return representation; - } - #endregion - - #region IDisposable Members - /// - /// Ends the calculation. The key will still be available. - /// - public void Dispose() - { - if (!Object.ReferenceEquals(prime, null)) - prime.Dispose(); - if (!Object.ReferenceEquals(mine, null)) - mine.Dispose(); - if (!Object.ReferenceEquals(g, null)) - g.Dispose(); - - prime = null; - mine = null; - g = null; - - representation = null; - GC.Collect(); - GC.Collect(); - } - - #endregion - } -} diff --git a/ClientServerLib/ClientServerLib/DeffieHellman/StrongNumberProvider.cs b/ClientServerLib/ClientServerLib/DeffieHellman/StrongNumberProvider.cs deleted file mode 100644 index 720a1414..00000000 --- a/ClientServerLib/ClientServerLib/DeffieHellman/StrongNumberProvider.cs +++ /dev/null @@ -1,33 +0,0 @@ -using System; -using System.Collections.Generic; -using System.Text; -using System.Security.Cryptography; - -namespace DiffieHellman -{ - internal class StrongNumberProvider - { - private static RNGCryptoServiceProvider csp = new RNGCryptoServiceProvider(); - - public uint NextUInt32() - { - byte[] res = new byte[4]; - csp.GetBytes(res); - return BitConverter.ToUInt32(res, 0); - } - - public int NextInt() - { - byte[] res = new byte[4]; - csp.GetBytes(res); - return BitConverter.ToInt32(res, 0); - } - - public Single NextSingle() - { - float numerator = NextUInt32(); - float denominator = uint.MaxValue; - return numerator / denominator; - } - } -} diff --git a/ClientServerLib/ClientServerLib/ClientServerLib.csproj b/ClientServerLib/ClientServerLib/ServerLib.csproj similarity index 88% rename from ClientServerLib/ClientServerLib/ClientServerLib.csproj rename to ClientServerLib/ClientServerLib/ServerLib.csproj index 1037baeb..023b4bc6 100644 --- a/ClientServerLib/ClientServerLib/ClientServerLib.csproj +++ b/ClientServerLib/ClientServerLib/ServerLib.csproj @@ -8,7 +8,7 @@ {EC5167E4-CCFB-4CEE-987C-CF816F1062A3} Library Properties - ClientServerLib + ServerLib ClientServerLib v4.0 512 @@ -47,17 +47,11 @@ - - - - - -