[catacomb-python] / catacomb / __init__.py

### -*-python-*-
###
### Setup for Catacomb/Python bindings
###
### (c) 2004 Straylight/Edgeware
###

###----- Licensing notice ---------------------------------------------------
###
### This file is part of the Python interface to Catacomb.
###
### Catacomb/Python is free software; you can redistribute it and/or modify
### it under the terms of the GNU General Public License as published by
### the Free Software Foundation; either version 2 of the License, or
### (at your option) any later version.
###
### Catacomb/Python is distributed in the hope that it will be useful,
### but WITHOUT ANY WARRANTY; without even the implied warranty of
### MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
### GNU General Public License for more details.
###
### You should have received a copy of the GNU General Public License
### along with Catacomb/Python; if not, write to the Free Software Foundation,
### Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.

import _base
import types as _types
from binascii import hexlify as _hexify, unhexlify as _unhexify
from sys import argv as _argv

###--------------------------------------------------------------------------
### Basic stuff.

## For the benefit of the default keyreporter, we need the program na,e.
_base._ego(_argv[0])

## Initialize the module.  Drag in the static methods of the various
## classes; create names for the various known crypto algorithms.
def _init():
  d = globals()
  b = _base.__dict__;
  for i in b:
    if i[0] != '_':
      d[i] = b[i];
  for i in ['MP', 'GF', 'Field',
            'ECPt', 'ECPtCurve', 'ECCurve', 'ECInfo',
            'DHInfo', 'BinDHInfo', 'RSAPriv', 'BBSPriv',
            'PrimeFilter', 'RabinMiller',
            'Group', 'GE',
            'KeySZ', 'KeyData']:
    c = d[i]
    pre = '_' + i + '_'
    plen = len(pre)
    for j in b:
      if j[:plen] == pre:
        setattr(c, j[plen:], classmethod(b[j]))
  for i in [gcciphers, gchashes, gcmacs, gcprps]:
    for c in i.itervalues():
      d[c.name.replace('-', '_').translate(None, '/')] = c
  for c in gccrands.itervalues():
    d[c.name.replace('-', '_').translate(None, '/') + 'rand'] = c
_init()

## A handy function for our work: add the methods of a named class to an
## existing class.  This is how we write the Python-implemented parts of our
## mostly-C types.
def _augment(c, cc):
  for i in cc.__dict__:
    a = cc.__dict__[i]
    if type(a) is _types.MethodType:
      a = a.im_func
    elif type(a) not in (_types.FunctionType, staticmethod, classmethod):
      continue
    setattr(c, i, a)

## Parsing functions tend to return the object parsed and the remainder of
## the input.  This checks that the remainder is input and, if so, returns
## just the object.
def _checkend(r):
  x, rest = r
  if rest != '':
    raise SyntaxError, 'junk at end of string'
  return x

## Some pretty-printing utilities.
def _pp_str(me, pp, cyclep): pp.text(cyclep and '...' or str(me))
def _pp_bgroup(pp, text):
  ind = len(text)
  pp.begin_group(ind, text)
  return ind
def _pp_bgroup_tyname(pp, obj, open = '('):
  return _pp_bgroup(pp, type(obj).__name__ + open)
def _pp_kv(pp, k, v):
  ind = _pp_bgroup(pp, k + ' = ')
  pp.pretty(v)
  pp.end_group(ind, '')
def _pp_commas(pp, printfn, items):
  firstp = True
  for i in items:
    if firstp: firstp = False
    else: pp.text(','); pp.breakable()
    printfn(i)
def _pp_dict(pp, items):
  def p((k, v)):
    pp.begin_group(0)
    pp.pretty(k)
    pp.text(':')
    pp.begin_group(2)
    pp.breakable()
    pp.pretty(v)
    pp.end_group(2)
    pp.end_group(0)
  _pp_commas(pp, p, items)

###--------------------------------------------------------------------------
### Bytestrings.

class _tmp:
  def fromhex(x):
    return ByteString(_unhexify(x))
  fromhex = staticmethod(fromhex)
  def __hex__(me):
    return _hexify(me)
  def __repr__(me):
    return 'bytes(%r)' % hex(me)
_augment(ByteString, _tmp)
ByteString.__hash__ = str.__hash__
bytes = ByteString.fromhex

###--------------------------------------------------------------------------
### Hashing.

