d7ab1bab |
1 | # -*-python-*- |
2 | # |
3 | # $Id$ |
4 | # |
5 | # Setup for Catacomb/Python bindings |
6 | # |
7 | # (c) 2004 Straylight/Edgeware |
8 | # |
9 | |
10 | #----- Licensing notice ----------------------------------------------------- |
11 | # |
12 | # This file is part of the Python interface to Catacomb. |
13 | # |
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. |
18 | # |
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. |
23 | # |
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. |
27 | |
28 | import _base |
29 | import types as _types |
30 | from binascii import hexlify as _hexify, unhexlify as _unhexify |
31 | |
32 | def _init(): |
33 | d = globals() |
34 | b = _base.__dict__; |
35 | for i in b: |
36 | if i[0] != '_': |
37 | d[i] = b[i]; |
38 | for i in ['MP', 'GF', 'Field', |
39 | 'ECPt', 'ECPtCurve', 'ECCurve', 'ECInfo', |
40 | 'DHInfo', 'BinDHInfo', 'RSAPriv', 'PrimeFilter', 'RabinMiller', |
41 | 'Group', 'GE']: |
42 | c = d[i] |
43 | pre = '_' + i + '_' |
44 | plen = len(pre) |
45 | for j in b: |
46 | if j[:plen] == pre: |
47 | setattr(c, j[plen:], classmethod(b[j])) |
48 | for i in [gcciphers, gchashes, gcmacs]: |
49 | for j in i: |
50 | c = i[j] |
51 | d[c.name.replace('-', '_')] = c |
52 | _init() |
53 | |
54 | def _augment(c, cc): |
55 | for i in cc.__dict__: |
56 | a = cc.__dict__[i] |
57 | if type(a) is _types.MethodType: |
58 | a = a.im_func |
59 | elif type(a) not in (_types.FunctionType, staticmethod, classmethod): |
60 | continue |
61 | setattr(c, i, a) |
62 | |
63 | class _tmp: |
64 | def fromhex(x): |
65 | return ByteString(_unhexify(x)) |
66 | fromhex = staticmethod(fromhex) |
67 | def __hex__(me): |
68 | return _hexify(me) |
69 | def __repr__(me): |
70 | return 'bytes(%r)' % hex(me) |
71 | _augment(ByteString, _tmp) |
72 | bytes = ByteString.fromhex |
73 | |
74 | class _tmp: |
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) |
83 | def factorial(x): |
84 | 'factorial(X) -> X!' |
85 | if x < 0: raise ValueError, 'factorial argument must be > 0' |
86 | return MP.product(xrange(1, x + 1)) |
87 | factorial = staticmethod(factorial) |
88 | _augment(MP, _tmp) |
89 | |
90 | def _checkend(r): |
91 | x, rest = r |
92 | if rest != '': |
93 | raise SyntaxError, 'junk at end of string' |
94 | return x |
95 | |
96 | class _tmp: |
97 | def reduce(x): return GReduce(x) |
98 | _augment(GF, _tmp) |
99 | |
100 | class _tmp: |
101 | def fromstring(str): return _checkend(Field.parse(str)) |
102 | fromstring = staticmethod(fromstring) |
103 | _augment(Field, _tmp) |
104 | |
105 | class _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) |
109 | |
110 | class _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) |
114 | |
115 | class _tmp: |
116 | def __str__(me): return str(me.value) |
117 | def __repr__(me): return '%s(%s)' % (repr(me.field), repr(me.value)) |
118 | _augment(FE, _tmp) |
119 | |
120 | class _groupmap (object): |
121 | def __init__(me, map, nth): |
122 | me.map = map |
123 | me.nth = nth |
124 | me.i = [None] * (max(map.values()) + 1) |
125 | def __repr__(me): |
126 | return '{%s}' % ', '.join(['%r: %r' % (k, me[k]) for k in me]) |
127 | def __contains__(me, k): |
128 | return k in me.map |
129 | def __getitem__(me, k): |
130 | i = me.map[k] |
131 | if me.i[i] is None: |
132 | me.i[i] = me.nth(i) |
133 | return me.i[i] |
134 | def __setitem__(me, k, v): |
135 | raise TypeError, "immutable object" |
136 | def __iter__(me): |
137 | return iter(me.map) |
df9f8366 |
138 | def keys(me): |
139 | return [k for k in me] |
140 | def values(me): |
141 | return [me[k] for k in me] |
d7ab1bab |
142 | eccurves = _groupmap(_base._eccurves, ECInfo._curven) |
143 | primegroups = _groupmap(_base._pgroups, DHInfo._groupn) |
144 | bingroups = _groupmap(_base._bingroups, BinDHInfo._groupn) |
145 | |
146 | class _tmp: |
147 | def __repr__(me): |
148 | return '%s(%r, %s, %s)' % (type(me).__name__, me.field, me.a, me.b) |
149 | def frombuf(me, s): |
150 | return ecpt.frombuf(me, s) |
151 | def fromraw(me, s): |
152 | return ecpt.fromraw(me, s) |
153 | def pt(me, *args): |
154 | return ECPt(me, *args) |
155 | _augment(ECCurve, _tmp) |
156 | |
157 | class _tmp: |
158 | def __repr__(me): |
159 | if not me: return 'ECPt()' |
160 | return 'ECPt(%s, %s)' % (me.ix, me.iy) |
161 | def __str__(me): |
162 | if not me: return 'inf' |
163 | return '(%s, %s)' % (me.ix, me.iy) |
164 | _augment(ECPt, _tmp) |
165 | |
166 | class _tmp: |
167 | def __repr__(me): |
168 | return 'ECInfo(curve = %r, G = %r, r = %s, h = %s)' % \ |
169 | (me.curve, me.G, me.r, me.h) |
170 | def group(me): |
171 | return ECGroup(me) |
172 | _augment(ECInfo, _tmp) |
173 | |
174 | class _tmp: |
175 | def __repr__(me): |
176 | if not me: return '%r()' % (me.curve) |
177 | return '%r(%s, %s)' % (me.curve, me.x, me.y) |
178 | def __str__(me): |
179 | if not me: return 'inf' |
180 | return '(%s, %s)' % (me.x, me.y) |
181 | _augment(ECPtCurve, _tmp) |
182 | |
183 | class _tmp: |
184 | def __repr__(me): return 'KeySZAny(%d)' % me.default |
185 | def check(me, sz): return True |
186 | def best(me, sz): return sz |
187 | _augment(KeySZAny, _tmp) |
188 | |
189 | class _tmp: |
190 | def __repr__(me): |
191 | return 'KeySZRange(%d, %d, %d, %d)' % \ |
192 | (me.default, me.min, me.max, me.mod) |
193 | def check(me, sz): return me.min <= sz <= me.max and sz % me.mod == 0 |
194 | def best(me, sz): |
195 | if sz < me.min: raise ValueError, 'key too small' |
196 | elif sz > me.max: return me.max |
197 | else: return sz - (sz % me.mod) |
198 | _augment(KeySZRange, _tmp) |
199 | |
200 | class _tmp: |
201 | def __repr__(me): return 'KeySZSet(%d, %s)' % (me.default, me.set) |
202 | def check(me, sz): return sz in me.set |
203 | def best(me, sz): |
204 | found = -1 |
205 | for i in me.set: |
206 | if found < i <= sz: found = i |
207 | if found < 0: raise ValueError, 'key too small' |
208 | return found |
209 | _augment(KeySZSet, _tmp) |
210 | |
211 | class _tmp: |
212 | def __repr__(me): |
213 | return '%s(p = %s, r = %s, g = %s)' % \ |
214 | (type(me).__name__, me.p, me.r, me.g) |
215 | _augment(FGInfo, _tmp) |
216 | |
217 | class _tmp: |
218 | def group(me): return PrimeGroup(me) |
219 | _augment(DHInfo, _tmp) |
220 | |
221 | class _tmp: |
222 | def group(me): return BinGroup(me) |
223 | _augment(BinDHInfo, _tmp) |
224 | |
225 | class _tmp: |
226 | def __repr__(me): |
227 | return '%s(%r)' % (type(me).__name__, me.info) |
228 | _augment(Group, _tmp) |
229 | |
230 | class _tmp: |
231 | def __repr__(me): |
232 | return '%r(%r)' % (me.group, str(me)) |
233 | _augment(GE, _tmp) |
234 | |
235 | class PKCS1Crypt(object): |
236 | def __init__(me, ep = '', rng = rand): |
237 | me.ep = ep |
238 | me.rng = rng |
239 | def encode(me, msg, nbits): |
240 | return _base._p1crypt_encode(msg, nbits, me.ep, me.rng) |
241 | def decode(me, ct, nbits): |
242 | return _base._p1crypt_decode(ct, nbits, me.ep, me.rng) |
243 | |
244 | class PKCS1Sig(object): |
245 | def __init__(me, ep = '', rng = rand): |
246 | me.ep = ep |
247 | me.rng = rng |
248 | def encode(me, msg, nbits): |
249 | return _base._p1sig_encode(msg, nbits, me.ep, me.rng) |
250 | def decode(me, msg, sig, nbits): |
251 | return _base._p1sig_decode(msg, sig, nbits, me.ep, me.rng) |
252 | |
253 | class OAEP(object): |
254 | def __init__(me, mgf = sha_mgf, hash = sha, ep = '', rng = rand): |
255 | me.mgf = mgf |
256 | me.hash = hash |
257 | me.ep = ep |
258 | me.rng = rng |
259 | def encode(me, msg, nbits): |
260 | return _base._oaep_encode(msg, nbits, me.mgf, me.hash, me.ep, me.rng) |
261 | def decode(me, ct, nbits): |
262 | return _base._oaep_decode(ct, nbits, me.mgf, me.hash, me.ep, me.rng) |
263 | |
264 | class PSS(object): |
265 | def __init__(me, mgf = sha_mgf, hash = sha, saltsz = None, rng = rand): |
266 | me.mgf = mgf |
267 | me.hash = hash |
268 | if saltsz is None: |
269 | saltsz = hash.hashsz |
270 | me.saltsz = saltsz |
271 | me.rng = rng |
272 | def encode(me, msg, nbits): |
273 | return _base._pss_encode(msg, nbits, me.mgf, me.hash, me.saltsz, me.rng) |
274 | def decode(me, msg, sig, nbits): |
275 | return _base._pss_decode(msg, sig, nbits, |
276 | me.mgf, me.hash, me.saltsz, me.rng) |
277 | |
278 | class _tmp: |
279 | def encrypt(me, msg, enc): |
280 | return me.pubop(enc.encode(msg, me.n.nbits)) |
281 | def verify(me, msg, sig, enc): |
282 | if msg is None: return enc.decode(msg, me.pubop(sig), me.n.nbits) |
283 | try: |
284 | x = enc.decode(msg, me.pubop(sig), me.n.nbits) |
285 | return x is None or x == msg |
286 | except ValueError: |
287 | return False |
288 | _augment(RSAPub, _tmp) |
289 | |
290 | class _tmp: |
291 | def decrypt(me, ct, enc): return enc.decode(me.privop(ct), me.n.nbits) |
292 | def sign(me, msg, enc): return me.privop(enc.encode(msg, me.n.nbits)) |
293 | _augment(RSAPriv, _tmp) |
294 | |
295 | |
296 | class SophieGermainStepJump (object): |
297 | def pg_begin(me, ev): |
298 | me.lf = PrimeFilter(ev.x) |
299 | me.hf = me.lf.muladd(2, 1) |
300 | return me.cont(ev) |
301 | def pg_try(me, ev): |
302 | me.step() |
303 | return me.cont(ev) |
304 | def cont(me, ev): |
305 | while me.lf.status == PGEN_FAIL or me.hf.status == PGEN_FAIL: |
306 | me.step() |
307 | if me.lf.status == PGEN_ABORT or me.hf.status == PGEN_ABORT: |
308 | return PGEN_ABORT |
309 | ev.x = me.lf.x |
310 | if me.lf.status == PGEN_DONE and me.hf.status == PGEN_DONE: |
311 | return PGEN_DONE |
312 | return PGEN_TRY |
313 | def pg_done(me, ev): |
314 | del me.lf |
315 | del me.hf |
316 | |
317 | class SophieGermainStepper (SophieGermainStepJump): |
318 | def __init__(me, step): |
319 | me.lstep = step; |
320 | me.hstep = 2 * step |
321 | def step(me): |
322 | me.lf.step(me.lstep) |
323 | me.hf.step(me.hstep) |
324 | |
325 | class SophieGermainJumper (SophieGermainStepJump): |
326 | def __init__(me, jump): |
327 | me.ljump = PrimeFilter(jump); |
328 | me.hjump = me.ljump.muladd(2, 0) |
329 | def step(me): |
330 | me.lf.jump(me.ljump) |
331 | me.hf.jump(me.hjump) |
332 | def pg_done(me, ev): |
333 | del me.ljump |
334 | del me.hjump |
335 | SophieGermainStepJump.pg_done(me, ev) |
336 | |
337 | class SophieGermainTester (object): |
338 | def __init__(me): |
339 | pass |
340 | def pg_begin(me, ev): |
341 | me.lr = RabinMiller(ev.x) |
342 | me.hr = RabinMiller(2 * ev.x + 1) |
343 | def pg_try(me, ev): |
344 | lst = me.lr.test(ev.rng.range(me.lr.x)) |
345 | if lst != PGEN_PASS and lst != PGEN_DONE: |
346 | return lst |
347 | rst = me.hr.test(ev.rng.range(me.hr.x)) |
348 | if rst != PGEN_PASS and rst != PGEN_DONE: |
349 | return rst |
350 | if lst == PGEN_DONE and rst == PGEN_DONE: |
351 | return PGEN_DONE |
352 | return PGEN_PASS |
353 | def pg_done(me, ev): |
354 | del me.lr |
355 | del me.hr |
356 | |
357 | class PrimeGenEventHandler (object): |
358 | def pg_begin(me, ev): |
359 | return me.pg_try(ev) |
360 | def pg_done(me, ev): |
361 | return PGEN_DONE |
362 | def pg_abort(me, ev): |
363 | return PGEN_TRY |
364 | def pg_fail(me, ev): |
365 | return PGEN_TRY |
366 | def pg_pass(me, ev): |
367 | return PGEN_TRY |
368 | |
369 | class PrimitiveStepper (PrimeGenEventHandler): |
370 | def __init__(me): |
371 | pass |
372 | def pg_try(me, ev): |
373 | ev.x = me.i.next() |
374 | return PGEN_TRY |
375 | def pg_begin(me, ev): |
376 | me.i = iter(smallprimes) |
377 | return me.pg_try(ev) |
378 | |
379 | class PrimitiveTester (PrimeGenEventHandler): |
380 | def __init__(me, mod, hh = [], exp = None): |
381 | me.mod = MPMont(mod) |
382 | me.exp = exp |
383 | me.hh = hh |
384 | def pg_try(me, ev): |
385 | x = ev.x |
386 | if me.exp is not None: |
387 | x = me.mod.exp(x, me.exp) |
388 | if x == 1: return PGEN_FAIL |
389 | for h in me.hh: |
390 | if me.mod.exp(x, h) == 1: return PGEN_FAIL |
391 | ev.x = x |
392 | return PGEN_DONE |
393 | |
394 | class SimulStepper (PrimeGenEventHandler): |
395 | def __init__(me, mul = 2, add = 1, step = 2): |
396 | me.step = step |
397 | me.mul = mul |
398 | me.add = add |
399 | def _stepfn(me, step): |
400 | if step <= 0: |
401 | raise ValueError, 'step must be positive' |
402 | if step <= MPW_MAX: |
403 | return lambda f: f.step(step) |
404 | j = PrimeFilter(step) |
405 | return lambda f: f.jump(j) |
406 | def pg_begin(me, ev): |
407 | x = ev.x |
408 | me.lf = PrimeFilter(x) |
409 | me.hf = PrimeFilter(x * me.mul + me.add) |
410 | me.lstep = me._stepfn(me.step) |
411 | me.hstep = me._stepfn(me.step * me.mul) |
412 | SimulStepper._cont(me, ev) |
413 | def pg_try(me, ev): |
414 | me._step() |
415 | me._cont(ev) |
416 | def _step(me): |
417 | me.lstep(me.lf) |
418 | me.hstep(me.hf) |
419 | def _cont(me, ev): |
420 | while me.lf.status == PGEN_FAIL or me.hf.status == PGEN_FAIL: |
421 | me._step() |
422 | if me.lf.status == PGEN_ABORT or me.hf.status == PGEN_ABORT: |
423 | return PGEN_ABORT |
424 | ev.x = me.lf.x |
425 | if me.lf.status == PGEN_DONE and me.hf.status == PGEN_DONE: |
426 | return PGEN_DONE |
427 | return PGEN_TRY |
428 | def pg_done(me, ev): |
429 | del me.lf |
430 | del me.hf |
431 | del me.lstep |
432 | del me.hstep |
433 | |
434 | class SimulTester (PrimeGenEventHandler): |
435 | def __init__(me, mul = 2, add = 1): |
436 | me.mul = mul |
437 | me.add = add |
438 | def pg_begin(me, ev): |
439 | x = ev.x |
440 | me.lr = RabinMiller(x) |
441 | me.hr = RabinMiller(x * me.mul + me.add) |
442 | def pg_try(me, ev): |
443 | lst = me.lr.test(ev.rng.range(me.lr.x)) |
444 | if lst != PGEN_PASS and lst != PGEN_DONE: |
445 | return lst |
446 | rst = me.hr.test(ev.rng.range(me.hr.x)) |
447 | if rst != PGEN_PASS and rst != PGEN_DONE: |
448 | return rst |
449 | if lst == PGEN_DONE and rst == PGEN_DONE: |
450 | return PGEN_DONE |
451 | return PGEN_PASS |
452 | def pg_done(me, ev): |
453 | del me.lr |
454 | del me.hr |
455 | |
456 | def sgprime(start, step = 2, name = 'p', event = pgen_nullev, nsteps = 0): |
457 | start = MP(start) |
458 | return pgen(start, name, SimulStepper(step = step), SimulTester(), event, |
459 | nsteps, RabinMiller.iters(start.nbits)) |
460 | |
461 | def findprimitive(mod, hh = [], exp = None, name = 'g', event = pgen_nullev): |
462 | return pgen(0, name, PrimitiveStepper(), PrimitiveTester(mod, hh, exp), |
463 | event, 0, 1) |
464 | |
465 | def kcdsaprime(pbits, qbits, rng = rand, |
466 | event = pgen_nullev, name = 'p', nsteps = 0): |
467 | hbits = pbits - qbits |
468 | h = pgen(rng.mp(hbits, 1), name + ' [h]', |
469 | PrimeGenStepper(2), PrimeGenTester(), |
470 | event, nsteps, RabinMiller.iters(hbits)) |
471 | q = pgen(rng.mp(qbits, 1), name, SimulStepper(2 * h, 1, 2), |
472 | SimulTester(2 * h, 1), event, nsteps, RabinMiller.iters(qbits)) |
473 | p = 2 * q * h + 1 |
474 | return p, q, h |
475 | |
43c09851 |
476 | import pwsafe |
477 | |
d7ab1bab |
478 | #----- That's all, folks ---------------------------------------------------- |