9e4d47fc82aab8a6343c230ae7e54044136e5f2e
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 ## Text/binary conversions.
83 ## Iterating over dictionaries.
84 def _iteritems(dict): return dict.iteritems()
85 def _itervalues(dict): return dict.itervalues()
87 ## How to fix a name back into the right identifier. Alas, the rules are not
91 ## Hyphens consistently become underscores.
92 name
= name
.replace('-', '_')
94 ## But slashes might become underscores or just vanish.
95 if name
.startswith('salsa20'): name
= name
.replace('/', '')
96 else: name
= name
.replace('/', '_')
101 ## Initialize the module. Drag in the static methods of the various
102 ## classes; create names for the various known crypto algorithms.
109 for i
in [gcciphers
, gcaeads
, gchashes
, gcmacs
, gcprps
]:
110 for c
in _itervalues(i
):
111 d
[_fixname(c
.name
)] = c
112 for c
in _itervalues(gccrands
):
113 d
[_fixname(c
.name
+ 'rand')] = c
116 ## A handy function for our work: add the methods of a named class to an
117 ## existing class. This is how we write the Python-implemented parts of our
120 for i
in cc
.__dict__
:
122 if type(a
) is _types
.MethodType
:
124 elif type(a
) not in (_types
.FunctionType
, staticmethod, classmethod):
128 ## Parsing functions tend to return the object parsed and the remainder of
129 ## the input. This checks that the remainder is input and, if so, returns
134 raise SyntaxError('junk at end of string')
137 ## Some pretty-printing utilities.
138 PRINT_SECRETS
= False
139 def _clsname(me
): return type(me
).__name__
140 def _repr_secret(thing
, secretp
= True):
141 if not secretp
or PRINT_SECRETS
: return repr(thing
)
142 else: return '#<SECRET>'
143 def _pp_str(me
, pp
, cyclep
): pp
.text(cyclep
and '...' or str(me
))
144 def _pp_secret(pp
, thing
, secretp
= True):
145 if not secretp
or PRINT_SECRETS
: pp
.pretty(thing
)
146 else: pp
.text('#<SECRET>')
147 def _pp_bgroup(pp
, text
):
149 pp
.begin_group(ind
, text
)
151 def _pp_bgroup_tyname(pp
, obj
, open = '('):
152 return _pp_bgroup(pp
, _clsname(obj
) + open)
153 def _pp_kv(pp
, k
, v
, secretp
= False):
154 ind
= _pp_bgroup(pp
, k
+ ' = ')
155 _pp_secret(pp
, v
, secretp
)
156 pp
.end_group(ind
, '')
157 def _pp_commas(pp
, printfn
, items
):
160 if firstp
: firstp
= False
161 else: pp
.text(','); pp
.breakable()
163 def _pp_dict(pp
, items
):
174 _pp_commas(pp
, p
, items
)
176 ###--------------------------------------------------------------------------
181 return ByteString(_unhexify(x
))
182 fromhex
= staticmethod(fromhex
)
186 return 'bytes(%r)' %
hex(me
)
187 _augment(ByteString
, _tmp
)
188 ByteString
.__hash__
= str.__hash__
189 bytes
= ByteString
.fromhex
191 ###--------------------------------------------------------------------------
192 ### Symmetric encryption.
195 def encrypt(me
, n
, m
, tsz
= None, h
= ByteString('')):
196 if tsz
is None: tsz
= me
.__class__
.tagsz
.default
197 e
= me
.enc(n
, len(h
), len(m
), tsz
)
198 if not len(h
): a
= None
199 else: a
= e
.aad().hash(h
)
201 c1
, t
= e
.done(aad
= a
)
203 def decrypt(me
, n
, c
, t
, h
= ByteString('')):
204 d
= me
.dec(n
, len(h
), len(c
), len(t
))
205 if not len(h
): a
= None
206 else: a
= d
.aad().hash(h
)
208 m
+= d
.done(t
, aad
= a
)
210 _augment(GAEKey
, _tmp
)
212 ###--------------------------------------------------------------------------
218 return ctstreq(h
, hh
)
219 _augment(GHash
, _tmp
)
220 _augment(Poly1305Hash
, _tmp
)
222 class _HashBase (object):
223 ## The standard hash methods. Assume that `hash' is defined and returns
225 def _check_range(me
, n
, max):
226 if not (0 <= n
<= max): raise OverflowError("out of range")
228 me
._check_range(n
, 0xff)
229 return me
.hash(_pack('B', n
))
231 me
._check_range(n
, 0xffff)
232 return me
.hash(_pack('<H', n
))
234 me
._check_range(n
, 0xffff)
235 return me
.hash(_pack('>H', n
))
238 me
._check_range(n
, 0xffffffff)
239 return me
.hash(_pack('<L', n
))
241 me
._check_range(n
, 0xffffffff)
242 return me
.hash(_pack('>L', n
))
245 me
._check_range(n
, 0xffffffffffffffff)
246 return me
.hash(_pack('<Q', n
))
248 me
._check_range(n
, 0xffffffffffffffff)
249 return me
.hash(_pack('>Q', n
))
251 def hashbuf8(me
, s
): return me
.hashu8(len(s
)).hash(s
)
252 def hashbuf16l(me
, s
): return me
.hashu16l(len(s
)).hash(s
)
253 def hashbuf16b(me
, s
): return me
.hashu16b(len(s
)).hash(s
)
254 hashbuf16
= hashbuf16b
255 def hashbuf32l(me
, s
): return me
.hashu32l(len(s
)).hash(s
)
256 def hashbuf32b(me
, s
): return me
.hashu32b(len(s
)).hash(s
)
257 hashbuf32
= hashbuf32b
258 def hashbuf64l(me
, s
): return me
.hashu64l(len(s
)).hash(s
)
259 def hashbuf64b(me
, s
): return me
.hashu64b(len(s
)).hash(s
)
260 hashbuf64
= hashbuf64b
261 def hashstrz(me
, s
): return me
.hash(s
).hashu8(0)
263 class _ShakeBase (_HashBase
):
265 ## Python gets really confused if I try to augment `__new__' on native
266 ## classes, so wrap and delegate. Sorry.
267 def __init__(me
, perso
= _bin(''), *args
, **kw
):
268 super(_ShakeBase
, me
).__init__(*args
, **kw
)
269 me
._h
= me
._SHAKE(perso
= perso
, func
= me
._FUNC
)
271 ## Delegate methods...
272 def copy(me
): new
= me
.__class__
._bare_new(); new
._copy(me
); return new
273 def _copy(me
, other
): me
._h
= other
._h
.copy()
274 def hash(me
, m
): me
._h
.hash(m
); return me
275 def xof(me
): me
._h
.xof(); return me
276 def get(me
, n
): return me
._h
.get(n
)
277 def mask(me
, m
): return me
._h
.mask(m
)
278 def done(me
, n
): return me
._h
.done(n
)
279 def check(me
, h
): return ctstreq(h
, me
.done(len(h
)))
281 def state(me
): return me
._h
.state
283 def buffered(me
): return me
._h
.buffered
285 def rate(me
): return me
._h
.rate
287 def _bare_new(cls
): return cls()
291 return ctstreq(h
, me
.done(len(h
)))
294 return me
.hashu8(len(nn
)).hash(nn
)
297 return me
.hash(nn
).hashu8(len(nn
))
298 def stringenc(me
, str):
299 return me
.leftenc(8*len(str)).hash(str)
300 def bytepad_before(me
):
301 return me
.leftenc(me
.rate
)
302 def bytepad_after(me
):
303 if me
.buffered
: me
.hash(me
._Z
[:me
.rate
- me
.buffered
])
310 _augment(Shake
, _tmp
)
311 _augment(_ShakeBase
, _tmp
)
312 Shake
._Z
= _ShakeBase
._Z
= ByteString
.zero(200)
314 class KMAC (_ShakeBase
):
316 def __init__(me
, k
, *arg
, **kw
):
317 super(KMAC
, me
).__init__(*arg
, **kw
)
318 with me
.bytepad(): me
.stringenc(k
)
319 def done(me
, n
= -1):
320 if n
< 0: n
= me
._TAGSZ
322 return super(KMAC
, me
).done(n
)
325 return super(KMAC
, me
).xof()
327 def _bare_new(cls
): return cls(_bin(""))
329 class KMAC128 (KMAC
): _SHAKE
= Shake128
; _TAGSZ
= 16
330 class KMAC256 (KMAC
): _SHAKE
= Shake256
; _TAGSZ
= 32
332 ###--------------------------------------------------------------------------
333 ### NaCl `secretbox'.
335 def secret_box(k
, n
, m
):
336 y
, t
= salsa20_naclbox(k
).encrypt(n
, m
)
339 def secret_unbox(k
, n
, c
):
341 return salsa20_naclbox(k
).decrypt(n
, c
[tsz
:], c
[0:tsz
])
343 ###--------------------------------------------------------------------------
344 ### Multiprecision integers and binary polynomials.
347 if isinstance(x
, BaseRat
): return x
._n
, x
._d
349 class BaseRat (object):
350 """Base class implementing fields of fractions over Euclidean domains."""
351 def __new__(cls
, a
, b
):
352 a
, b
= cls
.RING(a
), cls
.RING(b
)
356 me
= super(BaseRat
, cls
).__new__(cls
)
361 def numer(me
): return me
._n
363 def denom(me
): return me
._d
364 def __str__(me
): return '%s/%s' %
(me
._n
, me
._d
)
365 def __repr__(me
): return '%s(%s, %s)' %
(_clsname(me
), me
._n
, me
._d
)
366 _repr_pretty_
= _pp_str
368 def __add__(me
, you
):
369 n
, d
= _split_rat(you
)
370 return type(me
)(me
._n
*d
+ n
*me
._d
, d
*me
._d
)
372 def __sub__(me
, you
):
373 n
, d
= _split_rat(you
)
374 return type(me
)(me
._n
*d
- n
*me
._d
, d
*me
._d
)
375 def __rsub__(me
, you
):
376 n
, d
= _split_rat(you
)
377 return type(me
)(n
*me
._d
- me
._n
*d
, d
*me
._d
)
378 def __mul__(me
, you
):
379 n
, d
= _split_rat(you
)
380 return type(me
)(me
._n
*n
, me
._d
*d
)
382 def __truediv__(me
, you
):
383 n
, d
= _split_rat(you
)
384 return type(me
)(me
._n
*d
, me
._d
*n
)
385 def __rtruediv__(me
, you
):
386 n
, d
= _split_rat(you
)
387 return type(me
)(me
._d
*n
, me
._n
*d
)
388 __div__
= __truediv__
389 __rdiv__
= __rtruediv__
390 def __cmp__(me
, you
):
391 n
, d
= _split_rat(you
)
392 return cmp(me
._n
*d
, n
*me
._d
)
393 def __rcmp__(me
, you
):
394 n
, d
= _split_rat(you
)
395 return cmp(n
*me
._d
, me
._n
*d
)
397 class IntRat (BaseRat
):
400 class GFRat (BaseRat
):
404 def negp(x
): return x
< 0
405 def posp(x
): return x
> 0
406 def zerop(x
): return x
== 0
407 def oddp(x
): return x
.testbit(0)
408 def evenp(x
): return not x
.testbit(0)
409 def mont(x
): return MPMont(x
)
410 def barrett(x
): return MPBarrett(x
)
411 def reduce(x
): return MPReduce(x
)
412 def __truediv__(me
, you
): return IntRat(me
, you
)
413 def __rtruediv__(me
, you
): return IntRat(you
, me
)
414 __div__
= __truediv__
415 __rdiv__
= __rtruediv__
416 _repr_pretty_
= _pp_str
420 def zerop(x
): return x
== 0
421 def reduce(x
): return GFReduce(x
)
422 def trace(x
, y
): return x
.reduce().trace(y
)
423 def halftrace(x
, y
): return x
.reduce().halftrace(y
)
424 def modsqrt(x
, y
): return x
.reduce().sqrt(y
)
425 def quadsolve(x
, y
): return x
.reduce().quadsolve(y
)
426 def __truediv__(me
, you
): return GFRat(me
, you
)
427 def __rtruediv__(me
, you
): return GFRat(you
, me
)
428 __div__
= __truediv__
429 __rdiv__
= __rtruediv__
430 _repr_pretty_
= _pp_str
435 'product(ITERABLE) or product(I, ...) -> PRODUCT'
436 return MPMul(*arg
).done()
437 product
= staticmethod(product
)
438 _augment(MPMul
, _tmp
)
440 ###--------------------------------------------------------------------------
444 def fromstring(str): return _checkend(Field
.parse(str))
445 fromstring
= staticmethod(fromstring
)
446 _augment(Field
, _tmp
)
449 def __repr__(me
): return '%s(%sL)' %
(_clsname(me
), me
.p
)
450 def __hash__(me
): return 0x114401de ^
hash(me
.p
)
451 def _repr_pretty_(me
, pp
, cyclep
):
452 ind
= _pp_bgroup_tyname(pp
, me
)
453 if cyclep
: pp
.text('...')
454 else: pp
.pretty(me
.p
)
455 pp
.end_group(ind
, ')')
456 def ec(me
, a
, b
): return ECPrimeProjCurve(me
, a
, b
)
457 _augment(PrimeField
, _tmp
)
460 def __repr__(me
): return '%s(%#xL)' %
(_clsname(me
), me
.p
)
461 def ec(me
, a
, b
): return ECBinProjCurve(me
, a
, b
)
462 def _repr_pretty_(me
, pp
, cyclep
):
463 ind
= _pp_bgroup_tyname(pp
, me
)
464 if cyclep
: pp
.text('...')
465 else: pp
.text('%#x' % me
.p
)
466 pp
.end_group(ind
, ')')
467 _augment(BinField
, _tmp
)
470 def __hash__(me
): return 0x23e4701c ^
hash(me
.p
)
471 _augment(BinPolyField
, _tmp
)
477 h ^
= 2*hash(me
.beta
) & 0xffffffff
479 _augment(BinNormField
, _tmp
)
482 def __str__(me
): return str(me
.value
)
483 def __repr__(me
): return '%s(%s)' %
(repr(me
.field
), repr(me
.value
))
484 _repr_pretty_
= _pp_str
487 ###--------------------------------------------------------------------------
492 return '%s(%r, %s, %s)' %
(_clsname(me
), me
.field
, me
.a
, me
.b
)
493 def _repr_pretty_(me
, pp
, cyclep
):
494 ind
= _pp_bgroup_tyname(pp
, me
)
498 pp
.pretty(me
.field
); pp
.text(','); pp
.breakable()
499 pp
.pretty(me
.a
); pp
.text(','); pp
.breakable()
501 pp
.end_group(ind
, ')')
503 return ecpt
.frombuf(me
, s
)
505 return ecpt
.fromraw(me
, s
)
508 _augment(ECCurve
, _tmp
)
514 h ^
= 2*hash(me
.a
) ^
0xffffffff
515 h ^
= 5*hash(me
.b
) ^
0xffffffff
517 _augment(ECPrimeCurve
, _tmp
)
523 h ^
= 2*hash(me
.a
) ^
0xffffffff
524 h ^
= 5*hash(me
.b
) ^
0xffffffff
526 _augment(ECBinCurve
, _tmp
)
530 if not me
: return '%s()' %
_clsname(me
)
531 return '%s(%s, %s)' %
(_clsname(me
), me
.ix
, me
.iy
)
533 if not me
: return 'inf'
534 return '(%s, %s)' %
(me
.ix
, me
.iy
)
535 def _repr_pretty_(me
, pp
, cyclep
):
541 ind
= _pp_bgroup(pp
, '(')
542 pp
.pretty(me
.ix
); pp
.text(','); pp
.breakable()
544 pp
.end_group(ind
, ')')
549 return '%s(curve = %r, G = %r, r = %s, h = %s)' % \
550 (_clsname(me
), me
.curve
, me
.G
, me
.r
, me
.h
)
551 def _repr_pretty_(me
, pp
, cyclep
):
552 ind
= _pp_bgroup_tyname(pp
, me
)
556 _pp_kv(pp
, 'curve', me
.curve
); pp
.text(','); pp
.breakable()
557 _pp_kv(pp
, 'G', me
.G
); pp
.text(','); pp
.breakable()
558 _pp_kv(pp
, 'r', me
.r
); pp
.text(','); pp
.breakable()
559 _pp_kv(pp
, 'h', me
.h
)
560 pp
.end_group(ind
, ')')
564 h ^
= 2*hash(me
.G
) & 0xffffffff
568 _augment(ECInfo
, _tmp
)
572 if not me
: return '%r()' %
(me
.curve
)
573 return '%r(%s, %s)' %
(me
.curve
, me
.x
, me
.y
)
575 if not me
: return 'inf'
576 return '(%s, %s)' %
(me
.x
, me
.y
)
577 def _repr_pretty_(me
, pp
, cyclep
):
583 ind
= _pp_bgroup(pp
, '(')
584 pp
.pretty(me
.x
); pp
.text(','); pp
.breakable()
586 pp
.end_group(ind
, ')')
587 _augment(ECPtCurve
, _tmp
)
589 ###--------------------------------------------------------------------------
593 def __repr__(me
): return '%s(%d)' %
(_clsname(me
), me
.default
)
594 def check(me
, sz
): return True
595 def best(me
, sz
): return sz
596 def pad(me
, sz
): return sz
597 _augment(KeySZAny
, _tmp
)
601 return '%s(%d, %d, %d, %d)' % \
602 (_clsname(me
), me
.default
, me
.min, me
.max, me
.mod
)
603 def _repr_pretty_(me
, pp
, cyclep
):
604 ind
= _pp_bgroup_tyname(pp
, me
)
608 pp
.pretty(me
.default
); pp
.text(','); pp
.breakable()
609 pp
.pretty(me
.min); pp
.text(','); pp
.breakable()
610 pp
.pretty(me
.max); pp
.text(','); pp
.breakable()
612 pp
.end_group(ind
, ')')
613 def check(me
, sz
): return me
.min <= sz
<= me
.max and sz
%me
.mod
== 0
615 if sz
< me
.min: raise ValueError('key too small')
616 elif sz
> me
.max: return me
.max
617 else: return sz
- sz
%me
.mod
619 if sz
> me
.max: raise ValueError('key too large')
620 elif sz
< me
.min: return me
.min
621 else: sz
+= me
.mod
- 1; return sz
- sz
%me
.mod
622 _augment(KeySZRange
, _tmp
)
625 def __repr__(me
): return '%s(%d, %s)' %
(_clsname(me
), me
.default
, me
.set)
626 def _repr_pretty_(me
, pp
, cyclep
):
627 ind
= _pp_bgroup_tyname(pp
, me
)
631 pp
.pretty(me
.default
); pp
.text(','); pp
.breakable()
632 ind1
= _pp_bgroup(pp
, '{')
633 _pp_commas(pp
, pp
.pretty
, me
.set)
634 pp
.end_group(ind1
, '}')
635 pp
.end_group(ind
, ')')
636 def check(me
, sz
): return sz
in me
.set
640 if found
< i
<= sz
: found
= i
641 if found
< 0: raise ValueError('key too small')
646 if sz
<= i
and (found
== -1 or i
< found
): found
= i
647 if found
< 0: raise ValueError('key too large')
649 _augment(KeySZSet
, _tmp
)
651 ###--------------------------------------------------------------------------
652 ### Key data objects.
655 def __repr__(me
): return '%s(%r)' %
(_clsname(me
), me
.name
)
656 _augment(KeyFile
, _tmp
)
659 def __repr__(me
): return '%s(%r)' %
(_clsname(me
), me
.fulltag
)
664 return '%s({%s})' %
(_clsname(me
),
665 ', '.join(['%r: %r' % kv
for kv
in _iteritems(me
)()]))
666 def _repr_pretty_(me
, pp
, cyclep
):
667 ind
= _pp_bgroup_tyname(pp
, me
)
668 if cyclep
: pp
.text('...')
669 else: _pp_dict(pp
, _iteritems(me
))
670 pp
.end_group(ind
, ')')
671 _augment(KeyAttributes
, _tmp
)
675 return '%s(%s, %r)' %
(_clsname(me
),
676 _repr_secret(me
._guts(),
677 not (me
.flags
& KF_NONSECRET
)),
678 me
.writeflags(me
.flags
))
679 def _repr_pretty_(me
, pp
, cyclep
):
680 ind
= _pp_bgroup_tyname(pp
, me
)
684 _pp_secret(pp
, me
._guts(), not (me
.flags
& KF_NONSECRET
))
685 pp
.text(','); pp
.breakable()
686 pp
.pretty(me
.writeflags(me
.flags
))
687 pp
.end_group(ind
, ')')
688 _augment(KeyData
, _tmp
)
691 def _guts(me
): return me
.bin
692 _augment(KeyDataBinary
, _tmp
)
695 def _guts(me
): return me
.ct
696 _augment(KeyDataEncrypted
, _tmp
)
699 def _guts(me
): return me
.mp
700 _augment(KeyDataMP
, _tmp
)
703 def _guts(me
): return me
.str
704 _augment(KeyDataString
, _tmp
)
707 def _guts(me
): return me
.ecpt
708 _augment(KeyDataECPt
, _tmp
)
712 return '%s({%s})' %
(_clsname(me
),
713 ', '.join(['%r: %r' % kv
for kv
in _iteritems(me
)]))
714 def _repr_pretty_(me
, pp
, cyclep
):
715 ind
= _pp_bgroup_tyname(pp
, me
, '({ ')
716 if cyclep
: pp
.text('...')
717 else: _pp_dict(pp
, _iteritems(me
))
718 pp
.end_group(ind
, ' })')
719 _augment(KeyDataStructured
, _tmp
)
721 ###--------------------------------------------------------------------------
726 return '%s(p = %s, r = %s, g = %s)' %
(_clsname(me
), me
.p
, me
.r
, me
.g
)
727 def _repr_pretty_(me
, pp
, cyclep
):
728 ind
= _pp_bgroup_tyname(pp
, me
)
732 _pp_kv(pp
, 'p', me
.p
); pp
.text(','); pp
.breakable()
733 _pp_kv(pp
, 'r', me
.r
); pp
.text(','); pp
.breakable()
734 _pp_kv(pp
, 'g', me
.g
)
735 pp
.end_group(ind
, ')')
736 _augment(FGInfo
, _tmp
)
739 def group(me
): return PrimeGroup(me
)
740 _augment(DHInfo
, _tmp
)
743 def group(me
): return BinGroup(me
)
744 _augment(BinDHInfo
, _tmp
)
748 return '%s(%r)' %
(_clsname(me
), me
.info
)
749 def _repr_pretty_(me
, pp
, cyclep
):
750 ind
= _pp_bgroup_tyname(pp
, me
)
751 if cyclep
: pp
.text('...')
752 else: pp
.pretty(me
.info
)
753 pp
.end_group(ind
, ')')
754 _augment(Group
, _tmp
)
761 h ^
= 2*hash(info
.r
) & 0xffffffff
762 h ^
= 5*hash(info
.g
) & 0xffffffff
764 def _get_geval(me
, x
): return MP(x
)
765 _augment(PrimeGroup
, _tmp
)
772 h ^
= 2*hash(info
.r
) & 0xffffffff
773 h ^
= 5*hash(info
.g
) & 0xffffffff
775 def _get_geval(me
, x
): return GF(x
)
776 _augment(BinGroup
, _tmp
)
779 def __hash__(me
): return 0x0ec23dab ^
hash(me
.info
)
780 def _get_geval(me
, x
): return x
.toec()
781 _augment(ECGroup
, _tmp
)
785 return '%r(%r)' %
(me
.group
, str(me
))
786 def _repr_pretty_(me
, pp
, cyclep
):
787 pp
.pretty(type(me
)._get_geval(me
))
790 ###--------------------------------------------------------------------------
791 ### RSA encoding techniques.
793 class PKCS1Crypt (object):
794 def __init__(me
, ep
= _bin(''), rng
= rand
):
797 def encode(me
, msg
, nbits
):
798 return _base
._p1crypt_encode(msg
, nbits
, me
.ep
, me
.rng
)
799 def decode(me
, ct
, nbits
):
800 return _base
._p1crypt_decode(ct
, nbits
, me
.ep
, me
.rng
)
802 class PKCS1Sig (object):
803 def __init__(me
, ep
= _bin(''), rng
= rand
):
806 def encode(me
, msg
, nbits
):
807 return _base
._p1sig_encode(msg
, nbits
, me
.ep
, me
.rng
)
808 def decode(me
, msg
, sig
, nbits
):
809 return _base
._p1sig_decode(msg
, sig
, nbits
, me
.ep
, me
.rng
)
812 def __init__(me
, mgf
= sha_mgf
, hash = sha
, ep
= _bin(''), rng
= rand
):
817 def encode(me
, msg
, nbits
):
818 return _base
._oaep_encode(msg
, nbits
, me
.mgf
, me
.hash, me
.ep
, me
.rng
)
819 def decode(me
, ct
, nbits
):
820 return _base
._oaep_decode(ct
, nbits
, me
.mgf
, me
.hash, me
.ep
, me
.rng
)
823 def __init__(me
, mgf
= sha_mgf
, hash = sha
, saltsz
= None, rng
= rand
):
830 def encode(me
, msg
, nbits
):
831 return _base
._pss_encode(msg
, nbits
, me
.mgf
, me
.hash, me
.saltsz
, me
.rng
)
832 def decode(me
, msg
, sig
, nbits
):
833 return _base
._pss_decode(msg
, sig
, nbits
,
834 me
.mgf
, me
.hash, me
.saltsz
, me
.rng
)
837 def encrypt(me
, msg
, enc
):
838 return me
.pubop(enc
.encode(msg
, me
.n
.nbits
))
839 def verify(me
, msg
, sig
, enc
):
840 if msg
is None: return enc
.decode(msg
, me
.pubop(sig
), me
.n
.nbits
)
842 x
= enc
.decode(msg
, me
.pubop(sig
), me
.n
.nbits
)
843 return x
is None or x
== msg
847 return '%s(n = %r, e = %r)' %
(_clsname(me
), me
.n
, me
.e
)
848 def _repr_pretty_(me
, pp
, cyclep
):
849 ind
= _pp_bgroup_tyname(pp
, me
)
853 _pp_kv(pp
, 'n', me
.n
); pp
.text(','); pp
.breakable()
854 _pp_kv(pp
, 'e', me
.e
)
855 pp
.end_group(ind
, ')')
856 _augment(RSAPub
, _tmp
)
859 def decrypt(me
, ct
, enc
): return enc
.decode(me
.privop(ct
), me
.n
.nbits
)
860 def sign(me
, msg
, enc
): return me
.privop(enc
.encode(msg
, me
.n
.nbits
))
862 return '%s(n = %r, e = %r, d = %s, ' \
863 'p = %s, q = %s, dp = %s, dq = %s, q_inv = %s)' % \
864 (_clsname(me
), me
.n
, me
.e
,
865 _repr_secret(me
.d
), _repr_secret(me
.p
), _repr_secret(me
.q
),
866 _repr_secret(me
.dp
), _repr_secret(me
.dq
), _repr_secret(me
.q_inv
))
867 def _repr_pretty_(me
, pp
, cyclep
):
868 ind
= _pp_bgroup_tyname(pp
, me
)
872 _pp_kv(pp
, 'n', me
.n
); pp
.text(','); pp
.breakable()
873 _pp_kv(pp
, 'e', me
.e
); pp
.text(','); pp
.breakable()
874 _pp_kv(pp
, 'd', me
.d
, secretp
= True); pp
.text(','); pp
.breakable()
875 _pp_kv(pp
, 'p', me
.p
, secretp
= True); pp
.text(','); pp
.breakable()
876 _pp_kv(pp
, 'q', me
.q
, secretp
= True); pp
.text(','); pp
.breakable()
877 _pp_kv(pp
, 'dp', me
.dp
, secretp
= True); pp
.text(','); pp
.breakable()
878 _pp_kv(pp
, 'dq', me
.dq
, secretp
= True); pp
.text(','); pp
.breakable()
879 _pp_kv(pp
, 'q_inv', me
.q_inv
, secretp
= True)
880 pp
.end_group(ind
, ')')
881 _augment(RSAPriv
, _tmp
)
883 ###--------------------------------------------------------------------------
884 ### DSA and related schemes.
887 def __repr__(me
): return '%s(G = %r, p = %r, hash = %r)' % \
888 (_clsname(me
), me
.G
, me
.p
, me
.hash)
889 def _repr_pretty_(me
, pp
, cyclep
):
890 ind
= _pp_bgroup_tyname(pp
, me
)
894 _pp_kv(pp
, 'G', me
.G
); pp
.text(','); pp
.breakable()
895 _pp_kv(pp
, 'p', me
.p
); pp
.text(','); pp
.breakable()
896 _pp_kv(pp
, 'hash', me
.hash)
897 pp
.end_group(ind
, ')')
898 _augment(DSAPub
, _tmp
)
899 _augment(KCDSAPub
, _tmp
)
902 def __repr__(me
): return '%s(G = %r, u = %s, p = %r, hash = %r)' % \
903 (_clsname(me
), me
.G
, _repr_secret(me
.u
), me
.p
, me
.hash)
904 def _repr_pretty_(me
, pp
, cyclep
):
905 ind
= _pp_bgroup_tyname(pp
, me
)
909 _pp_kv(pp
, 'G', me
.G
); pp
.text(','); pp
.breakable()
910 _pp_kv(pp
, 'u', me
.u
, True); pp
.text(','); pp
.breakable()
911 _pp_kv(pp
, 'p', me
.p
); pp
.text(','); pp
.breakable()
912 _pp_kv(pp
, 'hash', me
.hash)
913 pp
.end_group(ind
, ')')
914 _augment(DSAPriv
, _tmp
)
915 _augment(KCDSAPriv
, _tmp
)
917 ###--------------------------------------------------------------------------
918 ### Bernstein's elliptic curve crypto and related schemes.
920 X25519_BASE
= MP(9).storel(32)
921 X448_BASE
= MP(5).storel(56)
923 Z128
= ByteString
.zero(16)
925 class _BasePub (object):
926 def __init__(me
, pub
, *args
, **kw
):
927 if not me
._PUBSZ
.check(len(pub
)): raise ValueError('bad public key')
928 super(_BasePub
, me
).__init__(*args
, **kw
)
930 def __repr__(me
): return '%s(pub = %r)' %
(_clsname(me
), me
.pub
)
931 def _pp(me
, pp
): _pp_kv(pp
, 'pub', me
.pub
)
932 def _repr_pretty_(me
, pp
, cyclep
):
933 ind
= _pp_bgroup_tyname(pp
, me
)
934 if cyclep
: pp
.text('...')
936 pp
.end_group(ind
, ')')
938 class _BasePriv (object):
939 def __init__(me
, priv
, pub
= None, *args
, **kw
):
940 if not me
._KEYSZ
.check(len(priv
)): raise ValueError('bad private key')
941 if pub
is None: pub
= me
._pubkey(priv
)
942 super(_BasePriv
, me
).__init__(pub
= pub
, *args
, **kw
)
945 def generate(cls
, rng
= rand
):
946 return cls(rng
.block(cls
._KEYSZ
.default
))
948 return '%s(priv = %d, pub = %r)' % \
949 (_clsname(me
), _repr_secret(me
.priv
), me
.pub
)
951 _pp_kv(pp
, 'priv', me
.priv
, secretp
= True); pp
.text(','); pp
.breakable()
952 super(_BasePriv
, me
)._pp(pp
)
954 class _XDHPub (_BasePub
): pass
956 class _XDHPriv (_BasePriv
):
957 def _pubkey(me
, priv
): return me
._op(priv
, me
._BASE
)
958 def agree(me
, you
): return me
._op(me
.priv
, you
.pub
)
959 def boxkey(me
, recip
): return me
._hashkey(me
.agree(recip
))
960 def box(me
, recip
, n
, m
): return secret_box(me
.boxkey(recip
), n
, m
)
961 def unbox(me
, recip
, n
, c
): return secret_unbox(me
.boxkey(recip
), n
, c
)
963 class X25519Pub (_XDHPub
):
964 _PUBSZ
= KeySZSet(X25519_PUBSZ
)
967 class X25519Priv (_XDHPriv
, X25519Pub
):
968 _KEYSZ
= KeySZSet(X25519_KEYSZ
)
969 def _op(me
, k
, X
): return x25519(k
, X
)
970 def _hashkey(me
, z
): return hsalsa20_prf(z
, Z128
)
972 class X448Pub (_XDHPub
):
973 _PUBSZ
= KeySZSet(X448_PUBSZ
)
976 class X448Priv (_XDHPriv
, X448Pub
):
977 _KEYSZ
= KeySZSet(X448_KEYSZ
)
978 def _op(me
, k
, X
): return x448(k
, X
)
979 def _hashkey(me
, z
): return Shake256().hash(z
).done(salsa20
.keysz
.default
)
981 class _EdDSAPub (_BasePub
):
982 def beginhash(me
): return me
._HASH()
983 def endhash(me
, h
): return h
.done()
985 class _EdDSAPriv (_BasePriv
, _EdDSAPub
):
988 class Ed25519Pub (_EdDSAPub
):
989 _PUBSZ
= KeySZSet(ED25519_PUBSZ
)
991 def verify(me
, msg
, sig
, **kw
):
992 return ed25519_verify(me
.pub
, msg
, sig
, **kw
)
994 class Ed25519Priv (_EdDSAPriv
, Ed25519Pub
):
995 _KEYSZ
= KeySZAny(ED25519_KEYSZ
)
996 def _pubkey(me
, priv
): return ed25519_pubkey(priv
)
997 def sign(me
, msg
, **kw
):
998 return ed25519_sign(me
.priv
, msg
, pub
= me
.pub
, **kw
)
1000 class Ed448Pub (_EdDSAPub
):
1001 _PUBSZ
= KeySZSet(ED448_PUBSZ
)
1003 def verify(me
, msg
, sig
, **kw
):
1004 return ed448_verify(me
.pub
, msg
, sig
, **kw
)
1006 class Ed448Priv (_EdDSAPriv
, Ed448Pub
):
1007 _KEYSZ
= KeySZAny(ED448_KEYSZ
)
1008 def _pubkey(me
, priv
): return ed448_pubkey(priv
)
1009 def sign(me
, msg
, **kw
):
1010 return ed448_sign(me
.priv
, msg
, pub
= me
.pub
, **kw
)
1012 ###--------------------------------------------------------------------------
1013 ### Built-in algorithm and group tables.
1017 return '{%s}' %
', '.join(['%r: %r' % kv
for kv
in _iteritems(me
)])
1018 def _repr_pretty_(me
, pp
, cyclep
):
1019 ind
= _pp_bgroup(pp
, '{ ')
1020 if cyclep
: pp
.text('...')
1021 else: _pp_dict(pp
, _iteritems(me
))
1022 pp
.end_group(ind
, ' }')
1023 _augment(_base
._MiscTable
, _tmp
)
1025 ###--------------------------------------------------------------------------
1026 ### Prime number generation.
1028 class PrimeGenEventHandler (object):
1029 def pg_begin(me
, ev
):
1030 return me
.pg_try(ev
)
1031 def pg_done(me
, ev
):
1033 def pg_abort(me
, ev
):
1035 def pg_fail(me
, ev
):
1037 def pg_pass(me
, ev
):
1040 class SophieGermainStepJump (object):
1041 def pg_begin(me
, ev
):
1042 me
.lf
= PrimeFilter(ev
.x
)
1043 me
.hf
= me
.lf
.muladd(2, 1)
1049 while me
.lf
.status
== PGEN_FAIL
or me
.hf
.status
== PGEN_FAIL
:
1051 if me
.lf
.status
== PGEN_ABORT
or me
.hf
.status
== PGEN_ABORT
:
1054 if me
.lf
.status
== PGEN_DONE
and me
.hf
.status
== PGEN_DONE
:
1057 def pg_done(me
, ev
):
1061 class SophieGermainStepper (SophieGermainStepJump
):
1062 def __init__(me
, step
):
1066 me
.lf
.step(me
.lstep
)
1067 me
.hf
.step(me
.hstep
)
1069 class SophieGermainJumper (SophieGermainStepJump
):
1070 def __init__(me
, jump
):
1071 me
.ljump
= PrimeFilter(jump
);
1072 me
.hjump
= me
.ljump
.muladd(2, 0)
1074 me
.lf
.jump(me
.ljump
)
1075 me
.hf
.jump(me
.hjump
)
1076 def pg_done(me
, ev
):
1079 SophieGermainStepJump
.pg_done(me
, ev
)
1081 class SophieGermainTester (object):
1084 def pg_begin(me
, ev
):
1085 me
.lr
= RabinMiller(ev
.x
)
1086 me
.hr
= RabinMiller(2 * ev
.x
+ 1)
1088 lst
= me
.lr
.test(ev
.rng
.range(me
.lr
.x
))
1089 if lst
!= PGEN_PASS
and lst
!= PGEN_DONE
:
1091 rst
= me
.hr
.test(ev
.rng
.range(me
.hr
.x
))
1092 if rst
!= PGEN_PASS
and rst
!= PGEN_DONE
:
1094 if lst
== PGEN_DONE
and rst
== PGEN_DONE
:
1097 def pg_done(me
, ev
):
1101 class PrimitiveStepper (PrimeGenEventHandler
):
1107 def pg_begin(me
, ev
):
1108 me
.i
= iter(smallprimes
)
1109 return me
.pg_try(ev
)
1111 class PrimitiveTester (PrimeGenEventHandler
):
1112 def __init__(me
, mod
, hh
= [], exp
= None):
1113 me
.mod
= MPMont(mod
)
1118 if me
.exp
is not None:
1119 x
= me
.mod
.exp(x
, me
.exp
)
1120 if x
== 1: return PGEN_FAIL
1122 if me
.mod
.exp(x
, h
) == 1: return PGEN_FAIL
1126 class SimulStepper (PrimeGenEventHandler
):
1127 def __init__(me
, mul
= 2, add
= 1, step
= 2):
1131 def _stepfn(me
, step
):
1133 raise ValueError('step must be positive')
1135 return lambda f
: f
.step(step
)
1136 j
= PrimeFilter(step
)
1137 return lambda f
: f
.jump(j
)
1138 def pg_begin(me
, ev
):
1140 me
.lf
= PrimeFilter(x
)
1141 me
.hf
= PrimeFilter(x
* me
.mul
+ me
.add
)
1142 me
.lstep
= me
._stepfn(me
.step
)
1143 me
.hstep
= me
._stepfn(me
.step
* me
.mul
)
1144 SimulStepper
._cont(me
, ev
)
1152 while me
.lf
.status
== PGEN_FAIL
or me
.hf
.status
== PGEN_FAIL
:
1154 if me
.lf
.status
== PGEN_ABORT
or me
.hf
.status
== PGEN_ABORT
:
1157 if me
.lf
.status
== PGEN_DONE
and me
.hf
.status
== PGEN_DONE
:
1160 def pg_done(me
, ev
):
1166 class SimulTester (PrimeGenEventHandler
):
1167 def __init__(me
, mul
= 2, add
= 1):
1170 def pg_begin(me
, ev
):
1172 me
.lr
= RabinMiller(x
)
1173 me
.hr
= RabinMiller(x
* me
.mul
+ me
.add
)
1175 lst
= me
.lr
.test(ev
.rng
.range(me
.lr
.x
))
1176 if lst
!= PGEN_PASS
and lst
!= PGEN_DONE
:
1178 rst
= me
.hr
.test(ev
.rng
.range(me
.hr
.x
))
1179 if rst
!= PGEN_PASS
and rst
!= PGEN_DONE
:
1181 if lst
== PGEN_DONE
and rst
== PGEN_DONE
:
1184 def pg_done(me
, ev
):
1188 def sgprime(start
, step
= 2, name
= 'p', event
= pgen_nullev
, nsteps
= 0):
1190 return pgen(start
, name
, SimulStepper(step
= step
), SimulTester(), event
,
1191 nsteps
, RabinMiller
.iters(start
.nbits
))
1193 def findprimitive(mod
, hh
= [], exp
= None, name
= 'g', event
= pgen_nullev
):
1194 return pgen(0, name
, PrimitiveStepper(), PrimitiveTester(mod
, hh
, exp
),
1197 def kcdsaprime(pbits
, qbits
, rng
= rand
,
1198 event
= pgen_nullev
, name
= 'p', nsteps
= 0):
1199 hbits
= pbits
- qbits
1200 h
= pgen(rng
.mp(hbits
, 1), name
+ ' [h]',
1201 PrimeGenStepper(2), PrimeGenTester(),
1202 event
, nsteps
, RabinMiller
.iters(hbits
))
1203 q
= pgen(rng
.mp(qbits
, 1), name
, SimulStepper(2 * h
, 1, 2),
1204 SimulTester(2 * h
, 1), event
, nsteps
, RabinMiller
.iters(qbits
))
1208 #----- That's all, folks ----------------------------------------------------