class _tmp:
  def check(me, h):
    hh = me.done()
    return ctstreq(h, hh)
_augment(GHash, _tmp)
_augment(Poly1305Hash, _tmp)

###--------------------------------------------------------------------------
### NaCl `secretbox'.

def secret_box(k, n, m):
  E = xsalsa20(k).setiv(n)
  r = E.enczero(poly1305.keysz.default)
  s = E.enczero(poly1305.masksz)
  y = E.encrypt(m)
  t = poly1305(r)(s).hash(y).done()
  return ByteString(t + y)

def secret_unbox(k, n, c):
  E = xsalsa20(k).setiv(n)
  r = E.enczero(poly1305.keysz.default)
  s = E.enczero(poly1305.masksz)
  y = c[poly1305.tagsz:]
  if not poly1305(r)(s).hash(y).check(c[0:poly1305.tagsz]):
    raise ValueError, 'decryption failed'
  return E.decrypt(c[poly1305.tagsz:])

###--------------------------------------------------------------------------
### Multiprecision integers and binary polynomials.

def _split_rat(x):
  if isinstance(x, BaseRat): return x._n, x._d
  else: return x, 1
class BaseRat (object):
  """Base class implementing fields of fractions over Euclidean domains."""
  def __new__(cls, a, b):
    a, b = cls.RING(a), cls.RING(b)
    q, r = divmod(a, b)
    if r == 0: return q
    g = b.gcd(r)
    me = super(BaseRat, cls).__new__(cls)
    me._n = a//g
    me._d = b//g
    return me
  @property
  def numer(me): return me._n
  @property
  def denom(me): return me._d
  def __str__(me): return '%s/%s' % (me._n, me._d)
  def __repr__(me): return '%s(%s, %s)' % (type(me).__name__, me._n, me._d)
  _repr_pretty_ = _pp_str

  def __add__(me, you):
    n, d = _split_rat(you)
    return type(me)(me._n*d + n*me._d, d*me._d)
  __radd__ = __add__
  def __sub__(me, you):
    n, d = _split_rat(you)
    return type(me)(me._n*d - n*me._d, d*me._d)
  def __rsub__(me, you):
    n, d = _split_rat(you)
    return type(me)(n*me._d - me._n*d, d*me._d)
  def __mul__(me, you):
    n, d = _split_rat(you)
    return type(me)(me._n*n, me._d*d)
  def __div__(me, you):
    n, d = _split_rat(you)
    return type(me)(me._n*d, me._d*n)
  def __rdiv__(me, you):
    n, d = _split_rat(you)
    return type(me)(me._d*n, me._n*d)
  def __cmp__(me, you):
    n, d = _split_rat(you)
    return type(me)(me._n*d, n*me._d)
  def __rcmp__(me, you):
    n, d = _split_rat(you)
    return cmp(n*me._d, me._n*d)

class IntRat (BaseRat):
  RING = MP

class GFRat (BaseRat):
  RING = GF

class _tmp:
  def negp(x): return x < 0
  def posp(x): return x > 0
  def zerop(x): return x == 0
  def oddp(x): return x.testbit(0)
  def evenp(x): return not x.testbit(0)
  def mont(x): return MPMont(x)
  def barrett(x): return MPBarrett(x)
  def reduce(x): return MPReduce(x)
  def __div__(me, you): return IntRat(me, you)
  def __rdiv__(me, you): return IntRat(you, me)
  _repr_pretty_ = _pp_str
_augment(MP, _tmp)

class _tmp:
  def zerop(x): return x == 0
  def reduce(x): return GFReduce(x)
  def trace(x, y): return x.reduce().trace(y)
  def halftrace(x, y): return x.reduce().halftrace(y)
  def modsqrt(x, y): return x.reduce().sqrt(y)
  def quadsolve(x, y): return x.reduce().quadsolve(y)
  def __div__(me, you): return GFRat(me, you)
  def __rdiv__(me, you): return GFRat(you, me)
  _repr_pretty_ = _pp_str
_augment(GF, _tmp)

class _tmp:
  def product(*arg):
    'product(ITERABLE) or product(I, ...) -> PRODUCT'
    return MPMul(*arg).done()
  product = staticmethod(product)
_augment(MPMul, _tmp)

###--------------------------------------------------------------------------
### Abstract fields.

class _tmp:
  def fromstring(str): return _checkend(Field.parse(str))
  fromstring = staticmethod(fromstring)
