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