mdw@git.distorted.org.uk Git - catacomb-python/blob - catacomb/__init__.py

   1 ### -*-python-*-
   2 ###
   3 ### Setup for Catacomb/Python bindings
   4 ###
   5 ### (c) 2004 Straylight/Edgeware
   6 ###
   7
   8 ###----- Licensing notice ---------------------------------------------------
   9 ###
  10 ### This file is part of the Python interface to Catacomb.
  11 ###
  12 ### Catacomb/Python is free software; you can redistribute it and/or modify
  13 ### it under the terms of the GNU General Public License as published by
  14 ### the Free Software Foundation; either version 2 of the License, or
  15 ### (at your option) any later version.
  16 ###
  17 ### Catacomb/Python is distributed in the hope that it will be useful,
  18 ### but WITHOUT ANY WARRANTY; without even the implied warranty of
  19 ### MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  20 ### GNU General Public License for more details.
  21 ###
  22 ### You should have received a copy of the GNU General Public License
  23 ### along with Catacomb/Python; if not, write to the Free Software Foundation,
  24 ### Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
  25
  26 import _base
  27 import types as _types
  28 from binascii import hexlify as _hexify, unhexlify as _unhexify
  29 from sys import argv as _argv
  30
  31 ###--------------------------------------------------------------------------
  32 ### Basic stuff.
  33
  34 ## For the benefit of the default keyreporter, we need the program na,e.
  35 _base._ego(_argv[0])
  36
  37 ## How to fix a name back into the right identifier.  Alas, the rules are not
  38 ## consistent.
  39 def _fixname(name):
  40
  41   ## Hyphens consistently become underscores.
  42   name = name.replace('-', '_')
  43
  44   ## But slashes might become underscores or just vanish.
  45   if name.startswith('salsa20'): name = name.translate(None, '/')
  46   else: name = name.replace('/', '_')
  47
  48   ## Done.
  49   return name
  50
  51 ## Initialize the module.  Drag in the static methods of the various
  52 ## classes; create names for the various known crypto algorithms.
  53 def _init():
  54   d = globals()
  55   b = _base.__dict__;
  56   for i in b:
  57     if i[0] != '_':
  58       d[i] = b[i];
  59   for i in ['MP', 'GF', 'Field',
  60             'ECPt', 'ECPtCurve', 'ECCurve', 'ECInfo',
  61             'DHInfo', 'BinDHInfo', 'RSAPriv', 'BBSPriv',
  62             'PrimeFilter', 'RabinMiller',
  63             'Group', 'GE',
  64             'KeySZ', 'KeyData']:
  65     c = d[i]
  66     pre = '_' + i + '_'
  67     plen = len(pre)
  68     for j in b:
  69       if j[:plen] == pre:
  70         setattr(c, j[plen:], classmethod(b[j]))
  71   for i in [gcciphers, gchashes, gcmacs, gcprps]:
  72     for c in i.itervalues():
  73       d[_fixname(c.name)] = c
  74   for c in gccrands.itervalues():
  75     d[_fixname(c.name + 'rand')] = c
  76 _init()
  77
  78 ## A handy function for our work: add the methods of a named class to an
  79 ## existing class.  This is how we write the Python-implemented parts of our
  80 ## mostly-C types.
  81 def _augment(c, cc):
  82   for i in cc.__dict__:
  83     a = cc.__dict__[i]
  84     if type(a) is _types.MethodType:
  85       a = a.im_func
  86     elif type(a) not in (_types.FunctionType, staticmethod, classmethod):
  87       continue
  88     setattr(c, i, a)
  89
  90 ## Parsing functions tend to return the object parsed and the remainder of
  91 ## the input.  This checks that the remainder is input and, if so, returns
  92 ## just the object.
  93 def _checkend(r):
  94   x, rest = r
  95   if rest != '':
  96     raise SyntaxError, 'junk at end of string'
  97   return x
  98
  99 ## Some pretty-printing utilities.
 100 PRINT_SECRETS = False
 101 def _clsname(me): return type(me).__name__
 102 def _repr_secret(thing, secretp = True):
 103   if not secretp or PRINT_SECRETS: return repr(thing)
 104   else: return '#<SECRET>'
 105 def _pp_str(me, pp, cyclep): pp.text(cyclep and '...' or str(me))
 106 def _pp_secret(pp, thing, secretp = True):
 107   if not secretp or PRINT_SECRETS: pp.pretty(thing)
 108   else: pp.text('#<SECRET>')
 109 def _pp_bgroup(pp, text):
 110   ind = len(text)
 111   pp.begin_group(ind, text)
 112   return ind
 113 def _pp_bgroup_tyname(pp, obj, open = '('):
 114   return _pp_bgroup(pp, _clsname(obj) + open)
 115 def _pp_kv(pp, k, v, secretp = False):
 116   ind = _pp_bgroup(pp, k + ' = ')
 117   _pp_secret(pp, v, secretp)
 118   pp.end_group(ind, '')
 119 def _pp_commas(pp, printfn, items):
 120   firstp = True
 121   for i in items:
 122     if firstp: firstp = False
 123     else: pp.text(','); pp.breakable()
 124     printfn(i)
 125 def _pp_dict(pp, items):
 126   def p((k, v)):
 127     pp.begin_group(0)
 128     pp.pretty(k)
 129     pp.text(':')
 130     pp.begin_group(2)
 131     pp.breakable()
 132     pp.pretty(v)
 133     pp.end_group(2)
 134     pp.end_group(0)
 135   _pp_commas(pp, p, items)
 136
 137 ###--------------------------------------------------------------------------
 138 ### Bytestrings.
 139
 140 class _tmp:
 141   def fromhex(x):
 142     return ByteString(_unhexify(x))
 143   fromhex = staticmethod(fromhex)
 144   def __hex__(me):
 145     return _hexify(me)
 146   def __repr__(me):
 147     return 'bytes(%r)' % hex(me)
 148 _augment(ByteString, _tmp)
 149 ByteString.__hash__ = str.__hash__
 150 bytes = ByteString.fromhex
 151
 152 ###--------------------------------------------------------------------------
 153 ### Hashing.
 154
 155 class _tmp:
 156   def check(me, h):
 157     hh = me.done()
 158     return ctstreq(h, hh)
 159 _augment(GHash, _tmp)
 160 _augment(Poly1305Hash, _tmp)
 161
 162 ###--------------------------------------------------------------------------
 163 ### NaCl `secretbox'.
 164
 165 def secret_box(k, n, m):
 166   E = xsalsa20(k).setiv(n)
 167   r = E.enczero(poly1305.keysz.default)
 168   s = E.enczero(poly1305.masksz)
 169   y = E.encrypt(m)
 170   t = poly1305(r)(s).hash(y).done()
 171   return ByteString(t + y)
 172
 173 def secret_unbox(k, n, c):
 174   E = xsalsa20(k).setiv(n)
 175   r = E.enczero(poly1305.keysz.default)
 176   s = E.enczero(poly1305.masksz)
 177   y = c[poly1305.tagsz:]
 178   if not poly1305(r)(s).hash(y).check(c[0:poly1305.tagsz]):
 179     raise ValueError, 'decryption failed'
 180   return E.decrypt(c[poly1305.tagsz:])
 181
 182 ###--------------------------------------------------------------------------
 183 ### Multiprecision integers and binary polynomials.
 184
 185 def _split_rat(x):
 186   if isinstance(x, BaseRat): return x._n, x._d
 187   else: return x, 1
 188 class BaseRat (object):
 189   """Base class implementing fields of fractions over Euclidean domains."""
 190   def __new__(cls, a, b):
 191     a, b = cls.RING(a), cls.RING(b)
 192     q, r = divmod(a, b)
 193     if r == 0: return q
 194     g = b.gcd(r)
 195     me = super(BaseRat, cls).__new__(cls)
 196     me._n = a//g
 197     me._d = b//g
 198     return me
 199   @property
 200   def numer(me): return me._n
 201   @property
 202   def denom(me): return me._d
 203   def __str__(me): return '%s/%s' % (me._n, me._d)
 204   def __repr__(me): return '%s(%s, %s)' % (_clsname(me), me._n, me._d)
 205   _repr_pretty_ = _pp_str
 206
 207   def __add__(me, you):
 208     n, d = _split_rat(you)
 209     return type(me)(me._n*d + n*me._d, d*me._d)
 210   __radd__ = __add__
 211   def __sub__(me, you):
 212     n, d = _split_rat(you)
 213     return type(me)(me._n*d - n*me._d, d*me._d)
 214   def __rsub__(me, you):
 215     n, d = _split_rat(you)
 216     return type(me)(n*me._d - me._n*d, d*me._d)
 217   def __mul__(me, you):
 218     n, d = _split_rat(you)
 219     return type(me)(me._n*n, me._d*d)
 220   def __div__(me, you):
 221     n, d = _split_rat(you)
 222     return type(me)(me._n*d, me._d*n)
 223   def __rdiv__(me, you):
 224     n, d = _split_rat(you)
 225     return type(me)(me._d*n, me._n*d)
 226   def __cmp__(me, you):
 227     n, d = _split_rat(you)
 228     return type(me)(me._n*d, n*me._d)
 229   def __rcmp__(me, you):
 230     n, d = _split_rat(you)
 231     return cmp(n*me._d, me._n*d)
 232
 233 class IntRat (BaseRat):
 234   RING = MP
 235
 236 class GFRat (BaseRat):
 237   RING = GF
 238
 239 class _tmp:
 240   def negp(x): return x < 0
 241   def posp(x): return x > 0
 242   def zerop(x): return x == 0
 243   def oddp(x): return x.testbit(0)
 244   def evenp(x): return not x.testbit(0)
 245   def mont(x): return MPMont(x)
 246   def barrett(x): return MPBarrett(x)
 247   def reduce(x): return MPReduce(x)
 248   def __div__(me, you): return IntRat(me, you)
 249   def __rdiv__(me, you): return IntRat(you, me)
 250   _repr_pretty_ = _pp_str
 251 _augment(MP, _tmp)
 252
 253 class _tmp:
 254   def zerop(x): return x == 0
 255   def reduce(x): return GFReduce(x)
 256   def trace(x, y): return x.reduce().trace(y)
 257   def halftrace(x, y): return x.reduce().halftrace(y)
 258   def modsqrt(x, y): return x.reduce().sqrt(y)
 259   def quadsolve(x, y): return x.reduce().quadsolve(y)
 260   def __div__(me, you): return GFRat(me, you)
 261   def __rdiv__(me, you): return GFRat(you, me)
 262   _repr_pretty_ = _pp_str
 263 _augment(GF, _tmp)
 264
 265 class _tmp:
 266   def product(*arg):
 267     'product(ITERABLE) or product(I, ...) -> PRODUCT'
 268     return MPMul(*arg).done()
 269   product = staticmethod(product)
 270 _augment(MPMul, _tmp)
 271
 272 ###--------------------------------------------------------------------------
 273 ### Abstract fields.
 274
 275 class _tmp:
 276   def fromstring(str): return _checkend(Field.parse(str))
 277   fromstring = staticmethod(fromstring)
 278 _augment(Field, _tmp)
 279
 280 class _tmp:
 281   def __repr__(me): return '%s(%sL)' % (_clsname(me), me.p)
 282   def __hash__(me): return 0x114401de ^ hash(me.p)
 283   def _repr_pretty_(me, pp, cyclep):
 284     ind = _pp_bgroup_tyname(pp, me)
 285     if cyclep: pp.text('...')
 286     else: pp.pretty(me.p)
 287     pp.end_group(ind, ')')
 288   def ec(me, a, b): return ECPrimeProjCurve(me, a, b)
 289 _augment(PrimeField, _tmp)
 290
 291 class _tmp:
 292   def __repr__(me): return '%s(%#xL)' % (_clsname(me), me.p)
 293   def ec(me, a, b): return ECBinProjCurve(me, a, b)
 294   def _repr_pretty_(me, pp, cyclep):
 295     ind = _pp_bgroup_tyname(pp, me)
 296     if cyclep: pp.text('...')
 297     else: pp.text('%#x' % me.p)
 298     pp.end_group(ind, ')')
 299 _augment(BinField, _tmp)
 300
 301 class _tmp:
 302   def __hash__(me): return 0x23e4701c ^ hash(me.p)
 303 _augment(BinPolyField, _tmp)
 304
 305 class _tmp:
 306   def __hash__(me):
 307     h = 0x9a7d6240
 308     h ^=   hash(me.p)
 309     h ^= 2*hash(me.beta) & 0xffffffff
 310     return h
 311 _augment(BinNormField, _tmp)
 312
 313 class _tmp:
 314   def __str__(me): return str(me.value)
 315   def __repr__(me): return '%s(%s)' % (repr(me.field), repr(me.value))
 316   _repr_pretty_ = _pp_str
 317 _augment(FE, _tmp)
 318
 319 ###--------------------------------------------------------------------------
 320 ### Elliptic curves.
 321
 322 class _tmp:
 323   def __repr__(me):
 324     return '%s(%r, %s, %s)' % (_clsname(me), me.field, me.a, me.b)
 325   def _repr_pretty_(me, pp, cyclep):
 326     ind = _pp_bgroup_tyname(pp, me)
 327     if cyclep:
 328       pp.text('...')
 329     else:
 330       pp.pretty(me.field); pp.text(','); pp.breakable()
 331       pp.pretty(me.a); pp.text(','); pp.breakable()
 332       pp.pretty(me.b)
 333     pp.end_group(ind, ')')
 334   def frombuf(me, s):
 335     return ecpt.frombuf(me, s)
 336   def fromraw(me, s):
 337     return ecpt.fromraw(me, s)
 338   def pt(me, *args):
 339     return me(*args)
 340 _augment(ECCurve, _tmp)
 341
 342 class _tmp:
 343   def __hash__(me):
 344     h = 0x6751d341
 345     h ^=   hash(me.field)
 346     h ^= 2*hash(me.a) ^ 0xffffffff
 347     h ^= 5*hash(me.b) ^ 0xffffffff
 348     return h
 349 _augment(ECPrimeCurve, _tmp)
 350
 351 class _tmp:
 352   def __hash__(me):
 353     h = 0x2ac203c5
 354     h ^=   hash(me.field)
 355     h ^= 2*hash(me.a) ^ 0xffffffff
 356     h ^= 5*hash(me.b) ^ 0xffffffff
 357     return h
 358 _augment(ECBinCurve, _tmp)
 359
 360 class _tmp:
 361   def __repr__(me):
 362     if not me: return '%s()' % _clsname(me)
 363     return '%s(%s, %s)' % (_clsname(me), me.ix, me.iy)
 364   def __str__(me):
 365     if not me: return 'inf'
 366     return '(%s, %s)' % (me.ix, me.iy)
 367   def _repr_pretty_(me, pp, cyclep):
 368     if cyclep:
 369       pp.text('...')
 370     elif not me:
 371       pp.text('inf')
 372     else:
 373       ind = _pp_bgroup(pp, '(')
 374       pp.pretty(me.ix); pp.text(','); pp.breakable()
 375       pp.pretty(me.iy)
 376       pp.end_group(ind, ')')
 377 _augment(ECPt, _tmp)
 378
 379 class _tmp:
 380   def __repr__(me):
 381     return '%s(curve = %r, G = %r, r = %s, h = %s)' % \
 382            (_clsname(me), me.curve, me.G, me.r, me.h)
 383   def _repr_pretty_(me, pp, cyclep):
 384     ind = _pp_bgroup_tyname(pp, me)
 385     if cyclep:
 386       pp.text('...')
 387     else:
 388       _pp_kv(pp, 'curve', me.curve); pp.text(','); pp.breakable()
 389       _pp_kv(pp, 'G', me.G); pp.text(','); pp.breakable()
 390       _pp_kv(pp, 'r', me.r); pp.text(','); pp.breakable()
 391       _pp_kv(pp, 'h', me.h)
 392     pp.end_group(ind, ')')
 393   def __hash__(me):
 394     h = 0x9bedb8de
 395     h ^=   hash(me.curve)
 396     h ^= 2*hash(me.G) & 0xffffffff
 397     return h
 398   def group(me):
 399     return ECGroup(me)
 400 _augment(ECInfo, _tmp)
 401
 402 class _tmp:
 403   def __repr__(me):
 404     if not me: return '%r()' % (me.curve)
 405     return '%r(%s, %s)' % (me.curve, me.x, me.y)
 406   def __str__(me):
 407     if not me: return 'inf'
 408     return '(%s, %s)' % (me.x, me.y)
 409   def _repr_pretty_(me, pp, cyclep):
 410     if cyclep:
 411       pp.text('...')
 412     elif not me:
 413       pp.text('inf')
 414     else:
 415       ind = _pp_bgroup(pp, '(')
 416       pp.pretty(me.x); pp.text(','); pp.breakable()
 417       pp.pretty(me.y)
 418       pp.end_group(ind, ')')
 419 _augment(ECPtCurve, _tmp)
 420
 421 ###--------------------------------------------------------------------------
 422 ### Key sizes.
 423
 424 class _tmp:
 425   def __repr__(me): return '%s(%d)' % (_clsname(me), me.default)
 426   def check(me, sz): return True
 427   def best(me, sz): return sz
 428 _augment(KeySZAny, _tmp)
 429
 430 class _tmp:
 431   def __repr__(me):
 432     return '%s(%d, %d, %d, %d)' % \
 433            (_clsname(me), me.default, me.min, me.max, me.mod)
 434   def _repr_pretty_(me, pp, cyclep):
 435     ind = _pp_bgroup_tyname(pp, me)
 436     if cyclep:
 437       pp.text('...')
 438     else:
 439       pp.pretty(me.default); pp.text(','); pp.breakable()
 440       pp.pretty(me.min); pp.text(','); pp.breakable()
 441       pp.pretty(me.max); pp.text(','); pp.breakable()
 442       pp.pretty(me.mod)
 443     pp.end_group(ind, ')')
 444   def check(me, sz): return me.min <= sz <= me.max and sz % me.mod == 0
 445   def best(me, sz):
 446     if sz < me.min: raise ValueError, 'key too small'
 447     elif sz > me.max: return me.max
 448     else: return sz - (sz % me.mod)
 449 _augment(KeySZRange, _tmp)
 450
 451 class _tmp:
 452   def __repr__(me): return '%s(%d, %s)' % (_clsname(me), me.default, me.set)
 453   def _repr_pretty_(me, pp, cyclep):
 454     ind = _pp_bgroup_tyname(pp, me)
 455     if cyclep:
 456       pp.text('...')
 457     else:
 458       pp.pretty(me.default); pp.text(','); pp.breakable()
 459       ind1 = _pp_bgroup(pp, '{')
 460       _pp_commas(pp, pp.pretty, me.set)
 461       pp.end_group(ind1, '}')
 462     pp.end_group(ind, ')')
 463   def check(me, sz): return sz in me.set
 464   def best(me, sz):
 465     found = -1
 466     for i in me.set:
 467       if found < i <= sz: found = i
 468     if found < 0: raise ValueError, 'key too small'
 469     return found
 470 _augment(KeySZSet, _tmp)
 471
 472 ###--------------------------------------------------------------------------
 473 ### Key data objects.
 474
 475 class _tmp:
 476   def __repr__(me): return '%s(%r)' % (_clsname(me), me.name)
 477 _augment(KeyFile, _tmp)
 478
 479 class _tmp:
 480   def __repr__(me): return '%s(%r)' % (_clsname(me), me.fulltag)
 481 _augment(Key, _tmp)
 482
 483 class _tmp:
 484   def __repr__(me):
 485     return '%s({%s})' % (_clsname(me),
 486                          ', '.join(['%r: %r' % kv for kv in me.iteritems()]))
 487   def _repr_pretty_(me, pp, cyclep):
 488     ind = _pp_bgroup_tyname(pp, me)
 489     if cyclep: pp.text('...')
 490     else: _pp_dict(pp, me.iteritems())
 491     pp.end_group(ind, ')')
 492 _augment(KeyAttributes, _tmp)
 493
 494 class _tmp:
 495   def __repr__(me):
 496     return '%s(%s, %r)' % (_clsname(me),
 497                            _repr_secret(me._guts(),
 498                                         not (me.flags & KF_NONSECRET)),
 499                            me.writeflags(me.flags))
 500   def _repr_pretty_(me, pp, cyclep):
 501     ind = _pp_bgroup_tyname(pp, me)
 502     if cyclep:
 503       pp.text('...')
 504     else:
 505       _pp_secret(pp, me._guts(), not (me.flags & KF_NONSECRET))
 506       pp.text(','); pp.breakable()
 507       pp.pretty(me.writeflags(me.flags))
 508     pp.end_group(ind, ')')
 509 _augment(KeyData, _tmp)
 510
 511 class _tmp:
 512   def _guts(me): return me.bin
 513 _augment(KeyDataBinary, _tmp)
 514
 515 class _tmp:
 516   def _guts(me): return me.ct
 517 _augment(KeyDataEncrypted, _tmp)
 518
 519 class _tmp:
 520   def _guts(me): return me.mp
 521 _augment(KeyDataMP, _tmp)
 522
 523 class _tmp:
 524   def _guts(me): return me.str
 525 _augment(KeyDataString, _tmp)
 526
 527 class _tmp:
 528   def _guts(me): return me.ecpt
 529 _augment(KeyDataECPt, _tmp)
 530
 531 class _tmp:
 532   def __repr__(me):
 533     return '%s({%s})' % (_clsname(me),
 534                          ', '.join(['%r: %r' % kv for kv in me.iteritems()]))
 535   def _repr_pretty_(me, pp, cyclep):
 536     ind = _pp_bgroup_tyname(pp, me, '({ ')
 537     if cyclep: pp.text('...')
 538     else: _pp_dict(pp, me.iteritems())
 539     pp.end_group(ind, ' })')
 540 _augment(KeyDataStructured, _tmp)
 541
 542 ###--------------------------------------------------------------------------
 543 ### Abstract groups.
 544
 545 class _tmp:
 546   def __repr__(me):
 547     return '%s(p = %s, r = %s, g = %s)' % (_clsname(me), me.p, me.r, me.g)
 548   def _repr_pretty_(me, pp, cyclep):
 549     ind = _pp_bgroup_tyname(pp, me)
 550     if cyclep:
 551       pp.text('...')
 552     else:
 553       _pp_kv(pp, 'p', me.p); pp.text(','); pp.breakable()
 554       _pp_kv(pp, 'r', me.r); pp.text(','); pp.breakable()
 555       _pp_kv(pp, 'g', me.g)
 556     pp.end_group(ind, ')')
 557 _augment(FGInfo, _tmp)
 558
 559 class _tmp:
 560   def group(me): return PrimeGroup(me)
 561 _augment(DHInfo, _tmp)
 562
 563 class _tmp:
 564   def group(me): return BinGroup(me)
 565 _augment(BinDHInfo, _tmp)
 566
 567 class _tmp:
 568   def __repr__(me):
 569     return '%s(%r)' % (_clsname(me), me.info)
 570   def _repr_pretty_(me, pp, cyclep):
 571     ind = _pp_bgroup_tyname(pp, me)
 572     if cyclep: pp.text('...')
 573     else: pp.pretty(me.info)
 574     pp.end_group(ind, ')')
 575 _augment(Group, _tmp)
 576
 577 class _tmp:
 578   def __hash__(me):
 579     info = me.info
 580     h = 0xbce3cfe6
 581     h ^=   hash(info.p)
 582     h ^= 2*hash(info.r) & 0xffffffff
 583     h ^= 5*hash(info.g) & 0xffffffff
 584     return h
 585   def _get_geval(me, x): return MP(x)
 586 _augment(PrimeGroup, _tmp)
 587
 588 class _tmp:
 589   def __hash__(me):
 590     info = me.info
 591     h = 0x80695949
 592     h ^=   hash(info.p)
 593     h ^= 2*hash(info.r) & 0xffffffff
 594     h ^= 5*hash(info.g) & 0xffffffff
 595     return h
 596   def _get_geval(me, x): return GF(x)
 597 _augment(BinGroup, _tmp)
 598
 599 class _tmp:
 600   def __hash__(me): return 0x0ec23dab ^ hash(me.info)
 601   def _get_geval(me, x): return x.toec()
 602 _augment(ECGroup, _tmp)
 603
 604 class _tmp:
 605   def __repr__(me):
 606     return '%r(%r)' % (me.group, str(me))
 607   def _repr_pretty_(me, pp, cyclep):
 608     pp.pretty(type(me)._get_geval(me))
 609 _augment(GE, _tmp)
 610
 611 ###--------------------------------------------------------------------------
 612 ### RSA encoding techniques.
 613
 614 class PKCS1Crypt (object):
 615   def __init__(me, ep = '', rng = rand):
 616     me.ep = ep
 617     me.rng = rng
 618   def encode(me, msg, nbits):
 619     return _base._p1crypt_encode(msg, nbits, me.ep, me.rng)
 620   def decode(me, ct, nbits):
 621     return _base._p1crypt_decode(ct, nbits, me.ep, me.rng)
 622
 623 class PKCS1Sig (object):
 624   def __init__(me, ep = '', rng = rand):
 625     me.ep = ep
 626     me.rng = rng
 627   def encode(me, msg, nbits):
 628     return _base._p1sig_encode(msg, nbits, me.ep, me.rng)
 629   def decode(me, msg, sig, nbits):
 630     return _base._p1sig_decode(msg, sig, nbits, me.ep, me.rng)
 631
 632 class OAEP (object):
 633   def __init__(me, mgf = sha_mgf, hash = sha, ep = '', rng = rand):
 634     me.mgf = mgf
 635     me.hash = hash
 636     me.ep = ep
 637     me.rng = rng
 638   def encode(me, msg, nbits):
 639     return _base._oaep_encode(msg, nbits, me.mgf, me.hash, me.ep, me.rng)
 640   def decode(me, ct, nbits):
 641     return _base._oaep_decode(ct, nbits, me.mgf, me.hash, me.ep, me.rng)
 642
 643 class PSS (object):
 644   def __init__(me, mgf = sha_mgf, hash = sha, saltsz = None, rng = rand):
 645     me.mgf = mgf
 646     me.hash = hash
 647     if saltsz is None:
 648       saltsz = hash.hashsz
 649     me.saltsz = saltsz
 650     me.rng = rng
 651   def encode(me, msg, nbits):
 652     return _base._pss_encode(msg, nbits, me.mgf, me.hash, me.saltsz, me.rng)
 653   def decode(me, msg, sig, nbits):
 654     return _base._pss_decode(msg, sig, nbits,
 655                              me.mgf, me.hash, me.saltsz, me.rng)
 656
 657 class _tmp:
 658   def encrypt(me, msg, enc):
 659     return me.pubop(enc.encode(msg, me.n.nbits))
 660   def verify(me, msg, sig, enc):
 661     if msg is None: return enc.decode(msg, me.pubop(sig), me.n.nbits)
 662     try:
 663       x = enc.decode(msg, me.pubop(sig), me.n.nbits)
 664       return x is None or x == msg
 665     except ValueError:
 666       return False
 667   def __repr__(me):
 668     return '%s(n = %r, e = %r)' % (_clsname(me), me.n, me.e)
 669   def _repr_pretty_(me, pp, cyclep):
 670     ind = _pp_bgroup_tyname(pp, me)
 671     if cyclep:
 672       pp.text('...')
 673     else:
 674       _pp_kv(pp, 'n', me.n); pp.text(','); pp.breakable()
 675       _pp_kv(pp, 'e', me.e)
 676     pp.end_group(ind, ')')
 677 _augment(RSAPub, _tmp)
 678
 679 class _tmp:
 680   def decrypt(me, ct, enc): return enc.decode(me.privop(ct), me.n.nbits)
 681   def sign(me, msg, enc): return me.privop(enc.encode(msg, me.n.nbits))
 682   def __repr__(me):
 683     return '%s(n = %r, e = %r, d = %s, ' \
 684       'p = %s, q = %s, dp = %s, dq = %s, q_inv = %s)' % \
 685       (_clsname(me), me.n, me.e,
 686        _repr_secret(me.d), _repr_secret(me.p), _repr_secret(me.q),
 687        _repr_secret(me.dp), _repr_secret(me.dq), _repr_secret(me.q_inv))
 688   def _repr_pretty_(me, pp, cyclep):
 689     ind = _pp_bgroup_tyname(pp, me)
 690     if cyclep:
 691       pp.text('...')
 692     else:
 693       _pp_kv(pp, 'n', me.n); pp.text(','); pp.breakable()
 694       _pp_kv(pp, 'e', me.e); pp.text(','); pp.breakable()
 695       _pp_kv(pp, 'd', me.d, secretp = True); pp.text(','); pp.breakable()
 696       _pp_kv(pp, 'p', me.p, secretp = True); pp.text(','); pp.breakable()
 697       _pp_kv(pp, 'q', me.q, secretp = True); pp.text(','); pp.breakable()
 698       _pp_kv(pp, 'dp', me.dp, secretp = True); pp.text(','); pp.breakable()
 699       _pp_kv(pp, 'dq', me.dq, secretp = True); pp.text(','); pp.breakable()
 700       _pp_kv(pp, 'q_inv', me.q_inv, secretp = True)
 701     pp.end_group(ind, ')')
 702 _augment(RSAPriv, _tmp)
 703
 704 ###--------------------------------------------------------------------------
 705 ### DSA and related schemes.
 706
 707 class _tmp:
 708   def __repr__(me): return '%s(G = %r, p = %r)' % (_clsname(me), me.G, me.p)
 709   def _repr_pretty_(me, pp, cyclep):
 710     ind = _pp_bgroup_tyname(pp, me)
 711     if cyclep:
 712       pp.text('...')
 713     else:
 714       _pp_kv(pp, 'G', me.G); pp.text(','); pp.breakable()
 715       _pp_kv(pp, 'p', me.p)
 716     pp.end_group(ind, ')')
 717 _augment(DSAPub, _tmp)
 718 _augment(KCDSAPub, _tmp)
 719
 720 class _tmp:
 721   def __repr__(me): return '%s(G = %r, u = %s, p = %r)' % \
 722       (_clsname(me), me.G, _repr_secret(me.u), me.p)
 723   def _repr_pretty_(me, pp, cyclep):
 724     ind = _pp_bgroup_tyname(pp, me)
 725     if cyclep:
 726       pp.text('...')
 727     else:
 728       _pp_kv(pp, 'G', me.G); pp.text(','); pp.breakable()
 729       _pp_kv(pp, 'u', me.u, True); pp.text(','); pp.breakable()
 730       _pp_kv(pp, 'p', me.p)
 731     pp.end_group(ind, ')')
 732 _augment(DSAPriv, _tmp)
 733 _augment(KCDSAPriv, _tmp)
 734
 735 ###--------------------------------------------------------------------------
 736 ### Bernstein's elliptic curve crypto and related schemes.
 737
 738 X25519_BASE = MP(9).storel(32)
 739 X448_BASE = MP(5).storel(56)
 740
 741 Z128 = bytes('00000000000000000000000000000000')
 742
 743 class _BoxyPub (object):
 744   def __init__(me, pub, *args, **kw):
 745     if len(pub) != me._PUBSZ: raise ValueError, 'bad public key'
 746     super(_BoxyPub, me).__init__(*args, **kw)
 747     me.pub = pub
 748   def __repr__(me): return '%s(pub = %r)' % (_clsname(me), me.pub)
 749   def _repr_pretty_(me, pp, cyclep):
 750     ind = _pp_bgroup_tyname(pp, me)
 751     if cyclep:
 752       pp.text('...')
 753     else:
 754       _pp_kv(pp, 'pub', me.pub)
 755     pp.end_group(ind, ')')
 756
 757 class _BoxyPriv (_BoxyPub):
 758   def __init__(me, priv, pub = None, *args, **kw):
 759     if len(priv) != me._KEYSZ: raise ValueError, 'bad private key'
 760     if pub is None: pub = me._op(priv, me._BASE)
 761     super(_BoxyPriv, me).__init__(pub = pub, *args, **kw)
 762     me.priv = priv
 763   def agree(me, you): return me._op(me.priv, you.pub)
 764   def boxkey(me, recip):
 765     return me._hashkey(me.agree(recip))
 766   def box(me, recip, n, m):
 767     return secret_box(me.boxkey(recip), n, m)
 768   def unbox(me, recip, n, c):
 769     return secret_unbox(me.boxkey(recip), n, c)
 770   def __repr__(me): return '%s(priv = %s, pub = %r)' % \
 771       (_clsname(me), _repr_secret(me.priv), me.pub)
 772   def _repr_pretty_(me, pp, cyclep):
 773     ind = _pp_bgroup_tyname(pp, me)
 774     if cyclep:
 775       pp.text('...')
 776     else:
 777       _pp_kv(pp, 'priv', me.priv, True); pp.text(','); pp.breakable()
 778       _pp_kv(pp, 'pub', me.pub)
 779     pp.end_group(ind, ')')
 780
 781 class X25519Pub (_BoxyPub):
 782   _PUBSZ = X25519_PUBSZ
 783   _BASE = X25519_BASE
 784
 785 class X25519Priv (_BoxyPriv, X25519Pub):
 786   _KEYSZ = X25519_KEYSZ
 787   def _op(me, k, X): return x25519(k, X)
 788   def _hashkey(me, z): return hsalsa20_prf(z, Z128)
 789
 790 class X448Pub (_BoxyPub):
 791   _PUBSZ = X448_PUBSZ
 792   _BASE = X448_BASE
 793
 794 class X448Priv (_BoxyPriv, X448Pub):
 795   _KEYSZ = X448_KEYSZ
 796   def _op(me, k, X): return x448(k, X)
 797   ##def _hashkey(me, z): return ???
 798
 799 class Ed25519Pub (object):
 800   def __init__(me, pub):
 801     me.pub = pub
 802   def verify(me, msg, sig):
 803     return ed25519_verify(me.pub, msg, sig)
 804
 805 class Ed25519Priv (Ed25519Pub):
 806   def __init__(me, priv):
 807     me.priv = priv
 808     Ed25519Pub.__init__(me, ed25519_pubkey(priv))
 809   def sign(me, msg):
 810     return ed25519_sign(me.priv, msg, pub = me.pub)
 811   @classmethod
 812   def generate(cls, rng = rand):
 813     return cls(rng.block(ED25519_KEYSZ))
 814
 815 ###--------------------------------------------------------------------------
 816 ### Built-in named curves and prime groups.
 817
 818 class _groupmap (object):
 819   def __init__(me, map, nth):
 820     me.map = map
 821     me.nth = nth
 822     me._n = max(map.values()) + 1
 823     me.i = me._n*[None]
 824   def __repr__(me):
 825     return '{%s}' % ', '.join(['%r: %r' % kv for kv in me.iteritems()])
 826   def _repr_pretty_(me, pp, cyclep):
 827     ind = _pp_bgroup(pp, '{ ')
 828     if cyclep: pp.text('...')
 829     else: _pp_dict(pp, me.iteritems())
 830     pp.end_group(ind, ' }')
 831   def __len__(me):
 832     return me._n
 833   def __contains__(me, k):
 834     return k in me.map
 835   def __getitem__(me, k):
 836     i = me.map[k]
 837     if me.i[i] is None:
 838       me.i[i] = me.nth(i)
 839     return me.i[i]
 840   def __setitem__(me, k, v):
 841     raise TypeError, "immutable object"
 842   def __iter__(me):
 843     return iter(me.map)
 844   def iterkeys(me):
 845     return iter(me.map)
 846   def itervalues(me):
 847     for k in me:
 848       yield me[k]
 849   def iteritems(me):
 850     for k in me:
 851       yield k, me[k]
 852   def keys(me):
 853     return [k for k in me]
 854   def values(me):
 855     return [me[k] for k in me]
 856   def items(me):
 857     return [(k, me[k]) for k in me]
 858 eccurves = _groupmap(_base._eccurves, ECInfo._curven)
 859 primegroups = _groupmap(_base._pgroups, DHInfo._groupn)
 860 bingroups = _groupmap(_base._bingroups, BinDHInfo._groupn)
 861
 862 ###--------------------------------------------------------------------------
 863 ### Prime number generation.
 864
 865 class PrimeGenEventHandler (object):
 866   def pg_begin(me, ev):
 867     return me.pg_try(ev)
 868   def pg_done(me, ev):
 869     return PGEN_DONE
 870   def pg_abort(me, ev):
 871     return PGEN_TRY
 872   def pg_fail(me, ev):
 873     return PGEN_TRY
 874   def pg_pass(me, ev):
 875     return PGEN_TRY
 876
 877 class SophieGermainStepJump (object):
 878   def pg_begin(me, ev):
 879     me.lf = PrimeFilter(ev.x)
 880     me.hf = me.lf.muladd(2, 1)
 881     return me.cont(ev)
 882   def pg_try(me, ev):
 883     me.step()
 884     return me.cont(ev)
 885   def cont(me, ev):
 886     while me.lf.status == PGEN_FAIL or me.hf.status == PGEN_FAIL:
 887       me.step()
 888     if me.lf.status == PGEN_ABORT or me.hf.status == PGEN_ABORT:
 889       return PGEN_ABORT
 890     ev.x = me.lf.x
 891     if me.lf.status == PGEN_DONE and me.hf.status == PGEN_DONE:
 892       return PGEN_DONE
 893     return PGEN_TRY
 894   def pg_done(me, ev):
 895     del me.lf
 896     del me.hf
 897
 898 class SophieGermainStepper (SophieGermainStepJump):
 899   def __init__(me, step):
 900     me.lstep = step;
 901     me.hstep = 2 * step
 902   def step(me):
 903     me.lf.step(me.lstep)
 904     me.hf.step(me.hstep)
 905
 906 class SophieGermainJumper (SophieGermainStepJump):
 907   def __init__(me, jump):
 908     me.ljump = PrimeFilter(jump);
 909     me.hjump = me.ljump.muladd(2, 0)
 910   def step(me):
 911     me.lf.jump(me.ljump)
 912     me.hf.jump(me.hjump)
 913   def pg_done(me, ev):
 914     del me.ljump
 915     del me.hjump
 916     SophieGermainStepJump.pg_done(me, ev)
 917
 918 class SophieGermainTester (object):
 919   def __init__(me):
 920     pass
 921   def pg_begin(me, ev):
 922     me.lr = RabinMiller(ev.x)
 923     me.hr = RabinMiller(2 * ev.x + 1)
 924   def pg_try(me, ev):
 925     lst = me.lr.test(ev.rng.range(me.lr.x))
 926     if lst != PGEN_PASS and lst != PGEN_DONE:
 927       return lst
 928     rst = me.hr.test(ev.rng.range(me.hr.x))
 929     if rst != PGEN_PASS and rst != PGEN_DONE:
 930       return rst
 931     if lst == PGEN_DONE and rst == PGEN_DONE:
 932       return PGEN_DONE
 933     return PGEN_PASS
 934   def pg_done(me, ev):
 935     del me.lr
 936     del me.hr
 937
 938 class PrimitiveStepper (PrimeGenEventHandler):
 939   def __init__(me):
 940     pass
 941   def pg_try(me, ev):
 942     ev.x = me.i.next()
 943     return PGEN_TRY
 944   def pg_begin(me, ev):
 945     me.i = iter(smallprimes)
 946     return me.pg_try(ev)
 947
 948 class PrimitiveTester (PrimeGenEventHandler):
 949   def __init__(me, mod, hh = [], exp = None):
 950     me.mod = MPMont(mod)
 951     me.exp = exp
 952     me.hh = hh
 953   def pg_try(me, ev):
 954     x = ev.x
 955     if me.exp is not None:
 956       x = me.mod.exp(x, me.exp)
 957       if x == 1: return PGEN_FAIL
 958     for h in me.hh:
 959       if me.mod.exp(x, h) == 1: return PGEN_FAIL
 960     ev.x = x
 961     return PGEN_DONE
 962
 963 class SimulStepper (PrimeGenEventHandler):
 964   def __init__(me, mul = 2, add = 1, step = 2):
 965     me.step = step
 966     me.mul = mul
 967     me.add = add
 968   def _stepfn(me, step):
 969     if step <= 0:
 970       raise ValueError, 'step must be positive'
 971     if step <= MPW_MAX:
 972       return lambda f: f.step(step)
 973     j = PrimeFilter(step)
 974     return lambda f: f.jump(j)
 975   def pg_begin(me, ev):
 976     x = ev.x
 977     me.lf = PrimeFilter(x)
 978     me.hf = PrimeFilter(x * me.mul + me.add)
 979     me.lstep = me._stepfn(me.step)
 980     me.hstep = me._stepfn(me.step * me.mul)
 981     SimulStepper._cont(me, ev)
 982   def pg_try(me, ev):
 983     me._step()
 984     me._cont(ev)
 985   def _step(me):
 986     me.lstep(me.lf)
 987     me.hstep(me.hf)
 988   def _cont(me, ev):
 989     while me.lf.status == PGEN_FAIL or me.hf.status == PGEN_FAIL:
 990       me._step()
 991     if me.lf.status == PGEN_ABORT or me.hf.status == PGEN_ABORT:
 992       return PGEN_ABORT
 993     ev.x = me.lf.x
 994     if me.lf.status == PGEN_DONE and me.hf.status == PGEN_DONE:
 995       return PGEN_DONE
 996     return PGEN_TRY
 997   def pg_done(me, ev):
 998     del me.lf
 999     del me.hf
