5 # Setup for Catacomb/Python bindings
7 # (c) 2004 Straylight/Edgeware
10 #----- Licensing notice -----------------------------------------------------
12 # This file is part of the Python interface to Catacomb.
14 # Catacomb/Python is free software; you can redistribute it and/or modify
15 # it under the terms of the GNU General Public License as published by
16 # the Free Software Foundation; either version 2 of the License, or
17 # (at your option) any later version.
19 # Catacomb/Python is distributed in the hope that it will be useful,
20 # but WITHOUT ANY WARRANTY; without even the implied warranty of
21 # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 # GNU General Public License for more details.
24 # You should have received a copy of the GNU General Public License
25 # along with Catacomb/Python; if not, write to the Free Software Foundation,
26 # Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
29 import types
as _types
30 from binascii
import hexlify
as _hexify
, unhexlify
as _unhexify
38 for i
in ['MP', 'GF', 'Field',
39 'ECPt', 'ECPtCurve', 'ECCurve', 'ECInfo',
40 'DHInfo', 'BinDHInfo', 'RSAPriv', 'PrimeFilter', 'RabinMiller',
47 setattr(c
, j
[plen
:], classmethod(b
[j
]))
48 for i
in [gcciphers
, gchashes
, gcmacs
]:
51 d
[c
.name
.replace('-', '_')] = c
57 if type(a
) is _types
.MethodType
:
59 elif type(a
) not in (_types
.FunctionType
, staticmethod, classmethod):
65 return ByteString(_unhexify(x
))
66 fromhex
= staticmethod(fromhex
)
70 return 'bytes(%r)' %
hex(me
)
71 _augment(ByteString
, _tmp
)
72 bytes
= ByteString
.fromhex
75 def negp(x
): return x
< 0
76 def posp(x
): return x
> 0
77 def zerop(x
): return x
== 0
78 def oddp(x
): return x
.testbit(0)
79 def evenp(x
): return not x
.testbit(0)
80 def mont(x
): return MPMont(x
)
81 def barrett(x
): return MPBarrett(x
)
82 def reduce(x
): return MPReduce(x
)
85 if x
< 0: raise ValueError, 'factorial argument must be > 0'
86 return MP
.product(xrange(1, x
+ 1))
87 factorial
= staticmethod(factorial
)
93 raise SyntaxError, 'junk at end of string'
97 def reduce(x
): return GReduce(x
)
101 def fromstring(str): return _checkend(Field
.parse(str))
102 fromstring
= staticmethod(fromstring
)
103 _augment(Field
, _tmp
)
106 def __repr__(me
): return '%s(%sL)' %
(type(me
).__name__
, me
.p
)
107 def ec(me
, a
, b
): return ECPrimeProjCurve(me
, a
, b
)
108 _augment(PrimeField
, _tmp
)
111 def __repr__(me
): return '%s(%sL)' %
(type(me
).__name__
, hex(me
.p
))
112 def ec(me
, a
, b
): return ECBinProjCurve(me
, a
, b
)
113 _augment(BinField
, _tmp
)
116 def __str__(me
): return str(me
.value
)
117 def __repr__(me
): return '%s(%s)' %
(repr(me
.field
), repr(me
.value
))
120 class _groupmap (object):
121 def __init__(me
, map, nth
):
124 me
.i
= [None] * (max(map.values()) + 1)
126 return '{%s}' %
', '.join(['%r: %r' %
(k
, me
[k
]) for k
in me
])
127 def __contains__(me
, k
):
129 def __getitem__(me
, k
):
134 def __setitem__(me
, k
, v
):
135 raise TypeError, "immutable object"
138 eccurves
= _groupmap(_base
._eccurves
, ECInfo
._curven
)
139 primegroups
= _groupmap(_base
._pgroups
, DHInfo
._groupn
)
140 bingroups
= _groupmap(_base
._bingroups
, BinDHInfo
._groupn
)
144 return '%s(%r, %s, %s)' %
(type(me
).__name__
, me
.field
, me
.a
, me
.b
)
146 return ecpt
.frombuf(me
, s
)
148 return ecpt
.fromraw(me
, s
)
150 return ECPt(me
, *args
)
151 _augment(ECCurve
, _tmp
)
155 if not me
: return 'ECPt()'
156 return 'ECPt(%s, %s)' %
(me
.ix
, me
.iy
)
158 if not me
: return 'inf'
159 return '(%s, %s)' %
(me
.ix
, me
.iy
)
164 return 'ECInfo(curve = %r, G = %r, r = %s, h = %s)' % \
165 (me
.curve
, me
.G
, me
.r
, me
.h
)
168 _augment(ECInfo
, _tmp
)
172 if not me
: return '%r()' %
(me
.curve
)
173 return '%r(%s, %s)' %
(me
.curve
, me
.x
, me
.y
)
175 if not me
: return 'inf'
176 return '(%s, %s)' %
(me
.x
, me
.y
)
177 _augment(ECPtCurve
, _tmp
)
180 def __repr__(me
): return 'KeySZAny(%d)' % me
.default
181 def check(me
, sz
): return True
182 def best(me
, sz
): return sz
183 _augment(KeySZAny
, _tmp
)
187 return 'KeySZRange(%d, %d, %d, %d)' % \
188 (me
.default
, me
.min, me
.max, me
.mod
)
189 def check(me
, sz
): return me
.min <= sz
<= me
.max and sz % me
.mod
== 0
191 if sz
< me
.min: raise ValueError, 'key too small'
192 elif sz
> me
.max: return me
.max
193 else: return sz
- (sz % me
.mod
)
194 _augment(KeySZRange
, _tmp
)
197 def __repr__(me
): return 'KeySZSet(%d, %s)' %
(me
.default
, me
.set)
198 def check(me
, sz
): return sz
in me
.set
202 if found
< i
<= sz
: found
= i
203 if found
< 0: raise ValueError, 'key too small'
205 _augment(KeySZSet
, _tmp
)
209 return '%s(p = %s, r = %s, g = %s)' % \
210 (type(me
).__name__
, me
.p
, me
.r
, me
.g
)
211 _augment(FGInfo
, _tmp
)
214 def group(me
): return PrimeGroup(me
)
215 _augment(DHInfo
, _tmp
)
218 def group(me
): return BinGroup(me
)
219 _augment(BinDHInfo
, _tmp
)
223 return '%s(%r)' %
(type(me
).__name__
, me
.info
)
224 _augment(Group
, _tmp
)
228 return '%r(%r)' %
(me
.group
, str(me
))
231 class PKCS1Crypt(object):
232 def __init__(me
, ep
= '', rng
= rand
):
235 def encode(me
, msg
, nbits
):
236 return _base
._p1crypt_encode(msg
, nbits
, me
.ep
, me
.rng
)
237 def decode(me
, ct
, nbits
):
238 return _base
._p1crypt_decode(ct
, nbits
, me
.ep
, me
.rng
)
240 class PKCS1Sig(object):
241 def __init__(me
, ep
= '', rng
= rand
):
244 def encode(me
, msg
, nbits
):
245 return _base
._p1sig_encode(msg
, nbits
, me
.ep
, me
.rng
)
246 def decode(me
, msg
, sig
, nbits
):
247 return _base
._p1sig_decode(msg
, sig
, nbits
, me
.ep
, me
.rng
)
250 def __init__(me
, mgf
= sha_mgf
, hash = sha
, ep
= '', rng
= rand
):
255 def encode(me
, msg
, nbits
):
256 return _base
._oaep_encode(msg
, nbits
, me
.mgf
, me
.hash, me
.ep
, me
.rng
)
257 def decode(me
, ct
, nbits
):
258 return _base
._oaep_decode(ct
, nbits
, me
.mgf
, me
.hash, me
.ep
, me
.rng
)
261 def __init__(me
, mgf
= sha_mgf
, hash = sha
, saltsz
= None, rng
= rand
):
268 def encode(me
, msg
, nbits
):
269 return _base
._pss_encode(msg
, nbits
, me
.mgf
, me
.hash, me
.saltsz
, me
.rng
)
270 def decode(me
, msg
, sig
, nbits
):
271 return _base
._pss_decode(msg
, sig
, nbits
,
272 me
.mgf
, me
.hash, me
.saltsz
, me
.rng
)
275 def encrypt(me
, msg
, enc
):
276 return me
.pubop(enc
.encode(msg
, me
.n
.nbits
))
277 def verify(me
, msg
, sig
, enc
):
278 if msg
is None: return enc
.decode(msg
, me
.pubop(sig
), me
.n
.nbits
)
280 x
= enc
.decode(msg
, me
.pubop(sig
), me
.n
.nbits
)
281 return x
is None or x
== msg
284 _augment(RSAPub
, _tmp
)
287 def decrypt(me
, ct
, enc
): return enc
.decode(me
.privop(ct
), me
.n
.nbits
)
288 def sign(me
, msg
, enc
): return me
.privop(enc
.encode(msg
, me
.n
.nbits
))
289 _augment(RSAPriv
, _tmp
)
292 class SophieGermainStepJump (object):
293 def pg_begin(me
, ev
):
294 me
.lf
= PrimeFilter(ev
.x
)
295 me
.hf
= me
.lf
.muladd(2, 1)
301 while me
.lf
.status
== PGEN_FAIL
or me
.hf
.status
== PGEN_FAIL
:
303 if me
.lf
.status
== PGEN_ABORT
or me
.hf
.status
== PGEN_ABORT
:
306 if me
.lf
.status
== PGEN_DONE
and me
.hf
.status
== PGEN_DONE
:
313 class SophieGermainStepper (SophieGermainStepJump
):
314 def __init__(me
, step
):
321 class SophieGermainJumper (SophieGermainStepJump
):
322 def __init__(me
, jump
):
323 me
.ljump
= PrimeFilter(jump
);
324 me
.hjump
= me
.ljump
.muladd(2, 0)
331 SophieGermainStepJump
.pg_done(me
, ev
)
333 class SophieGermainTester (object):
336 def pg_begin(me
, ev
):
337 me
.lr
= RabinMiller(ev
.x
)
338 me
.hr
= RabinMiller(2 * ev
.x
+ 1)
340 lst
= me
.lr
.test(ev
.rng
.range(me
.lr
.x
))
341 if lst
!= PGEN_PASS
and lst
!= PGEN_DONE
:
343 rst
= me
.hr
.test(ev
.rng
.range(me
.hr
.x
))
344 if rst
!= PGEN_PASS
and rst
!= PGEN_DONE
:
346 if lst
== PGEN_DONE
and rst
== PGEN_DONE
:
353 class PrimeGenEventHandler (object):
354 def pg_begin(me
, ev
):
358 def pg_abort(me
, ev
):
365 class PrimitiveStepper (PrimeGenEventHandler
):
371 def pg_begin(me
, ev
):
372 me
.i
= iter(smallprimes
)
375 class PrimitiveTester (PrimeGenEventHandler
):
376 def __init__(me
, mod
, hh
= [], exp
= None):
382 if me
.exp
is not None:
383 x
= me
.mod
.exp(x
, me
.exp
)
384 if x
== 1: return PGEN_FAIL
386 if me
.mod
.exp(x
, h
) == 1: return PGEN_FAIL
390 class SimulStepper (PrimeGenEventHandler
):
391 def __init__(me
, mul
= 2, add
= 1, step
= 2):
395 def _stepfn(me
, step
):
397 raise ValueError, 'step must be positive'
399 return lambda f
: f
.step(step
)
400 j
= PrimeFilter(step
)
401 return lambda f
: f
.jump(j
)
402 def pg_begin(me
, ev
):
404 me
.lf
= PrimeFilter(x
)
405 me
.hf
= PrimeFilter(x
* me
.mul
+ me
.add
)
406 me
.lstep
= me
._stepfn(me
.step
)
407 me
.hstep
= me
._stepfn(me
.step
* me
.mul
)
408 SimulStepper
._cont(me
, ev
)
416 while me
.lf
.status
== PGEN_FAIL
or me
.hf
.status
== PGEN_FAIL
:
418 if me
.lf
.status
== PGEN_ABORT
or me
.hf
.status
== PGEN_ABORT
:
421 if me
.lf
.status
== PGEN_DONE
and me
.hf
.status
== PGEN_DONE
:
430 class SimulTester (PrimeGenEventHandler
):
431 def __init__(me
, mul
= 2, add
= 1):
434 def pg_begin(me
, ev
):
436 me
.lr
= RabinMiller(x
)
437 me
.hr
= RabinMiller(x
* me
.mul
+ me
.add
)
439 lst
= me
.lr
.test(ev
.rng
.range(me
.lr
.x
))
440 if lst
!= PGEN_PASS
and lst
!= PGEN_DONE
:
442 rst
= me
.hr
.test(ev
.rng
.range(me
.hr
.x
))
443 if rst
!= PGEN_PASS
and rst
!= PGEN_DONE
:
445 if lst
== PGEN_DONE
and rst
== PGEN_DONE
:
452 def sgprime(start
, step
= 2, name
= 'p', event
= pgen_nullev
, nsteps
= 0):
454 return pgen(start
, name
, SimulStepper(step
= step
), SimulTester(), event
,
455 nsteps
, RabinMiller
.iters(start
.nbits
))
457 def findprimitive(mod
, hh
= [], exp
= None, name
= 'g', event
= pgen_nullev
):
458 return pgen(0, name
, PrimitiveStepper(), PrimitiveTester(mod
, hh
, exp
),
461 def kcdsaprime(pbits
, qbits
, rng
= rand
,
462 event
= pgen_nullev
, name
= 'p', nsteps
= 0):
463 hbits
= pbits
- qbits
464 h
= pgen(rng
.mp(hbits
, 1), name
+ ' [h]',
465 PrimeGenStepper(2), PrimeGenTester(),
466 event
, nsteps
, RabinMiller
.iters(hbits
))
467 q
= pgen(rng
.mp(qbits
, 1), name
, SimulStepper(2 * h
, 1, 2),
468 SimulTester(2 * h
, 1), event
, nsteps
, RabinMiller
.iters(qbits
))
472 #----- That's all, folks ----------------------------------------------------