_augment(Field, _tmp)

class _tmp:
  def __repr__(me): return '%s(%sL)' % (type(me).__name__, me.p)
  def __hash__(me): return 0x114401de ^ hash(me.p)
  def _repr_pretty_(me, pp, cyclep):
    ind = _pp_bgroup_tyname(pp, me)
    if cyclep: pp.text('...')
    else: pp.pretty(me.p)
    pp.end_group(ind, ')')
  def ec(me, a, b): return ECPrimeProjCurve(me, a, b)
_augment(PrimeField, _tmp)

class _tmp:
  def __repr__(me): return '%s(%#xL)' % (type(me).__name__, me.p)
  def ec(me, a, b): return ECBinProjCurve(me, a, b)
  def _repr_pretty_(me, pp, cyclep):
    ind = _pp_bgroup_tyname(pp, me)
    if cyclep: pp.text('...')
    else: pp.text('%#x' % me.p)
    pp.end_group(ind, ')')
_augment(BinField, _tmp)

class _tmp:
  def __hash__(me): return 0x23e4701c ^ hash(me.p)
_augment(BinPolyField, _tmp)

class _tmp:
  def __hash__(me):
    h = 0x9a7d6240
    h ^=   hash(me.p)
    h ^= 2*hash(me.beta) & 0xffffffff
    return h
_augment(BinNormField, _tmp)

class _tmp:
  def __str__(me): return str(me.value)
  def __repr__(me): return '%s(%s)' % (repr(me.field), repr(me.value))
  _repr_pretty_ = _pp_str
_augment(FE, _tmp)

###--------------------------------------------------------------------------
### Elliptic curves.

class _tmp:
  def __repr__(me):
    return '%s(%r, %s, %s)' % (type(me).__name__, me.field, me.a, me.b)
  def _repr_pretty_(me, pp, cyclep):
    ind = _pp_bgroup_tyname(pp, me)
    if cyclep:
      pp.text('...')
    else:
      pp.pretty(me.field); pp.text(','); pp.breakable()
      pp.pretty(me.a); pp.text(','); pp.breakable()
      pp.pretty(me.b)
    pp.end_group(ind, ')')
  def frombuf(me, s):
    return ecpt.frombuf(me, s)
  def fromraw(me, s):
    return ecpt.fromraw(me, s)
  def pt(me, *args):
    return me(*args)
_augment(ECCurve, _tmp)

class _tmp:
  def __hash__(me):
    h = 0x6751d341
    h ^=   hash(me.field)
    h ^= 2*hash(me.a) ^ 0xffffffff
    h ^= 5*hash(me.b) ^ 0xffffffff
    return h
_augment(ECPrimeCurve, _tmp)

class _tmp:
  def __hash__(me):
    h = 0x2ac203c5
    h ^=   hash(me.field)
    h ^= 2*hash(me.a) ^ 0xffffffff
    h ^= 5*hash(me.b) ^ 0xffffffff
    return h
_augment(ECBinCurve, _tmp)

class _tmp:
  def __repr__(me):
    if not me: return 'ECPt()'
    return 'ECPt(%s, %s)' % (me.ix, me.iy)
  def __str__(me):
    if not me: return 'inf'
    return '(%s, %s)' % (me.ix, me.iy)
  def _repr_pretty_(me, pp, cyclep):
    if cyclep:
      pp.text('...')
    elif not me:
      pp.text('inf')
    else:
      ind = _pp_bgroup(pp, '(')
      pp.pretty(me.ix); pp.text(','); pp.breakable()
      pp.pretty(me.iy)
      pp.end_group(ind, ')')
_augment(ECPt, _tmp)

class _tmp:
  def __repr__(me):
    return 'ECInfo(curve = %r, G = %r, r = %s, h = %s)' % \
           (me.curve, me.G, me.r, me.h)
  def _repr_pretty_(me, pp, cyclep):
    ind = _pp_bgroup_tyname(pp, me)
    if cyclep:
      pp.text('...')
    else:
      _pp_kv(pp, 'curve', me.curve); pp.text(','); pp.breakable()
      _pp_kv(pp, 'G', me.G); pp.text(','); pp.breakable()
      _pp_kv(pp, 'r', me.r); pp.text(','); pp.breakable()
      _pp_kv(pp, 'h', me.h)
    pp.end_group(ind, ')')
  def __hash__(me):
    h = 0x9bedb8de
    h ^=   hash(me.curve)
    h ^= 2*hash(me.G) & 0xffffffff
    return h
  def group(me):
    return ECGroup(me)
