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 | |
6bd22b53 MW |
26 | from __future__ import with_statement |
27 | ||
d7ab1bab | 28 | from binascii import hexlify as _hexify, unhexlify as _unhexify |
6bd22b53 | 29 | from contextlib import contextmanager as _ctxmgr |
8854bd74 MW |
30 | try: import DLFCN as _dlfcn |
31 | except ImportError: _dlfcn = None | |
a3ae4a9f | 32 | import os as _os |
6bd22b53 | 33 | from struct import pack as _pack |
378ceeef MW |
34 | import sys as _sys |
35 | import types as _types | |
36 | ||
37 | ###-------------------------------------------------------------------------- | |
38 | ### Import the main C extension module. | |
39 | ||
a3ae4a9f MW |
40 | try: |
41 | _dlflags = _odlflags = _sys.getdlopenflags() | |
42 | except AttributeError: | |
43 | _dlflags = _odlflags = -1 | |
44 | ||
45 | ## Set the `deep binding' flag. Python has its own different MD5 | |
46 | ## implementation, and some distributions export `md5_init' and friends so | |
47 | ## they override our versions, which doesn't end well. Figure out how to | |
48 | ## turn this flag on so we don't have the problem. | |
49 | if _dlflags >= 0: | |
50 | try: _dlflags |= _dlfcn.RTLD_DEEPBIND | |
51 | except AttributeError: | |
52 | try: _dlflags |= _os.RTLD_DEEPBIND | |
53 | except AttributeError: | |
54 | if _os.uname()[0] == 'Linux': _dlflags |= 8 # magic knowledge | |
55 | else: pass # can't do this. | |
56 | _sys.setdlopenflags(_dlflags) | |
57 | ||
378ceeef | 58 | import _base |
46e6ad89 | 59 | |
a3ae4a9f MW |
60 | if _odlflags >= 0: |
61 | _sys.setdlopenflags(_odlflags) | |
62 | ||
63 | del _dlflags, _odlflags | |
64 | ||
00401529 MW |
65 | ###-------------------------------------------------------------------------- |
66 | ### Basic stuff. | |
ed8cc62d | 67 | |
c04b289c MW |
68 | ## For the benefit of the default keyreporter, we need the program name. |
69 | _base._ego(_sys.argv[0]) | |
d7ab1bab | 70 | |
930d78e3 MW |
71 | ## Register our module. |
72 | _base._set_home_module(_sys.modules[__name__]) | |
73 | def default_lostexchook(why, ty, val, tb): | |
74 | """`catacomb.lostexchook(WHY, TY, VAL, TB)' reports lost exceptions.""" | |
75 | _sys.stderr.write("\n\n!!! LOST EXCEPTION: %s\n" % why) | |
76 | _sys.excepthook(ty, val, tb) | |
77 | _sys.stderr.write("\n") | |
78 | lostexchook = default_lostexchook | |
79 | ||
837fa485 MW |
80 | ## How to fix a name back into the right identifier. Alas, the rules are not |
81 | ## consistent. | |
82 | def _fixname(name): | |
83 | ||
84 | ## Hyphens consistently become underscores. | |
85 | name = name.replace('-', '_') | |
86 | ||
87 | ## But slashes might become underscores or just vanish. | |
3e80d327 | 88 | if name.startswith('salsa20'): name = name.replace('/', '') |
837fa485 MW |
89 | else: name = name.replace('/', '_') |
90 | ||
91 | ## Done. | |
92 | return name | |
93 | ||
ed8cc62d MW |
94 | ## Initialize the module. Drag in the static methods of the various |
95 | ## classes; create names for the various known crypto algorithms. | |
d7ab1bab | 96 | def _init(): |
97 | d = globals() | |
98 | b = _base.__dict__; | |
99 | for i in b: | |
100 | if i[0] != '_': | |
101 | d[i] = b[i]; | |
bebf03ab | 102 | for i in [gcciphers, gcaeads, gchashes, gcmacs, gcprps]: |
ed8cc62d | 103 | for c in i.itervalues(): |
837fa485 | 104 | d[_fixname(c.name)] = c |
ed8cc62d | 105 | for c in gccrands.itervalues(): |
837fa485 | 106 | d[_fixname(c.name + 'rand')] = c |
d7ab1bab | 107 | _init() |
108 | ||
ed8cc62d MW |
109 | ## A handy function for our work: add the methods of a named class to an |
110 | ## existing class. This is how we write the Python-implemented parts of our | |
111 | ## mostly-C types. | |
d7ab1bab | 112 | def _augment(c, cc): |
113 | for i in cc.__dict__: | |
114 | a = cc.__dict__[i] | |
115 | if type(a) is _types.MethodType: | |
116 | a = a.im_func | |
117 | elif type(a) not in (_types.FunctionType, staticmethod, classmethod): | |
118 | continue | |
119 | setattr(c, i, a) | |
120 | ||
ed8cc62d MW |
121 | ## Parsing functions tend to return the object parsed and the remainder of |
122 | ## the input. This checks that the remainder is input and, if so, returns | |
123 | ## just the object. | |
124 | def _checkend(r): | |
125 | x, rest = r | |
126 | if rest != '': | |
127 | raise SyntaxError, 'junk at end of string' | |
128 | return x | |
129 | ||
96d7ed6c | 130 | ## Some pretty-printing utilities. |
652e16ea | 131 | PRINT_SECRETS = False |
330e6a74 | 132 | def _clsname(me): return type(me).__name__ |
652e16ea MW |
133 | def _repr_secret(thing, secretp = True): |
134 | if not secretp or PRINT_SECRETS: return repr(thing) | |
135 | else: return '#<SECRET>' | |
96d7ed6c | 136 | def _pp_str(me, pp, cyclep): pp.text(cyclep and '...' or str(me)) |
652e16ea MW |
137 | def _pp_secret(pp, thing, secretp = True): |
138 | if not secretp or PRINT_SECRETS: pp.pretty(thing) | |
139 | else: pp.text('#<SECRET>') | |
582568f1 MW |
140 | def _pp_bgroup(pp, text): |
141 | ind = len(text) | |
142 | pp.begin_group(ind, text) | |
143 | return ind | |
144 | def _pp_bgroup_tyname(pp, obj, open = '('): | |
330e6a74 | 145 | return _pp_bgroup(pp, _clsname(obj) + open) |
652e16ea | 146 | def _pp_kv(pp, k, v, secretp = False): |
582568f1 | 147 | ind = _pp_bgroup(pp, k + ' = ') |
652e16ea | 148 | _pp_secret(pp, v, secretp) |
96d7ed6c MW |
149 | pp.end_group(ind, '') |
150 | def _pp_commas(pp, printfn, items): | |
151 | firstp = True | |
152 | for i in items: | |
153 | if firstp: firstp = False | |
154 | else: pp.text(','); pp.breakable() | |
155 | printfn(i) | |
156 | def _pp_dict(pp, items): | |
157 | def p((k, v)): | |
582568f1 | 158 | pp.begin_group(0) |
96d7ed6c MW |
159 | pp.pretty(k) |
160 | pp.text(':') | |
582568f1 | 161 | pp.begin_group(2) |
96d7ed6c MW |
162 | pp.breakable() |
163 | pp.pretty(v) | |
582568f1 MW |
164 | pp.end_group(2) |
165 | pp.end_group(0) | |
96d7ed6c MW |
166 | _pp_commas(pp, p, items) |
167 | ||
00401529 MW |
168 | ###-------------------------------------------------------------------------- |
169 | ### Bytestrings. | |
ed8cc62d | 170 | |
d7ab1bab | 171 | class _tmp: |
172 | def fromhex(x): | |
173 | return ByteString(_unhexify(x)) | |
174 | fromhex = staticmethod(fromhex) | |
175 | def __hex__(me): | |
176 | return _hexify(me) | |
177 | def __repr__(me): | |
178 | return 'bytes(%r)' % hex(me) | |
179 | _augment(ByteString, _tmp) | |
bfb450cc | 180 | ByteString.__hash__ = str.__hash__ |
d7ab1bab | 181 | bytes = ByteString.fromhex |
182 | ||
00401529 | 183 | ###-------------------------------------------------------------------------- |
bebf03ab MW |
184 | ### Symmetric encryption. |
185 | ||
186 | class _tmp: | |
187 | def encrypt(me, n, m, tsz = None, h = ByteString('')): | |
188 | if tsz is None: tsz = me.__class__.tagsz.default | |
189 | e = me.enc(n, len(h), len(m), tsz) | |
190 | if not len(h): a = None | |
191 | else: a = e.aad().hash(h) | |
192 | c0 = e.encrypt(m) | |
193 | c1, t = e.done(aad = a) | |
194 | return c0 + c1, t | |
195 | def decrypt(me, n, c, t, h = ByteString('')): | |
196 | d = me.dec(n, len(h), len(c), len(t)) | |
197 | if not len(h): a = None | |
198 | else: a = d.aad().hash(h) | |
199 | m = d.decrypt(c) | |
200 | m += d.done(t, aad = a) | |
201 | return m | |
202 | _augment(GAEKey, _tmp) | |
203 | ||
204 | ###-------------------------------------------------------------------------- | |
bfb450cc MW |
205 | ### Hashing. |
206 | ||
207 | class _tmp: | |
208 | def check(me, h): | |
209 | hh = me.done() | |
210 | return ctstreq(h, hh) | |
211 | _augment(GHash, _tmp) | |
212 | _augment(Poly1305Hash, _tmp) | |
213 | ||
6bd22b53 MW |
214 | class _HashBase (object): |
215 | ## The standard hash methods. Assume that `hash' is defined and returns | |
216 | ## the receiver. | |
05868a05 MW |
217 | def _check_range(me, n, max): |
218 | if not (0 <= n <= max): raise OverflowError("out of range") | |
219 | def hashu8(me, n): | |
220 | me._check_range(n, 0xff) | |
221 | return me.hash(_pack('B', n)) | |
222 | def hashu16l(me, n): | |
223 | me._check_range(n, 0xffff) | |
224 | return me.hash(_pack('<H', n)) | |
225 | def hashu16b(me, n): | |
226 | me._check_range(n, 0xffff) | |
227 | return me.hash(_pack('>H', n)) | |
6bd22b53 | 228 | hashu16 = hashu16b |
05868a05 MW |
229 | def hashu32l(me, n): |
230 | me._check_range(n, 0xffffffff) | |
231 | return me.hash(_pack('<L', n)) | |
232 | def hashu32b(me, n): | |
233 | me._check_range(n, 0xffffffff) | |
234 | return me.hash(_pack('>L', n)) | |
6bd22b53 | 235 | hashu32 = hashu32b |
05868a05 MW |
236 | def hashu64l(me, n): |
237 | me._check_range(n, 0xffffffffffffffff) | |
238 | return me.hash(_pack('<Q', n)) | |
239 | def hashu64b(me, n): | |
240 | me._check_range(n, 0xffffffffffffffff) | |
241 | return me.hash(_pack('>Q', n)) | |
6bd22b53 MW |
242 | hashu64 = hashu64b |
243 | def hashbuf8(me, s): return me.hashu8(len(s)).hash(s) | |
244 | def hashbuf16l(me, s): return me.hashu16l(len(s)).hash(s) | |
245 | def hashbuf16b(me, s): return me.hashu16b(len(s)).hash(s) | |
246 | hashbuf16 = hashbuf16b | |
247 | def hashbuf32l(me, s): return me.hashu32l(len(s)).hash(s) | |
248 | def hashbuf32b(me, s): return me.hashu32b(len(s)).hash(s) | |
249 | hashbuf32 = hashbuf32b | |
250 | def hashbuf64l(me, s): return me.hashu64l(len(s)).hash(s) | |
251 | def hashbuf64b(me, s): return me.hashu64b(len(s)).hash(s) | |
252 | hashbuf64 = hashbuf64b | |
253 | def hashstrz(me, s): return me.hash(s).hashu8(0) | |
254 | ||
255 | class _ShakeBase (_HashBase): | |
256 | ||
257 | ## Python gets really confused if I try to augment `__new__' on native | |
258 | ## classes, so wrap and delegate. Sorry. | |
259 | def __init__(me, perso = '', *args, **kw): | |
260 | super(_ShakeBase, me).__init__(*args, **kw) | |
261 | me._h = me._SHAKE(perso = perso, func = me._FUNC) | |
262 | ||
263 | ## Delegate methods... | |
688625b6 | 264 | def copy(me): new = me.__class__._bare_new(); new._copy(me); return new |
614c3bbf | 265 | def _copy(me, other): me._h = other._h.copy() |
6bd22b53 MW |
266 | def hash(me, m): me._h.hash(m); return me |
267 | def xof(me): me._h.xof(); return me | |
268 | def get(me, n): return me._h.get(n) | |
269 | def mask(me, m): return me._h.mask(m) | |
270 | def done(me, n): return me._h.done(n) | |
271 | def check(me, h): return ctstreq(h, me.done(len(h))) | |
272 | @property | |
273 | def state(me): return me._h.state | |
274 | @property | |
275 | def buffered(me): return me._h.buffered | |
276 | @property | |
277 | def rate(me): return me._h.rate | |
688625b6 MW |
278 | @classmethod |
279 | def _bare_new(cls): return cls() | |
6bd22b53 MW |
280 | |
281 | class _tmp: | |
282 | def check(me, h): | |
283 | return ctstreq(h, me.done(len(h))) | |
284 | def leftenc(me, n): | |
285 | nn = MP(n).storeb() | |
286 | return me.hashu8(len(nn)).hash(nn) | |
287 | def rightenc(me, n): | |
288 | nn = MP(n).storeb() | |
289 | return me.hash(nn).hashu8(len(nn)) | |
290 | def stringenc(me, str): | |
291 | return me.leftenc(8*len(str)).hash(str) | |
292 | def bytepad_before(me): | |
293 | return me.leftenc(me.rate) | |
294 | def bytepad_after(me): | |
295 | if me.buffered: me.hash(me._Z[:me.rate - me.buffered]) | |
296 | return me | |
297 | @_ctxmgr | |
298 | def bytepad(me): | |
299 | me.bytepad_before() | |
300 | yield me | |
301 | me.bytepad_after() | |
302 | _augment(Shake, _tmp) | |
303 | _augment(_ShakeBase, _tmp) | |
f22cdfa9 | 304 | Shake._Z = _ShakeBase._Z = ByteString.zero(200) |
6bd22b53 MW |
305 | |
306 | class KMAC (_ShakeBase): | |
307 | _FUNC = 'KMAC' | |
308 | def __init__(me, k, *arg, **kw): | |
309 | super(KMAC, me).__init__(*arg, **kw) | |
310 | with me.bytepad(): me.stringenc(k) | |
311 | def done(me, n = -1): | |
312 | if n < 0: n = me._TAGSZ | |
313 | me.rightenc(8*n) | |
314 | return super(KMAC, me).done(n) | |
315 | def xof(me): | |
316 | me.rightenc(0) | |
317 | return super(KMAC, me).xof() | |
688625b6 MW |
318 | @classmethod |
319 | def _bare_new(cls): return cls("") | |
6bd22b53 MW |
320 | |
321 | class KMAC128 (KMAC): _SHAKE = Shake128; _TAGSZ = 16 | |
322 | class KMAC256 (KMAC): _SHAKE = Shake256; _TAGSZ = 32 | |
323 | ||
bfb450cc | 324 | ###-------------------------------------------------------------------------- |
ce0340b6 MW |
325 | ### NaCl `secretbox'. |
326 | ||
327 | def secret_box(k, n, m): | |
bebf03ab | 328 | y, t = salsa20_naclbox(k).encrypt(n, m) |
bb5c23a4 | 329 | return t + y |
ce0340b6 MW |
330 | |
331 | def secret_unbox(k, n, c): | |
bebf03ab MW |
332 | tsz = poly1305.tagsz |
333 | return salsa20_naclbox(k).decrypt(n, c[tsz:], c[0:tsz]) | |
ce0340b6 MW |
334 | |
335 | ###-------------------------------------------------------------------------- | |
00401529 | 336 | ### Multiprecision integers and binary polynomials. |
ed8cc62d | 337 | |
2ef393b5 | 338 | def _split_rat(x): |
83c77564 | 339 | if isinstance(x, BaseRat): return x._n, x._d |
2ef393b5 | 340 | else: return x, 1 |
83c77564 MW |
341 | class BaseRat (object): |
342 | """Base class implementing fields of fractions over Euclidean domains.""" | |
2ef393b5 | 343 | def __new__(cls, a, b): |
83c77564 | 344 | a, b = cls.RING(a), cls.RING(b) |
2ef393b5 MW |
345 | q, r = divmod(a, b) |
346 | if r == 0: return q | |
347 | g = b.gcd(r) | |
83c77564 | 348 | me = super(BaseRat, cls).__new__(cls) |
2ef393b5 MW |
349 | me._n = a//g |
350 | me._d = b//g | |
351 | return me | |
352 | @property | |
353 | def numer(me): return me._n | |
354 | @property | |
355 | def denom(me): return me._d | |
356 | def __str__(me): return '%s/%s' % (me._n, me._d) | |
330e6a74 | 357 | def __repr__(me): return '%s(%s, %s)' % (_clsname(me), me._n, me._d) |
96d7ed6c | 358 | _repr_pretty_ = _pp_str |
2ef393b5 MW |
359 | |
360 | def __add__(me, you): | |
361 | n, d = _split_rat(you) | |
83c77564 | 362 | return type(me)(me._n*d + n*me._d, d*me._d) |
2ef393b5 MW |
363 | __radd__ = __add__ |
364 | def __sub__(me, you): | |
365 | n, d = _split_rat(you) | |
83c77564 | 366 | return type(me)(me._n*d - n*me._d, d*me._d) |
2ef393b5 MW |
367 | def __rsub__(me, you): |
368 | n, d = _split_rat(you) | |
83c77564 | 369 | return type(me)(n*me._d - me._n*d, d*me._d) |
2ef393b5 MW |
370 | def __mul__(me, you): |
371 | n, d = _split_rat(you) | |
83c77564 | 372 | return type(me)(me._n*n, me._d*d) |
08041ebb | 373 | __rmul__ = __mul__ |
b47818ea | 374 | def __truediv__(me, you): |
2ef393b5 | 375 | n, d = _split_rat(you) |
83c77564 | 376 | return type(me)(me._n*d, me._d*n) |
b47818ea | 377 | def __rtruediv__(me, you): |
2ef393b5 | 378 | n, d = _split_rat(you) |
83c77564 | 379 | return type(me)(me._d*n, me._n*d) |
b47818ea MW |
380 | __div__ = __truediv__ |
381 | __rdiv__ = __rtruediv__ | |
2ef393b5 MW |
382 | def __cmp__(me, you): |
383 | n, d = _split_rat(you) | |
7051e349 | 384 | return cmp(me._n*d, n*me._d) |
2ef393b5 MW |
385 | def __rcmp__(me, you): |
386 | n, d = _split_rat(you) | |
387 | return cmp(n*me._d, me._n*d) | |
388 | ||
83c77564 MW |
389 | class IntRat (BaseRat): |
390 | RING = MP | |
391 | ||
392 | class GFRat (BaseRat): | |
393 | RING = GF | |
394 | ||
d7ab1bab | 395 | class _tmp: |
396 | def negp(x): return x < 0 | |
397 | def posp(x): return x > 0 | |
398 | def zerop(x): return x == 0 | |
399 | def oddp(x): return x.testbit(0) | |
400 | def evenp(x): return not x.testbit(0) | |
401 | def mont(x): return MPMont(x) | |
402 | def barrett(x): return MPBarrett(x) | |
403 | def reduce(x): return MPReduce(x) | |
b47818ea MW |
404 | def __truediv__(me, you): return IntRat(me, you) |
405 | def __rtruediv__(me, you): return IntRat(you, me) | |
406 | __div__ = __truediv__ | |
407 | __rdiv__ = __rtruediv__ | |
96d7ed6c | 408 | _repr_pretty_ = _pp_str |
d7ab1bab | 409 | _augment(MP, _tmp) |
410 | ||
d7ab1bab | 411 | class _tmp: |
fbc145f3 | 412 | def zerop(x): return x == 0 |
ed8cc62d | 413 | def reduce(x): return GFReduce(x) |
fbc145f3 MW |
414 | def trace(x, y): return x.reduce().trace(y) |
415 | def halftrace(x, y): return x.reduce().halftrace(y) | |
416 | def modsqrt(x, y): return x.reduce().sqrt(y) | |
417 | def quadsolve(x, y): return x.reduce().quadsolve(y) | |
b47818ea MW |
418 | def __truediv__(me, you): return GFRat(me, you) |
419 | def __rtruediv__(me, you): return GFRat(you, me) | |
420 | __div__ = __truediv__ | |
421 | __rdiv__ = __rtruediv__ | |
96d7ed6c | 422 | _repr_pretty_ = _pp_str |
d7ab1bab | 423 | _augment(GF, _tmp) |
424 | ||
425 | class _tmp: | |
ed8cc62d MW |
426 | def product(*arg): |
427 | 'product(ITERABLE) or product(I, ...) -> PRODUCT' | |
428 | return MPMul(*arg).done() | |
429 | product = staticmethod(product) | |
430 | _augment(MPMul, _tmp) | |
431 | ||
00401529 MW |
432 | ###-------------------------------------------------------------------------- |
433 | ### Abstract fields. | |
ed8cc62d MW |
434 | |
435 | class _tmp: | |
d7ab1bab | 436 | def fromstring(str): return _checkend(Field.parse(str)) |
437 | fromstring = staticmethod(fromstring) | |
438 | _augment(Field, _tmp) | |
439 | ||
440 | class _tmp: | |
330e6a74 | 441 | def __repr__(me): return '%s(%sL)' % (_clsname(me), me.p) |
6d481bc6 | 442 | def __hash__(me): return 0x114401de ^ hash(me.p) |
96d7ed6c | 443 | def _repr_pretty_(me, pp, cyclep): |
582568f1 MW |
444 | ind = _pp_bgroup_tyname(pp, me) |
445 | if cyclep: pp.text('...') | |
446 | else: pp.pretty(me.p) | |
447 | pp.end_group(ind, ')') | |
d7ab1bab | 448 | def ec(me, a, b): return ECPrimeProjCurve(me, a, b) |
449 | _augment(PrimeField, _tmp) | |
450 | ||
451 | class _tmp: | |
330e6a74 | 452 | def __repr__(me): return '%s(%#xL)' % (_clsname(me), me.p) |
d7ab1bab | 453 | def ec(me, a, b): return ECBinProjCurve(me, a, b) |
96d7ed6c | 454 | def _repr_pretty_(me, pp, cyclep): |
582568f1 MW |
455 | ind = _pp_bgroup_tyname(pp, me) |
456 | if cyclep: pp.text('...') | |
457 | else: pp.text('%#x' % me.p) | |
458 | pp.end_group(ind, ')') | |
d7ab1bab | 459 | _augment(BinField, _tmp) |
460 | ||
461 | class _tmp: | |
6d481bc6 MW |
462 | def __hash__(me): return 0x23e4701c ^ hash(me.p) |
463 | _augment(BinPolyField, _tmp) | |
464 | ||
465 | class _tmp: | |
466 | def __hash__(me): | |
467 | h = 0x9a7d6240 | |
468 | h ^= hash(me.p) | |
469 | h ^= 2*hash(me.beta) & 0xffffffff | |
470 | return h | |
471 | _augment(BinNormField, _tmp) | |
472 | ||
473 | class _tmp: | |
d7ab1bab | 474 | def __str__(me): return str(me.value) |
475 | def __repr__(me): return '%s(%s)' % (repr(me.field), repr(me.value)) | |
96d7ed6c | 476 | _repr_pretty_ = _pp_str |
d7ab1bab | 477 | _augment(FE, _tmp) |
478 | ||
00401529 MW |
479 | ###-------------------------------------------------------------------------- |
480 | ### Elliptic curves. | |
d7ab1bab | 481 | |
482 | class _tmp: | |
483 | def __repr__(me): | |
330e6a74 | 484 | return '%s(%r, %s, %s)' % (_clsname(me), me.field, me.a, me.b) |
96d7ed6c | 485 | def _repr_pretty_(me, pp, cyclep): |
582568f1 | 486 | ind = _pp_bgroup_tyname(pp, me) |
96d7ed6c | 487 | if cyclep: |
582568f1 | 488 | pp.text('...') |
96d7ed6c | 489 | else: |
96d7ed6c MW |
490 | pp.pretty(me.field); pp.text(','); pp.breakable() |
491 | pp.pretty(me.a); pp.text(','); pp.breakable() | |
492 | pp.pretty(me.b) | |
582568f1 | 493 | pp.end_group(ind, ')') |
d7ab1bab | 494 | def frombuf(me, s): |
495 | return ecpt.frombuf(me, s) | |
496 | def fromraw(me, s): | |
497 | return ecpt.fromraw(me, s) | |
498 | def pt(me, *args): | |
5f959e50 | 499 | return me(*args) |
d7ab1bab | 500 | _augment(ECCurve, _tmp) |
501 | ||
502 | class _tmp: | |
6d481bc6 MW |
503 | def __hash__(me): |
504 | h = 0x6751d341 | |
505 | h ^= hash(me.field) | |
506 | h ^= 2*hash(me.a) ^ 0xffffffff | |
507 | h ^= 5*hash(me.b) ^ 0xffffffff | |
508 | return h | |
509 | _augment(ECPrimeCurve, _tmp) | |
510 | ||
511 | class _tmp: | |
512 | def __hash__(me): | |
513 | h = 0x2ac203c5 | |
514 | h ^= hash(me.field) | |
515 | h ^= 2*hash(me.a) ^ 0xffffffff | |
516 | h ^= 5*hash(me.b) ^ 0xffffffff | |
517 | return h | |
518 | _augment(ECBinCurve, _tmp) | |
519 | ||
520 | class _tmp: | |
d7ab1bab | 521 | def __repr__(me): |
330e6a74 MW |
522 | if not me: return '%s()' % _clsname(me) |
523 | return '%s(%s, %s)' % (_clsname(me), me.ix, me.iy) | |
d7ab1bab | 524 | def __str__(me): |
525 | if not me: return 'inf' | |
526 | return '(%s, %s)' % (me.ix, me.iy) | |
96d7ed6c MW |
527 | def _repr_pretty_(me, pp, cyclep): |
528 | if cyclep: | |
529 | pp.text('...') | |
530 | elif not me: | |
531 | pp.text('inf') | |
532 | else: | |
582568f1 | 533 | ind = _pp_bgroup(pp, '(') |
96d7ed6c MW |
534 | pp.pretty(me.ix); pp.text(','); pp.breakable() |
535 | pp.pretty(me.iy) | |
582568f1 | 536 | pp.end_group(ind, ')') |
d7ab1bab | 537 | _augment(ECPt, _tmp) |
538 | ||
539 | class _tmp: | |
540 | def __repr__(me): | |
330e6a74 MW |
541 | return '%s(curve = %r, G = %r, r = %s, h = %s)' % \ |
542 | (_clsname(me), me.curve, me.G, me.r, me.h) | |
96d7ed6c | 543 | def _repr_pretty_(me, pp, cyclep): |
582568f1 | 544 | ind = _pp_bgroup_tyname(pp, me) |
96d7ed6c | 545 | if cyclep: |
582568f1 | 546 | pp.text('...') |
96d7ed6c | 547 | else: |
96d7ed6c MW |
548 | _pp_kv(pp, 'curve', me.curve); pp.text(','); pp.breakable() |
549 | _pp_kv(pp, 'G', me.G); pp.text(','); pp.breakable() | |
550 | _pp_kv(pp, 'r', me.r); pp.text(','); pp.breakable() | |
551 | _pp_kv(pp, 'h', me.h) | |
582568f1 | 552 | pp.end_group(ind, ')') |
6d481bc6 MW |
553 | def __hash__(me): |
554 | h = 0x9bedb8de | |
555 | h ^= hash(me.curve) | |
556 | h ^= 2*hash(me.G) & 0xffffffff | |
557 | return h | |
d7ab1bab | 558 | def group(me): |
559 | return ECGroup(me) | |
560 | _augment(ECInfo, _tmp) | |
561 | ||
562 | class _tmp: | |
563 | def __repr__(me): | |
564 | if not me: return '%r()' % (me.curve) | |
565 | return '%r(%s, %s)' % (me.curve, me.x, me.y) | |
566 | def __str__(me): | |
567 | if not me: return 'inf' | |
568 | return '(%s, %s)' % (me.x, me.y) | |
7a7aa30e MW |
569 | def _repr_pretty_(me, pp, cyclep): |
570 | if cyclep: | |
571 | pp.text('...') | |
572 | elif not me: | |
573 | pp.text('inf') | |
574 | else: | |
575 | ind = _pp_bgroup(pp, '(') | |
576 | pp.pretty(me.x); pp.text(','); pp.breakable() | |
577 | pp.pretty(me.y) | |
578 | pp.end_group(ind, ')') | |
d7ab1bab | 579 | _augment(ECPtCurve, _tmp) |
580 | ||
00401529 MW |
581 | ###-------------------------------------------------------------------------- |
582 | ### Key sizes. | |
ed8cc62d | 583 | |
d7ab1bab | 584 | class _tmp: |
330e6a74 | 585 | def __repr__(me): return '%s(%d)' % (_clsname(me), me.default) |
d7ab1bab | 586 | def check(me, sz): return True |
587 | def best(me, sz): return sz | |
dfb915d3 | 588 | def pad(me, sz): return sz |
d7ab1bab | 589 | _augment(KeySZAny, _tmp) |
590 | ||
591 | class _tmp: | |
592 | def __repr__(me): | |
330e6a74 MW |
593 | return '%s(%d, %d, %d, %d)' % \ |
594 | (_clsname(me), me.default, me.min, me.max, me.mod) | |
96d7ed6c | 595 | def _repr_pretty_(me, pp, cyclep): |
582568f1 | 596 | ind = _pp_bgroup_tyname(pp, me) |
96d7ed6c | 597 | if cyclep: |
582568f1 | 598 | pp.text('...') |
96d7ed6c | 599 | else: |
96d7ed6c MW |
600 | pp.pretty(me.default); pp.text(','); pp.breakable() |
601 | pp.pretty(me.min); pp.text(','); pp.breakable() | |
602 | pp.pretty(me.max); pp.text(','); pp.breakable() | |
603 | pp.pretty(me.mod) | |
582568f1 | 604 | pp.end_group(ind, ')') |
dfb915d3 | 605 | def check(me, sz): return me.min <= sz <= me.max and sz%me.mod == 0 |
d7ab1bab | 606 | def best(me, sz): |
607 | if sz < me.min: raise ValueError, 'key too small' | |
608 | elif sz > me.max: return me.max | |
dfb915d3 MW |
609 | else: return sz - sz%me.mod |
610 | def pad(me, sz): | |
611 | if sz > me.max: raise ValueError, 'key too large' | |
612 | elif sz < me.min: return me.min | |
8fc76cc0 | 613 | else: sz += me.mod - 1; return sz - sz%me.mod |
d7ab1bab | 614 | _augment(KeySZRange, _tmp) |
615 | ||
616 | class _tmp: | |
330e6a74 | 617 | def __repr__(me): return '%s(%d, %s)' % (_clsname(me), me.default, me.set) |
96d7ed6c | 618 | def _repr_pretty_(me, pp, cyclep): |
582568f1 | 619 | ind = _pp_bgroup_tyname(pp, me) |
96d7ed6c | 620 | if cyclep: |
582568f1 | 621 | pp.text('...') |
96d7ed6c | 622 | else: |
96d7ed6c | 623 | pp.pretty(me.default); pp.text(','); pp.breakable() |
582568f1 | 624 | ind1 = _pp_bgroup(pp, '{') |
96d7ed6c | 625 | _pp_commas(pp, pp.pretty, me.set) |
582568f1 MW |
626 | pp.end_group(ind1, '}') |
627 | pp.end_group(ind, ')') | |
d7ab1bab | 628 | def check(me, sz): return sz in me.set |
629 | def best(me, sz): | |
630 | found = -1 | |
631 | for i in me.set: | |
632 | if found < i <= sz: found = i | |
633 | if found < 0: raise ValueError, 'key too small' | |
634 | return found | |
dfb915d3 MW |
635 | def pad(me, sz): |
636 | found = -1 | |
637 | for i in me.set: | |
638 | if sz <= i and (found == -1 or i < found): found = i | |
639 | if found < 0: raise ValueError, 'key too large' | |
640 | return found | |
d7ab1bab | 641 | _augment(KeySZSet, _tmp) |
642 | ||
00401529 | 643 | ###-------------------------------------------------------------------------- |
96d7ed6c MW |
644 | ### Key data objects. |
645 | ||
646 | class _tmp: | |
330e6a74 | 647 | def __repr__(me): return '%s(%r)' % (_clsname(me), me.name) |
96d7ed6c MW |
648 | _augment(KeyFile, _tmp) |
649 | ||
650 | class _tmp: | |
330e6a74 | 651 | def __repr__(me): return '%s(%r)' % (_clsname(me), me.fulltag) |
96d7ed6c MW |
652 | _augment(Key, _tmp) |
653 | ||
654 | class _tmp: | |
655 | def __repr__(me): | |
330e6a74 MW |
656 | return '%s({%s})' % (_clsname(me), |
657 | ', '.join(['%r: %r' % kv for kv in me.iteritems()])) | |
96d7ed6c | 658 | def _repr_pretty_(me, pp, cyclep): |
582568f1 | 659 | ind = _pp_bgroup_tyname(pp, me) |
96d7ed6c MW |
660 | if cyclep: pp.text('...') |
661 | else: _pp_dict(pp, me.iteritems()) | |
582568f1 | 662 | pp.end_group(ind, ')') |
96d7ed6c MW |
663 | _augment(KeyAttributes, _tmp) |
664 | ||
665 | class _tmp: | |
849e8a20 | 666 | def __repr__(me): |
652e16ea MW |
667 | return '%s(%s, %r)' % (_clsname(me), |
668 | _repr_secret(me._guts(), | |
669 | not (me.flags & KF_NONSECRET)), | |
670 | me.writeflags(me.flags)) | |
96d7ed6c | 671 | def _repr_pretty_(me, pp, cyclep): |
582568f1 | 672 | ind = _pp_bgroup_tyname(pp, me) |
96d7ed6c | 673 | if cyclep: |
582568f1 | 674 | pp.text('...') |
96d7ed6c | 675 | else: |
652e16ea MW |
676 | _pp_secret(pp, me._guts(), not (me.flags & KF_NONSECRET)) |
677 | pp.text(','); pp.breakable() | |
96d7ed6c | 678 | pp.pretty(me.writeflags(me.flags)) |
582568f1 | 679 | pp.end_group(ind, ')') |
849e8a20 MW |
680 | _augment(KeyData, _tmp) |
681 | ||
682 | class _tmp: | |
683 | def _guts(me): return me.bin | |
96d7ed6c MW |
684 | _augment(KeyDataBinary, _tmp) |
685 | ||
686 | class _tmp: | |
849e8a20 | 687 | def _guts(me): return me.ct |
96d7ed6c MW |
688 | _augment(KeyDataEncrypted, _tmp) |
689 | ||
690 | class _tmp: | |
849e8a20 | 691 | def _guts(me): return me.mp |
96d7ed6c MW |
692 | _augment(KeyDataMP, _tmp) |
693 | ||
694 | class _tmp: | |
849e8a20 | 695 | def _guts(me): return me.str |
96d7ed6c MW |
696 | _augment(KeyDataString, _tmp) |
697 | ||
698 | class _tmp: | |
849e8a20 | 699 | def _guts(me): return me.ecpt |
96d7ed6c MW |
700 | _augment(KeyDataECPt, _tmp) |
701 | ||
702 | class _tmp: | |
703 | def __repr__(me): | |
330e6a74 MW |
704 | return '%s({%s})' % (_clsname(me), |
705 | ', '.join(['%r: %r' % kv for kv in me.iteritems()])) | |
96d7ed6c | 706 | def _repr_pretty_(me, pp, cyclep): |
582568f1 | 707 | ind = _pp_bgroup_tyname(pp, me, '({ ') |
96d7ed6c MW |
708 | if cyclep: pp.text('...') |
709 | else: _pp_dict(pp, me.iteritems()) | |
582568f1 | 710 | pp.end_group(ind, ' })') |
96d7ed6c MW |
711 | _augment(KeyDataStructured, _tmp) |
712 | ||
713 | ###-------------------------------------------------------------------------- | |
00401529 | 714 | ### Abstract groups. |
ed8cc62d | 715 | |
d7ab1bab | 716 | class _tmp: |
717 | def __repr__(me): | |
330e6a74 | 718 | return '%s(p = %s, r = %s, g = %s)' % (_clsname(me), me.p, me.r, me.g) |
96d7ed6c | 719 | def _repr_pretty_(me, pp, cyclep): |
582568f1 | 720 | ind = _pp_bgroup_tyname(pp, me) |
96d7ed6c | 721 | if cyclep: |
582568f1 | 722 | pp.text('...') |
96d7ed6c | 723 | else: |
96d7ed6c MW |
724 | _pp_kv(pp, 'p', me.p); pp.text(','); pp.breakable() |
725 | _pp_kv(pp, 'r', me.r); pp.text(','); pp.breakable() | |
726 | _pp_kv(pp, 'g', me.g) | |
582568f1 | 727 | pp.end_group(ind, ')') |
d7ab1bab | 728 | _augment(FGInfo, _tmp) |
729 | ||
730 | class _tmp: | |
731 | def group(me): return PrimeGroup(me) | |
732 | _augment(DHInfo, _tmp) | |
733 | ||
734 | class _tmp: | |
735 | def group(me): return BinGroup(me) | |
736 | _augment(BinDHInfo, _tmp) | |
737 | ||
738 | class _tmp: | |
739 | def __repr__(me): | |
330e6a74 | 740 | return '%s(%r)' % (_clsname(me), me.info) |
99d932fe MW |
741 | def _repr_pretty_(me, pp, cyclep): |
742 | ind = _pp_bgroup_tyname(pp, me) | |
743 | if cyclep: pp.text('...') | |
744 | else: pp.pretty(me.info) | |
745 | pp.end_group(ind, ')') | |
d7ab1bab | 746 | _augment(Group, _tmp) |
747 | ||
748 | class _tmp: | |
6d481bc6 MW |
749 | def __hash__(me): |
750 | info = me.info | |
751 | h = 0xbce3cfe6 | |
752 | h ^= hash(info.p) | |
753 | h ^= 2*hash(info.r) & 0xffffffff | |
754 | h ^= 5*hash(info.g) & 0xffffffff | |
755 | return h | |
d7012c2b | 756 | def _get_geval(me, x): return MP(x) |
6d481bc6 MW |
757 | _augment(PrimeGroup, _tmp) |
758 | ||
759 | class _tmp: | |
760 | def __hash__(me): | |
761 | info = me.info | |
762 | h = 0x80695949 | |
763 | h ^= hash(info.p) | |
764 | h ^= 2*hash(info.r) & 0xffffffff | |
765 | h ^= 5*hash(info.g) & 0xffffffff | |
766 | return h | |
d7012c2b | 767 | def _get_geval(me, x): return GF(x) |
6d481bc6 MW |
768 | _augment(BinGroup, _tmp) |
769 | ||
770 | class _tmp: | |
771 | def __hash__(me): return 0x0ec23dab ^ hash(me.info) | |
d7012c2b | 772 | def _get_geval(me, x): return x.toec() |
6d481bc6 MW |
773 | _augment(ECGroup, _tmp) |
774 | ||
775 | class _tmp: | |
d7ab1bab | 776 | def __repr__(me): |
777 | return '%r(%r)' % (me.group, str(me)) | |
d7012c2b MW |
778 | def _repr_pretty_(me, pp, cyclep): |
779 | pp.pretty(type(me)._get_geval(me)) | |
d7ab1bab | 780 | _augment(GE, _tmp) |
781 | ||
00401529 MW |
782 | ###-------------------------------------------------------------------------- |
783 | ### RSA encoding techniques. | |
ed8cc62d MW |
784 | |
785 | class PKCS1Crypt (object): | |
d7ab1bab | 786 | def __init__(me, ep = '', rng = rand): |
787 | me.ep = ep | |
788 | me.rng = rng | |
789 | def encode(me, msg, nbits): | |
790 | return _base._p1crypt_encode(msg, nbits, me.ep, me.rng) | |
791 | def decode(me, ct, nbits): | |
792 | return _base._p1crypt_decode(ct, nbits, me.ep, me.rng) | |
793 | ||
ed8cc62d | 794 | class PKCS1Sig (object): |
d7ab1bab | 795 | def __init__(me, ep = '', rng = rand): |
796 | me.ep = ep | |
797 | me.rng = rng | |
798 | def encode(me, msg, nbits): | |
799 | return _base._p1sig_encode(msg, nbits, me.ep, me.rng) | |
800 | def decode(me, msg, sig, nbits): | |
801 | return _base._p1sig_decode(msg, sig, nbits, me.ep, me.rng) | |
802 | ||
ed8cc62d | 803 | class OAEP (object): |
d7ab1bab | 804 | def __init__(me, mgf = sha_mgf, hash = sha, ep = '', rng = rand): |
805 | me.mgf = mgf | |
806 | me.hash = hash | |
807 | me.ep = ep | |
808 | me.rng = rng | |
809 | def encode(me, msg, nbits): | |
810 | return _base._oaep_encode(msg, nbits, me.mgf, me.hash, me.ep, me.rng) | |
811 | def decode(me, ct, nbits): | |
812 | return _base._oaep_decode(ct, nbits, me.mgf, me.hash, me.ep, me.rng) | |
813 | ||
ed8cc62d | 814 | class PSS (object): |
d7ab1bab | 815 | def __init__(me, mgf = sha_mgf, hash = sha, saltsz = None, rng = rand): |
816 | me.mgf = mgf | |
817 | me.hash = hash | |
818 | if saltsz is None: | |
819 | saltsz = hash.hashsz | |
820 | me.saltsz = saltsz | |
821 | me.rng = rng | |
822 | def encode(me, msg, nbits): | |
823 | return _base._pss_encode(msg, nbits, me.mgf, me.hash, me.saltsz, me.rng) | |
824 | def decode(me, msg, sig, nbits): | |
825 | return _base._pss_decode(msg, sig, nbits, | |
00401529 | 826 | me.mgf, me.hash, me.saltsz, me.rng) |
d7ab1bab | 827 | |
828 | class _tmp: | |
829 | def encrypt(me, msg, enc): | |
830 | return me.pubop(enc.encode(msg, me.n.nbits)) | |
831 | def verify(me, msg, sig, enc): | |
832 | if msg is None: return enc.decode(msg, me.pubop(sig), me.n.nbits) | |
833 | try: | |
834 | x = enc.decode(msg, me.pubop(sig), me.n.nbits) | |
835 | return x is None or x == msg | |
836 | except ValueError: | |
b2687a0a | 837 | return False |
bbd94558 MW |
838 | def __repr__(me): |
839 | return '%s(n = %r, e = %r)' % (_clsname(me), me.n, me.e) | |
840 | def _repr_pretty_(me, pp, cyclep): | |
841 | ind = _pp_bgroup_tyname(pp, me) | |
842 | if cyclep: | |
843 | pp.text('...') | |
844 | else: | |
845 | _pp_kv(pp, 'n', me.n); pp.text(','); pp.breakable() | |
846 | _pp_kv(pp, 'e', me.e) | |
847 | pp.end_group(ind, ')') | |
d7ab1bab | 848 | _augment(RSAPub, _tmp) |
849 | ||
850 | class _tmp: | |
851 | def decrypt(me, ct, enc): return enc.decode(me.privop(ct), me.n.nbits) | |
852 | def sign(me, msg, enc): return me.privop(enc.encode(msg, me.n.nbits)) | |
bbd94558 MW |
853 | def __repr__(me): |
854 | return '%s(n = %r, e = %r, d = %s, ' \ | |
855 | 'p = %s, q = %s, dp = %s, dq = %s, q_inv = %s)' % \ | |
856 | (_clsname(me), me.n, me.e, | |
857 | _repr_secret(me.d), _repr_secret(me.p), _repr_secret(me.q), | |
858 | _repr_secret(me.dp), _repr_secret(me.dq), _repr_secret(me.q_inv)) | |
859 | def _repr_pretty_(me, pp, cyclep): | |
860 | ind = _pp_bgroup_tyname(pp, me) | |
861 | if cyclep: | |
862 | pp.text('...') | |
863 | else: | |
864 | _pp_kv(pp, 'n', me.n); pp.text(','); pp.breakable() | |
865 | _pp_kv(pp, 'e', me.e); pp.text(','); pp.breakable() | |
866 | _pp_kv(pp, 'd', me.d, secretp = True); pp.text(','); pp.breakable() | |
867 | _pp_kv(pp, 'p', me.p, secretp = True); pp.text(','); pp.breakable() | |
868 | _pp_kv(pp, 'q', me.q, secretp = True); pp.text(','); pp.breakable() | |
869 | _pp_kv(pp, 'dp', me.dp, secretp = True); pp.text(','); pp.breakable() | |
870 | _pp_kv(pp, 'dq', me.dq, secretp = True); pp.text(','); pp.breakable() | |
871 | _pp_kv(pp, 'q_inv', me.q_inv, secretp = True) | |
872 | pp.end_group(ind, ')') | |
d7ab1bab | 873 | _augment(RSAPriv, _tmp) |
874 | ||
00401529 | 875 | ###-------------------------------------------------------------------------- |
bbd94558 MW |
876 | ### DSA and related schemes. |
877 | ||
878 | class _tmp: | |
1b3b79da MW |
879 | def __repr__(me): return '%s(G = %r, p = %r, hash = %r)' % \ |
880 | (_clsname(me), me.G, me.p, me.hash) | |
bbd94558 MW |
881 | def _repr_pretty_(me, pp, cyclep): |
882 | ind = _pp_bgroup_tyname(pp, me) | |
883 | if cyclep: | |
884 | pp.text('...') | |
885 | else: | |
886 | _pp_kv(pp, 'G', me.G); pp.text(','); pp.breakable() | |
1b3b79da MW |
887 | _pp_kv(pp, 'p', me.p); pp.text(','); pp.breakable() |
888 | _pp_kv(pp, 'hash', me.hash) | |
bbd94558 MW |
889 | pp.end_group(ind, ')') |
890 | _augment(DSAPub, _tmp) | |
891 | _augment(KCDSAPub, _tmp) | |
892 | ||
893 | class _tmp: | |
1b3b79da MW |
894 | def __repr__(me): return '%s(G = %r, u = %s, p = %r, hash = %r)' % \ |
895 | (_clsname(me), me.G, _repr_secret(me.u), me.p, me.hash) | |
bbd94558 MW |
896 | def _repr_pretty_(me, pp, cyclep): |
897 | ind = _pp_bgroup_tyname(pp, me) | |
898 | if cyclep: | |
899 | pp.text('...') | |
900 | else: | |
901 | _pp_kv(pp, 'G', me.G); pp.text(','); pp.breakable() | |
902 | _pp_kv(pp, 'u', me.u, True); pp.text(','); pp.breakable() | |
1b3b79da MW |
903 | _pp_kv(pp, 'p', me.p); pp.text(','); pp.breakable() |
904 | _pp_kv(pp, 'hash', me.hash) | |
bbd94558 MW |
905 | pp.end_group(ind, ')') |
906 | _augment(DSAPriv, _tmp) | |
907 | _augment(KCDSAPriv, _tmp) | |
908 | ||
909 | ###-------------------------------------------------------------------------- | |
eb8aa4ec | 910 | ### Bernstein's elliptic curve crypto and related schemes. |
848ba392 | 911 | |
8e6f45a3 MW |
912 | X25519_BASE = MP(9).storel(32) |
913 | X448_BASE = MP(5).storel(56) | |
eb8aa4ec | 914 | |
5a8b43b3 | 915 | Z128 = ByteString.zero(16) |
848ba392 | 916 | |
925aa45b | 917 | class _BasePub (object): |
f40e338b | 918 | def __init__(me, pub, *args, **kw): |
925aa45b MW |
919 | if not me._PUBSZ.check(len(pub)): raise ValueError, 'bad public key' |
920 | super(_BasePub, me).__init__(*args, **kw) | |
848ba392 | 921 | me.pub = pub |
bbd94558 | 922 | def __repr__(me): return '%s(pub = %r)' % (_clsname(me), me.pub) |
925aa45b | 923 | def _pp(me, pp): _pp_kv(pp, 'pub', me.pub) |
bbd94558 MW |
924 | def _repr_pretty_(me, pp, cyclep): |
925 | ind = _pp_bgroup_tyname(pp, me) | |
925aa45b MW |
926 | if cyclep: pp.text('...') |
927 | else: me._pp(pp) | |
bbd94558 | 928 | pp.end_group(ind, ')') |
848ba392 | 929 | |
925aa45b | 930 | class _BasePriv (object): |
f40e338b | 931 | def __init__(me, priv, pub = None, *args, **kw): |
925aa45b MW |
932 | if not me._KEYSZ.check(len(priv)): raise ValueError, 'bad private key' |
933 | if pub is None: pub = me._pubkey(priv) | |
934 | super(_BasePriv, me).__init__(pub = pub, *args, **kw) | |
848ba392 | 935 | me.priv = priv |
925aa45b MW |
936 | @classmethod |
937 | def generate(cls, rng = rand): | |
938 | return cls(rng.block(cls._KEYSZ.default)) | |
939 | def __repr__(me): | |
940 | return '%s(priv = %d, pub = %r)' % \ | |
941 | (_clsname(me), _repr_secret(me.priv), me.pub) | |
942 | def _pp(me, pp): | |
943 | _pp_kv(pp, 'priv', me.priv, secretp = True); pp.text(','); pp.breakable() | |
944 | super(_BasePriv, me)._pp(pp) | |
945 | ||
946 | class _XDHPub (_BasePub): pass | |
947 | ||
948 | class _XDHPriv (_BasePriv): | |
949 | def _pubkey(me, priv): return me._op(priv, me._BASE) | |
848ba392 | 950 | def agree(me, you): return me._op(me.priv, you.pub) |
925aa45b MW |
951 | def boxkey(me, recip): return me._hashkey(me.agree(recip)) |
952 | def box(me, recip, n, m): return secret_box(me.boxkey(recip), n, m) | |
953 | def unbox(me, recip, n, c): return secret_unbox(me.boxkey(recip), n, c) | |
848ba392 | 954 | |
925aa45b MW |
955 | class X25519Pub (_XDHPub): |
956 | _PUBSZ = KeySZSet(X25519_PUBSZ) | |
848ba392 MW |
957 | _BASE = X25519_BASE |
958 | ||
925aa45b MW |
959 | class X25519Priv (_XDHPriv, X25519Pub): |
960 | _KEYSZ = KeySZSet(X25519_KEYSZ) | |
848ba392 MW |
961 | def _op(me, k, X): return x25519(k, X) |
962 | def _hashkey(me, z): return hsalsa20_prf(z, Z128) | |
963 | ||
925aa45b MW |
964 | class X448Pub (_XDHPub): |
965 | _PUBSZ = KeySZSet(X448_PUBSZ) | |
eb8aa4ec MW |
966 | _BASE = X448_BASE |
967 | ||
925aa45b MW |
968 | class X448Priv (_XDHPriv, X448Pub): |
969 | _KEYSZ = KeySZSet(X448_KEYSZ) | |
eb8aa4ec | 970 | def _op(me, k, X): return x448(k, X) |
f1b0cf0d | 971 | def _hashkey(me, z): return Shake256().hash(z).done(salsa20.keysz.default) |
eb8aa4ec | 972 | |
925aa45b | 973 | class _EdDSAPub (_BasePub): |
058f0a00 MW |
974 | def beginhash(me): return me._HASH() |
975 | def endhash(me, h): return h.done() | |
925aa45b MW |
976 | |
977 | class _EdDSAPriv (_BasePriv, _EdDSAPub): | |
978 | pass | |
979 | ||
980 | class Ed25519Pub (_EdDSAPub): | |
981 | _PUBSZ = KeySZSet(ED25519_PUBSZ) | |
058f0a00 | 982 | _HASH = sha512 |
5c4c0231 MW |
983 | def verify(me, msg, sig, **kw): |
984 | return ed25519_verify(me.pub, msg, sig, **kw) | |
dafb2da4 | 985 | |
925aa45b MW |
986 | class Ed25519Priv (_EdDSAPriv, Ed25519Pub): |
987 | _KEYSZ = KeySZAny(ED25519_KEYSZ) | |
988 | def _pubkey(me, priv): return ed25519_pubkey(priv) | |
5c4c0231 MW |
989 | def sign(me, msg, **kw): |
990 | return ed25519_sign(me.priv, msg, pub = me.pub, **kw) | |
dafb2da4 | 991 | |
eee202c3 MW |
992 | class Ed448Pub (_EdDSAPub): |
993 | _PUBSZ = KeySZSet(ED448_PUBSZ) | |
994 | _HASH = shake256 | |
995 | def verify(me, msg, sig, **kw): | |
996 | return ed448_verify(me.pub, msg, sig, **kw) | |
997 | ||
998 | class Ed448Priv (_EdDSAPriv, Ed448Pub): | |
999 | _KEYSZ = KeySZAny(ED448_KEYSZ) | |
1000 | def _pubkey(me, priv): return ed448_pubkey(priv) | |
1001 | def sign(me, msg, **kw): | |
1002 | return ed448_sign(me.priv, msg, pub = me.pub, **kw) | |
1003 | ||
848ba392 | 1004 | ###-------------------------------------------------------------------------- |
00401529 | 1005 | ### Built-in named curves and prime groups. |
ed8cc62d MW |
1006 | |
1007 | class _groupmap (object): | |
1008 | def __init__(me, map, nth): | |
1009 | me.map = map | |
1010 | me.nth = nth | |
1b61856d MW |
1011 | me._n = max(map.values()) + 1 |
1012 | me.i = me._n*[None] | |
ed8cc62d | 1013 | def __repr__(me): |
96d7ed6c MW |
1014 | return '{%s}' % ', '.join(['%r: %r' % kv for kv in me.iteritems()]) |
1015 | def _repr_pretty_(me, pp, cyclep): | |
582568f1 MW |
1016 | ind = _pp_bgroup(pp, '{ ') |
1017 | if cyclep: pp.text('...') | |
1018 | else: _pp_dict(pp, me.iteritems()) | |
1019 | pp.end_group(ind, ' }') | |
1b61856d MW |
1020 | def __len__(me): |
1021 | return me._n | |
ed8cc62d MW |
1022 | def __contains__(me, k): |
1023 | return k in me.map | |
1024 | def __getitem__(me, k): | |
1025 | i = me.map[k] | |
1026 | if me.i[i] is None: | |
1027 | me.i[i] = me.nth(i) | |
1028 | return me.i[i] | |
1029 | def __setitem__(me, k, v): | |
1030 | raise TypeError, "immutable object" | |
1031 | def __iter__(me): | |
1032 | return iter(me.map) | |
96851f5d MW |
1033 | def iterkeys(me): |
1034 | return iter(me.map) | |
1035 | def itervalues(me): | |
1036 | for k in me: | |
1037 | yield me[k] | |
1038 | def iteritems(me): | |
1039 | for k in me: | |
1040 | yield k, me[k] | |
ed8cc62d MW |
1041 | def keys(me): |
1042 | return [k for k in me] | |
1043 | def values(me): | |
1044 | return [me[k] for k in me] | |
96851f5d MW |
1045 | def items(me): |
1046 | return [(k, me[k]) for k in me] | |
ed8cc62d MW |
1047 | eccurves = _groupmap(_base._eccurves, ECInfo._curven) |
1048 | primegroups = _groupmap(_base._pgroups, DHInfo._groupn) | |
1049 | bingroups = _groupmap(_base._bingroups, BinDHInfo._groupn) | |
1050 | ||
00401529 MW |
1051 | ###-------------------------------------------------------------------------- |
1052 | ### Prime number generation. | |
ed8cc62d MW |
1053 | |
1054 | class PrimeGenEventHandler (object): | |
1055 | def pg_begin(me, ev): | |
1056 | return me.pg_try(ev) | |
1057 | def pg_done(me, ev): | |
1058 | return PGEN_DONE | |
1059 | def pg_abort(me, ev): | |
1060 | return PGEN_TRY | |
1061 | def pg_fail(me, ev): | |
1062 | return PGEN_TRY | |
1063 | def pg_pass(me, ev): | |
1064 | return PGEN_TRY | |
d7ab1bab | 1065 | |
1066 | class SophieGermainStepJump (object): | |
1067 | def pg_begin(me, ev): | |
1068 | me.lf = PrimeFilter(ev.x) | |
1069 | me.hf = me.lf.muladd(2, 1) | |
1070 | return me.cont(ev) | |
1071 | def pg_try(me, ev): | |
1072 | me.step() | |
1073 | return me.cont(ev) | |
1074 | def cont(me, ev): | |
1075 | while me.lf.status == PGEN_FAIL or me.hf.status == PGEN_FAIL: | |
1076 | me.step() | |
1077 | if me.lf.status == PGEN_ABORT or me.hf.status == PGEN_ABORT: | |
1078 | return PGEN_ABORT | |
1079 | ev.x = me.lf.x | |
1080 | if me.lf.status == PGEN_DONE and me.hf.status == PGEN_DONE: | |
1081 | return PGEN_DONE | |
1082 | return PGEN_TRY | |
1083 | def pg_done(me, ev): | |
1084 | del me.lf | |
1085 | del me.hf | |
1086 | ||
1087 | class SophieGermainStepper (SophieGermainStepJump): | |
1088 | def __init__(me, step): | |
1089 | me.lstep = step; | |
1090 | me.hstep = 2 * step | |
1091 | def step(me): | |
1092 | me.lf.step(me.lstep) | |
1093 | me.hf.step(me.hstep) | |
1094 | ||
1095 | class SophieGermainJumper (SophieGermainStepJump): | |
1096 | def __init__(me, jump): | |
1097 | me.ljump = PrimeFilter(jump); | |
1098 | me.hjump = me.ljump.muladd(2, 0) | |
1099 | def step(me): | |
1100 | me.lf.jump(me.ljump) | |
1101 | me.hf.jump(me.hjump) | |
1102 | def pg_done(me, ev): | |
1103 | del me.ljump | |
1104 | del me.hjump | |
1105 | SophieGermainStepJump.pg_done(me, ev) | |
1106 | ||
1107 | class SophieGermainTester (object): | |
1108 | def __init__(me): | |
1109 | pass | |
1110 | def pg_begin(me, ev): | |
1111 | me.lr = RabinMiller(ev.x) | |
1112 | me.hr = RabinMiller(2 * ev.x + 1) | |
1113 | def pg_try(me, ev): | |
1114 | lst = me.lr.test(ev.rng.range(me.lr.x)) | |
1115 | if lst != PGEN_PASS and lst != PGEN_DONE: | |
1116 | return lst | |
1117 | rst = me.hr.test(ev.rng.range(me.hr.x)) | |
1118 | if rst != PGEN_PASS and rst != PGEN_DONE: | |
1119 | return rst | |
1120 | if lst == PGEN_DONE and rst == PGEN_DONE: | |
1121 | return PGEN_DONE | |
1122 | return PGEN_PASS | |
1123 | def pg_done(me, ev): | |
1124 | del me.lr | |
1125 | del me.hr | |
1126 | ||
d7ab1bab | 1127 | class PrimitiveStepper (PrimeGenEventHandler): |
1128 | def __init__(me): | |
1129 | pass | |
1130 | def pg_try(me, ev): | |
1131 | ev.x = me.i.next() | |
1132 | return PGEN_TRY | |
1133 | def pg_begin(me, ev): | |
1134 | me.i = iter(smallprimes) | |
1135 | return me.pg_try(ev) | |
1136 | ||
1137 | class PrimitiveTester (PrimeGenEventHandler): | |
1138 | def __init__(me, mod, hh = [], exp = None): | |
1139 | me.mod = MPMont(mod) | |
1140 | me.exp = exp | |
1141 | me.hh = hh | |
1142 | def pg_try(me, ev): | |
1143 | x = ev.x | |
1144 | if me.exp is not None: | |
1145 | x = me.mod.exp(x, me.exp) | |
1146 | if x == 1: return PGEN_FAIL | |
1147 | for h in me.hh: | |
1148 | if me.mod.exp(x, h) == 1: return PGEN_FAIL | |
1149 | ev.x = x | |
1150 | return PGEN_DONE | |
1151 | ||
1152 | class SimulStepper (PrimeGenEventHandler): | |
1153 | def __init__(me, mul = 2, add = 1, step = 2): | |
1154 | me.step = step | |
1155 | me.mul = mul | |
1156 | me.add = add | |
1157 | def _stepfn(me, step): | |
1158 | if step <= 0: | |
1159 | raise ValueError, 'step must be positive' | |
1160 | if step <= MPW_MAX: | |
1161 | return lambda f: f.step(step) | |
1162 | j = PrimeFilter(step) | |
1163 | return lambda f: f.jump(j) | |
1164 | def pg_begin(me, ev): | |
1165 | x = ev.x | |
1166 | me.lf = PrimeFilter(x) | |
1167 | me.hf = PrimeFilter(x * me.mul + me.add) | |
1168 | me.lstep = me._stepfn(me.step) | |
1169 | me.hstep = me._stepfn(me.step * me.mul) | |
1170 | SimulStepper._cont(me, ev) | |
1171 | def pg_try(me, ev): | |
1172 | me._step() | |
1173 | me._cont(ev) | |
1174 | def _step(me): | |
1175 | me.lstep(me.lf) | |
1176 | me.hstep(me.hf) | |
1177 | def _cont(me, ev): | |
1178 | while me.lf.status == PGEN_FAIL or me.hf.status == PGEN_FAIL: | |
1179 | me._step() | |
1180 | if me.lf.status == PGEN_ABORT or me.hf.status == PGEN_ABORT: | |
1181 | return PGEN_ABORT | |
1182 | ev.x = me.lf.x | |
1183 | if me.lf.status == PGEN_DONE and me.hf.status == PGEN_DONE: | |
1184 | return PGEN_DONE | |
1185 | return PGEN_TRY | |
1186 | def pg_done(me, ev): | |
1187 | del me.lf | |
1188 | del me.hf | |
1189 | del me.lstep | |
1190 | del me.hstep | |
1191 | ||
1192 | class SimulTester (PrimeGenEventHandler): | |
1193 | def __init__(me, mul = 2, add = 1): | |
1194 | me.mul = mul | |
1195 | me.add = add | |
1196 | def pg_begin(me, ev): | |
1197 | x = ev.x | |
1198 | me.lr = RabinMiller(x) | |
1199 | me.hr = RabinMiller(x * me.mul + me.add) | |
1200 | def pg_try(me, ev): | |
1201 | lst = me.lr.test(ev.rng.range(me.lr.x)) | |
1202 | if lst != PGEN_PASS and lst != PGEN_DONE: | |
1203 | return lst | |
1204 | rst = me.hr.test(ev.rng.range(me.hr.x)) | |
1205 | if rst != PGEN_PASS and rst != PGEN_DONE: | |
1206 | return rst | |
1207 | if lst == PGEN_DONE and rst == PGEN_DONE: | |
1208 | return PGEN_DONE | |
1209 | return PGEN_PASS | |
1210 | def pg_done(me, ev): | |
1211 | del me.lr | |
1212 | del me.hr | |
1213 | ||
1214 | def sgprime(start, step = 2, name = 'p', event = pgen_nullev, nsteps = 0): | |
1215 | start = MP(start) | |
1216 | return pgen(start, name, SimulStepper(step = step), SimulTester(), event, | |
00401529 | 1217 | nsteps, RabinMiller.iters(start.nbits)) |
d7ab1bab | 1218 | |
1219 | def findprimitive(mod, hh = [], exp = None, name = 'g', event = pgen_nullev): | |
1220 | return pgen(0, name, PrimitiveStepper(), PrimitiveTester(mod, hh, exp), | |
00401529 | 1221 | event, 0, 1) |
d7ab1bab | 1222 | |
1223 | def kcdsaprime(pbits, qbits, rng = rand, | |
00401529 | 1224 | event = pgen_nullev, name = 'p', nsteps = 0): |
d7ab1bab | 1225 | hbits = pbits - qbits |
1226 | h = pgen(rng.mp(hbits, 1), name + ' [h]', | |
00401529 MW |
1227 | PrimeGenStepper(2), PrimeGenTester(), |
1228 | event, nsteps, RabinMiller.iters(hbits)) | |
d7ab1bab | 1229 | q = pgen(rng.mp(qbits, 1), name, SimulStepper(2 * h, 1, 2), |
00401529 | 1230 | SimulTester(2 * h, 1), event, nsteps, RabinMiller.iters(qbits)) |
d7ab1bab | 1231 | p = 2 * q * h + 1 |
1232 | return p, q, h | |
1233 | ||
1234 | #----- That's all, folks ---------------------------------------------------- |