3 ### Setup for Catacomb/Python bindings
5 ### (c) 2004 Straylight/Edgeware
8 ###----- Licensing notice ---------------------------------------------------
10 ### This file is part of the Python interface to Catacomb.
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.
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.
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.
27 import types
as _types
28 from binascii
import hexlify
as _hexify
, unhexlify
as _unhexify
29 from sys
import argv
as _argv
31 ###--------------------------------------------------------------------------
34 ## For the benefit of the default keyreporter, we need the program na,e.
37 ## How to fix a name back into the right identifier. Alas, the rules are not
41 ## Hyphens consistently become underscores.
42 name
= name
.replace('-', '_')
44 ## But slashes might become underscores or just vanish.
45 if name
.startswith('salsa20'): name
= name
.translate(None, '/')
46 else: name
= name
.replace('/', '_')
51 ## Initialize the module. Drag in the static methods of the various
52 ## classes; create names for the various known crypto algorithms.
59 for i
in ['MP', 'GF', 'Field',
60 'ECPt', 'ECPtCurve', 'ECCurve', 'ECInfo',
61 'DHInfo', 'BinDHInfo', 'RSAPriv', 'BBSPriv',
62 'PrimeFilter', 'RabinMiller',
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
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
84 if type(a
) is _types
.MethodType
:
86 elif type(a
) not in (_types
.FunctionType
, staticmethod, classmethod):
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
96 raise SyntaxError, 'junk at end of string'
99 ###--------------------------------------------------------------------------
104 return ByteString(_unhexify(x
))
105 fromhex
= staticmethod(fromhex
)
109 return 'bytes(%r)' %
hex(me
)
110 _augment(ByteString
, _tmp
)
111 bytes
= ByteString
.fromhex
113 ###--------------------------------------------------------------------------
114 ### Multiprecision integers and binary polynomials.
117 if isinstance(x
, BaseRat
): return x
._n
, x
._d
119 class BaseRat (object):
120 """Base class implementing fields of fractions over Euclidean domains."""
121 def __new__(cls
, a
, b
):
122 a
, b
= cls
.RING(a
), cls
.RING(b
)
126 me
= super(BaseRat
, cls
).__new__(cls
)
131 def numer(me
): return me
._n
133 def denom(me
): return me
._d
134 def __str__(me
): return '%s/%s' %
(me
._n
, me
._d
)
135 def __repr__(me
): return '%s(%s, %s)' %
(type(me
).__name__
, me
._n
, me
._d
)
137 def __add__(me
, you
):
138 n
, d
= _split_rat(you
)
139 return type(me
)(me
._n
*d
+ n
*me
._d
, d
*me
._d
)
141 def __sub__(me
, you
):
142 n
, d
= _split_rat(you
)
143 return type(me
)(me
._n
*d
- n
*me
._d
, d
*me
._d
)
144 def __rsub__(me
, you
):
145 n
, d
= _split_rat(you
)
146 return type(me
)(n
*me
._d
- me
._n
*d
, d
*me
._d
)
147 def __mul__(me
, you
):
148 n
, d
= _split_rat(you
)
149 return type(me
)(me
._n
*n
, me
._d
*d
)
150 def __div__(me
, you
):
151 n
, d
= _split_rat(you
)
152 return type(me
)(me
._n
*d
, me
._d
*n
)
153 def __rdiv__(me
, you
):
154 n
, d
= _split_rat(you
)
155 return type(me
)(me
._d
*n
, me
._n
*d
)
156 def __cmp__(me
, you
):
157 n
, d
= _split_rat(you
)
158 return type(me
)(me
._n
*d
, n
*me
._d
)
159 def __rcmp__(me
, you
):
160 n
, d
= _split_rat(you
)
161 return cmp(n
*me
._d
, me
._n
*d
)
163 class IntRat (BaseRat
):
166 class GFRat (BaseRat
):
170 def negp(x
): return x
< 0
171 def posp(x
): return x
> 0
172 def zerop(x
): return x
== 0
173 def oddp(x
): return x
.testbit(0)
174 def evenp(x
): return not x
.testbit(0)
175 def mont(x
): return MPMont(x
)
176 def barrett(x
): return MPBarrett(x
)
177 def reduce(x
): return MPReduce(x
)
178 def __div__(me
, you
): return IntRat(me
, you
)
179 def __rdiv__(me
, you
): return IntRat(you
, me
)
183 def zerop(x
): return x
== 0
184 def reduce(x
): return GFReduce(x
)
185 def trace(x
, y
): return x
.reduce().trace(y
)
186 def halftrace(x
, y
): return x
.reduce().halftrace(y
)
187 def modsqrt(x
, y
): return x
.reduce().sqrt(y
)
188 def quadsolve(x
, y
): return x
.reduce().quadsolve(y
)
189 def __div__(me
, you
): return GFRat(me
, you
)
190 def __rdiv__(me
, you
): return GFRat(you
, me
)
195 'product(ITERABLE) or product(I, ...) -> PRODUCT'
196 return MPMul(*arg
).done()
197 product
= staticmethod(product
)
198 _augment(MPMul
, _tmp
)
200 ###--------------------------------------------------------------------------
204 def fromstring(str): return _checkend(Field
.parse(str))
205 fromstring
= staticmethod(fromstring
)
206 _augment(Field
, _tmp
)
209 def __repr__(me
): return '%s(%sL)' %
(type(me
).__name__
, me
.p
)
210 def __hash__(me
): return 0x114401de ^
hash(me
.p
)
211 def ec(me
, a
, b
): return ECPrimeProjCurve(me
, a
, b
)
212 _augment(PrimeField
, _tmp
)
215 def __repr__(me
): return '%s(%sL)' %
(type(me
).__name__
, hex(me
.p
))
216 def ec(me
, a
, b
): return ECBinProjCurve(me
, a
, b
)
217 _augment(BinField
, _tmp
)
220 def __hash__(me
): return 0x23e4701c ^
hash(me
.p
)
221 _augment(BinPolyField
, _tmp
)
227 h ^
= 2*hash(me
.beta
) & 0xffffffff
229 _augment(BinNormField
, _tmp
)
232 def __str__(me
): return str(me
.value
)
233 def __repr__(me
): return '%s(%s)' %
(repr(me
.field
), repr(me
.value
))
236 ###--------------------------------------------------------------------------
241 return '%s(%r, %s, %s)' %
(type(me
).__name__
, me
.field
, me
.a
, me
.b
)
243 return ecpt
.frombuf(me
, s
)
245 return ecpt
.fromraw(me
, s
)
248 _augment(ECCurve
, _tmp
)
254 h ^
= 2*hash(me
.a
) ^
0xffffffff
255 h ^
= 5*hash(me
.b
) ^
0xffffffff
257 _augment(ECPrimeCurve
, _tmp
)
263 h ^
= 2*hash(me
.a
) ^
0xffffffff
264 h ^
= 5*hash(me
.b
) ^
0xffffffff
266 _augment(ECBinCurve
, _tmp
)
270 if not me
: return 'ECPt()'
271 return 'ECPt(%s, %s)' %
(me
.ix
, me
.iy
)
273 if not me
: return 'inf'
274 return '(%s, %s)' %
(me
.ix
, me
.iy
)
279 return 'ECInfo(curve = %r, G = %r, r = %s, h = %s)' % \
280 (me
.curve
, me
.G
, me
.r
, me
.h
)
284 h ^
= 2*hash(me
.G
) & 0xffffffff
288 _augment(ECInfo
, _tmp
)
292 if not me
: return '%r()' %
(me
.curve
)
293 return '%r(%s, %s)' %
(me
.curve
, me
.x
, me
.y
)
295 if not me
: return 'inf'
296 return '(%s, %s)' %
(me
.x
, me
.y
)
297 _augment(ECPtCurve
, _tmp
)
299 ###--------------------------------------------------------------------------
303 def __repr__(me
): return 'KeySZAny(%d)' % me
.default
304 def check(me
, sz
): return True
305 def best(me
, sz
): return sz
306 _augment(KeySZAny
, _tmp
)
310 return 'KeySZRange(%d, %d, %d, %d)' % \
311 (me
.default
, me
.min, me
.max, me
.mod
)
312 def check(me
, sz
): return me
.min <= sz
<= me
.max and sz % me
.mod
== 0
314 if sz
< me
.min: raise ValueError, 'key too small'
315 elif sz
> me
.max: return me
.max
316 else: return sz
- (sz % me
.mod
)
317 _augment(KeySZRange
, _tmp
)
320 def __repr__(me
): return 'KeySZSet(%d, %s)' %
(me
.default
, me
.set)
321 def check(me
, sz
): return sz
in me
.set
325 if found
< i
<= sz
: found
= i
326 if found
< 0: raise ValueError, 'key too small'
328 _augment(KeySZSet
, _tmp
)
330 ###--------------------------------------------------------------------------
335 return '%s(p = %s, r = %s, g = %s)' % \
336 (type(me
).__name__
, me
.p
, me
.r
, me
.g
)
337 _augment(FGInfo
, _tmp
)
340 def group(me
): return PrimeGroup(me
)
341 _augment(DHInfo
, _tmp
)
344 def group(me
): return BinGroup(me
)
345 _augment(BinDHInfo
, _tmp
)
349 return '%s(%r)' %
(type(me
).__name__
, me
.info
)
350 _augment(Group
, _tmp
)
357 h ^
= 2*hash(info
.r
) & 0xffffffff
358 h ^
= 5*hash(info
.g
) & 0xffffffff
360 _augment(PrimeGroup
, _tmp
)
367 h ^
= 2*hash(info
.r
) & 0xffffffff
368 h ^
= 5*hash(info
.g
) & 0xffffffff
370 _augment(BinGroup
, _tmp
)
373 def __hash__(me
): return 0x0ec23dab ^
hash(me
.info
)
374 _augment(ECGroup
, _tmp
)
378 return '%r(%r)' %
(me
.group
, str(me
))
381 ###--------------------------------------------------------------------------
382 ### RSA encoding techniques.
384 class PKCS1Crypt (object):
385 def __init__(me
, ep
= '', rng
= rand
):
388 def encode(me
, msg
, nbits
):
389 return _base
._p1crypt_encode(msg
, nbits
, me
.ep
, me
.rng
)
390 def decode(me
, ct
, nbits
):
391 return _base
._p1crypt_decode(ct
, nbits
, me
.ep
, me
.rng
)
393 class PKCS1Sig (object):
394 def __init__(me
, ep
= '', rng
= rand
):
397 def encode(me
, msg
, nbits
):
398 return _base
._p1sig_encode(msg
, nbits
, me
.ep
, me
.rng
)
399 def decode(me
, msg
, sig
, nbits
):
400 return _base
._p1sig_decode(msg
, sig
, nbits
, me
.ep
, me
.rng
)
403 def __init__(me
, mgf
= sha_mgf
, hash = sha
, ep
= '', rng
= rand
):
408 def encode(me
, msg
, nbits
):
409 return _base
._oaep_encode(msg
, nbits
, me
.mgf
, me
.hash, me
.ep
, me
.rng
)
410 def decode(me
, ct
, nbits
):
411 return _base
._oaep_decode(ct
, nbits
, me
.mgf
, me
.hash, me
.ep
, me
.rng
)
414 def __init__(me
, mgf
= sha_mgf
, hash = sha
, saltsz
= None, rng
= rand
):
421 def encode(me
, msg
, nbits
):
422 return _base
._pss_encode(msg
, nbits
, me
.mgf
, me
.hash, me
.saltsz
, me
.rng
)
423 def decode(me
, msg
, sig
, nbits
):
424 return _base
._pss_decode(msg
, sig
, nbits
,
425 me
.mgf
, me
.hash, me
.saltsz
, me
.rng
)
428 def encrypt(me
, msg
, enc
):
429 return me
.pubop(enc
.encode(msg
, me
.n
.nbits
))
430 def verify(me
, msg
, sig
, enc
):
431 if msg
is None: return enc
.decode(msg
, me
.pubop(sig
), me
.n
.nbits
)
433 x
= enc
.decode(msg
, me
.pubop(sig
), me
.n
.nbits
)
434 return x
is None or x
== msg
437 _augment(RSAPub
, _tmp
)
440 def decrypt(me
, ct
, enc
): return enc
.decode(me
.privop(ct
), me
.n
.nbits
)
441 def sign(me
, msg
, enc
): return me
.privop(enc
.encode(msg
, me
.n
.nbits
))
442 _augment(RSAPriv
, _tmp
)
444 ###--------------------------------------------------------------------------
445 ### Built-in named curves and prime groups.
447 class _groupmap (object):
448 def __init__(me
, map, nth
):
451 me
.i
= [None] * (max(map.values()) + 1)
453 return '{%s}' %
', '.join(['%r: %r' %
(k
, me
[k
]) for k
in me
])
454 def __contains__(me
, k
):
456 def __getitem__(me
, k
):
461 def __setitem__(me
, k
, v
):
462 raise TypeError, "immutable object"
474 return [k
for k
in me
]
476 return [me
[k
] for k
in me
]
478 return [(k
, me
[k
]) for k
in me
]
479 eccurves
= _groupmap(_base
._eccurves
, ECInfo
._curven
)
480 primegroups
= _groupmap(_base
._pgroups
, DHInfo
._groupn
)
481 bingroups
= _groupmap(_base
._bingroups
, BinDHInfo
._groupn
)
483 ###--------------------------------------------------------------------------
484 ### Prime number generation.
486 class PrimeGenEventHandler (object):
487 def pg_begin(me
, ev
):
491 def pg_abort(me
, ev
):
498 class SophieGermainStepJump (object):
499 def pg_begin(me
, ev
):
500 me
.lf
= PrimeFilter(ev
.x
)
501 me
.hf
= me
.lf
.muladd(2, 1)
507 while me
.lf
.status
== PGEN_FAIL
or me
.hf
.status
== PGEN_FAIL
:
509 if me
.lf
.status
== PGEN_ABORT
or me
.hf
.status
== PGEN_ABORT
:
512 if me
.lf
.status
== PGEN_DONE
and me
.hf
.status
== PGEN_DONE
:
519 class SophieGermainStepper (SophieGermainStepJump
):
520 def __init__(me
, step
):
527 class SophieGermainJumper (SophieGermainStepJump
):
528 def __init__(me
, jump
):
529 me
.ljump
= PrimeFilter(jump
);
530 me
.hjump
= me
.ljump
.muladd(2, 0)
537 SophieGermainStepJump
.pg_done(me
, ev
)
539 class SophieGermainTester (object):
542 def pg_begin(me
, ev
):
543 me
.lr
= RabinMiller(ev
.x
)
544 me
.hr
= RabinMiller(2 * ev
.x
+ 1)
546 lst
= me
.lr
.test(ev
.rng
.range(me
.lr
.x
))
547 if lst
!= PGEN_PASS
and lst
!= PGEN_DONE
:
549 rst
= me
.hr
.test(ev
.rng
.range(me
.hr
.x
))
550 if rst
!= PGEN_PASS
and rst
!= PGEN_DONE
:
552 if lst
== PGEN_DONE
and rst
== PGEN_DONE
:
559 class PrimitiveStepper (PrimeGenEventHandler
):
565 def pg_begin(me
, ev
):
566 me
.i
= iter(smallprimes
)
569 class PrimitiveTester (PrimeGenEventHandler
):
570 def __init__(me
, mod
, hh
= [], exp
= None):
576 if me
.exp
is not None:
577 x
= me
.mod
.exp(x
, me
.exp
)
578 if x
== 1: return PGEN_FAIL
580 if me
.mod
.exp(x
, h
) == 1: return PGEN_FAIL
584 class SimulStepper (PrimeGenEventHandler
):
585 def __init__(me
, mul
= 2, add
= 1, step
= 2):
589 def _stepfn(me
, step
):
591 raise ValueError, 'step must be positive'
593 return lambda f
: f
.step(step
)
594 j
= PrimeFilter(step
)
595 return lambda f
: f
.jump(j
)
596 def pg_begin(me
, ev
):
598 me
.lf
= PrimeFilter(x
)
599 me
.hf
= PrimeFilter(x
* me
.mul
+ me
.add
)
600 me
.lstep
= me
._stepfn(me
.step
)
601 me
.hstep
= me
._stepfn(me
.step
* me
.mul
)
602 SimulStepper
._cont(me
, ev
)
610 while me
.lf
.status
== PGEN_FAIL
or me
.hf
.status
== PGEN_FAIL
:
612 if me
.lf
.status
== PGEN_ABORT
or me
.hf
.status
== PGEN_ABORT
:
615 if me
.lf
.status
== PGEN_DONE
and me
.hf
.status
== PGEN_DONE
:
624 class SimulTester (PrimeGenEventHandler
):
625 def __init__(me
, mul
= 2, add
= 1):
628 def pg_begin(me
, ev
):
630 me
.lr
= RabinMiller(x
)
631 me
.hr
= RabinMiller(x
* me
.mul
+ me
.add
)
633 lst
= me
.lr
.test(ev
.rng
.range(me
.lr
.x
))
634 if lst
!= PGEN_PASS
and lst
!= PGEN_DONE
:
636 rst
= me
.hr
.test(ev
.rng
.range(me
.hr
.x
))
637 if rst
!= PGEN_PASS
and rst
!= PGEN_DONE
:
639 if lst
== PGEN_DONE
and rst
== PGEN_DONE
:
646 def sgprime(start
, step
= 2, name
= 'p', event
= pgen_nullev
, nsteps
= 0):
648 return pgen(start
, name
, SimulStepper(step
= step
), SimulTester(), event
,
649 nsteps
, RabinMiller
.iters(start
.nbits
))
651 def findprimitive(mod
, hh
= [], exp
= None, name
= 'g', event
= pgen_nullev
):
652 return pgen(0, name
, PrimitiveStepper(), PrimitiveTester(mod
, hh
, exp
),
655 def kcdsaprime(pbits
, qbits
, rng
= rand
,
656 event
= pgen_nullev
, name
= 'p', nsteps
= 0):
657 hbits
= pbits
- qbits
658 h
= pgen(rng
.mp(hbits
, 1), name
+ ' [h]',
659 PrimeGenStepper(2), PrimeGenTester(),
660 event
, nsteps
, RabinMiller
.iters(hbits
))
661 q
= pgen(rng
.mp(qbits
, 1), name
, SimulStepper(2 * h
, 1, 2),
662 SimulTester(2 * h
, 1), event
, nsteps
, RabinMiller
.iters(qbits
))
666 #----- That's all, folks ----------------------------------------------------