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