pike.git/ lib/ modules/ Crypto.pmod/ DH.pmod

2014-09-28

2014-09-28 22:37:36 by Martin Nilsson <nilsson@opera.com>

• b137d6589479fed714f4adaeefe284cd895bf770 (32 lines) (+32/-0) ^{[ Show | Annotate ]}
  Branch: 8.0

Added validation method and _sprintf.

44:    }   #endif    +  //! Validate that the DH Parameters doesn't have obvious security +  //! weaknesses. It will first attempt to verify the prime @[p] using +  //! Donald Knuth's probabilistic primality test with provided +  //! @[effort]. This has a chance of pow(0.25,effort) to produce a +  //! false positive. An @[effort] of 0 skipps this step. The second +  //! test verifies that @[g] is of high order. +  bool validate(int(0..) effort) +  { +  if( effort && !p->probably_prime_p(effort) ) +  return 0; +  +  Gmp.mpz qq = [object(Gmp.mpz)]((p-1)/2); +  while( int f = qq->small_factor() ) +  qq /= f; +  +  if( g->powm( [object(Gmp.mpz)]((p-1)/qq), p )==1 ) +  return 0; +  +  return 1; +  } +     //! Alias for @[q].    //!    //! @deprecated q
99:    this_program::g = g && Gmp.mpz(g) || Gmp.mpz(2);    this_program::q = q && Gmp.mpz(q) || Gmp.mpz( [int](p-1)/2 );    } +  +  protected string _sprintf(int t) +  { +  if( t!='O' ) return UNDEFINED; +  mapping(string:mixed) m = mkmapping([array(string)]indices(Crypto.DH), +  values(Crypto.DH)); +  foreach(m; string id; mixed val) +  if( val==this ) return sprintf("Crypto.DH.%s", id); +  return sprintf("%O(%O, %O, %O)", this_program, p, g, q);    } -  + }      //! MODP Group 1 (768 bit) (aka First Oakley Group (aka ORM96 group 1)).   //!