_augment(ECInfo, _tmp)

class _tmp:
  def __repr__(me):
    if not me: return '%r()' % (me.curve)
    return '%r(%s, %s)' % (me.curve, me.x, me.y)
  def __str__(me):
    if not me: return 'inf'
    return '(%s, %s)' % (me.x, me.y)
_augment(ECPtCurve, _tmp)

###--------------------------------------------------------------------------
### Key sizes.

class _tmp:
  def __repr__(me): return 'KeySZAny(%d)' % me.default
  def check(me, sz): return True
  def best(me, sz): return sz
_augment(KeySZAny, _tmp)

class _tmp:
  def __repr__(me):
    return 'KeySZRange(%d, %d, %d, %d)' % \
           (me.default, me.min, me.max, me.mod)
  def _repr_pretty_(me, pp, cyclep):
    ind = _pp_bgroup_tyname(pp, me)
    if cyclep:
      pp.text('...')
    else:
      pp.pretty(me.default); pp.text(','); pp.breakable()
      pp.pretty(me.min); pp.text(','); pp.breakable()
      pp.pretty(me.max); pp.text(','); pp.breakable()
      pp.pretty(me.mod)
    pp.end_group(ind, ')')
  def check(me, sz): return me.min <= sz <= me.max and sz % me.mod == 0
  def best(me, sz):
    if sz < me.min: raise ValueError, 'key too small'
    elif sz > me.max: return me.max
    else: return sz - (sz % me.mod)
_augment(KeySZRange, _tmp)

class _tmp:
  def __repr__(me): return 'KeySZSet(%d, %s)' % (me.default, me.set)
  def _repr_pretty_(me, pp, cyclep):
    ind = _pp_bgroup_tyname(pp, me)
    if cyclep:
      pp.text('...')
    else:
      pp.pretty(me.default); pp.text(','); pp.breakable()
      ind1 = _pp_bgroup(pp, '{')
      _pp_commas(pp, pp.pretty, me.set)
      pp.end_group(ind1, '}')
    pp.end_group(ind, ')')
  def check(me, sz): return sz in me.set
  def best(me, sz):
    found = -1
    for i in me.set:
      if found < i <= sz: found = i
    if found < 0: raise ValueError, 'key too small'
    return found
_augment(KeySZSet, _tmp)

###--------------------------------------------------------------------------
### Key data objects.

class _tmp:
  def __repr__(me): return 'KeyFile(%r)' % me.name
_augment(KeyFile, _tmp)

class _tmp:
  def __repr__(me): return 'Key(%r)' % me.fulltag
_augment(Key, _tmp)

class _tmp:
  def __repr__(me):
    return 'KeyAttributes({%s})' % \
        ', '.join(['%r: %r' % kv for kv in me.iteritems()])
  def _repr_pretty_(me, pp, cyclep):
    ind = _pp_bgroup_tyname(pp, me)
    if cyclep: pp.text('...')
    else: _pp_dict(pp, me.iteritems())
    pp.end_group(ind, ')')
_augment(KeyAttributes, _tmp)

class _tmp:
  def __repr__(me): return 'KeyDataBinary(%r, %r)' % \
        (me.bin, me.writeflags(me.flags))
  def _repr_pretty_(me, pp, cyclep):
    ind = _pp_bgroup_tyname(pp, me)
    if cyclep:
      pp.text('...')
    else:
      pp.pretty(me.bin); pp.text(','); pp.breakable()
      pp.pretty(me.writeflags(me.flags))
    pp.end_group(ind, ')')
_augment(KeyDataBinary, _tmp)

class _tmp:
  def __repr__(me): return 'KeyDataEncrypted(%r, %r)' % \
        (me.ct, me.writeflags(me.flags))
  def _repr_pretty_(me, pp, cyclep):
    ind = _pp_bgroup_tyname(pp, me)
    if cyclep:
      pp.text('...')
    else:
      pp.pretty(me.ct); pp.text(','); pp.breakable()
      pp.pretty(me.writeflags(me.flags))
    pp.end_group(ind, ')')
_augment(KeyDataEncrypted, _tmp)

