-
Notifications
You must be signed in to change notification settings - Fork 92
/
detect.py
2258 lines (1900 loc) · 71.8 KB
/
detect.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
Key fingerprinting
The fingerprinter supports the following formats:
- X509 Certificate, DER encoded, one per file, *.der, *.crt
- X509 Certificate, PEM encoded, more per file, *.pem
- RSA PEM encoded private key, public key, more per file, *.pem (has to have correct header -----BEGIN RSA...)
- SSH public key, *.pub, starting with "ssh-rsa", one per line
- ASC encoded PGP key, *.pgp, *.asc. More per file, has to have correct header -----BEGIN PGP...
- APK android application, *.apk
- one modulus per line text file *.txt, modulus can be
a) base64 encoded number, b) hex coded number, c) decimal coded number
- JSON file with moduli, one record per line, record with modulus has
key "mod" (int, base64, hex, dec encoding supported)
certificate(s) with key "cert" / array of certificates with key "certs" are supported, base64 encoded DER.
- LDIFF file - LDAP database dump. Any field ending with ";binary::" is attempted to decode as X509 certificate
- Java Key Store file (JKS). Tries empty password & some common, specify more with --jks-pass-file
- PKCS7 signature with user certificate.
Script requirements:
- Tested on Python 2.7.13, 3.4, 3.5, 3.6
- pip install cryptography pgpdump coloredlogs future six pycrypto>=2.6 python-dateutil pyx509_ph4 apk_parse_ph4 pyjks M2Crypto
- some system packages are usually needed for pip to install dependencies (like gcc):
sudo sudo yum install python-devel python-pip gcc gcc-c++ make automake autoreconf libtool openssl-devel libffi-devel dialog
sudo apt-get install python-pip python-dev build-essential libssl-dev libffi-dev
https://github.com/crocs-muni/roca
https://roca.crocs.fi.muni.cz
"""
from future.utils import iteritems
from builtins import bytes
from past.builtins import basestring
from past.builtins import long
from functools import reduce
import json
import argparse
import logging
import coloredlogs
import base64
import hashlib
import sys
import os
import re
import math
import itertools
import binascii
import collections
import traceback
import datetime
from math import ceil, log
# '%(asctime)s %(hostname)s %(name)s[%(process)d] %(levelname)s %(message)s'
LOG_FORMAT = '%(asctime)s [%(process)d] %(levelname)s %(message)s'
logger = logging.getLogger(__name__)
coloredlogs.install(level=logging.INFO, fmt=LOG_FORMAT)
#
# Helper functions & classes
#
def strip_hex_prefix(x):
"""
Strips possible hex prefixes from the strings
:param x:
:return:
"""
if startswith(x, '0x'):
return x[2:]
if startswith(x, '\\x'):
return x[2:]
return x
def error_message(e, message=None, cause=None):
"""
Formats exception message + cause
:param e:
:param message:
:param cause:
:return: formatted message, includes cause if any is set
"""
if message is None and cause is None:
return None
elif message is None:
return '%s, caused by %r' % (e.__class__, cause)
elif cause is None:
return message
else:
return '%s, caused by %r' % (message, cause)
def format_pgp_key(key):
"""
Formats PGP key in 16hex digits
:param key:
:return:
"""
if key is None:
return None
if isinstance(key, (int, long)):
return '%016x' % key
elif isinstance(key, list):
return [format_pgp_key(x) for x in key]
else:
key = key.strip()
key = strip_hex_prefix(key)
return format_pgp_key(int(key, 16))
def defval(val, default=None):
"""
Returns val if is not None, default instead
:param val:
:param default:
:return:
"""
return val if val is not None else default
def defvalkey(js, key, default=None, take_none=True):
"""
Returns js[key] if set, otherwise default. Note js[key] can be None.
:param js:
:param key:
:param default:
:param take_none:
:return:
"""
if js is None:
return default
if key not in js:
return default
if js[key] is None and not take_none:
return default
return js[key]
def drop_none(arr):
"""
Drop none from the list
:param arr:
:return:
"""
if arr is None:
return arr
return [x for x in arr if x is not None]
def drop_empty(arr):
"""
Drop empty array element
:param arr:
:return:
"""
return [x for x in arr if not isinstance(x, list) or len(x) > 0]
def add_res(acc, elem):
"""
Adds results to the accumulator
:param acc:
:param elem:
:return:
"""
if not isinstance(elem, list):
elem = [elem]
if acc is None:
acc = []
for x in elem:
acc.append(x)
return acc
def flatten(iterable):
"""
Non-recursive flatten.
:param iterable:
:return:
"""
try:
iterator, sentinel, stack = iter(iterable), object(), []
except TypeError:
yield iterable
return
while True:
value = next(iterator, sentinel)
if value is sentinel:
if not stack:
break
iterator = stack.pop()
elif isinstance(value, str):
yield value
else:
try:
new_iterator = iter(value)
except TypeError:
yield value
else:
stack.append(iterator)
iterator = new_iterator
def try_get_dn_part(subject, oid=None):
"""
Tries to extracts the OID from the X500 name.
:param subject:
:param oid:
:return:
"""
try:
if subject is None:
return None
if oid is None:
return None
for sub in subject:
if oid is not None and sub.oid == oid:
return sub.value
except:
pass
return None
def try_get_dn_string(subject, shorten=False):
"""
Returns DN as a string
:param subject:
:param shorten:
:return:
"""
try:
from cryptography.x509.oid import NameOID
from cryptography.x509 import ObjectIdentifier
oid_names = {
getattr(NameOID, 'COMMON_NAME', ObjectIdentifier("2.5.4.3")): "CN",
getattr(NameOID, 'COUNTRY_NAME', ObjectIdentifier("2.5.4.6")): "C",
getattr(NameOID, 'LOCALITY_NAME', ObjectIdentifier("2.5.4.7")): "L",
getattr(NameOID, 'STATE_OR_PROVINCE_NAME', ObjectIdentifier("2.5.4.8")): "ST",
getattr(NameOID, 'STREET_ADDRESS', ObjectIdentifier("2.5.4.9")): "St",
getattr(NameOID, 'ORGANIZATION_NAME', ObjectIdentifier("2.5.4.10")): "O",
getattr(NameOID, 'ORGANIZATIONAL_UNIT_NAME', ObjectIdentifier("2.5.4.11")): "OU",
getattr(NameOID, 'SERIAL_NUMBER', ObjectIdentifier("2.5.4.5")): "SN",
getattr(NameOID, 'USER_ID', ObjectIdentifier("0.9.2342.19200300.100.1.1")): "userID",
getattr(NameOID, 'DOMAIN_COMPONENT', ObjectIdentifier("0.9.2342.19200300.100.1.25")): "domainComponent",
getattr(NameOID, 'EMAIL_ADDRESS', ObjectIdentifier("1.2.840.113549.1.9.1")): "emailAddress",
getattr(NameOID, 'POSTAL_CODE', ObjectIdentifier("2.5.4.17")): "ZIP",
}
ret = []
try:
for attribute in subject:
oid = attribute.oid
dot = oid.dotted_string
oid_name = oid_names[oid] if shorten and oid in oid_names else oid._name
val = attribute.value
ret.append('%s: %s' % (oid_name, val))
except:
pass
return ', '.join(ret)
except Exception as e:
logger.warning('Unexpected error: %s' % e)
return 'N/A'
def utf8ize(x):
"""
Converts to utf8 if non-empty
:param x:
:return:
"""
if x is None:
return None
return x.encode('utf-8')
def startswith(haystack, prefix):
"""
py3 comp startswith
:param haystack:
:param prefix:
:return:
"""
if haystack is None:
return None
if sys.version_info[0] < 3:
return haystack.startswith(prefix)
return to_bytes(haystack).startswith(to_bytes(prefix))
def to_string(x):
"""
Utf8 conversion
:param x:
:return:
"""
if isinstance(x, bytes):
return x.decode('utf-8')
if isinstance(x, basestring):
return x
def to_bytes(x):
"""
Byte conv
:param x:
:return:
"""
if isinstance(x, bytes):
return x
if isinstance(x, basestring):
return x.encode('utf-8')
def contains(haystack, needle):
"""
py3 contains
:param haystack:
:param needle:
:return:
"""
if sys.version_info[0] < 3:
return needle in haystack
else:
return to_bytes(needle) in to_bytes(haystack)
def strip_spaces(x):
"""
Strips spaces
:param x:
:return:
"""
x = x.replace(b' ', b'')
x = x.replace(b'\t', b'')
return x
def strip_pem(x):
"""
Strips PEM to bare base64 encoded form
:param x:
:return:
"""
if x is None:
return None
x = to_string(x)
pem = x.replace('-----BEGIN CERTIFICATE-----', '')
pem = pem.replace('-----END CERTIFICATE-----', '')
pem = re.sub(r'-----BEGIN .+?-----', '', pem)
pem = re.sub(r'-----END .+?-----', '', pem)
pem = pem.replace(' ', '')
pem = pem.replace('\t', '')
pem = pem.replace('\r', '')
pem = pem.replace('\n', '')
return pem.strip()
def pem_to_der(x):
"""
Converts PEM to DER
:param x:
:return:
"""
if x is None:
return None
pem = strip_pem(x)
return base64.b64decode(pem)
def unix_time(dt):
if dt is None:
return None
cur = datetime.datetime.utcfromtimestamp(0)
if dt.tzinfo is not None:
cur.replace(tzinfo=dt.tzinfo)
return (dt - cur).total_seconds()
class Tracelogger(object):
"""
Prints traceback to the debugging logger if not shown before
"""
def __init__(self, logger=None):
self.logger = logger
self._db = set()
def log(self, cause=None, do_message=True, custom_msg=None):
"""
Loads exception data from the current exception frame - should be called inside the except block
:return:
"""
message = error_message(self, cause=cause)
exc_type, exc_value, exc_traceback = sys.exc_info()
traceback_formatted = traceback.format_exc()
traceback_val = traceback.extract_tb(exc_traceback)
md5 = hashlib.md5(traceback_formatted.encode('utf-8')).hexdigest()
if md5 in self._db:
# self.logger.debug('Exception trace logged: %s' % md5)
return
if custom_msg is not None and cause is not None:
self.logger.debug('%s : %s' % (custom_msg, cause))
elif custom_msg is not None:
self.logger.debug(custom_msg)
elif cause is not None:
self.logger.debug('%s' % cause)
self.logger.debug(traceback_formatted)
self._db.add(md5)
class AutoJSONEncoder(json.JSONEncoder):
"""
JSON encoder trying to_json() first
"""
def default(self, obj):
try:
return obj.to_json()
except AttributeError:
return self.default_classic(obj)
def default_classic(self, o):
from cryptography.hazmat.primitives.asymmetric.rsa import RSAPublicNumbers
if isinstance(o, set):
return list(o)
elif isinstance(o, RSAPublicNumbers):
return {'n': o.n, 'e': o.e}
else:
return super(AutoJSONEncoder, self).default(o)
class TestResult(object):
"""
Fingerprint test result holder.
"""
def __init__(self, data=None, **kwargs):
self._data = collections.OrderedDict(data if data is not None else {})
for key, value in iteritems(kwargs):
self._data[key] = value
@property
def type(self):
return defvalkey(self._data, 'type')
@property
def marked(self):
return defvalkey(self._data, 'marked', False)
@property
def n(self):
return defvalkey(self._data, 'n')
@property
def time_years(self):
return defvalkey(self._data, 'time_years')
@property
def price_aws_c4(self):
return defvalkey(self._data, 'price_aws_c4')
def __getattr__(self, item):
if item in self._data:
return self._data[item]
return None
def to_json(self):
self._data['marked'] = self.marked
self._data['type'] = self.type
return self._data
class ImportException(Exception):
"""Import exception used with optional dependencies"""
def __init__(self, message=None, cause=None):
super(ImportException, self).__init__(message)
class DlogFprint(object):
"""
Discrete logarithm (dlog) fingerprinter for ROCA.
Exploits the mathematical prime structure described in the paper.
No external python dependencies are needed (for sake of compatibility).
Detection could be optimized using sympy / gmpy but that would add significant dependency overhead.
"""
def __init__(self, max_prime=167, generator=65537):
self.primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101,
103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167]
self.max_prime = max_prime
self.generator = generator
self.m, self.phi_m = self.primorial(max_prime)
self.phi_m_decomposition = DlogFprint.small_factors(self.phi_m, max_prime)
self.generator_order = DlogFprint.element_order(generator, self.m, self.phi_m, self.phi_m_decomposition)
self.generator_order_decomposition = DlogFprint.small_factors(self.generator_order, max_prime)
logger.debug('Dlog fprint data: max prime: %s, generator: %s, m: %s, phi_m: %s, phi_m_dec: %s, '
'generator_order: %s, generator_order_decomposition: %s'
% (self.max_prime, self.generator, self.m, self.phi_m, self.phi_m_decomposition,
self.generator_order, self.generator_order_decomposition))
def fprint(self, modulus):
"""
Returns True if fingerprint is present / detected.
:param modulus:
:return:
"""
if modulus <= 2:
return False
d = DlogFprint.discrete_log(modulus, self.generator,
self.generator_order, self.generator_order_decomposition, self.m)
return d is not None
def primorial(self, max_prime=167):
"""
Returns primorial (and its totient) with max prime inclusive - product of all primes below the value
:param max_prime:
:param dummy:
:return: primorial, phi(primorial)
"""
mprime = max(self.primes)
if max_prime > mprime:
raise ValueError('Current primorial implementation does not support values above %s' % mprime)
primorial = 1
phi_primorial = 1
for prime in self.primes:
primorial *= prime
phi_primorial *= prime - 1
return primorial, phi_primorial
@staticmethod
def prime3(a):
"""
Simple trial division prime detection
:param a:
:return:
"""
if a < 2:
return False
if a == 2 or a == 3:
return True # manually test 2 and 3
if a % 2 == 0 or a % 3 == 0:
return False # exclude multiples of 2 and 3
max_divisor = int(math.ceil(a ** 0.5))
d, i = 5, 2
while d <= max_divisor:
if a % d == 0:
return False
d += i
i = 6 - i # this modifies 2 into 4 and vice versa
return True
@staticmethod
def is_prime(a):
return DlogFprint.prime3(a)
@staticmethod
def prime_factors(n, limit=None):
"""
Simple trial division factorization
:param n:
:param limit:
:return:
"""
num = []
# add 2, 3 to list or prime factors and remove all even numbers(like sieve of ertosthenes)
while n % 2 == 0:
num.append(2)
n = n // 2
while n % 3 == 0:
num.append(3)
n = n // 3
max_divisor = int(math.ceil(n ** 0.5)) if limit is None else limit
d, i = 5, 2
while d <= max_divisor:
while n % d == 0:
num.append(d)
n = n // d
d += i
i = 6 - i # this modifies 2 into 4 and vice versa
# if no is > 2 i.e no is a prime number that is only divisible by itself add it
if n > 2:
num.append(n)
return num
@staticmethod
def factor_list_to_map(factors):
"""
Factor list to map factor -> power
:param factors:
:return:
"""
ret = {}
for k, g in itertools.groupby(factors):
ret[k] = len(list(g))
return ret
@staticmethod
def element_order(element, modulus, phi_m, phi_m_decomposition):
"""
Returns order of the element in Zmod(modulus)
:param element:
:param modulus:
:param phi_m: phi(modulus)
:param phi_m_decomposition: factorization of phi(modulus)
:return:
"""
if element == 1:
return 1 # by definition
if pow(element, phi_m, modulus) != 1:
return None # not an element of the group
order = phi_m
for factor, power in list(phi_m_decomposition.items()):
for p in range(1, power + 1):
next_order = order // factor
if pow(element, next_order, modulus) == 1:
order = next_order
else:
break
return order
@staticmethod
def chinese_remainder(n, a):
"""
Solves CRT for moduli and remainders
:param n:
:param a:
:return:
"""
sum = 0
prod = reduce(lambda a, b: a * b, n)
for n_i, a_i in zip(n, a):
p = prod // n_i
sum += a_i * DlogFprint.mul_inv(p, n_i) * p
return sum % prod
@staticmethod
def mul_inv(a, b):
"""
Modular inversion a mod b
:param a:
:param b:
:return:
"""
b0 = b
x0, x1 = 0, 1
if b == 1:
return 1
while a > 1:
q = a // b
a, b = b, a % b
x0, x1 = x1 - q * x0, x0
if x1 < 0:
x1 += b0
return x1
@staticmethod
def small_factors(x, max_prime):
"""
Factorizing x up to max_prime limit.
:param x:
:param max_prime:
:return:
"""
factors = DlogFprint.prime_factors(x, limit=max_prime)
return DlogFprint.factor_list_to_map(factors)
@staticmethod
def discrete_log(element, generator, generator_order, generator_order_decomposition, modulus):
"""
Simple discrete logarithm
:param element:
:param generator:
:param generator_order:
:param generator_order_decomposition:
:param modulus:
:return:
"""
if pow(element, generator_order, modulus) != 1:
# logger.debug('Powmod not one')
return None
moduli = []
remainders = []
for prime, power in list(generator_order_decomposition.items()):
prime_to_power = prime ** power
order_div_prime_power = generator_order // prime_to_power # g.div(generator_order, prime_to_power)
g_dash = pow(generator, order_div_prime_power, modulus)
h_dash = pow(element, order_div_prime_power, modulus)
found = False
for i in range(0, prime_to_power):
if pow(g_dash, i, modulus) == h_dash:
remainders.append(i)
moduli.append(prime_to_power)
found = True
break
if not found:
# logger.debug('Not found :(')
return None
ccrt = DlogFprint.chinese_remainder(moduli, remainders)
return ccrt
#
# Main fingerprinting tool
#
class RocaFingerprinter(object):
"""
Key fingerprinter
"""
def __init__(self, **kwargs):
self.args = None
self.trace_logger = Tracelogger(logger)
self.jks_passwords = ['', 'changeit', 'chageit', 'root', 'server', 'test', 'alias', 'jks',
'tomcat', 'www', 'web', 'https']
kwargs.setdefault('do_print', False)
self.jks_file_passwords = kwargs.get('jks_file_passwords')
self.do_print = kwargs.get('do_print')
# Minimal modulo size to avoid false positives on the random data and very short moduli
kwargs.setdefault('minimal_modulus_bits', 256)
kwargs.setdefault('minimal_modulus', 2**kwargs.get('minimal_modulus_bits'))
self.minimal_modulus_bits = kwargs.get('minimal_modulus_bits')
self.minimal_modulus = kwargs.get('minimal_modulus')
self.tested = 0
self.num_rsa = 0
self.num_pem_certs = 0
self.num_pem_csr = 0
self.num_der_certs = 0
self.num_rsa_keys = 0
self.num_pgp_masters = 0
self.num_pgp_total = 0
self.num_ssh = 0
self.num_json = 0
self.num_apk = 0
self.num_ldiff_cert = 0
self.num_jks_cert = 0
self.num_pkcs7_cert = 0
self.found = 0
self.dlog_fprinter = DlogFprint()
self.primes = [3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101,
103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167]
self.prints = [6, 30, 126, 1026, 5658, 107286, 199410, 8388606, 536870910, 2147483646, 67109890, 2199023255550,
8796093022206, 140737488355326, 5310023542746834, 576460752303423486, 1455791217086302986,
147573952589676412926, 20052041432995567486, 6041388139249378920330, 207530445072488465666,
9671406556917033397649406,
618970019642690137449562110,
79228162521181866724264247298,
2535301200456458802993406410750,
1760368345969468176824550810518,
50079290986288516948354744811034,
473022961816146413042658758988474,
10384593717069655257060992658440190,
144390480366845522447407333004847678774,
2722258935367507707706996859454145691646,
174224571863520493293247799005065324265470,
696898287454081973172991196020261297061886,
713623846352979940529142984724747568191373310,
1800793591454480341970779146165214289059119882,
126304807362733370595828809000324029340048915994,
11692013098647223345629478661730264157247460343806,
187072209578355573530071658587684226515959365500926]
self.length_to_time_years = {
512: 0.000220562038803,
544: 0.00147111662211,
576: 0.00673857391044,
608: 0.0618100348655,
640: 0.281991193891,
672: 4.17998973277,
704: 39.5102151646,
736: 3473.56982013,
768: 342674.912512,
800: 89394704.8817,
832: 8359663659.84,
864: 44184838761000.0,
896: -1,
928: -1,
960: -1,
992: 0.0658249816453,
1024: 0.266074841608,
1056: 1.28258930217,
1088: 7.38296771318,
1120: 20.2173702373,
1152: 58.9125352286,
1184: 415.827799825,
1216: 1536.17130832,
1248: 5415.49876704,
1280: 46281.7555548,
1312: 208675.856834,
1344: 1586124.1447,
1376: 13481048.41,
1408: 102251985.84,
1440: 1520923586.93,
1472: 30924687905.9,
1504: 1933367534430.0,
1536: 135663316837000.0,
1568: 7582543380680000.0,
1600: 5.1035570593e+17,
1632: 3.8899705405e+19,
1664: 3.66527648803e+21,
1696: 3.77984169396e+23,
1728: 5.14819714267e+25,
1760: 6.24593092623e+27,
1792: 8.73499845222e+29,
1824: 1.87621309001e+32,
1856: 2.9671795418e+34,
1888: -1,
1920: -1,
1952: -1,
1984: 28.6856385392,
2016: 60.644701708,
2048: 140.849490658,
2080: 269.272545592,
2112: 724.550220558,
2144: 1262.66048991,
2176: 3833.6903835,
2208: 7049.61288162,
2240: 14511.7355032,
2272: 41968.716653,
2304: 105863.580849,
2336: 509819.310451,
2368: 863135.14224,
2400: 3730089.12073,
2432: 14337269.1935,
2464: 55914941.3902,
2496: 144036102.003,
2528: 972239354.935,
2560: 1732510677.27,
2592: 10345329708.8,
2624: 72172778459.7,
2656: 386464106155.0,
2688: 1706310772440.0,
2720: 14920435519400.0,
2752: 77755063482200.0,
2784: 1237655413740000.0,
2816: 7524587305980000.0,
2848: 4.66421299974e+16,
2880: 5.41036780376e+17,
2912: 6.07066413463e+18,
2944: 6.17088797501e+19,
2976: 4.35440413514e+20,
3008: 1.04496910207e+22,
3040: 2.91790333753e+23,
3072: 2.84373206239e+25,
3104: 1.21552661668e+27,
3136: 1.14739892383e+29,
3168: 7.03739127786e+30,
3200: 5.5123347741e+32,
3232: 5.46349546772e+34,
3264: 3.07923071536e+36,
3296: 4.88872482194e+37,
3328: 4.74614877952e+39,
3360: 5.94743522012e+41,
3392: 3.63042884553e+43,
3424: 3.15382165869e+45,
3456: 4.22631927496e+47,
3488: 4.57325850696e+50,
3520: 7.58105156459e+52,
3552: 8.44988925164e+54,
3584: 2.1141023018e+57,
3616: 2.95898599696e+59,
3648: 7.23723533e+61,
3680: 6.0951282339e+62,
3712: 1.06824345519e+65,
3744: 1.85662696289e+67,
3776: 5.64628786015e+69,
3808: 1.38273039654e+72,
3840: -1,
3872: -1,
3904: -1,
3936: -1,
3968: 47950588.0004,
4000: 134211454.052,
4032: 201770331.337,
4064: 613149724.539,
4096: 1283252196.93,
}
# args init
parser = self.init_parser()
self.args = parser.parse_args(args=[])
def is_acceptable_modulus(self, modulus):
"""
Tests if modulus isn't too small
:param modulus:
:return:
"""
return not self.minimal_modulus or modulus >= self.minimal_modulus
def has_fingerprint_moduli(self, modulus):
"""
Returns true if the fingerprint was detected in the key
:param modulus:
:return:
"""
if not self.is_acceptable_modulus(modulus):
return False
self.tested += 1
for i in range(0, len(self.primes)):
if (1 << (modulus % self.primes[i])) & self.prints[i] == 0:
return False
self.found += 1
return True
def has_fingerprint_dlog(self, modulus):
"""
Exact fingerprint using mathematical structure of the primes
:param modulus:
:return:
"""
if not self.is_acceptable_modulus(modulus):
return False
self.tested += 1
positive = self.dlog_fprinter.fprint(modulus)
if positive:
self.found += 1
return positive
def switch_fingerprint_method(self, old=False):
"""
Switches main fingerprinting method.
:param old: if True old fingerprinting method will be used.
:return:
"""
if old:
self.has_fingerprint = self.has_fingerprint_moduli
else:
self.has_fingerprint = self.has_fingerprint_dlog
has_fingerprint_real = has_fingerprint_moduli
has_fingerprint = has_fingerprint_dlog
def mark_and_add_effort(self, modulus, json_info):
"""
Inserts factorization effort for vulnerable modulus into json_info
:param modulus:
:param json_info:
:return:
"""
META_AMZ_FACT = 92. / 152. # conversion from university cluster to AWS
AMZ_C4_PRICE = 0.1 # price of 2 AWS CPUs per hour
length = int(ceil(log(modulus, 2)))
length_ceiling = int(ceil(length / 32)) * 32
if length_ceiling in self.length_to_time_years:
effort_time = self.length_to_time_years[length_ceiling]