Commit | Line | Data |
---|---|---|
00401529 MW |
1 | ### -*-python-*- |
2 | ### | |
3 | ### Setup for Catacomb/Python bindings | |
4 | ### | |
5 | ### (c) 2004 Straylight/Edgeware | |
6 | ### | |
7 | ||
8 | ###----- Licensing notice --------------------------------------------------- | |
9 | ### | |
10 | ### This file is part of the Python interface to Catacomb. | |
11 | ### | |
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. | |
16 | ### | |
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. | |
21 | ### | |
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. | |
ed8cc62d | 25 | |
d7ab1bab | 26 | import _base |
27 | import types as _types | |
28 | from binascii import hexlify as _hexify, unhexlify as _unhexify | |
46e6ad89 | 29 | from sys import argv as _argv |
30 | ||
00401529 MW |
31 | ###-------------------------------------------------------------------------- |
32 | ### Basic stuff. | |
ed8cc62d MW |
33 | |
34 | ## For the benefit of the default keyreporter, we need the program na,e. | |
46e6ad89 | 35 | _base._ego(_argv[0]) |
d7ab1bab | 36 | |
ed8cc62d MW |
37 | ## Initialize the module. Drag in the static methods of the various |
38 | ## classes; create names for the various known crypto algorithms. | |
d7ab1bab | 39 | def _init(): |
40 | d = globals() | |
41 | b = _base.__dict__; | |
42 | for i in b: | |
43 | if i[0] != '_': | |
44 | d[i] = b[i]; | |
45 | for i in ['MP', 'GF', 'Field', | |
00401529 MW |
46 | 'ECPt', 'ECPtCurve', 'ECCurve', 'ECInfo', |
47 | 'DHInfo', 'BinDHInfo', 'RSAPriv', 'BBSPriv', | |
48 | 'PrimeFilter', 'RabinMiller', | |
49 | 'Group', 'GE', | |
89157adc | 50 | 'KeySZ', 'KeyData']: |
d7ab1bab | 51 | c = d[i] |
52 | pre = '_' + i + '_' | |
53 | plen = len(pre) | |
54 | for j in b: | |
55 | if j[:plen] == pre: | |
00401529 | 56 | setattr(c, j[plen:], classmethod(b[j])) |
ed8cc62d MW |
57 | for i in [gcciphers, gchashes, gcmacs, gcprps]: |
58 | for c in i.itervalues(): | |
3e04ec3a | 59 | d[c.name.replace('-', '_').translate(None, '/')] = c |
ed8cc62d | 60 | for c in gccrands.itervalues(): |
3e04ec3a | 61 | d[c.name.replace('-', '_').translate(None, '/') + 'rand'] = c |
d7ab1bab | 62 | _init() |
63 | ||
ed8cc62d MW |
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 | |
66 | ## mostly-C types. | |
d7ab1bab | 67 | def _augment(c, cc): |
68 | for i in cc.__dict__: | |
69 | a = cc.__dict__[i] | |
70 | if type(a) is _types.MethodType: | |
71 | a = a.im_func | |
72 | elif type(a) not in (_types.FunctionType, staticmethod, classmethod): | |
73 | continue | |
74 | setattr(c, i, a) | |
75 | ||
ed8cc62d MW |
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 | |
78 | ## just the object. | |
79 | def _checkend(r): | |
80 | x, rest = r | |
81 | if rest != '': | |
82 | raise SyntaxError, 'junk at end of string' | |
83 | return x | |
84 | ||
96d7ed6c | 85 | ## Some pretty-printing utilities. |
652e16ea | 86 | PRINT_SECRETS = False |
330e6a74 | 87 | def _clsname(me): return type(me).__name__ |
652e16ea MW |
88 | def _repr_secret(thing, secretp = True): |
89 | if not secretp or PRINT_SECRETS: return repr(thing) | |
90 | else: return '#<SECRET>' | |
96d7ed6c | 91 | def _pp_str(me, pp, cyclep): pp.text(cyclep and '...' or str(me)) |
652e16ea MW |
92 | def _pp_secret(pp, thing, secretp = True): |
93 | if not secretp or PRINT_SECRETS: pp.pretty(thing) | |
94 | else: pp.text('#<SECRET>') | |
582568f1 MW |
95 | def _pp_bgroup(pp, text): |
96 | ind = len(text) | |
97 | pp.begin_group(ind, text) | |
98 | return ind | |
99 | def _pp_bgroup_tyname(pp, obj, open = '('): | |
330e6a74 | 100 | return _pp_bgroup(pp, _clsname(obj) + open) |
652e16ea | 101 | def _pp_kv(pp, k, v, secretp = False): |
582568f1 | 102 | ind = _pp_bgroup(pp, k + ' = ') |
652e16ea | 103 | _pp_secret(pp, v, secretp) |
96d7ed6c MW |
104 | pp.end_group(ind, '') |
105 | def _pp_commas(pp, printfn, items): | |
106 | firstp = True | |
107 | for i in items: | |
108 | if firstp: firstp = False | |
109 | else: pp.text(','); pp.breakable() | |
110 | printfn(i) | |
111 | def _pp_dict(pp, items): | |
112 | def p((k, v)): | |
582568f1 | 113 | pp.begin_group(0) |
96d7ed6c MW |
114 | pp.pretty(k) |
115 | pp.text(':') | |
582568f1 | 116 | pp.begin_group(2) |
96d7ed6c MW |
117 | pp.breakable() |
118 | pp.pretty(v) | |
582568f1 MW |
119 | pp.end_group(2) |
120 | pp.end_group(0) | |
96d7ed6c MW |
121 | _pp_commas(pp, p, items) |
122 | ||
00401529 MW |
123 | ###-------------------------------------------------------------------------- |
124 | ### Bytestrings. | |
ed8cc62d | 125 | |
d7ab1bab | 126 | class _tmp: |
127 | def fromhex(x): | |
128 | return ByteString(_unhexify(x)) | |
129 | fromhex = staticmethod(fromhex) | |
130 | def __hex__(me): | |
131 | return _hexify(me) | |
132 | def __repr__(me): | |
133 | return 'bytes(%r)' % hex(me) | |
134 | _augment(ByteString, _tmp) | |
bfb450cc | 135 | ByteString.__hash__ = str.__hash__ |
d7ab1bab | 136 | bytes = ByteString.fromhex |
137 | ||
00401529 | 138 | ###-------------------------------------------------------------------------- |
bfb450cc MW |
139 | ### Hashing. |
140 | ||
141 | class _tmp: | |
142 | def check(me, h): | |
143 | hh = me.done() | |
144 | return ctstreq(h, hh) | |
145 | _augment(GHash, _tmp) | |
146 | _augment(Poly1305Hash, _tmp) | |
147 | ||
148 | ###-------------------------------------------------------------------------- | |
ce0340b6 MW |
149 | ### NaCl `secretbox'. |
150 | ||
151 | def secret_box(k, n, m): | |
152 | E = xsalsa20(k).setiv(n) | |
153 | r = E.enczero(poly1305.keysz.default) | |
154 | s = E.enczero(poly1305.masksz) | |
155 | y = E.encrypt(m) | |
156 | t = poly1305(r)(s).hash(y).done() | |
157 | return ByteString(t + y) | |
158 | ||
159 | def secret_unbox(k, n, c): | |
160 | E = xsalsa20(k).setiv(n) | |
161 | r = E.enczero(poly1305.keysz.default) | |
162 | s = E.enczero(poly1305.masksz) | |
163 | y = c[poly1305.tagsz:] | |
164 | if not poly1305(r)(s).hash(y).check(c[0:poly1305.tagsz]): | |
165 | raise ValueError, 'decryption failed' | |
166 | return E.decrypt(c[poly1305.tagsz:]) | |
167 | ||
168 | ###-------------------------------------------------------------------------- | |
00401529 | 169 | ### Multiprecision integers and binary polynomials. |
ed8cc62d | 170 | |
2ef393b5 | 171 | def _split_rat(x): |
83c77564 | 172 | if isinstance(x, BaseRat): return x._n, x._d |
2ef393b5 | 173 | else: return x, 1 |
83c77564 MW |
174 | class BaseRat (object): |
175 | """Base class implementing fields of fractions over Euclidean domains.""" | |
2ef393b5 | 176 | def __new__(cls, a, b): |
83c77564 | 177 | a, b = cls.RING(a), cls.RING(b) |
2ef393b5 MW |
178 | q, r = divmod(a, b) |
179 | if r == 0: return q | |
180 | g = b.gcd(r) | |
83c77564 | 181 | me = super(BaseRat, cls).__new__(cls) |
2ef393b5 MW |
182 | me._n = a//g |
183 | me._d = b//g | |
184 | return me | |
185 | @property | |
186 | def numer(me): return me._n | |
187 | @property | |
188 | def denom(me): return me._d | |
189 | def __str__(me): return '%s/%s' % (me._n, me._d) | |
330e6a74 | 190 | def __repr__(me): return '%s(%s, %s)' % (_clsname(me), me._n, me._d) |
96d7ed6c | 191 | _repr_pretty_ = _pp_str |
2ef393b5 MW |
192 | |
193 | def __add__(me, you): | |
194 | n, d = _split_rat(you) | |
83c77564 | 195 | return type(me)(me._n*d + n*me._d, d*me._d) |
2ef393b5 MW |
196 | __radd__ = __add__ |
197 | def __sub__(me, you): | |
198 | n, d = _split_rat(you) | |
83c77564 | 199 | return type(me)(me._n*d - n*me._d, d*me._d) |
2ef393b5 MW |
200 | def __rsub__(me, you): |
201 | n, d = _split_rat(you) | |
83c77564 | 202 | return type(me)(n*me._d - me._n*d, d*me._d) |
2ef393b5 MW |
203 | def __mul__(me, you): |
204 | n, d = _split_rat(you) | |
83c77564 | 205 | return type(me)(me._n*n, me._d*d) |
2ef393b5 MW |
206 | def __div__(me, you): |
207 | n, d = _split_rat(you) | |
83c77564 | 208 | return type(me)(me._n*d, me._d*n) |
2ef393b5 MW |
209 | def __rdiv__(me, you): |
210 | n, d = _split_rat(you) | |
83c77564 | 211 | return type(me)(me._d*n, me._n*d) |
2ef393b5 MW |
212 | def __cmp__(me, you): |
213 | n, d = _split_rat(you) | |
83c77564 | 214 | return type(me)(me._n*d, n*me._d) |
2ef393b5 MW |
215 | def __rcmp__(me, you): |
216 | n, d = _split_rat(you) | |
217 | return cmp(n*me._d, me._n*d) | |
218 | ||
83c77564 MW |
219 | class IntRat (BaseRat): |
220 | RING = MP | |
221 | ||
222 | class GFRat (BaseRat): | |
223 | RING = GF | |
224 | ||
d7ab1bab | 225 | class _tmp: |
226 | def negp(x): return x < 0 | |
227 | def posp(x): return x > 0 | |
228 | def zerop(x): return x == 0 | |
229 | def oddp(x): return x.testbit(0) | |
230 | def evenp(x): return not x.testbit(0) | |
231 | def mont(x): return MPMont(x) | |
232 | def barrett(x): return MPBarrett(x) | |
233 | def reduce(x): return MPReduce(x) | |
83c77564 MW |
234 | def __div__(me, you): return IntRat(me, you) |
235 | def __rdiv__(me, you): return IntRat(you, me) | |
96d7ed6c | 236 | _repr_pretty_ = _pp_str |
d7ab1bab | 237 | _augment(MP, _tmp) |
238 | ||
d7ab1bab | 239 | class _tmp: |
fbc145f3 | 240 | def zerop(x): return x == 0 |
ed8cc62d | 241 | def reduce(x): return GFReduce(x) |
fbc145f3 MW |
242 | def trace(x, y): return x.reduce().trace(y) |
243 | def halftrace(x, y): return x.reduce().halftrace(y) | |
244 | def modsqrt(x, y): return x.reduce().sqrt(y) | |
245 | def quadsolve(x, y): return x.reduce().quadsolve(y) | |
83c77564 MW |
246 | def __div__(me, you): return GFRat(me, you) |
247 | def __rdiv__(me, you): return GFRat(you, me) | |
96d7ed6c | 248 | _repr_pretty_ = _pp_str |
d7ab1bab | 249 | _augment(GF, _tmp) |
250 | ||
ed8cc62d MW |
251 | class _tmp: |
252 | def product(*arg): | |
253 | 'product(ITERABLE) or product(I, ...) -> PRODUCT' | |
254 | return MPMul(*arg).done() | |
255 | product = staticmethod(product) | |
256 | _augment(MPMul, _tmp) | |
257 | ||
00401529 MW |
258 | ###-------------------------------------------------------------------------- |
259 | ### Abstract fields. | |
ed8cc62d | 260 | |
d7ab1bab | 261 | class _tmp: |
262 | def fromstring(str): return _checkend(Field.parse(str)) | |
263 | fromstring = staticmethod(fromstring) | |
264 | _augment(Field, _tmp) | |
265 | ||
266 | class _tmp: | |
330e6a74 | 267 | def __repr__(me): return '%s(%sL)' % (_clsname(me), me.p) |
6d481bc6 | 268 | def __hash__(me): return 0x114401de ^ hash(me.p) |
96d7ed6c | 269 | def _repr_pretty_(me, pp, cyclep): |
582568f1 MW |
270 | ind = _pp_bgroup_tyname(pp, me) |
271 | if cyclep: pp.text('...') | |
272 | else: pp.pretty(me.p) | |
273 | pp.end_group(ind, ')') | |
d7ab1bab | 274 | def ec(me, a, b): return ECPrimeProjCurve(me, a, b) |
275 | _augment(PrimeField, _tmp) | |
276 | ||
277 | class _tmp: | |
330e6a74 | 278 | def __repr__(me): return '%s(%#xL)' % (_clsname(me), me.p) |
d7ab1bab | 279 | def ec(me, a, b): return ECBinProjCurve(me, a, b) |
96d7ed6c | 280 | def _repr_pretty_(me, pp, cyclep): |
582568f1 MW |
281 | ind = _pp_bgroup_tyname(pp, me) |
282 | if cyclep: pp.text('...') | |
283 | else: pp.text('%#x' % me.p) | |
284 | pp.end_group(ind, ')') | |
d7ab1bab | 285 | _augment(BinField, _tmp) |
286 | ||
6d481bc6 MW |
287 | class _tmp: |
288 | def __hash__(me): return 0x23e4701c ^ hash(me.p) | |
289 | _augment(BinPolyField, _tmp) | |
290 | ||
291 | class _tmp: | |
292 | def __hash__(me): | |
293 | h = 0x9a7d6240 | |
294 | h ^= hash(me.p) | |
295 | h ^= 2*hash(me.beta) & 0xffffffff | |
296 | return h | |
297 | _augment(BinNormField, _tmp) | |
298 | ||
d7ab1bab | 299 | class _tmp: |
300 | def __str__(me): return str(me.value) | |
301 | def __repr__(me): return '%s(%s)' % (repr(me.field), repr(me.value)) | |
96d7ed6c | 302 | _repr_pretty_ = _pp_str |
d7ab1bab | 303 | _augment(FE, _tmp) |
304 | ||
00401529 MW |
305 | ###-------------------------------------------------------------------------- |
306 | ### Elliptic curves. | |
d7ab1bab | 307 | |
308 | class _tmp: | |
309 | def __repr__(me): | |
330e6a74 | 310 | return '%s(%r, %s, %s)' % (_clsname(me), me.field, me.a, me.b) |
96d7ed6c | 311 | def _repr_pretty_(me, pp, cyclep): |
582568f1 | 312 | ind = _pp_bgroup_tyname(pp, me) |
96d7ed6c | 313 | if cyclep: |
582568f1 | 314 | pp.text('...') |
96d7ed6c | 315 | else: |
96d7ed6c MW |
316 | pp.pretty(me.field); pp.text(','); pp.breakable() |
317 | pp.pretty(me.a); pp.text(','); pp.breakable() | |
318 | pp.pretty(me.b) | |
582568f1 | 319 | pp.end_group(ind, ')') |
d7ab1bab | 320 | def frombuf(me, s): |
321 | return ecpt.frombuf(me, s) | |
322 | def fromraw(me, s): | |
323 | return ecpt.fromraw(me, s) | |
324 | def pt(me, *args): | |
5f959e50 | 325 | return me(*args) |
d7ab1bab | 326 | _augment(ECCurve, _tmp) |
327 | ||
6d481bc6 MW |
328 | class _tmp: |
329 | def __hash__(me): | |
330 | h = 0x6751d341 | |
331 | h ^= hash(me.field) | |
332 | h ^= 2*hash(me.a) ^ 0xffffffff | |
333 | h ^= 5*hash(me.b) ^ 0xffffffff | |
334 | return h | |
335 | _augment(ECPrimeCurve, _tmp) | |
336 | ||
337 | class _tmp: | |
338 | def __hash__(me): | |
339 | h = 0x2ac203c5 | |
340 | h ^= hash(me.field) | |
341 | h ^= 2*hash(me.a) ^ 0xffffffff | |
342 | h ^= 5*hash(me.b) ^ 0xffffffff | |
343 | return h | |
344 | _augment(ECBinCurve, _tmp) | |
345 | ||
d7ab1bab | 346 | class _tmp: |
347 | def __repr__(me): | |
330e6a74 MW |
348 | if not me: return '%s()' % _clsname(me) |
349 | return '%s(%s, %s)' % (_clsname(me), me.ix, me.iy) | |
d7ab1bab | 350 | def __str__(me): |
351 | if not me: return 'inf' | |
352 | return '(%s, %s)' % (me.ix, me.iy) | |
96d7ed6c MW |
353 | def _repr_pretty_(me, pp, cyclep): |
354 | if cyclep: | |
355 | pp.text('...') | |
356 | elif not me: | |
357 | pp.text('inf') | |
358 | else: | |
582568f1 | 359 | ind = _pp_bgroup(pp, '(') |
96d7ed6c MW |
360 | pp.pretty(me.ix); pp.text(','); pp.breakable() |
361 | pp.pretty(me.iy) | |
582568f1 | 362 | pp.end_group(ind, ')') |
d7ab1bab | 363 | _augment(ECPt, _tmp) |
364 | ||
365 | class _tmp: | |
366 | def __repr__(me): | |
330e6a74 MW |
367 | return '%s(curve = %r, G = %r, r = %s, h = %s)' % \ |
368 | (_clsname(me), me.curve, me.G, me.r, me.h) | |
96d7ed6c | 369 | def _repr_pretty_(me, pp, cyclep): |
582568f1 | 370 | ind = _pp_bgroup_tyname(pp, me) |
96d7ed6c | 371 | if cyclep: |
582568f1 | 372 | pp.text('...') |
96d7ed6c | 373 | else: |
96d7ed6c MW |
374 | _pp_kv(pp, 'curve', me.curve); pp.text(','); pp.breakable() |
375 | _pp_kv(pp, 'G', me.G); pp.text(','); pp.breakable() | |
376 | _pp_kv(pp, 'r', me.r); pp.text(','); pp.breakable() | |
377 | _pp_kv(pp, 'h', me.h) | |
582568f1 | 378 | pp.end_group(ind, ')') |
6d481bc6 MW |
379 | def __hash__(me): |
380 | h = 0x9bedb8de | |
381 | h ^= hash(me.curve) | |
382 | h ^= 2*hash(me.G) & 0xffffffff | |
383 | return h | |
d7ab1bab | 384 | def group(me): |
385 | return ECGroup(me) | |
386 | _augment(ECInfo, _tmp) | |
387 | ||
388 | class _tmp: | |
389 | def __repr__(me): | |
390 | if not me: return '%r()' % (me.curve) | |
391 | return '%r(%s, %s)' % (me.curve, me.x, me.y) | |
392 | def __str__(me): | |
393 | if not me: return 'inf' | |
394 | return '(%s, %s)' % (me.x, me.y) | |
7a7aa30e MW |
395 | def _repr_pretty_(me, pp, cyclep): |
396 | if cyclep: | |
397 | pp.text('...') | |
398 | elif not me: | |
399 | pp.text('inf') | |
400 | else: | |
401 | ind = _pp_bgroup(pp, '(') | |
402 | pp.pretty(me.x); pp.text(','); pp.breakable() | |
403 | pp.pretty(me.y) | |
404 | pp.end_group(ind, ')') | |
d7ab1bab | 405 | _augment(ECPtCurve, _tmp) |
406 | ||
00401529 MW |
407 | ###-------------------------------------------------------------------------- |
408 | ### Key sizes. | |
ed8cc62d | 409 | |
d7ab1bab | 410 | class _tmp: |
330e6a74 | 411 | def __repr__(me): return '%s(%d)' % (_clsname(me), me.default) |
d7ab1bab | 412 | def check(me, sz): return True |
413 | def best(me, sz): return sz | |
414 | _augment(KeySZAny, _tmp) | |
415 | ||
416 | class _tmp: | |
417 | def __repr__(me): | |
330e6a74 MW |
418 | return '%s(%d, %d, %d, %d)' % \ |
419 | (_clsname(me), me.default, me.min, me.max, me.mod) | |
96d7ed6c | 420 | def _repr_pretty_(me, pp, cyclep): |
582568f1 | 421 | ind = _pp_bgroup_tyname(pp, me) |
96d7ed6c | 422 | if cyclep: |
582568f1 | 423 | pp.text('...') |
96d7ed6c | 424 | else: |
96d7ed6c MW |
425 | pp.pretty(me.default); pp.text(','); pp.breakable() |
426 | pp.pretty(me.min); pp.text(','); pp.breakable() | |
427 | pp.pretty(me.max); pp.text(','); pp.breakable() | |
428 | pp.pretty(me.mod) | |
582568f1 | 429 | pp.end_group(ind, ')') |
d7ab1bab | 430 | def check(me, sz): return me.min <= sz <= me.max and sz % me.mod == 0 |
431 | def best(me, sz): | |
432 | if sz < me.min: raise ValueError, 'key too small' | |
433 | elif sz > me.max: return me.max | |
434 | else: return sz - (sz % me.mod) | |
435 | _augment(KeySZRange, _tmp) | |
436 | ||
437 | class _tmp: | |
330e6a74 | 438 | def __repr__(me): return '%s(%d, %s)' % (_clsname(me), me.default, me.set) |
96d7ed6c | 439 | def _repr_pretty_(me, pp, cyclep): |
582568f1 | 440 | ind = _pp_bgroup_tyname(pp, me) |
96d7ed6c | 441 | if cyclep: |
582568f1 | 442 | pp.text('...') |
96d7ed6c | 443 | else: |
96d7ed6c | 444 | pp.pretty(me.default); pp.text(','); pp.breakable() |
582568f1 | 445 | ind1 = _pp_bgroup(pp, '{') |
96d7ed6c | 446 | _pp_commas(pp, pp.pretty, me.set) |
582568f1 MW |
447 | pp.end_group(ind1, '}') |
448 | pp.end_group(ind, ')') | |
d7ab1bab | 449 | def check(me, sz): return sz in me.set |
450 | def best(me, sz): | |
451 | found = -1 | |
452 | for i in me.set: | |
453 | if found < i <= sz: found = i | |
454 | if found < 0: raise ValueError, 'key too small' | |
455 | return found | |
456 | _augment(KeySZSet, _tmp) | |
457 | ||
96d7ed6c MW |
458 | ###-------------------------------------------------------------------------- |
459 | ### Key data objects. | |
460 | ||
461 | class _tmp: | |
330e6a74 | 462 | def __repr__(me): return '%s(%r)' % (_clsname(me), me.name) |
96d7ed6c MW |
463 | _augment(KeyFile, _tmp) |
464 | ||
465 | class _tmp: | |
330e6a74 | 466 | def __repr__(me): return '%s(%r)' % (_clsname(me), me.fulltag) |
96d7ed6c MW |
467 | _augment(Key, _tmp) |
468 | ||
469 | class _tmp: | |
470 | def __repr__(me): | |
330e6a74 MW |
471 | return '%s({%s})' % (_clsname(me), |
472 | ', '.join(['%r: %r' % kv for kv in me.iteritems()])) | |
96d7ed6c | 473 | def _repr_pretty_(me, pp, cyclep): |
582568f1 | 474 | ind = _pp_bgroup_tyname(pp, me) |
96d7ed6c MW |
475 | if cyclep: pp.text('...') |
476 | else: _pp_dict(pp, me.iteritems()) | |
582568f1 | 477 | pp.end_group(ind, ')') |
96d7ed6c MW |
478 | _augment(KeyAttributes, _tmp) |
479 | ||
480 | class _tmp: | |
849e8a20 | 481 | def __repr__(me): |
652e16ea MW |
482 | return '%s(%s, %r)' % (_clsname(me), |
483 | _repr_secret(me._guts(), | |
484 | not (me.flags & KF_NONSECRET)), | |
485 | me.writeflags(me.flags)) | |
96d7ed6c | 486 | def _repr_pretty_(me, pp, cyclep): |
582568f1 | 487 | ind = _pp_bgroup_tyname(pp, me) |
96d7ed6c | 488 | if cyclep: |
582568f1 | 489 | pp.text('...') |
96d7ed6c | 490 | else: |
652e16ea MW |
491 | _pp_secret(pp, me._guts(), not (me.flags & KF_NONSECRET)) |
492 | pp.text(','); pp.breakable() | |
96d7ed6c | 493 | pp.pretty(me.writeflags(me.flags)) |
582568f1 | 494 | pp.end_group(ind, ')') |
849e8a20 MW |
495 | _augment(KeyData, _tmp) |
496 | ||
497 | class _tmp: | |
498 | def _guts(me): return me.bin | |
96d7ed6c MW |
499 | _augment(KeyDataBinary, _tmp) |
500 | ||
501 | class _tmp: | |
849e8a20 | 502 | def _guts(me): return me.ct |
96d7ed6c MW |
503 | _augment(KeyDataEncrypted, _tmp) |
504 | ||
505 | class _tmp: | |
849e8a20 | 506 | def _guts(me): return me.mp |
96d7ed6c MW |
507 | _augment(KeyDataMP, _tmp) |
508 | ||
509 | class _tmp: | |
849e8a20 | 510 | def _guts(me): return me.str |
96d7ed6c MW |
511 | _augment(KeyDataString, _tmp) |
512 | ||
513 | class _tmp: | |
849e8a20 | 514 | def _guts(me): return me.ecpt |
96d7ed6c MW |
515 | _augment(KeyDataECPt, _tmp) |
516 | ||
517 | class _tmp: | |
518 | def __repr__(me): | |
330e6a74 MW |
519 | return '%s({%s})' % (_clsname(me), |
520 | ', '.join(['%r: %r' % kv for kv in me.iteritems()])) | |
96d7ed6c | 521 | def _repr_pretty_(me, pp, cyclep): |
582568f1 | 522 | ind = _pp_bgroup_tyname(pp, me, '({ ') |
96d7ed6c MW |
523 | if cyclep: pp.text('...') |
524 | else: _pp_dict(pp, me.iteritems()) | |
582568f1 | 525 | pp.end_group(ind, ' })') |
96d7ed6c MW |
526 | _augment(KeyDataStructured, _tmp) |
527 | ||
00401529 MW |
528 | ###-------------------------------------------------------------------------- |
529 | ### Abstract groups. | |
ed8cc62d | 530 | |
d7ab1bab | 531 | class _tmp: |
532 | def __repr__(me): | |
330e6a74 | 533 | return '%s(p = %s, r = %s, g = %s)' % (_clsname(me), me.p, me.r, me.g) |
96d7ed6c | 534 | def _repr_pretty_(me, pp, cyclep): |
582568f1 | 535 | ind = _pp_bgroup_tyname(pp, me) |
96d7ed6c | 536 | if cyclep: |
582568f1 | 537 | pp.text('...') |
96d7ed6c | 538 | else: |
96d7ed6c MW |
539 | _pp_kv(pp, 'p', me.p); pp.text(','); pp.breakable() |
540 | _pp_kv(pp, 'r', me.r); pp.text(','); pp.breakable() | |
541 | _pp_kv(pp, 'g', me.g) | |
582568f1 | 542 | pp.end_group(ind, ')') |
d7ab1bab | 543 | _augment(FGInfo, _tmp) |
544 | ||
545 | class _tmp: | |
546 | def group(me): return PrimeGroup(me) | |
547 | _augment(DHInfo, _tmp) | |
548 | ||
549 | class _tmp: | |
550 | def group(me): return BinGroup(me) | |
551 | _augment(BinDHInfo, _tmp) | |
552 | ||
553 | class _tmp: | |
554 | def __repr__(me): | |
330e6a74 | 555 | return '%s(%r)' % (_clsname(me), me.info) |
99d932fe MW |
556 | def _repr_pretty_(me, pp, cyclep): |
557 | ind = _pp_bgroup_tyname(pp, me) | |
558 | if cyclep: pp.text('...') | |
559 | else: pp.pretty(me.info) | |
560 | pp.end_group(ind, ')') | |
d7ab1bab | 561 | _augment(Group, _tmp) |
562 | ||
6d481bc6 MW |
563 | class _tmp: |
564 | def __hash__(me): | |
565 | info = me.info | |
566 | h = 0xbce3cfe6 | |
567 | h ^= hash(info.p) | |
568 | h ^= 2*hash(info.r) & 0xffffffff | |
569 | h ^= 5*hash(info.g) & 0xffffffff | |
570 | return h | |
d7012c2b | 571 | def _get_geval(me, x): return MP(x) |
6d481bc6 MW |
572 | _augment(PrimeGroup, _tmp) |
573 | ||
574 | class _tmp: | |
575 | def __hash__(me): | |
576 | info = me.info | |
577 | h = 0x80695949 | |
578 | h ^= hash(info.p) | |
579 | h ^= 2*hash(info.r) & 0xffffffff | |
580 | h ^= 5*hash(info.g) & 0xffffffff | |
581 | return h | |
d7012c2b | 582 | def _get_geval(me, x): return GF(x) |
6d481bc6 MW |
583 | _augment(BinGroup, _tmp) |
584 | ||
585 | class _tmp: | |
586 | def __hash__(me): return 0x0ec23dab ^ hash(me.info) | |
d7012c2b | 587 | def _get_geval(me, x): return x.toec() |
6d481bc6 MW |
588 | _augment(ECGroup, _tmp) |
589 | ||
d7ab1bab | 590 | class _tmp: |
591 | def __repr__(me): | |
592 | return '%r(%r)' % (me.group, str(me)) | |
d7012c2b MW |
593 | def _repr_pretty_(me, pp, cyclep): |
594 | pp.pretty(type(me)._get_geval(me)) | |
d7ab1bab | 595 | _augment(GE, _tmp) |
596 | ||
00401529 MW |
597 | ###-------------------------------------------------------------------------- |
598 | ### RSA encoding techniques. | |
ed8cc62d MW |
599 | |
600 | class PKCS1Crypt (object): | |
d7ab1bab | 601 | def __init__(me, ep = '', rng = rand): |
602 | me.ep = ep | |
603 | me.rng = rng | |
604 | def encode(me, msg, nbits): | |
605 | return _base._p1crypt_encode(msg, nbits, me.ep, me.rng) | |
606 | def decode(me, ct, nbits): | |
607 | return _base._p1crypt_decode(ct, nbits, me.ep, me.rng) | |
608 | ||
ed8cc62d | 609 | class PKCS1Sig (object): |
d7ab1bab | 610 | def __init__(me, ep = '', rng = rand): |
611 | me.ep = ep | |
612 | me.rng = rng | |
613 | def encode(me, msg, nbits): | |
614 | return _base._p1sig_encode(msg, nbits, me.ep, me.rng) | |
615 | def decode(me, msg, sig, nbits): | |
616 | return _base._p1sig_decode(msg, sig, nbits, me.ep, me.rng) | |
617 | ||
ed8cc62d | 618 | class OAEP (object): |
d7ab1bab | 619 | def __init__(me, mgf = sha_mgf, hash = sha, ep = '', rng = rand): |
620 | me.mgf = mgf | |
621 | me.hash = hash | |
622 | me.ep = ep | |
623 | me.rng = rng | |
624 | def encode(me, msg, nbits): | |
625 | return _base._oaep_encode(msg, nbits, me.mgf, me.hash, me.ep, me.rng) | |
626 | def decode(me, ct, nbits): | |
627 | return _base._oaep_decode(ct, nbits, me.mgf, me.hash, me.ep, me.rng) | |
628 | ||
ed8cc62d | 629 | class PSS (object): |
d7ab1bab | 630 | def __init__(me, mgf = sha_mgf, hash = sha, saltsz = None, rng = rand): |
631 | me.mgf = mgf | |
632 | me.hash = hash | |
633 | if saltsz is None: | |
634 | saltsz = hash.hashsz | |
635 | me.saltsz = saltsz | |
636 | me.rng = rng | |
637 | def encode(me, msg, nbits): | |
638 | return _base._pss_encode(msg, nbits, me.mgf, me.hash, me.saltsz, me.rng) | |
639 | def decode(me, msg, sig, nbits): | |
640 | return _base._pss_decode(msg, sig, nbits, | |
00401529 | 641 | me.mgf, me.hash, me.saltsz, me.rng) |
d7ab1bab | 642 | |
643 | class _tmp: | |
644 | def encrypt(me, msg, enc): | |
645 | return me.pubop(enc.encode(msg, me.n.nbits)) | |
646 | def verify(me, msg, sig, enc): | |
647 | if msg is None: return enc.decode(msg, me.pubop(sig), me.n.nbits) | |
648 | try: | |
649 | x = enc.decode(msg, me.pubop(sig), me.n.nbits) | |
650 | return x is None or x == msg | |
651 | except ValueError: | |
b2687a0a | 652 | return False |
bbd94558 MW |
653 | def __repr__(me): |
654 | return '%s(n = %r, e = %r)' % (_clsname(me), me.n, me.e) | |
655 | def _repr_pretty_(me, pp, cyclep): | |
656 | ind = _pp_bgroup_tyname(pp, me) | |
657 | if cyclep: | |
658 | pp.text('...') | |
659 | else: | |
660 | _pp_kv(pp, 'n', me.n); pp.text(','); pp.breakable() | |
661 | _pp_kv(pp, 'e', me.e) | |
662 | pp.end_group(ind, ')') | |
d7ab1bab | 663 | _augment(RSAPub, _tmp) |
664 | ||
665 | class _tmp: | |
666 | def decrypt(me, ct, enc): return enc.decode(me.privop(ct), me.n.nbits) | |
667 | def sign(me, msg, enc): return me.privop(enc.encode(msg, me.n.nbits)) | |
bbd94558 MW |
668 | def __repr__(me): |
669 | return '%s(n = %r, e = %r, d = %s, ' \ | |
670 | 'p = %s, q = %s, dp = %s, dq = %s, q_inv = %s)' % \ | |
671 | (_clsname(me), me.n, me.e, | |
672 | _repr_secret(me.d), _repr_secret(me.p), _repr_secret(me.q), | |
673 | _repr_secret(me.dp), _repr_secret(me.dq), _repr_secret(me.q_inv)) | |
674 | def _repr_pretty_(me, pp, cyclep): | |
675 | ind = _pp_bgroup_tyname(pp, me) | |
676 | if cyclep: | |
677 | pp.text('...') | |
678 | else: | |
679 | _pp_kv(pp, 'n', me.n); pp.text(','); pp.breakable() | |
680 | _pp_kv(pp, 'e', me.e); pp.text(','); pp.breakable() | |
681 | _pp_kv(pp, 'd', me.d, secretp = True); pp.text(','); pp.breakable() | |
682 | _pp_kv(pp, 'p', me.p, secretp = True); pp.text(','); pp.breakable() | |
683 | _pp_kv(pp, 'q', me.q, secretp = True); pp.text(','); pp.breakable() | |
684 | _pp_kv(pp, 'dp', me.dp, secretp = True); pp.text(','); pp.breakable() | |
685 | _pp_kv(pp, 'dq', me.dq, secretp = True); pp.text(','); pp.breakable() | |
686 | _pp_kv(pp, 'q_inv', me.q_inv, secretp = True) | |
687 | pp.end_group(ind, ')') | |
d7ab1bab | 688 | _augment(RSAPriv, _tmp) |
689 | ||
bbd94558 MW |
690 | ###-------------------------------------------------------------------------- |
691 | ### DSA and related schemes. | |
692 | ||
693 | class _tmp: | |
694 | def __repr__(me): return '%s(G = %r, p = %r)' % (_clsname(me), me.G, me.p) | |
695 | def _repr_pretty_(me, pp, cyclep): | |
696 | ind = _pp_bgroup_tyname(pp, me) | |
697 | if cyclep: | |
698 | pp.text('...') | |
699 | else: | |
700 | _pp_kv(pp, 'G', me.G); pp.text(','); pp.breakable() | |
701 | _pp_kv(pp, 'p', me.p) | |
702 | pp.end_group(ind, ')') | |
703 | _augment(DSAPub, _tmp) | |
704 | _augment(KCDSAPub, _tmp) | |
705 | ||
706 | class _tmp: | |
707 | def __repr__(me): return '%s(G = %r, u = %s, p = %r)' % \ | |
708 | (_clsname(me), me.G, _repr_secret(me.u), me.p) | |
709 | def _repr_pretty_(me, pp, cyclep): | |
710 | ind = _pp_bgroup_tyname(pp, me) | |
711 | if cyclep: | |
712 | pp.text('...') | |
713 | else: | |
714 | _pp_kv(pp, 'G', me.G); pp.text(','); pp.breakable() | |
715 | _pp_kv(pp, 'u', me.u, True); pp.text(','); pp.breakable() | |
716 | _pp_kv(pp, 'p', me.p) | |
717 | pp.end_group(ind, ')') | |
718 | _augment(DSAPriv, _tmp) | |
719 | _augment(KCDSAPriv, _tmp) | |
720 | ||
848ba392 | 721 | ###-------------------------------------------------------------------------- |
eb8aa4ec | 722 | ### Bernstein's elliptic curve crypto and related schemes. |
848ba392 MW |
723 | |
724 | X25519_BASE = \ | |
725 | bytes('0900000000000000000000000000000000000000000000000000000000000000') | |
726 | ||
eb8aa4ec MW |
727 | X448_BASE = \ |
728 | bytes('05000000000000000000000000000000000000000000000000000000' | |
729 | '00000000000000000000000000000000000000000000000000000000') | |
730 | ||
848ba392 MW |
731 | Z128 = bytes('00000000000000000000000000000000') |
732 | ||
733 | class _BoxyPub (object): | |
734 | def __init__(me, pub, *kw, **kwargs): | |
735 | if len(pub) != me._PUBSZ: raise ValueError, 'bad public key' | |
736 | super(_BoxyPub, me).__init__(*kw, **kwargs) | |
737 | me.pub = pub | |
bbd94558 MW |
738 | def __repr__(me): return '%s(pub = %r)' % (_clsname(me), me.pub) |
739 | def _repr_pretty_(me, pp, cyclep): | |
740 | ind = _pp_bgroup_tyname(pp, me) | |
741 | if cyclep: | |
742 | pp.text('...') | |
743 | else: | |
744 | _pp_kv(pp, 'pub', me.pub) | |
745 | pp.end_group(ind, ')') | |
848ba392 MW |
746 | |
747 | class _BoxyPriv (_BoxyPub): | |
748 | def __init__(me, priv, pub = None, *kw, **kwargs): | |
749 | if len(priv) != me._KEYSZ: raise ValueError, 'bad private key' | |
750 | if pub is None: pub = me._op(priv, me._BASE) | |
751 | super(_BoxyPriv, me).__init__(pub = pub, *kw, **kwargs) | |
752 | me.priv = priv | |
753 | def agree(me, you): return me._op(me.priv, you.pub) | |
754 | def boxkey(me, recip): | |
755 | return me._hashkey(me.agree(recip)) | |
756 | def box(me, recip, n, m): | |
757 | return secret_box(me.boxkey(recip), n, m) | |
758 | def unbox(me, recip, n, c): | |
759 | return secret_unbox(me.boxkey(recip, n, c)) | |
bbd94558 MW |
760 | def __repr__(me): return '%s(priv = %s, pub = %r)' % \ |
761 | (_clsname(me), _repr_secret(me.priv), me.pub) | |
762 | def _repr_pretty_(me, pp, cyclep): | |
763 | ind = _pp_bgroup_tyname(pp, me) | |
764 | if cyclep: | |
765 | pp.text('...') | |
766 | else: | |
767 | _pp_kv(pp, 'priv', me.priv, True); pp.text(','); pp.breakable() | |
768 | _pp_kv(pp, 'pub', me.pub) | |
769 | pp.end_group(ind, ')') | |
848ba392 MW |
770 | |
771 | class X25519Pub (_BoxyPub): | |
772 | _PUBSZ = X25519_PUBSZ | |
773 | _BASE = X25519_BASE | |
774 | ||
775 | class X25519Priv (_BoxyPriv, X25519Pub): | |
776 | _KEYSZ = X25519_KEYSZ | |
777 | def _op(me, k, X): return x25519(k, X) | |
778 | def _hashkey(me, z): return hsalsa20_prf(z, Z128) | |
779 | ||
eb8aa4ec MW |
780 | class X448Pub (_BoxyPub): |
781 | _PUBSZ = X448_PUBSZ | |
782 | _BASE = X448_BASE | |
783 | ||
784 | class X448Priv (_BoxyPriv, X448Pub): | |
785 | _KEYSZ = X448_KEYSZ | |
786 | def _op(me, k, X): return x448(k, X) | |
787 | ##def _hashkey(me, z): return ??? | |
788 | ||
dafb2da4 MW |
789 | class Ed25519Pub (object): |
790 | def __init__(me, pub): | |
791 | me.pub = pub | |
792 | def verify(me, msg, sig): | |
793 | return ed25519_verify(me.pub, msg, sig) | |
794 | ||
795 | class Ed25519Priv (Ed25519Pub): | |
796 | def __init__(me, priv): | |
797 | me.priv = priv | |
798 | Ed25519Pub.__init__(me, ed25519_pubkey(priv)) | |
799 | def sign(me, msg): | |
800 | return ed25519_sign(me.priv, msg, pub = me.pub) | |
801 | @classmethod | |
802 | def generate(cls, rng = rand): | |
803 | return cls(rng.block(ED25519_KEYSZ)) | |
804 | ||
00401529 MW |
805 | ###-------------------------------------------------------------------------- |
806 | ### Built-in named curves and prime groups. | |
ed8cc62d MW |
807 | |
808 | class _groupmap (object): | |
809 | def __init__(me, map, nth): | |
810 | me.map = map | |
811 | me.nth = nth | |
1b61856d MW |
812 | me._n = max(map.values()) + 1 |
813 | me.i = me._n*[None] | |
ed8cc62d | 814 | def __repr__(me): |
96d7ed6c MW |
815 | return '{%s}' % ', '.join(['%r: %r' % kv for kv in me.iteritems()]) |
816 | def _repr_pretty_(me, pp, cyclep): | |
582568f1 MW |
817 | ind = _pp_bgroup(pp, '{ ') |
818 | if cyclep: pp.text('...') | |
819 | else: _pp_dict(pp, me.iteritems()) | |
820 | pp.end_group(ind, ' }') | |
1b61856d MW |
821 | def __len__(me): |
822 | return me._n | |
ed8cc62d MW |
823 | def __contains__(me, k): |
824 | return k in me.map | |
825 | def __getitem__(me, k): | |
826 | i = me.map[k] | |
827 | if me.i[i] is None: | |
828 | me.i[i] = me.nth(i) | |
829 | return me.i[i] | |
830 | def __setitem__(me, k, v): | |
831 | raise TypeError, "immutable object" | |
832 | def __iter__(me): | |
833 | return iter(me.map) | |
96851f5d MW |
834 | def iterkeys(me): |
835 | return iter(me.map) | |
836 | def itervalues(me): | |
837 | for k in me: | |
838 | yield me[k] | |
839 | def iteritems(me): | |
840 | for k in me: | |
841 | yield k, me[k] | |
ed8cc62d MW |
842 | def keys(me): |
843 | return [k for k in me] | |
844 | def values(me): | |
845 | return [me[k] for k in me] | |
96851f5d MW |
846 | def items(me): |
847 | return [(k, me[k]) for k in me] | |
ed8cc62d MW |
848 | eccurves = _groupmap(_base._eccurves, ECInfo._curven) |
849 | primegroups = _groupmap(_base._pgroups, DHInfo._groupn) | |
850 | bingroups = _groupmap(_base._bingroups, BinDHInfo._groupn) | |
851 | ||
00401529 MW |
852 | ###-------------------------------------------------------------------------- |
853 | ### Prime number generation. | |
ed8cc62d MW |
854 | |
855 | class PrimeGenEventHandler (object): | |
856 | def pg_begin(me, ev): | |
857 | return me.pg_try(ev) | |
858 | def pg_done(me, ev): | |
859 | return PGEN_DONE | |
860 | def pg_abort(me, ev): | |
861 | return PGEN_TRY | |
862 | def pg_fail(me, ev): | |
863 | return PGEN_TRY | |
864 | def pg_pass(me, ev): | |
865 | return PGEN_TRY | |
d7ab1bab | 866 | |
867 | class SophieGermainStepJump (object): | |
868 | def pg_begin(me, ev): | |
869 | me.lf = PrimeFilter(ev.x) | |
870 | me.hf = me.lf.muladd(2, 1) | |
871 | return me.cont(ev) | |
872 | def pg_try(me, ev): | |
873 | me.step() | |
874 | return me.cont(ev) | |
875 | def cont(me, ev): | |
876 | while me.lf.status == PGEN_FAIL or me.hf.status == PGEN_FAIL: | |
877 | me.step() | |
878 | if me.lf.status == PGEN_ABORT or me.hf.status == PGEN_ABORT: | |
879 | return PGEN_ABORT | |
880 | ev.x = me.lf.x | |
881 | if me.lf.status == PGEN_DONE and me.hf.status == PGEN_DONE: | |
882 | return PGEN_DONE | |
883 | return PGEN_TRY | |
884 | def pg_done(me, ev): | |
885 | del me.lf | |
886 | del me.hf | |
887 | ||
888 | class SophieGermainStepper (SophieGermainStepJump): | |
889 | def __init__(me, step): | |
890 | me.lstep = step; | |
891 | me.hstep = 2 * step | |
892 | def step(me): | |
893 | me.lf.step(me.lstep) | |
894 | me.hf.step(me.hstep) | |
895 | ||
896 | class SophieGermainJumper (SophieGermainStepJump): | |
897 | def __init__(me, jump): | |
898 | me.ljump = PrimeFilter(jump); | |
899 | me.hjump = me.ljump.muladd(2, 0) | |
900 | def step(me): | |
901 | me.lf.jump(me.ljump) | |
902 | me.hf.jump(me.hjump) | |
903 | def pg_done(me, ev): | |
904 | del me.ljump | |
905 | del me.hjump | |
906 | SophieGermainStepJump.pg_done(me, ev) | |
907 | ||
908 | class SophieGermainTester (object): | |
909 | def __init__(me): | |
910 | pass | |
911 | def pg_begin(me, ev): | |
912 | me.lr = RabinMiller(ev.x) | |
913 | me.hr = RabinMiller(2 * ev.x + 1) | |
914 | def pg_try(me, ev): | |
915 | lst = me.lr.test(ev.rng.range(me.lr.x)) | |
916 | if lst != PGEN_PASS and lst != PGEN_DONE: | |
917 | return lst | |
918 | rst = me.hr.test(ev.rng.range(me.hr.x)) | |
919 | if rst != PGEN_PASS and rst != PGEN_DONE: | |
920 | return rst | |
921 | if lst == PGEN_DONE and rst == PGEN_DONE: | |
922 | return PGEN_DONE | |
923 | return PGEN_PASS | |
924 | def pg_done(me, ev): | |
925 | del me.lr | |
926 | del me.hr | |
927 | ||
d7ab1bab | 928 | class PrimitiveStepper (PrimeGenEventHandler): |
929 | def __init__(me): | |
930 | pass | |
931 | def pg_try(me, ev): | |
932 | ev.x = me.i.next() | |
933 | return PGEN_TRY | |
934 | def pg_begin(me, ev): | |
935 | me.i = iter(smallprimes) | |
936 | return me.pg_try(ev) | |
937 | ||
938 | class PrimitiveTester (PrimeGenEventHandler): | |
939 | def __init__(me, mod, hh = [], exp = None): | |
940 | me.mod = MPMont(mod) | |
941 | me.exp = exp | |
942 | me.hh = hh | |
943 | def pg_try(me, ev): | |
944 | x = ev.x | |
945 | if me.exp is not None: | |
946 | x = me.mod.exp(x, me.exp) | |
947 | if x == 1: return PGEN_FAIL | |
948 | for h in me.hh: | |
949 | if me.mod.exp(x, h) == 1: return PGEN_FAIL | |
950 | ev.x = x | |
951 | return PGEN_DONE | |
952 | ||
953 | class SimulStepper (PrimeGenEventHandler): | |
954 | def __init__(me, mul = 2, add = 1, step = 2): | |
955 | me.step = step | |
956 | me.mul = mul | |
957 | me.add = add | |
958 | def _stepfn(me, step): | |
959 | if step <= 0: | |
960 | raise ValueError, 'step must be positive' | |
961 | if step <= MPW_MAX: | |
962 | return lambda f: f.step(step) | |
963 | j = PrimeFilter(step) | |
964 | return lambda f: f.jump(j) | |
965 | def pg_begin(me, ev): | |
966 | x = ev.x | |
967 | me.lf = PrimeFilter(x) | |
968 | me.hf = PrimeFilter(x * me.mul + me.add) | |
969 | me.lstep = me._stepfn(me.step) | |
970 | me.hstep = me._stepfn(me.step * me.mul) | |
971 | SimulStepper._cont(me, ev) | |
972 | def pg_try(me, ev): | |
973 | me._step() | |
974 | me._cont(ev) | |
975 | def _step(me): | |
976 | me.lstep(me.lf) | |
977 | me.hstep(me.hf) | |
978 | def _cont(me, ev): | |
979 | while me.lf.status == PGEN_FAIL or me.hf.status == PGEN_FAIL: | |
980 | me._step() | |
981 | if me.lf.status == PGEN_ABORT or me.hf.status == PGEN_ABORT: | |
982 | return PGEN_ABORT | |
983 | ev.x = me.lf.x | |
984 | if me.lf.status == PGEN_DONE and me.hf.status == PGEN_DONE: | |
985 | return PGEN_DONE | |
986 | return PGEN_TRY | |
987 | def pg_done(me, ev): | |
988 | del me.lf | |
989 | del me.hf | |
990 | del me.lstep | |
991 | del me.hstep | |
992 | ||
993 | class SimulTester (PrimeGenEventHandler): | |
994 | def __init__(me, mul = 2, add = 1): | |
995 | me.mul = mul | |
996 | me.add = add | |
997 | def pg_begin(me, ev): | |
998 | x = ev.x | |
999 | me.lr = RabinMiller(x) | |
1000 | me.hr = RabinMiller(x * me.mul + me.add) | |
1001 | def pg_try(me, ev): | |
1002 | lst = me.lr.test(ev.rng.range(me.lr.x)) | |
1003 | if lst != PGEN_PASS and lst != PGEN_DONE: | |
1004 | return lst | |
1005 | rst = me.hr.test(ev.rng.range(me.hr.x)) | |
1006 | if rst != PGEN_PASS and rst != PGEN_DONE: | |
1007 | return rst | |
1008 | if lst == PGEN_DONE and rst == PGEN_DONE: | |
1009 | return PGEN_DONE | |
1010 | return PGEN_PASS | |
1011 | def pg_done(me, ev): | |
1012 | del me.lr | |
1013 | del me.hr | |
1014 | ||
1015 | def sgprime(start, step = 2, name = 'p', event = pgen_nullev, nsteps = 0): | |
1016 | start = MP(start) | |
1017 | return pgen(start, name, SimulStepper(step = step), SimulTester(), event, | |
00401529 | 1018 | nsteps, RabinMiller.iters(start.nbits)) |
d7ab1bab | 1019 | |
1020 | def findprimitive(mod, hh = [], exp = None, name = 'g', event = pgen_nullev): | |
1021 | return pgen(0, name, PrimitiveStepper(), PrimitiveTester(mod, hh, exp), | |
00401529 | 1022 | event, 0, 1) |
d7ab1bab | 1023 | |
1024 | def kcdsaprime(pbits, qbits, rng = rand, | |
00401529 | 1025 | event = pgen_nullev, name = 'p', nsteps = 0): |
d7ab1bab | 1026 | hbits = pbits - qbits |
1027 | h = pgen(rng.mp(hbits, 1), name + ' [h]', | |
00401529 MW |
1028 | PrimeGenStepper(2), PrimeGenTester(), |
1029 | event, nsteps, RabinMiller.iters(hbits)) | |
d7ab1bab | 1030 | q = pgen(rng.mp(qbits, 1), name, SimulStepper(2 * h, 1, 2), |
00401529 | 1031 | SimulTester(2 * h, 1), event, nsteps, RabinMiller.iters(qbits)) |
d7ab1bab | 1032 | p = 2 * q * h + 1 |
1033 | return p, q, h | |
1034 | ||
1035 | #----- That's all, folks ---------------------------------------------------- |