1000     del me.lstep
1001     del me.hstep
1002
1003 class SimulTester (PrimeGenEventHandler):
1004   def __init__(me, mul = 2, add = 1):
1005     me.mul = mul
1006     me.add = add
1007   def pg_begin(me, ev):
1008     x = ev.x
1009     me.lr = RabinMiller(x)
1010     me.hr = RabinMiller(x * me.mul + me.add)
1011   def pg_try(me, ev):
1012     lst = me.lr.test(ev.rng.range(me.lr.x))
1013     if lst != PGEN_PASS and lst != PGEN_DONE:
1014       return lst
1015     rst = me.hr.test(ev.rng.range(me.hr.x))
1016     if rst != PGEN_PASS and rst != PGEN_DONE:
1017       return rst
1018     if lst == PGEN_DONE and rst == PGEN_DONE:
1019       return PGEN_DONE
1020     return PGEN_PASS
1021   def pg_done(me, ev):
1022     del me.lr
1023     del me.hr
1024
1025 def sgprime(start, step = 2, name = 'p', event = pgen_nullev, nsteps = 0):
1026   start = MP(start)
1027   return pgen(start, name, SimulStepper(step = step), SimulTester(), event,
1028               nsteps, RabinMiller.iters(start.nbits))
1029
1030 def findprimitive(mod, hh = [], exp = None, name = 'g', event = pgen_nullev):
1031   return pgen(0, name, PrimitiveStepper(), PrimitiveTester(mod, hh, exp),
1032               event, 0, 1)
1033
1034 def kcdsaprime(pbits, qbits, rng = rand,
1035                event = pgen_nullev, name = 'p', nsteps = 0):
1036   hbits = pbits - qbits
1037   h = pgen(rng.mp(hbits, 1), name + ' [h]',
1038            PrimeGenStepper(2), PrimeGenTester(),
1039            event, nsteps, RabinMiller.iters(hbits))
1040   q = pgen(rng.mp(qbits, 1), name, SimulStepper(2 * h, 1, 2),
1041            SimulTester(2 * h, 1), event, nsteps, RabinMiller.iters(qbits))
1042   p = 2 * q * h + 1
1043   return p, q, h
1044
1045 #----- That's all, folks ----------------------------------------------------