3 ### Setup for Catacomb/Python bindings
5 ### (c) 2004 Straylight/Edgeware
8 ###----- Licensing notice ---------------------------------------------------
10 ### This file is part of the Python interface to Catacomb.
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.
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.
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.
26 from __future__
import with_statement
28 from binascii
import hexlify
as _hexify
, unhexlify
as _unhexify
29 from contextlib
import contextmanager
as _ctxmgr
30 try: import DLFCN
as _dlfcn
31 except ImportError: _dlfcn
= None
33 from struct
import pack
as _pack
35 import types
as _types
37 ###--------------------------------------------------------------------------
38 ### Import the main C extension module.
41 _dlflags
= _odlflags
= _sys
.getdlopenflags()
42 except AttributeError:
43 _dlflags
= _odlflags
= -1
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.
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
)
61 _sys
.setdlopenflags(_odlflags
)
63 del _dlflags
, _odlflags
65 ###--------------------------------------------------------------------------
68 ## For the benefit of the default keyreporter, we need the program name.
69 _base
._ego(_sys
.argv
[0])
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
80 ## How to fix a name back into the right identifier. Alas, the rules are not
84 ## Hyphens consistently become underscores.
85 name
= name
.replace('-', '_')
87 ## But slashes might become underscores or just vanish.
88 if name
.startswith('salsa20'): name
= name
.replace('/', '')
89 else: name
= name
.replace('/', '_')
94 ## Initialize the module. Drag in the static methods of the various
95 ## classes; create names for the various known crypto algorithms.
102 for i
in [gcciphers
, gcaeads
, gchashes
, gcmacs
, gcprps
]:
103 for c
in i
.itervalues():
104 d
[_fixname(c
.name
)] = c
105 for c
in gccrands
.itervalues():
106 d
[_fixname(c
.name
+ 'rand')] = c
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
113 for i
in cc
.__dict__
:
115 if type(a
) is _types
.MethodType
:
117 elif type(a
) not in (_types
.FunctionType
, staticmethod, classmethod):
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
127 raise SyntaxError, 'junk at end of string'
130 ## Some pretty-printing utilities.
131 PRINT_SECRETS
= False
132 def _clsname(me
): return type(me
).__name__
133 def _repr_secret(thing
, secretp
= True):
134 if not secretp
or PRINT_SECRETS
: return repr(thing
)
135 else: return '#<SECRET>'
136 def _pp_str(me
, pp
, cyclep
): pp
.text(cyclep
and '...' or str(me
))
137 def _pp_secret(pp
, thing
, secretp
= True):
138 if not secretp
or PRINT_SECRETS
: pp
.pretty(thing
)
139 else: pp
.text('#<SECRET>')
140 def _pp_bgroup(pp
, text
):
142 pp
.begin_group(ind
, text
)
144 def _pp_bgroup_tyname(pp
, obj
, open = '('):
145 return _pp_bgroup(pp
, _clsname(obj
) + open)
146 def _pp_kv(pp
, k
, v
, secretp
= False):
147 ind
= _pp_bgroup(pp
, k
+ ' = ')
148 _pp_secret(pp
, v
, secretp
)
149 pp
.end_group(ind
, '')
150 def _pp_commas(pp
, printfn
, items
):
153 if firstp
: firstp
= False
154 else: pp
.text(','); pp
.breakable()
156 def _pp_dict(pp
, items
):
166 _pp_commas(pp
, p
, items
)
168 ###--------------------------------------------------------------------------
173 return ByteString(_unhexify(x
))
174 fromhex
= staticmethod(fromhex
)
178 return 'bytes(%r)' %
hex(me
)
179 _augment(ByteString
, _tmp
)
180 ByteString
.__hash__
= str.__hash__
181 bytes
= ByteString
.fromhex
183 ###--------------------------------------------------------------------------
184 ### Symmetric encryption.
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
)
193 c1
, t
= e
.done(aad
= a
)
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
)
200 m
+= d
.done(t
, aad
= a
)
202 _augment(GAEKey
, _tmp
)
204 ###--------------------------------------------------------------------------
210 return ctstreq(h
, hh
)
211 _augment(GHash
, _tmp
)
212 _augment(Poly1305Hash
, _tmp
)
214 class _HashBase (object):
215 ## The standard hash methods. Assume that `hash' is defined and returns
217 def _check_range(me
, n
, max):
218 if not (0 <= n
<= max): raise OverflowError("out of range")
220 me
._check_range(n
, 0xff)
221 return me
.hash(_pack('B', n
))
223 me
._check_range(n
, 0xffff)
224 return me
.hash(_pack('<H', n
))
226 me
._check_range(n
, 0xffff)
227 return me
.hash(_pack('>H', n
))
230 me
._check_range(n
, 0xffffffff)
231 return me
.hash(_pack('<L', n
))
233 me
._check_range(n
, 0xffffffff)
234 return me
.hash(_pack('>L', n
))
237 me
._check_range(n
, 0xffffffffffffffff)
238 return me
.hash(_pack('<Q', n
))
240 me
._check_range(n
, 0xffffffffffffffff)
241 return me
.hash(_pack('>Q', n
))
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)
255 class _ShakeBase (_HashBase
):
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
)
263 ## Delegate methods...
264 def copy(me
): new
= me
.__class__
._bare_new(); new
._copy(me
); return new
265 def _copy(me
, other
): me
._h
= other
._h
.copy()
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
)))
273 def state(me
): return me
._h
.state
275 def buffered(me
): return me
._h
.buffered
277 def rate(me
): return me
._h
.rate
279 def _bare_new(cls
): return cls()
283 return ctstreq(h
, me
.done(len(h
)))
286 return me
.hashu8(len(nn
)).hash(nn
)
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
])
302 _augment(Shake
, _tmp
)
303 _augment(_ShakeBase
, _tmp
)
304 Shake
._Z
= _ShakeBase
._Z
= ByteString
.zero(200)
306 class KMAC (_ShakeBase
):
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
314 return super(KMAC
, me
).done(n
)
317 return super(KMAC
, me
).xof()
319 def _bare_new(cls
): return cls("")
321 class KMAC128 (KMAC
): _SHAKE
= Shake128
; _TAGSZ
= 16
322 class KMAC256 (KMAC
): _SHAKE
= Shake256
; _TAGSZ
= 32
324 ###--------------------------------------------------------------------------
325 ### NaCl `secretbox'.
327 def secret_box(k
, n
, m
):
328 y
, t
= salsa20_naclbox(k
).encrypt(n
, m
)
331 def secret_unbox(k
, n
, c
):
333 return salsa20_naclbox(k
).decrypt(n
, c
[tsz
:], c
[0:tsz
])
335 ###--------------------------------------------------------------------------
336 ### Multiprecision integers and binary polynomials.
339 if isinstance(x
, BaseRat
): return x
._n
, x
._d
341 class BaseRat (object):
342 """Base class implementing fields of fractions over Euclidean domains."""
343 def __new__(cls
, a
, b
):
344 a
, b
= cls
.RING(a
), cls
.RING(b
)
348 me
= super(BaseRat
, cls
).__new__(cls
)
353 def numer(me
): return me
._n
355 def denom(me
): return me
._d
356 def __str__(me
): return '%s/%s' %
(me
._n
, me
._d
)
357 def __repr__(me
): return '%s(%s, %s)' %
(_clsname(me
), me
._n
, me
._d
)
358 _repr_pretty_
= _pp_str
360 def __add__(me
, you
):
361 n
, d
= _split_rat(you
)
362 return type(me
)(me
._n
*d
+ n
*me
._d
, d
*me
._d
)
364 def __sub__(me
, you
):
365 n
, d
= _split_rat(you
)
366 return type(me
)(me
._n
*d
- n
*me
._d
, d
*me
._d
)
367 def __rsub__(me
, you
):
368 n
, d
= _split_rat(you
)
369 return type(me
)(n
*me
._d
- me
._n
*d
, d
*me
._d
)
370 def __mul__(me
, you
):
371 n
, d
= _split_rat(you
)
372 return type(me
)(me
._n
*n
, me
._d
*d
)
374 def __truediv__(me
, you
):
375 n
, d
= _split_rat(you
)
376 return type(me
)(me
._n
*d
, me
._d
*n
)
377 def __rtruediv__(me
, you
):
378 n
, d
= _split_rat(you
)
379 return type(me
)(me
._d
*n
, me
._n
*d
)
380 __div__
= __truediv__
381 __rdiv__
= __rtruediv__
382 def __cmp__(me
, you
):
383 n
, d
= _split_rat(you
)
384 return cmp(me
._n
*d
, n
*me
._d
)
385 def __rcmp__(me
, you
):
386 n
, d
= _split_rat(you
)
387 return cmp(n
*me
._d
, me
._n
*d
)
389 class IntRat (BaseRat
):
392 class GFRat (BaseRat
):
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
)
404 def __truediv__(me
, you
): return IntRat(me
, you
)
405 def __rtruediv__(me
, you
): return IntRat(you
, me
)
406 __div__
= __truediv__
407 __rdiv__
= __rtruediv__
408 _repr_pretty_
= _pp_str
412 def zerop(x
): return x
== 0
413 def reduce(x
): return GFReduce(x
)
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
)
418 def __truediv__(me
, you
): return GFRat(me
, you
)
419 def __rtruediv__(me
, you
): return GFRat(you
, me
)
420 __div__
= __truediv__
421 __rdiv__
= __rtruediv__
422 _repr_pretty_
= _pp_str
427 'product(ITERABLE) or product(I, ...) -> PRODUCT'
428 return MPMul(*arg
).done()
429 product
= staticmethod(product
)
430 _augment(MPMul
, _tmp
)
432 ###--------------------------------------------------------------------------
436 def fromstring(str): return _checkend(Field
.parse(str))
437 fromstring
= staticmethod(fromstring
)
438 _augment(Field
, _tmp
)
441 def __repr__(me
): return '%s(%sL)' %
(_clsname(me
), me
.p
)
442 def __hash__(me
): return 0x114401de ^
hash(me
.p
)
443 def _repr_pretty_(me
, pp
, cyclep
):
444 ind
= _pp_bgroup_tyname(pp
, me
)
445 if cyclep
: pp
.text('...')
446 else: pp
.pretty(me
.p
)
447 pp
.end_group(ind
, ')')
448 def ec(me
, a
, b
): return ECPrimeProjCurve(me
, a
, b
)
449 _augment(PrimeField
, _tmp
)
452 def __repr__(me
): return '%s(%#xL)' %
(_clsname(me
), me
.p
)
453 def ec(me
, a
, b
): return ECBinProjCurve(me
, a
, b
)
454 def _repr_pretty_(me
, pp
, cyclep
):
455 ind
= _pp_bgroup_tyname(pp
, me
)
456 if cyclep
: pp
.text('...')
457 else: pp
.text('%#x' % me
.p
)
458 pp
.end_group(ind
, ')')
459 _augment(BinField
, _tmp
)
462 def __hash__(me
): return 0x23e4701c ^
hash(me
.p
)
463 _augment(BinPolyField
, _tmp
)
469 h ^
= 2*hash(me
.beta
) & 0xffffffff
471 _augment(BinNormField
, _tmp
)
474 def __str__(me
): return str(me
.value
)
475 def __repr__(me
): return '%s(%s)' %
(repr(me
.field
), repr(me
.value
))
476 _repr_pretty_
= _pp_str
479 ###--------------------------------------------------------------------------
484 return '%s(%r, %s, %s)' %
(_clsname(me
), me
.field
, me
.a
, me
.b
)
485 def _repr_pretty_(me
, pp
, cyclep
):
486 ind
= _pp_bgroup_tyname(pp
, me
)
490 pp
.pretty(me
.field
); pp
.text(','); pp
.breakable()
491 pp
.pretty(me
.a
); pp
.text(','); pp
.breakable()
493 pp
.end_group(ind
, ')')
495 return ecpt
.frombuf(me
, s
)
497 return ecpt
.fromraw(me
, s
)
500 _augment(ECCurve
, _tmp
)
506 h ^
= 2*hash(me
.a
) ^
0xffffffff
507 h ^
= 5*hash(me
.b
) ^
0xffffffff
509 _augment(ECPrimeCurve
, _tmp
)
515 h ^
= 2*hash(me
.a
) ^
0xffffffff
516 h ^
= 5*hash(me
.b
) ^
0xffffffff
518 _augment(ECBinCurve
, _tmp
)
522 if not me
: return '%s()' %
_clsname(me
)
523 return '%s(%s, %s)' %
(_clsname(me
), me
.ix
, me
.iy
)
525 if not me
: return 'inf'
526 return '(%s, %s)' %
(me
.ix
, me
.iy
)
527 def _repr_pretty_(me
, pp
, cyclep
):
533 ind
= _pp_bgroup(pp
, '(')
534 pp
.pretty(me
.ix
); pp
.text(','); pp
.breakable()
536 pp
.end_group(ind
, ')')
541 return '%s(curve = %r, G = %r, r = %s, h = %s)' % \
542 (_clsname(me
), me
.curve
, me
.G
, me
.r
, me
.h
)
543 def _repr_pretty_(me
, pp
, cyclep
):
544 ind
= _pp_bgroup_tyname(pp
, me
)
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
)
552 pp
.end_group(ind
, ')')
556 h ^
= 2*hash(me
.G
) & 0xffffffff
560 _augment(ECInfo
, _tmp
)
564 if not me
: return '%r()' %
(me
.curve
)
565 return '%r(%s, %s)' %
(me
.curve
, me
.x
, me
.y
)
567 if not me
: return 'inf'
568 return '(%s, %s)' %
(me
.x
, me
.y
)
569 def _repr_pretty_(me
, pp
, cyclep
):
575 ind
= _pp_bgroup(pp
, '(')
576 pp
.pretty(me
.x
); pp
.text(','); pp
.breakable()
578 pp
.end_group(ind
, ')')
579 _augment(ECPtCurve
, _tmp
)
581 ###--------------------------------------------------------------------------
585 def __repr__(me
): return '%s(%d)' %
(_clsname(me
), me
.default
)
586 def check(me
, sz
): return True
587 def best(me
, sz
): return sz
588 def pad(me
, sz
): return sz
589 _augment(KeySZAny
, _tmp
)
593 return '%s(%d, %d, %d, %d)' % \
594 (_clsname(me
), me
.default
, me
.min, me
.max, me
.mod
)
595 def _repr_pretty_(me
, pp
, cyclep
):
596 ind
= _pp_bgroup_tyname(pp
, me
)
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()
604 pp
.end_group(ind
, ')')
605 def check(me
, sz
): return me
.min <= sz
<= me
.max and sz
%me
.mod
== 0
607 if sz
< me
.min: raise ValueError, 'key too small'
608 elif sz
> me
.max: return me
.max
609 else: return sz
- sz
%me
.mod
611 if sz
> me
.max: raise ValueError, 'key too large'
612 elif sz
< me
.min: return me
.min
613 else: sz
+= me
.mod
- 1; return sz
- sz
%me
.mod
614 _augment(KeySZRange
, _tmp
)
617 def __repr__(me
): return '%s(%d, %s)' %
(_clsname(me
), me
.default
, me
.set)
618 def _repr_pretty_(me
, pp
, cyclep
):
619 ind
= _pp_bgroup_tyname(pp
, me
)
623 pp
.pretty(me
.default
); pp
.text(','); pp
.breakable()
624 ind1
= _pp_bgroup(pp
, '{')
625 _pp_commas(pp
, pp
.pretty
, me
.set)
626 pp
.end_group(ind1
, '}')
627 pp
.end_group(ind
, ')')
628 def check(me
, sz
): return sz
in me
.set
632 if found
< i
<= sz
: found
= i
633 if found
< 0: raise ValueError, 'key too small'
638 if sz
<= i
and (found
== -1 or i
< found
): found
= i
639 if found
< 0: raise ValueError, 'key too large'
641 _augment(KeySZSet
, _tmp
)
643 ###--------------------------------------------------------------------------
644 ### Key data objects.
647 def __repr__(me
): return '%s(%r)' %
(_clsname(me
), me
.name
)
648 _augment(KeyFile
, _tmp
)
651 def __repr__(me
): return '%s(%r)' %
(_clsname(me
), me
.fulltag
)
656 return '%s({%s})' %
(_clsname(me
),
657 ', '.join(['%r: %r' % kv
for kv
in me
.iteritems()]))
658 def _repr_pretty_(me
, pp
, cyclep
):
659 ind
= _pp_bgroup_tyname(pp
, me
)
660 if cyclep
: pp
.text('...')
661 else: _pp_dict(pp
, me
.iteritems())
662 pp
.end_group(ind
, ')')
663 _augment(KeyAttributes
, _tmp
)
667 return '%s(%s, %r)' %
(_clsname(me
),
668 _repr_secret(me
._guts(),
669 not (me
.flags
& KF_NONSECRET
)),
670 me
.writeflags(me
.flags
))
671 def _repr_pretty_(me
, pp
, cyclep
):
672 ind
= _pp_bgroup_tyname(pp
, me
)
676 _pp_secret(pp
, me
._guts(), not (me
.flags
& KF_NONSECRET
))
677 pp
.text(','); pp
.breakable()
678 pp
.pretty(me
.writeflags(me
.flags
))
679 pp
.end_group(ind
, ')')
680 _augment(KeyData
, _tmp
)
683 def _guts(me
): return me
.bin
684 _augment(KeyDataBinary
, _tmp
)
687 def _guts(me
): return me
.ct
688 _augment(KeyDataEncrypted
, _tmp
)
691 def _guts(me
): return me
.mp
692 _augment(KeyDataMP
, _tmp
)
695 def _guts(me
): return me
.str
696 _augment(KeyDataString
, _tmp
)
699 def _guts(me
): return me
.ecpt
700 _augment(KeyDataECPt
, _tmp
)
704 return '%s({%s})' %
(_clsname(me
),
705 ', '.join(['%r: %r' % kv
for kv
in me
.iteritems()]))
706 def _repr_pretty_(me
, pp
, cyclep
):
707 ind
= _pp_bgroup_tyname(pp
, me
, '({ ')
708 if cyclep
: pp
.text('...')
709 else: _pp_dict(pp
, me
.iteritems())
710 pp
.end_group(ind
, ' })')
711 _augment(KeyDataStructured
, _tmp
)
713 ###--------------------------------------------------------------------------
718 return '%s(p = %s, r = %s, g = %s)' %
(_clsname(me
), me
.p
, me
.r
, me
.g
)
719 def _repr_pretty_(me
, pp
, cyclep
):
720 ind
= _pp_bgroup_tyname(pp
, me
)
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
)
727 pp
.end_group(ind
, ')')
728 _augment(FGInfo
, _tmp
)
731 def group(me
): return PrimeGroup(me
)
732 _augment(DHInfo
, _tmp
)
735 def group(me
): return BinGroup(me
)
736 _augment(BinDHInfo
, _tmp
)
740 return '%s(%r)' %
(_clsname(me
), me
.info
)
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
, ')')
746 _augment(Group
, _tmp
)
753 h ^
= 2*hash(info
.r
) & 0xffffffff
754 h ^
= 5*hash(info
.g
) & 0xffffffff
756 def _get_geval(me
, x
): return MP(x
)
757 _augment(PrimeGroup
, _tmp
)
764 h ^
= 2*hash(info
.r
) & 0xffffffff
765 h ^
= 5*hash(info
.g
) & 0xffffffff
767 def _get_geval(me
, x
): return GF(x
)
768 _augment(BinGroup
, _tmp
)
771 def __hash__(me
): return 0x0ec23dab ^
hash(me
.info
)
772 def _get_geval(me
, x
): return x
.toec()
773 _augment(ECGroup
, _tmp
)
777 return '%r(%r)' %
(me
.group
, str(me
))
778 def _repr_pretty_(me
, pp
, cyclep
):
779 pp
.pretty(type(me
)._get_geval(me
))
782 ###--------------------------------------------------------------------------
783 ### RSA encoding techniques.
785 class PKCS1Crypt (object):
786 def __init__(me
, ep
= '', rng
= rand
):
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
)
794 class PKCS1Sig (object):
795 def __init__(me
, ep
= '', rng
= rand
):
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
)
804 def __init__(me
, mgf
= sha_mgf
, hash = sha
, ep
= '', rng
= rand
):
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
)
815 def __init__(me
, mgf
= sha_mgf
, hash = sha
, saltsz
= None, rng
= rand
):
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
,
826 me
.mgf
, me
.hash, me
.saltsz
, me
.rng
)
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
)
834 x
= enc
.decode(msg
, me
.pubop(sig
), me
.n
.nbits
)
835 return x
is None or x
== msg
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
)
845 _pp_kv(pp
, 'n', me
.n
); pp
.text(','); pp
.breakable()
846 _pp_kv(pp
, 'e', me
.e
)
847 pp
.end_group(ind
, ')')
848 _augment(RSAPub
, _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
))
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
)
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
, ')')
873 _augment(RSAPriv
, _tmp
)
875 ###--------------------------------------------------------------------------
876 ### DSA and related schemes.
879 def __repr__(me
): return '%s(G = %r, p = %r, hash = %r)' % \
880 (_clsname(me
), me
.G
, me
.p
, me
.hash)
881 def _repr_pretty_(me
, pp
, cyclep
):
882 ind
= _pp_bgroup_tyname(pp
, me
)
886 _pp_kv(pp
, 'G', me
.G
); pp
.text(','); pp
.breakable()
887 _pp_kv(pp
, 'p', me
.p
); pp
.text(','); pp
.breakable()
888 _pp_kv(pp
, 'hash', me
.hash)
889 pp
.end_group(ind
, ')')
890 _augment(DSAPub
, _tmp
)
891 _augment(KCDSAPub
, _tmp
)
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)
896 def _repr_pretty_(me
, pp
, cyclep
):
897 ind
= _pp_bgroup_tyname(pp
, me
)
901 _pp_kv(pp
, 'G', me
.G
); pp
.text(','); pp
.breakable()
902 _pp_kv(pp
, 'u', me
.u
, True); pp
.text(','); pp
.breakable()
903 _pp_kv(pp
, 'p', me
.p
); pp
.text(','); pp
.breakable()
904 _pp_kv(pp
, 'hash', me
.hash)
905 pp
.end_group(ind
, ')')
906 _augment(DSAPriv
, _tmp
)
907 _augment(KCDSAPriv
, _tmp
)
909 ###--------------------------------------------------------------------------
910 ### Bernstein's elliptic curve crypto and related schemes.
912 X25519_BASE
= MP(9).storel(32)
913 X448_BASE
= MP(5).storel(56)
915 Z128
= ByteString
.zero(16)
917 class _BasePub (object):
918 def __init__(me
, pub
, *args
, **kw
):
919 if not me
._PUBSZ
.check(len(pub
)): raise ValueError, 'bad public key'
920 super(_BasePub
, me
).__init__(*args
, **kw
)
922 def __repr__(me
): return '%s(pub = %r)' %
(_clsname(me
), me
.pub
)
923 def _pp(me
, pp
): _pp_kv(pp
, 'pub', me
.pub
)
924 def _repr_pretty_(me
, pp
, cyclep
):
925 ind
= _pp_bgroup_tyname(pp
, me
)
926 if cyclep
: pp
.text('...')
928 pp
.end_group(ind
, ')')
930 class _BasePriv (object):
931 def __init__(me
, priv
, pub
= None, *args
, **kw
):
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
)
937 def generate(cls
, rng
= rand
):
938 return cls(rng
.block(cls
._KEYSZ
.default
))
940 return '%s(priv = %d, pub = %r)' % \
941 (_clsname(me
), _repr_secret(me
.priv
), me
.pub
)
943 _pp_kv(pp
, 'priv', me
.priv
, secretp
= True); pp
.text(','); pp
.breakable()
944 super(_BasePriv
, me
)._pp(pp
)
946 class _XDHPub (_BasePub
): pass
948 class _XDHPriv (_BasePriv
):
949 def _pubkey(me
, priv
): return me
._op(priv
, me
._BASE
)
950 def agree(me
, you
): return me
._op(me
.priv
, you
.pub
)
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
)
955 class X25519Pub (_XDHPub
):
956 _PUBSZ
= KeySZSet(X25519_PUBSZ
)
959 class X25519Priv (_XDHPriv
, X25519Pub
):
960 _KEYSZ
= KeySZSet(X25519_KEYSZ
)
961 def _op(me
, k
, X
): return x25519(k
, X
)
962 def _hashkey(me
, z
): return hsalsa20_prf(z
, Z128
)
964 class X448Pub (_XDHPub
):
965 _PUBSZ
= KeySZSet(X448_PUBSZ
)
968 class X448Priv (_XDHPriv
, X448Pub
):
969 _KEYSZ
= KeySZSet(X448_KEYSZ
)
970 def _op(me
, k
, X
): return x448(k
, X
)
971 def _hashkey(me
, z
): return Shake256().hash(z
).done(salsa20
.keysz
.default
)
973 class _EdDSAPub (_BasePub
):
974 def beginhash(me
): return me
._HASH()
975 def endhash(me
, h
): return h
.done()
977 class _EdDSAPriv (_BasePriv
, _EdDSAPub
):
980 class Ed25519Pub (_EdDSAPub
):
981 _PUBSZ
= KeySZSet(ED25519_PUBSZ
)
983 def verify(me
, msg
, sig
, **kw
):
984 return ed25519_verify(me
.pub
, msg
, sig
, **kw
)
986 class Ed25519Priv (_EdDSAPriv
, Ed25519Pub
):
987 _KEYSZ
= KeySZAny(ED25519_KEYSZ
)
988 def _pubkey(me
, priv
): return ed25519_pubkey(priv
)
989 def sign(me
, msg
, **kw
):
990 return ed25519_sign(me
.priv
, msg
, pub
= me
.pub
, **kw
)
992 class Ed448Pub (_EdDSAPub
):
993 _PUBSZ
= KeySZSet(ED448_PUBSZ
)
995 def verify(me
, msg
, sig
, **kw
):
996 return ed448_verify(me
.pub
, msg
, sig
, **kw
)
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
)
1004 ###--------------------------------------------------------------------------
1005 ### Built-in algorithm and group tables.
1009 return '{%s}' %
', '.join(['%r: %r' % kv
for kv
in me
.iteritems()])
1010 def _repr_pretty_(me
, pp
, cyclep
):
1011 ind
= _pp_bgroup(pp
, '{ ')
1012 if cyclep
: pp
.text('...')
1013 else: _pp_dict(pp
, me
.iteritems())
1014 pp
.end_group(ind
, ' }')
1015 _augment(_base
._MiscTable
, _tmp
)
1017 ###--------------------------------------------------------------------------
1018 ### Prime number generation.
1020 class PrimeGenEventHandler (object):
1021 def pg_begin(me
, ev
):
1022 return me
.pg_try(ev
)
1023 def pg_done(me
, ev
):
1025 def pg_abort(me
, ev
):
1027 def pg_fail(me
, ev
):
1029 def pg_pass(me
, ev
):
1032 class SophieGermainStepJump (object):
1033 def pg_begin(me
, ev
):
1034 me
.lf
= PrimeFilter(ev
.x
)
1035 me
.hf
= me
.lf
.muladd(2, 1)
1041 while me
.lf
.status
== PGEN_FAIL
or me
.hf
.status
== PGEN_FAIL
:
1043 if me
.lf
.status
== PGEN_ABORT
or me
.hf
.status
== PGEN_ABORT
:
1046 if me
.lf
.status
== PGEN_DONE
and me
.hf
.status
== PGEN_DONE
:
1049 def pg_done(me
, ev
):
1053 class SophieGermainStepper (SophieGermainStepJump
):
1054 def __init__(me
, step
):
1058 me
.lf
.step(me
.lstep
)
1059 me
.hf
.step(me
.hstep
)
1061 class SophieGermainJumper (SophieGermainStepJump
):
1062 def __init__(me
, jump
):
1063 me
.ljump
= PrimeFilter(jump
);
1064 me
.hjump
= me
.ljump
.muladd(2, 0)
1066 me
.lf
.jump(me
.ljump
)
1067 me
.hf
.jump(me
.hjump
)
1068 def pg_done(me
, ev
):
1071 SophieGermainStepJump
.pg_done(me
, ev
)
1073 class SophieGermainTester (object):
1076 def pg_begin(me
, ev
):
1077 me
.lr
= RabinMiller(ev
.x
)
1078 me
.hr
= RabinMiller(2 * ev
.x
+ 1)
1080 lst
= me
.lr
.test(ev
.rng
.range(me
.lr
.x
))
1081 if lst
!= PGEN_PASS
and lst
!= PGEN_DONE
:
1083 rst
= me
.hr
.test(ev
.rng
.range(me
.hr
.x
))
1084 if rst
!= PGEN_PASS
and rst
!= PGEN_DONE
:
1086 if lst
== PGEN_DONE
and rst
== PGEN_DONE
:
1089 def pg_done(me
, ev
):
1093 class PrimitiveStepper (PrimeGenEventHandler
):
1099 def pg_begin(me
, ev
):
1100 me
.i
= iter(smallprimes
)
1101 return me
.pg_try(ev
)
1103 class PrimitiveTester (PrimeGenEventHandler
):
1104 def __init__(me
, mod
, hh
= [], exp
= None):
1105 me
.mod
= MPMont(mod
)
1110 if me
.exp
is not None:
1111 x
= me
.mod
.exp(x
, me
.exp
)
1112 if x
== 1: return PGEN_FAIL
1114 if me
.mod
.exp(x
, h
) == 1: return PGEN_FAIL
1118 class SimulStepper (PrimeGenEventHandler
):
1119 def __init__(me
, mul
= 2, add
= 1, step
= 2):
1123 def _stepfn(me
, step
):
1125 raise ValueError, 'step must be positive'
1127 return lambda f
: f
.step(step
)
1128 j
= PrimeFilter(step
)
1129 return lambda f
: f
.jump(j
)
1130 def pg_begin(me
, ev
):
1132 me
.lf
= PrimeFilter(x
)
1133 me
.hf
= PrimeFilter(x
* me
.mul
+ me
.add
)
1134 me
.lstep
= me
._stepfn(me
.step
)
1135 me
.hstep
= me
._stepfn(me
.step
* me
.mul
)
1136 SimulStepper
._cont(me
, ev
)
1144 while me
.lf
.status
== PGEN_FAIL
or me
.hf
.status
== PGEN_FAIL
:
1146 if me
.lf
.status
== PGEN_ABORT
or me
.hf
.status
== PGEN_ABORT
:
1149 if me
.lf
.status
== PGEN_DONE
and me
.hf
.status
== PGEN_DONE
:
1152 def pg_done(me
, ev
):
1158 class SimulTester (PrimeGenEventHandler
):
1159 def __init__(me
, mul
= 2, add
= 1):
1162 def pg_begin(me
, ev
):
1164 me
.lr
= RabinMiller(x
)
1165 me
.hr
= RabinMiller(x
* me
.mul
+ me
.add
)
1167 lst
= me
.lr
.test(ev
.rng
.range(me
.lr
.x
))
1168 if lst
!= PGEN_PASS
and lst
!= PGEN_DONE
:
1170 rst
= me
.hr
.test(ev
.rng
.range(me
.hr
.x
))
1171 if rst
!= PGEN_PASS
and rst
!= PGEN_DONE
:
1173 if lst
== PGEN_DONE
and rst
== PGEN_DONE
:
1176 def pg_done(me
, ev
):
1180 def sgprime(start
, step
= 2, name
= 'p', event
= pgen_nullev
, nsteps
= 0):
1182 return pgen(start
, name
, SimulStepper(step
= step
), SimulTester(), event
,
1183 nsteps
, RabinMiller
.iters(start
.nbits
))
1185 def findprimitive(mod
, hh
= [], exp
= None, name
= 'g', event
= pgen_nullev
):
1186 return pgen(0, name
, PrimitiveStepper(), PrimitiveTester(mod
, hh
, exp
),
1189 def kcdsaprime(pbits
, qbits
, rng
= rand
,
1190 event
= pgen_nullev
, name
= 'p', nsteps
= 0):
1191 hbits
= pbits
- qbits
1192 h
= pgen(rng
.mp(hbits
, 1), name
+ ' [h]',
1193 PrimeGenStepper(2), PrimeGenTester(),
1194 event
, nsteps
, RabinMiller
.iters(hbits
))
1195 q
= pgen(rng
.mp(qbits
, 1), name
, SimulStepper(2 * h
, 1, 2),
1196 SimulTester(2 * h
, 1), event
, nsteps
, RabinMiller
.iters(qbits
))
1200 #----- That's all, folks ----------------------------------------------------