class/Mono.Security/Mono.Security.Cryptography/DHKeyGeneration.cs

   1 //
   2 // DHKeyGeneration.cs: Defines the different key generation methods.
   3 //
   4 // Author:
   5 //      Pieter Philippaerts (Pieter@mentalis.org)
   6 //
   7 // (C) 2003 The Mentalis.org Team (http://www.mentalis.org/)
   8 //
   9
  10 //
  11 // Permission is hereby granted, free of charge, to any person obtaining
  12 // a copy of this software and associated documentation files (the
  13 // "Software"), to deal in the Software without restriction, including
  14 // without limitation the rights to use, copy, modify, merge, publish,
  15 // distribute, sublicense, and/or sell copies of the Software, and to
  16 // permit persons to whom the Software is furnished to do so, subject to
  17 // the following conditions:
  18 //
  19 // The above copyright notice and this permission notice shall be
  20 // included in all copies or substantial portions of the Software.
  21 //
  22 // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  23 // EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  24 // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  25 // NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
  26 // LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
  27 // OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
  28 // WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
  29 //
  30
  31 using System;
  32
  33 namespace Mono.Security.Cryptography {
  34         /// <summary>
  35         /// Defines the different Diffie-Hellman key generation methods.
  36         /// </summary>
  37         public enum DHKeyGeneration {
  38                 /// <summary>
  39                 /// [TODO] you first randomly select a prime Q of size 160 bits, then choose P randomly among numbers like
  40                 /// Q*R+1 with R random. Then you go along with finding a generator G which has order exactly Q. The private
  41                 /// key X is then a number modulo Q.
  42                 /// [FIPS 186-2-Change1 -- http://csrc.nist.gov/publications/fips/]
  43                 /// </summary>
  44                 // see RFC2631 [http://www.faqs.org/rfcs/rfc2631.html]
  45                 //DSA,
  46                 /// <summary>
  47                 /// Returns dynamically generated values for P and G. Unlike the Sophie Germain or DSA key generation methods,
  48                 /// this method does not ensure that the selected prime offers an adequate security level.
  49                 /// </summary>
  50                 Random,
  51                 /// <summary>
  52                 /// Returns dynamically generated values for P and G. P is a Sophie Germain prime, which has some interesting
  53                 /// security features when used with Diffie Hellman.
  54                 /// </summary>
  55                 //SophieGermain,
  56                 /// <summary>
  57                 /// Returns values for P and G that are hard coded in this library. Contrary to what your intuition may tell you,
  58                 /// using these hard coded values is perfectly safe.
  59                 /// The values of the P and G parameters are taken from 'The OAKLEY Key Determination Protocol' [RFC2412].
  60                 /// This is the prefered key generation method, because it is very fast and very safe.
  61                 /// Because this method uses fixed values for the P and G parameters, not all bit sizes are supported.
  62                 /// The current implementation supports bit sizes of 768, 1024 and 1536.
  63                 /// </summary>
  64                 Static
  65         }
  66 }