class _tmp:
  def __repr__(me): return 'KeyDataMP(%r, %r)' % \
        (me.mp, me.writeflags(me.flags))
  def _repr_pretty_(me, pp, cyclep):
    ind = _pp_bgroup_tyname(pp, me)
    if cyclep:
      pp.text('...')
    else:
      pp.pretty(me.mp); pp.text(','); pp.breakable()
      pp.pretty(me.writeflags(me.flags))
    pp.end_group(ind, ')')
_augment(KeyDataMP, _tmp)

class _tmp:
  def __repr__(me): return 'KeyDataString(%r)' % \
        (me.str, me.writeflags(me.flags))
  def _repr_pretty_(me, pp, cyclep):
    ind = _pp_bgroup_tyname(pp, me)
    if cyclep:
      pp.text('...')
    else:
      pp.pretty(me.str); pp.text(','); pp.breakable()
      pp.pretty(me.writeflags(me.flags))
    pp.end_group(ind, ')')
_augment(KeyDataString, _tmp)

class _tmp:
  def __repr__(me): return 'KeyDataECPt(%r)' % \
        (me.ecpt, me.writeflags(me.flags))
  def _repr_pretty_(me, pp, cyclep):
    ind = _pp_bgroup_tyname(pp, me)
    if cyclep:
      pp.text('...')
    else:
      pp.pretty(me.ecpt); pp.text(','); pp.breakable()
      pp.pretty(me.writeflags(me.flags))
    pp.end_group(ind, ')')
_augment(KeyDataECPt, _tmp)

class _tmp:
  def __repr__(me):
    return 'KeyDataStructured({%s})' % \
        ', '.join(['%r: %r' % kv for kv in me.iteritems()])
  def _repr_pretty_(me, pp, cyclep):
    ind = _pp_bgroup_tyname(pp, me, '({ ')
    if cyclep: pp.text('...')
    else: _pp_dict(pp, me.iteritems())
    pp.end_group(ind, ' })')
_augment(KeyDataStructured, _tmp)

###--------------------------------------------------------------------------
### Abstract groups.

class _tmp:
  def __repr__(me):
    return '%s(p = %s, r = %s, g = %s)' % \
           (type(me).__name__, me.p, me.r, me.g)
  def _repr_pretty_(me, pp, cyclep):
    ind = _pp_bgroup_tyname(pp, me)
    if cyclep:
      pp.text('...')
    else:
      _pp_kv(pp, 'p', me.p); pp.text(','); pp.breakable()
      _pp_kv(pp, 'r', me.r); pp.text(','); pp.breakable()
      _pp_kv(pp, 'g', me.g)
    pp.end_group(ind, ')')
_augment(FGInfo, _tmp)

class _tmp:
  def group(me): return PrimeGroup(me)
_augment(DHInfo, _tmp)

class _tmp:
  def group(me): return BinGroup(me)
_augment(BinDHInfo, _tmp)

class _tmp:
  def __repr__(me):
    return '%s(%r)' % (type(me).__name__, me.info)
_augment(Group, _tmp)

class _tmp:
  def __hash__(me):
    info = me.info
    h = 0xbce3cfe6
    h ^=   hash(info.p)
    h ^= 2*hash(info.r) & 0xffffffff
    h ^= 5*hash(info.g) & 0xffffffff
    return h
_augment(PrimeGroup, _tmp)

class _tmp:
  def __hash__(me):
    info = me.info
    h = 0x80695949
    h ^=   hash(info.p)
    h ^= 2*hash(info.r) & 0xffffffff
    h ^= 5*hash(info.g) & 0xffffffff
    return h
_augment(BinGroup, _tmp)

class _tmp:
  def __hash__(me): return 0x0ec23dab ^ hash(me.info)
_augment(ECGroup, _tmp)

class _tmp:
  def __repr__(me):
    return '%r(%r)' % (me.group, str(me))
  _repr_pretty_ = _pp_str
_augment(GE, _tmp)

###--------------------------------------------------------------------------
### RSA encoding techniques.

class PKCS1Crypt (object):
  def __init__(me, ep = '', rng = rand):
    me.ep = ep
    me.rng = rng
  def encode(me, msg, nbits):
    return _base._p1crypt_encode(msg, nbits, me.ep, me.rng)
  def decode(me, ct, nbits):
    return _base._p1crypt_decode(ct, nbits, me.ep, me.rng)

