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 ## Initialize the module. Drag in the static methods of the various
38 ## classes; create names for the various known crypto algorithms.
45 for i
in ['MP', 'GF', 'Field',
46 'ECPt', 'ECPtCurve', 'ECCurve', 'ECInfo',
47 'DHInfo', 'BinDHInfo', 'RSAPriv', 'BBSPriv',
48 'PrimeFilter', 'RabinMiller',
56 setattr(c
, j
[plen
:], classmethod(b
[j
]))
57 for i
in [gcciphers
, gchashes
, gcmacs
, gcprps
]:
58 for c
in i
.itervalues():
59 d
[c
.name
.replace('-', '_')] = c
60 for c
in gccrands
.itervalues():
61 d
[c
.name
.replace('-', '_') + 'rand'] = c
64 ## A handy function for our work: add the methods of a named class to an
65 ## existing class. This is how we write the Python-implemented parts of our
70 if type(a
) is _types
.MethodType
:
72 elif type(a
) not in (_types
.FunctionType
, staticmethod, classmethod):
76 ## Parsing functions tend to return the object parsed and the remainder of
77 ## the input. This checks that the remainder is input and, if so, returns
82 raise SyntaxError, 'junk at end of string'
85 ###--------------------------------------------------------------------------
90 return ByteString(_unhexify(x
))
91 fromhex
= staticmethod(fromhex
)
95 return 'bytes(%r)' %
hex(me
)
96 _augment(ByteString
, _tmp
)
97 bytes
= ByteString
.fromhex
99 ###--------------------------------------------------------------------------
100 ### Multiprecision integers and binary polynomials.
103 def negp(x
): return x
< 0
104 def posp(x
): return x
> 0
105 def zerop(x
): return x
== 0
106 def oddp(x
): return x
.testbit(0)
107 def evenp(x
): return not x
.testbit(0)
108 def mont(x
): return MPMont(x
)
109 def barrett(x
): return MPBarrett(x
)
110 def reduce(x
): return MPReduce(x
)
113 if x
< 0: raise ValueError, 'factorial argument must be > 0'
114 return MPMul
.product(xrange(1, x
+ 1))
115 factorial
= staticmethod(factorial
)
119 def zerop(x
): return x
== 0
120 def reduce(x
): return GFReduce(x
)
121 def trace(x
, y
): return x
.reduce().trace(y
)
122 def halftrace(x
, y
): return x
.reduce().halftrace(y
)
123 def modsqrt(x
, y
): return x
.reduce().sqrt(y
)
124 def quadsolve(x
, y
): return x
.reduce().quadsolve(y
)
129 'product(ITERABLE) or product(I, ...) -> PRODUCT'
130 return MPMul(*arg
).done()
131 product
= staticmethod(product
)
132 _augment(MPMul
, _tmp
)
134 ###--------------------------------------------------------------------------
138 def fromstring(str): return _checkend(Field
.parse(str))
139 fromstring
= staticmethod(fromstring
)
140 _augment(Field
, _tmp
)
143 def __repr__(me
): return '%s(%sL)' %
(type(me
).__name__
, me
.p
)
144 def ec(me
, a
, b
): return ECPrimeProjCurve(me
, a
, b
)
145 _augment(PrimeField
, _tmp
)
148 def __repr__(me
): return '%s(%sL)' %
(type(me
).__name__
, hex(me
.p
))
149 def ec(me
, a
, b
): return ECBinProjCurve(me
, a
, b
)
150 _augment(BinField
, _tmp
)
153 def __str__(me
): return str(me
.value
)
154 def __repr__(me
): return '%s(%s)' %
(repr(me
.field
), repr(me
.value
))
157 ###--------------------------------------------------------------------------
162 return '%s(%r, %s, %s)' %
(type(me
).__name__
, me
.field
, me
.a
, me
.b
)
164 return ecpt
.frombuf(me
, s
)
166 return ecpt
.fromraw(me
, s
)
169 _augment(ECCurve
, _tmp
)
173 if not me
: return 'ECPt()'
174 return 'ECPt(%s, %s)' %
(me
.ix
, me
.iy
)
176 if not me
: return 'inf'
177 return '(%s, %s)' %
(me
.ix
, me
.iy
)
182 return 'ECInfo(curve = %r, G = %r, r = %s, h = %s)' % \
183 (me
.curve
, me
.G
, me
.r
, me
.h
)
186 _augment(ECInfo
, _tmp
)
190 if not me
: return '%r()' %
(me
.curve
)
191 return '%r(%s, %s)' %
(me
.curve
, me
.x
, me
.y
)
193 if not me
: return 'inf'
194 return '(%s, %s)' %
(me
.x
, me
.y
)
195 _augment(ECPtCurve
, _tmp
)
197 ###--------------------------------------------------------------------------
201 def __repr__(me
): return 'KeySZAny(%d)' % me
.default
202 def check(me
, sz
): return True
203 def best(me
, sz
): return sz
204 _augment(KeySZAny
, _tmp
)
208 return 'KeySZRange(%d, %d, %d, %d)' % \
209 (me
.default
, me
.min, me
.max, me
.mod
)
210 def check(me
, sz
): return me
.min <= sz
<= me
.max and sz % me
.mod
== 0
212 if sz
< me
.min: raise ValueError, 'key too small'
213 elif sz
> me
.max: return me
.max
214 else: return sz
- (sz % me
.mod
)
215 _augment(KeySZRange
, _tmp
)
218 def __repr__(me
): return 'KeySZSet(%d, %s)' %
(me
.default
, me
.set)
219 def check(me
, sz
): return sz
in me
.set
223 if found
< i
<= sz
: found
= i
224 if found
< 0: raise ValueError, 'key too small'
226 _augment(KeySZSet
, _tmp
)
228 ###--------------------------------------------------------------------------
233 return '%s(p = %s, r = %s, g = %s)' % \
234 (type(me
).__name__
, me
.p
, me
.r
, me
.g
)
235 _augment(FGInfo
, _tmp
)
238 def group(me
): return PrimeGroup(me
)
239 _augment(DHInfo
, _tmp
)
242 def group(me
): return BinGroup(me
)
243 _augment(BinDHInfo
, _tmp
)
247 return '%s(%r)' %
(type(me
).__name__
, me
.info
)
248 _augment(Group
, _tmp
)
252 return '%r(%r)' %
(me
.group
, str(me
))
255 ###--------------------------------------------------------------------------
256 ### RSA encoding techniques.
258 class PKCS1Crypt (object):
259 def __init__(me
, ep
= '', rng
= rand
):
262 def encode(me
, msg
, nbits
):
263 return _base
._p1crypt_encode(msg
, nbits
, me
.ep
, me
.rng
)
264 def decode(me
, ct
, nbits
):
265 return _base
._p1crypt_decode(ct
, nbits
, me
.ep
, me
.rng
)
267 class PKCS1Sig (object):
268 def __init__(me
, ep
= '', rng
= rand
):
271 def encode(me
, msg
, nbits
):
272 return _base
._p1sig_encode(msg
, nbits
, me
.ep
, me
.rng
)
273 def decode(me
, msg
, sig
, nbits
):
274 return _base
._p1sig_decode(msg
, sig
, nbits
, me
.ep
, me
.rng
)
277 def __init__(me
, mgf
= sha_mgf
, hash = sha
, ep
= '', rng
= rand
):
282 def encode(me
, msg
, nbits
):
283 return _base
._oaep_encode(msg
, nbits
, me
.mgf
, me
.hash, me
.ep
, me
.rng
)
284 def decode(me
, ct
, nbits
):
285 return _base
._oaep_decode(ct
, nbits
, me
.mgf
, me
.hash, me
.ep
, me
.rng
)
288 def __init__(me
, mgf
= sha_mgf
, hash = sha
, saltsz
= None, rng
= rand
):
295 def encode(me
, msg
, nbits
):
296 return _base
._pss_encode(msg
, nbits
, me
.mgf
, me
.hash, me
.saltsz
, me
.rng
)
297 def decode(me
, msg
, sig
, nbits
):
298 return _base
._pss_decode(msg
, sig
, nbits
,
299 me
.mgf
, me
.hash, me
.saltsz
, me
.rng
)
302 def encrypt(me
, msg
, enc
):
303 return me
.pubop(enc
.encode(msg
, me
.n
.nbits
))
304 def verify(me
, msg
, sig
, enc
):
305 if msg
is None: return enc
.decode(msg
, me
.pubop(sig
), me
.n
.nbits
)
307 x
= enc
.decode(msg
, me
.pubop(sig
), me
.n
.nbits
)
308 return x
is None or x
== msg
311 _augment(RSAPub
, _tmp
)
314 def decrypt(me
, ct
, enc
): return enc
.decode(me
.privop(ct
), me
.n
.nbits
)
315 def sign(me
, msg
, enc
): return me
.privop(enc
.encode(msg
, me
.n
.nbits
))
316 _augment(RSAPriv
, _tmp
)
318 ###--------------------------------------------------------------------------
319 ### Built-in named curves and prime groups.
321 class _groupmap (object):
322 def __init__(me
, map, nth
):
325 me
.i
= [None] * (max(map.values()) + 1)
327 return '{%s}' %
', '.join(['%r: %r' %
(k
, me
[k
]) for k
in me
])
328 def __contains__(me
, k
):
330 def __getitem__(me
, k
):
335 def __setitem__(me
, k
, v
):
336 raise TypeError, "immutable object"
348 return [k
for k
in me
]
350 return [me
[k
] for k
in me
]
352 return [(k
, me
[k
]) for k
in me
]
353 eccurves
= _groupmap(_base
._eccurves
, ECInfo
._curven
)
354 primegroups
= _groupmap(_base
._pgroups
, DHInfo
._groupn
)
355 bingroups
= _groupmap(_base
._bingroups
, BinDHInfo
._groupn
)
357 ###--------------------------------------------------------------------------
358 ### Prime number generation.
360 class PrimeGenEventHandler (object):
361 def pg_begin(me
, ev
):
365 def pg_abort(me
, ev
):
372 class SophieGermainStepJump (object):
373 def pg_begin(me
, ev
):
374 me
.lf
= PrimeFilter(ev
.x
)
375 me
.hf
= me
.lf
.muladd(2, 1)
381 while me
.lf
.status
== PGEN_FAIL
or me
.hf
.status
== PGEN_FAIL
:
383 if me
.lf
.status
== PGEN_ABORT
or me
.hf
.status
== PGEN_ABORT
:
386 if me
.lf
.status
== PGEN_DONE
and me
.hf
.status
== PGEN_DONE
:
393 class SophieGermainStepper (SophieGermainStepJump
):
394 def __init__(me
, step
):
401 class SophieGermainJumper (SophieGermainStepJump
):
402 def __init__(me
, jump
):
403 me
.ljump
= PrimeFilter(jump
);
404 me
.hjump
= me
.ljump
.muladd(2, 0)
411 SophieGermainStepJump
.pg_done(me
, ev
)
413 class SophieGermainTester (object):
416 def pg_begin(me
, ev
):
417 me
.lr
= RabinMiller(ev
.x
)
418 me
.hr
= RabinMiller(2 * ev
.x
+ 1)
420 lst
= me
.lr
.test(ev
.rng
.range(me
.lr
.x
))
421 if lst
!= PGEN_PASS
and lst
!= PGEN_DONE
:
423 rst
= me
.hr
.test(ev
.rng
.range(me
.hr
.x
))
424 if rst
!= PGEN_PASS
and rst
!= PGEN_DONE
:
426 if lst
== PGEN_DONE
and rst
== PGEN_DONE
:
433 class PrimitiveStepper (PrimeGenEventHandler
):
439 def pg_begin(me
, ev
):
440 me
.i
= iter(smallprimes
)
443 class PrimitiveTester (PrimeGenEventHandler
):
444 def __init__(me
, mod
, hh
= [], exp
= None):
450 if me
.exp
is not None:
451 x
= me
.mod
.exp(x
, me
.exp
)
452 if x
== 1: return PGEN_FAIL
454 if me
.mod
.exp(x
, h
) == 1: return PGEN_FAIL
458 class SimulStepper (PrimeGenEventHandler
):
459 def __init__(me
, mul
= 2, add
= 1, step
= 2):
463 def _stepfn(me
, step
):
465 raise ValueError, 'step must be positive'
467 return lambda f
: f
.step(step
)
468 j
= PrimeFilter(step
)
469 return lambda f
: f
.jump(j
)
470 def pg_begin(me
, ev
):
472 me
.lf
= PrimeFilter(x
)
473 me
.hf
= PrimeFilter(x
* me
.mul
+ me
.add
)
474 me
.lstep
= me
._stepfn(me
.step
)
475 me
.hstep
= me
._stepfn(me
.step
* me
.mul
)
476 SimulStepper
._cont(me
, ev
)
484 while me
.lf
.status
== PGEN_FAIL
or me
.hf
.status
== PGEN_FAIL
:
486 if me
.lf
.status
== PGEN_ABORT
or me
.hf
.status
== PGEN_ABORT
:
489 if me
.lf
.status
== PGEN_DONE
and me
.hf
.status
== PGEN_DONE
:
498 class SimulTester (PrimeGenEventHandler
):
499 def __init__(me
, mul
= 2, add
= 1):
502 def pg_begin(me
, ev
):
504 me
.lr
= RabinMiller(x
)
505 me
.hr
= RabinMiller(x
* me
.mul
+ me
.add
)
507 lst
= me
.lr
.test(ev
.rng
.range(me
.lr
.x
))
508 if lst
!= PGEN_PASS
and lst
!= PGEN_DONE
:
510 rst
= me
.hr
.test(ev
.rng
.range(me
.hr
.x
))
511 if rst
!= PGEN_PASS
and rst
!= PGEN_DONE
:
513 if lst
== PGEN_DONE
and rst
== PGEN_DONE
:
520 def sgprime(start
, step
= 2, name
= 'p', event
= pgen_nullev
, nsteps
= 0):
522 return pgen(start
, name
, SimulStepper(step
= step
), SimulTester(), event
,
523 nsteps
, RabinMiller
.iters(start
.nbits
))
525 def findprimitive(mod
, hh
= [], exp
= None, name
= 'g', event
= pgen_nullev
):
526 return pgen(0, name
, PrimitiveStepper(), PrimitiveTester(mod
, hh
, exp
),
529 def kcdsaprime(pbits
, qbits
, rng
= rand
,
530 event
= pgen_nullev
, name
= 'p', nsteps
= 0):
531 hbits
= pbits
- qbits
532 h
= pgen(rng
.mp(hbits
, 1), name
+ ' [h]',
533 PrimeGenStepper(2), PrimeGenTester(),
534 event
, nsteps
, RabinMiller
.iters(hbits
))
535 q
= pgen(rng
.mp(qbits
, 1), name
, SimulStepper(2 * h
, 1, 2),
536 SimulTester(2 * h
, 1), event
, nsteps
, RabinMiller
.iters(qbits
))
540 #----- That's all, folks ----------------------------------------------------