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
|
"""
Some tests for the rsa/key.py file.
"""
import unittest
import rsa.key
import rsa.core
class BlindingTest(unittest.TestCase):
def test_blinding(self):
"""Test blinding and unblinding.
This is basically the doctest of the PrivateKey.blind method, but then
implemented as unittest to allow running on different Python versions.
"""
pk = rsa.key.PrivateKey(3727264081, 65537, 3349121513, 65063, 57287)
message = 12345
encrypted = rsa.core.encrypt_int(message, pk.e, pk.n)
blinded_1, unblind_1 = pk.blind(encrypted) # blind before decrypting
decrypted = rsa.core.decrypt_int(blinded_1, pk.d, pk.n)
unblinded_1 = pk.unblind(decrypted, unblind_1)
self.assertEqual(unblinded_1, message)
# Re-blinding should use a different blinding factor.
blinded_2, unblind_2 = pk.blind(encrypted) # blind before decrypting
self.assertNotEqual(blinded_1, blinded_2)
# The unblinding should still work, though.
decrypted = rsa.core.decrypt_int(blinded_2, pk.d, pk.n)
unblinded_2 = pk.unblind(decrypted, unblind_2)
self.assertEqual(unblinded_2, message)
class KeyGenTest(unittest.TestCase):
def test_custom_exponent(self):
pub, priv = rsa.key.newkeys(16, exponent=3)
self.assertEqual(3, priv.e)
self.assertEqual(3, pub.e)
def test_default_exponent(self):
pub, priv = rsa.key.newkeys(16)
self.assertEqual(0x10001, priv.e)
self.assertEqual(0x10001, pub.e)
def test_exponents_coefficient_calculation(self):
pk = rsa.key.PrivateKey(3727264081, 65537, 3349121513, 65063, 57287)
self.assertEqual(pk.exp1, 55063)
self.assertEqual(pk.exp2, 10095)
self.assertEqual(pk.coef, 50797)
def test_custom_getprime_func(self):
# List of primes to test with, in order [p, q, p, q, ....]
# By starting with two of the same primes, we test that this is
# properly rejected.
primes = [64123, 64123, 64123, 50957, 39317, 33107]
def getprime(_):
return primes.pop(0)
# This exponent will cause two other primes to be generated.
exponent = 136407
(p, q, e, d) = rsa.key.gen_keys(
64, accurate=False, getprime_func=getprime, exponent=exponent
)
self.assertEqual(39317, p)
self.assertEqual(33107, q)
class HashTest(unittest.TestCase):
"""Test hashing of keys"""
def test_hash_possible(self):
pub, priv = rsa.key.newkeys(16)
# This raises a TypeError when hashing isn't possible.
hash(priv)
hash(pub)
|