class PKCS1Sig (object):
  def __init__(me, ep = '', rng = rand):
    me.ep = ep
    me.rng = rng
  def encode(me, msg, nbits):
    return _base._p1sig_encode(msg, nbits, me.ep, me.rng)
  def decode(me, msg, sig, nbits):
    return _base._p1sig_decode(msg, sig, nbits, me.ep, me.rng)

class OAEP (object):
  def __init__(me, mgf = sha_mgf, hash = sha, ep = '', rng = rand):
    me.mgf = mgf
    me.hash = hash
    me.ep = ep
    me.rng = rng
  def encode(me, msg, nbits):
    return _base._oaep_encode(msg, nbits, me.mgf, me.hash, me.ep, me.rng)
  def decode(me, ct, nbits):
    return _base._oaep_decode(ct, nbits, me.mgf, me.hash, me.ep, me.rng)

class PSS (object):
  def __init__(me, mgf = sha_mgf, hash = sha, saltsz = None, rng = rand):
    me.mgf = mgf
    me.hash = hash
    if saltsz is None:
      saltsz = hash.hashsz
    me.saltsz = saltsz
    me.rng = rng
  def encode(me, msg, nbits):
    return _base._pss_encode(msg, nbits, me.mgf, me.hash, me.saltsz, me.rng)
  def decode(me, msg, sig, nbits):
    return _base._pss_decode(msg, sig, nbits,
                             me.mgf, me.hash, me.saltsz, me.rng)

class _tmp:
  def encrypt(me, msg, enc):
    return me.pubop(enc.encode(msg, me.n.nbits))
  def verify(me, msg, sig, enc):
    if msg is None: return enc.decode(msg, me.pubop(sig), me.n.nbits)
    try:
      x = enc.decode(msg, me.pubop(sig), me.n.nbits)
      return x is None or x == msg
    except ValueError:
      return False
_augment(RSAPub, _tmp)

class _tmp:
  def decrypt(me, ct, enc): return enc.decode(me.privop(ct), me.n.nbits)
  def sign(me, msg, enc): return me.privop(enc.encode(msg, me.n.nbits))
_augment(RSAPriv, _tmp)

###--------------------------------------------------------------------------
### Bernstein's elliptic curve crypto and related schemes.

X25519_BASE = \
  bytes('0900000000000000000000000000000000000000000000000000000000000000')

X448_BASE = \
  bytes('05000000000000000000000000000000000000000000000000000000'
        '00000000000000000000000000000000000000000000000000000000')

Z128 = bytes('00000000000000000000000000000000')

class _BoxyPub (object):
  def __init__(me, pub, *kw, **kwargs):
    if len(pub) != me._PUBSZ: raise ValueError, 'bad public key'
    super(_BoxyPub, me).__init__(*kw, **kwargs)
    me.pub = pub

class _BoxyPriv (_BoxyPub):
  def __init__(me, priv, pub = None, *kw, **kwargs):
    if len(priv) != me._KEYSZ: raise ValueError, 'bad private key'
    if pub is None: pub = me._op(priv, me._BASE)
    super(_BoxyPriv, me).__init__(pub = pub, *kw, **kwargs)
    me.priv = priv
  def agree(me, you): return me._op(me.priv, you.pub)
  def boxkey(me, recip):
    return me._hashkey(me.agree(recip))
  def box(me, recip, n, m):
    return secret_box(me.boxkey(recip), n, m)
  def unbox(me, recip, n, c):
    return secret_unbox(me.boxkey(recip, n, c))

class X25519Pub (_BoxyPub):
  _PUBSZ = X25519_PUBSZ
  _BASE = X25519_BASE

class X25519Priv (_BoxyPriv, X25519Pub):
  _KEYSZ = X25519_KEYSZ
  def _op(me, k, X): return x25519(k, X)
  def _hashkey(me, z): return hsalsa20_prf(z, Z128)

class X448Pub (_BoxyPub):
  _PUBSZ = X448_PUBSZ
  _BASE = X448_BASE

class X448Priv (_BoxyPriv, X448Pub):
  _KEYSZ = X448_KEYSZ
  def _op(me, k, X): return x448(k, X)
  ##def _hashkey(me, z): return ???

class Ed25519Pub (object):
  def __init__(me, pub):
    me.pub = pub
  def verify(me, msg, sig):
    return ed25519_verify(me.pub, msg, sig)

class Ed25519Priv (Ed25519Pub):
  def __init__(me, priv):
    me.priv = priv
    Ed25519Pub.__init__(me, ed25519_pubkey(priv))
  def sign(me, msg):
    return ed25519_sign(me.priv, msg, pub = me.pub)
  @classmethod
  def generate(cls, rng = rand):
    return cls(rng.block(ED25519_KEYSZ))

###--------------------------------------------------------------------------
### Built-in named curves and prime groups.

class _groupmap (object):
  def __init__(me, map, nth):
    me.map = map
    me.nth = nth
    me._n = max(map.values()) + 1
    me.i = me._n*[None]
  def __repr__(me):
    return '{%s}' % ', '.join(['%r: %r' % kv for kv in me.iteritems()])
  def _repr_pretty_(me, pp, cyclep):
    ind = _pp_bgroup(pp, '{ ')
    if cyclep: pp.text('...')
    else: _pp_dict(pp, me.iteritems())
    pp.end_group(ind, ' }')
  def __len__(me):
    return me._n
  def __contains__(me, k):
    return k in me.map
  def __getitem__(me, k):
    i = me.map[k]
    if me.i[i] is None:
      me.i[i] = me.nth(i)
    return me.i[i]
  def __setitem__(me, k, v):
    raise TypeError, "immutable object"
  def __iter__(me):
    return iter(me.map)
  def iterkeys(me):
    return iter(me.map)
  def itervalues(me):
    for k in me:
      yield me[k]
  def iteritems(me):
    for k in me:
      yield k, me[k]
  def keys(me):
    return [k for k in me]
  def values(me):
    return [me[k] for k in me]
  def items(me):
    return [(k, me[k]) for k in me]
eccurves = _groupmap(_base._eccurves, ECInfo._curven)
primegroups = _groupmap(_base._pgroups, DHInfo._groupn)
bingroups = _groupmap(_base._bingroups, BinDHInfo._groupn)

###--------------------------------------------------------------------------
### Prime number generation.

class PrimeGenEventHandler (object):
  def pg_begin(me, ev):
    return me.pg_try(ev)
  def pg_done(me, ev):
    return PGEN_DONE
  def pg_abort(me, ev):
    return PGEN_TRY
  def pg_fail(me, ev):
    return PGEN_TRY
  def pg_pass(me, ev):
    return PGEN_TRY

class SophieGermainStepJump (object):
  def pg_begin(me, ev):
    me.lf = PrimeFilter(ev.x)
    me.hf = me.lf.muladd(2, 1)
    return me.cont(ev)
  def pg_try(me, ev):
    me.step()
    return me.cont(ev)
  def cont(me, ev):
    while me.lf.status == PGEN_FAIL or me.hf.status == PGEN_FAIL:
      me.step()
    if me.lf.status == PGEN_ABORT or me.hf.status == PGEN_ABORT:
      return PGEN_ABORT
    ev.x = me.lf.x
    if me.lf.status == PGEN_DONE and me.hf.status == PGEN_DONE:
      return PGEN_DONE
    return PGEN_TRY
  def pg_done(me, ev):
    del me.lf
    del me.hf

class SophieGermainStepper (SophieGermainStepJump):
  def __init__(me, step):
    me.lstep = step;
    me.hstep = 2 * step
  def step(me):
    me.lf.step(me.lstep)
    me.hf.step(me.hstep)

class SophieGermainJumper (SophieGermainStepJump):
  def __init__(me, jump):
    me.ljump = PrimeFilter(jump);
    me.hjump = me.ljump.muladd(2, 0)
  def step(me):
    me.lf.jump(me.ljump)
    me.hf.jump(me.hjump)
  def pg_done(me, ev):
    del me.ljump
    del me.hjump
    SophieGermainStepJump.pg_done(me, ev)

class SophieGermainTester (object):
  def __init__(me):
    pass
  def pg_begin(me, ev):
    me.lr = RabinMiller(ev.x)
    me.hr = RabinMiller(2 * ev.x + 1)
  def pg_try(me, ev):
    lst = me.lr.test(ev.rng.range(me.lr.x))
    if lst != PGEN_PASS and lst != PGEN_DONE:
      return lst
    rst = me.hr.test(ev.rng.range(me.hr.x))
    if rst != PGEN_PASS and rst != PGEN_DONE:
      return rst
    if lst == PGEN_DONE and rst == PGEN_DONE:
      return PGEN_DONE
    return PGEN_PASS
  def pg_done(me, ev):
    del me.lr
    del me.hr

class PrimitiveStepper (PrimeGenEventHandler):
  def __init__(me):
    pass
  def pg_try(me, ev):
    ev.x = me.i.next()
    return PGEN_TRY
  def pg_begin(me, ev):
    me.i = iter(smallprimes)
    return me.pg_try(ev)

class PrimitiveTester (PrimeGenEventHandler):
  def __init__(me, mod, hh = [], exp = None):
    me.mod = MPMont(mod)
    me.exp = exp
    me.hh = hh
  def pg_try(me, ev):
    x = ev.x
    if me.exp is not None:
      x = me.mod.exp(x, me.exp)
      if x == 1: return PGEN_FAIL
    for h in me.hh:
      if me.mod.exp(x, h) == 1: return PGEN_FAIL
    ev.x = x
    return PGEN_DONE

class SimulStepper (PrimeGenEventHandler):
  def __init__(me, mul = 2, add = 1, step = 2):
    me.step = step
    me.mul = mul
    me.add = add
  def _stepfn(me, step):
    if step <= 0:
      raise ValueError, 'step must be positive'
    if step <= MPW_MAX:
      return lambda f: f.step(step)
    j = PrimeFilter(step)
    return lambda f: f.jump(j)
  def pg_begin(me, ev):
    x = ev.x
    me.lf = PrimeFilter(x)
    me.hf = PrimeFilter(x * me.mul + me.add)
    me.lstep = me._stepfn(me.step)
    me.hstep = me._stepfn(me.step * me.mul)
    SimulStepper._cont(me, ev)
  def pg_try(me, ev):
    me._step()
    me._cont(ev)
  def _step(me):
    me.lstep(me.lf)
    me.hstep(me.hf)
  def _cont(me, ev):
    while me.lf.status == PGEN_FAIL or me.hf.status == PGEN_FAIL:
      me._step()
    if me.lf.status == PGEN_ABORT or me.hf.status == PGEN_ABORT:
      return PGEN_ABORT
    ev.x = me.lf.x
    if me.lf.status == PGEN_DONE and me.hf.status == PGEN_DONE:
      return PGEN_DONE
    return PGEN_TRY
  def pg_done(me, ev):
    del me.lf
    del me.hf
    del me.lstep
    del me.hstep

class SimulTester (PrimeGenEventHandler):
  def __init__(me, mul = 2, add = 1):
    me.mul = mul
    me.add = add
  def pg_begin(me, ev):
    x = ev.x
    me.lr = RabinMiller(x)
    me.hr = RabinMiller(x * me.mul + me.add)
  def pg_try(me, ev):
    lst = me.lr.test(ev.rng.range(me.lr.x))
    if lst != PGEN_PASS and lst != PGEN_DONE:
      return lst
    rst = me.hr.test(ev.rng.range(me.hr.x))
    if rst != PGEN_PASS and rst != PGEN_DONE:
      return rst
    if lst == PGEN_DONE and rst == PGEN_DONE:
      return PGEN_DONE
    return PGEN_PASS
  def pg_done(me, ev):
    del me.lr
    del me.hr

def sgprime(start, step = 2, name = 'p', event = pgen_nullev, nsteps = 0):
  start = MP(start)
  return pgen(start, name, SimulStepper(step = step), SimulTester(), event,
              nsteps, RabinMiller.iters(start.nbits))

def findprimitive(mod, hh = [], exp = None, name = 'g', event = pgen_nullev):
  return pgen(0, name, PrimitiveStepper(), PrimitiveTester(mod, hh, exp),
              event, 0, 1)

def kcdsaprime(pbits, qbits, rng = rand,
               event = pgen_nullev, name = 'p', nsteps = 0):
  hbits = pbits - qbits
  h = pgen(rng.mp(hbits, 1), name + ' [h]',
           PrimeGenStepper(2), PrimeGenTester(),
           event, nsteps, RabinMiller.iters(hbits))
  q = pgen(rng.mp(qbits, 1), name, SimulStepper(2 * h, 1, 2),
           SimulTester(2 * h, 1), event, nsteps, RabinMiller.iters(qbits))
  p = 2 * q * h + 1
  return p, q, h

#----- That's all, folks ----------------------------------------------------