PageRenderTime 27ms CodeModel.GetById 18ms RepoModel.GetById 0ms app.codeStats 0ms

/lib/Crypto/SelfTest/Util/test_number.py

https://gitlab.com/grayhamster/pycrypto
Python | 338 lines | 314 code | 1 blank | 23 comment | 0 complexity | e1d4adfc46ca57bd39d76be08ce4c97b MD5 | raw file
  1. # -*- coding: utf-8 -*-
  2. #
  3. # SelfTest/Util/test_number.py: Self-test for parts of the Crypto.Util.number module
  4. #
  5. # Written in 2008 by Dwayne C. Litzenberger <dlitz@dlitz.net>
  6. #
  7. # ===================================================================
  8. # The contents of this file are dedicated to the public domain. To
  9. # the extent that dedication to the public domain is not available,
  10. # everyone is granted a worldwide, perpetual, royalty-free,
  11. # non-exclusive license to exercise all rights associated with the
  12. # contents of this file for any purpose whatsoever.
  13. # No rights are reserved.
  14. #
  15. # THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  16. # EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  17. # MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  18. # NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  19. # BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  20. # ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  21. # CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  22. # SOFTWARE.
  23. # ===================================================================
  24. """Self-tests for (some of) Crypto.Util.number"""
  25. __revision__ = "$Id$"
  26. import sys
  27. if sys.version_info[0] == 2 and sys.version_info[1] == 1:
  28. from Crypto.Util.py21compat import *
  29. import unittest
  30. from Crypto.SelfTest.st_common import assert_disabled
  31. class MyError(Exception):
  32. """Dummy exception used for tests"""
  33. # NB: In some places, we compare tuples instead of just output values so that
  34. # if any inputs cause a test failure, we'll be able to tell which ones.
  35. class MiscTests(unittest.TestCase):
  36. def setUp(self):
  37. global number, math
  38. from Crypto.Util import number
  39. import math
  40. def test_ceil_shift(self):
  41. """Util.number.ceil_shift"""
  42. if not assert_disabled():
  43. self.assertRaises(AssertionError, number.ceil_shift, -1, 1)
  44. self.assertRaises(AssertionError, number.ceil_shift, 1, -1)
  45. # b = 0
  46. self.assertEqual(0, number.ceil_shift(0, 0))
  47. self.assertEqual(1, number.ceil_shift(1, 0))
  48. self.assertEqual(2, number.ceil_shift(2, 0))
  49. self.assertEqual(3, number.ceil_shift(3, 0))
  50. # b = 1
  51. self.assertEqual(0, number.ceil_shift(0, 1))
  52. self.assertEqual(1, number.ceil_shift(1, 1))
  53. self.assertEqual(1, number.ceil_shift(2, 1))
  54. self.assertEqual(2, number.ceil_shift(3, 1))
  55. # b = 2
  56. self.assertEqual(0, number.ceil_shift(0, 2))
  57. self.assertEqual(1, number.ceil_shift(1, 2))
  58. self.assertEqual(1, number.ceil_shift(2, 2))
  59. self.assertEqual(1, number.ceil_shift(3, 2))
  60. self.assertEqual(1, number.ceil_shift(4, 2))
  61. self.assertEqual(2, number.ceil_shift(5, 2))
  62. self.assertEqual(2, number.ceil_shift(6, 2))
  63. self.assertEqual(2, number.ceil_shift(7, 2))
  64. self.assertEqual(2, number.ceil_shift(8, 2))
  65. self.assertEqual(3, number.ceil_shift(9, 2))
  66. for b in range(3, 1+129, 3): # 3, 6, ... , 129
  67. self.assertEqual(0, number.ceil_shift(0, b))
  68. n = 1L
  69. while n <= 2L**(b+2):
  70. (q, r) = divmod(n-1, 2L**b)
  71. expected = q + int(not not r)
  72. self.assertEqual((n-1, b, expected),
  73. (n-1, b, number.ceil_shift(n-1, b)))
  74. (q, r) = divmod(n, 2L**b)
  75. expected = q + int(not not r)
  76. self.assertEqual((n, b, expected),
  77. (n, b, number.ceil_shift(n, b)))
  78. (q, r) = divmod(n+1, 2L**b)
  79. expected = q + int(not not r)
  80. self.assertEqual((n+1, b, expected),
  81. (n+1, b, number.ceil_shift(n+1, b)))
  82. n *= 2
  83. def test_ceil_div(self):
  84. """Util.number.ceil_div"""
  85. self.assertRaises(TypeError, number.ceil_div, "1", 1)
  86. self.assertRaises(ZeroDivisionError, number.ceil_div, 1, 0)
  87. self.assertRaises(ZeroDivisionError, number.ceil_div, -1, 0)
  88. # b = -1
  89. self.assertEqual(0, number.ceil_div(0, -1))
  90. self.assertEqual(-1, number.ceil_div(1, -1))
  91. self.assertEqual(-2, number.ceil_div(2, -1))
  92. self.assertEqual(-3, number.ceil_div(3, -1))
  93. # b = 1
  94. self.assertEqual(0, number.ceil_div(0, 1))
  95. self.assertEqual(1, number.ceil_div(1, 1))
  96. self.assertEqual(2, number.ceil_div(2, 1))
  97. self.assertEqual(3, number.ceil_div(3, 1))
  98. # b = 2
  99. self.assertEqual(0, number.ceil_div(0, 2))
  100. self.assertEqual(1, number.ceil_div(1, 2))
  101. self.assertEqual(1, number.ceil_div(2, 2))
  102. self.assertEqual(2, number.ceil_div(3, 2))
  103. self.assertEqual(2, number.ceil_div(4, 2))
  104. self.assertEqual(3, number.ceil_div(5, 2))
  105. # b = 3
  106. self.assertEqual(0, number.ceil_div(0, 3))
  107. self.assertEqual(1, number.ceil_div(1, 3))
  108. self.assertEqual(1, number.ceil_div(2, 3))
  109. self.assertEqual(1, number.ceil_div(3, 3))
  110. self.assertEqual(2, number.ceil_div(4, 3))
  111. self.assertEqual(2, number.ceil_div(5, 3))
  112. self.assertEqual(2, number.ceil_div(6, 3))
  113. self.assertEqual(3, number.ceil_div(7, 3))
  114. # b = 4
  115. self.assertEqual(0, number.ceil_div(0, 4))
  116. self.assertEqual(1, number.ceil_div(1, 4))
  117. self.assertEqual(1, number.ceil_div(2, 4))
  118. self.assertEqual(1, number.ceil_div(3, 4))
  119. self.assertEqual(1, number.ceil_div(4, 4))
  120. self.assertEqual(2, number.ceil_div(5, 4))
  121. self.assertEqual(2, number.ceil_div(6, 4))
  122. self.assertEqual(2, number.ceil_div(7, 4))
  123. self.assertEqual(2, number.ceil_div(8, 4))
  124. self.assertEqual(3, number.ceil_div(9, 4))
  125. # b = -4
  126. self.assertEqual(3, number.ceil_div(-9, -4))
  127. self.assertEqual(2, number.ceil_div(-8, -4))
  128. self.assertEqual(2, number.ceil_div(-7, -4))
  129. self.assertEqual(2, number.ceil_div(-6, -4))
  130. self.assertEqual(2, number.ceil_div(-5, -4))
  131. self.assertEqual(1, number.ceil_div(-4, -4))
  132. self.assertEqual(1, number.ceil_div(-3, -4))
  133. self.assertEqual(1, number.ceil_div(-2, -4))
  134. self.assertEqual(1, number.ceil_div(-1, -4))
  135. self.assertEqual(0, number.ceil_div(0, -4))
  136. self.assertEqual(0, number.ceil_div(1, -4))
  137. self.assertEqual(0, number.ceil_div(2, -4))
  138. self.assertEqual(0, number.ceil_div(3, -4))
  139. self.assertEqual(-1, number.ceil_div(4, -4))
  140. self.assertEqual(-1, number.ceil_div(5, -4))
  141. self.assertEqual(-1, number.ceil_div(6, -4))
  142. self.assertEqual(-1, number.ceil_div(7, -4))
  143. self.assertEqual(-2, number.ceil_div(8, -4))
  144. self.assertEqual(-2, number.ceil_div(9, -4))
  145. def test_exact_log2(self):
  146. """Util.number.exact_log2"""
  147. self.assertRaises(TypeError, number.exact_log2, "0")
  148. self.assertRaises(ValueError, number.exact_log2, -1)
  149. self.assertRaises(ValueError, number.exact_log2, 0)
  150. self.assertEqual(0, number.exact_log2(1))
  151. self.assertEqual(1, number.exact_log2(2))
  152. self.assertRaises(ValueError, number.exact_log2, 3)
  153. self.assertEqual(2, number.exact_log2(4))
  154. self.assertRaises(ValueError, number.exact_log2, 5)
  155. self.assertRaises(ValueError, number.exact_log2, 6)
  156. self.assertRaises(ValueError, number.exact_log2, 7)
  157. e = 3
  158. n = 8
  159. while e < 16:
  160. if n == 2**e:
  161. self.assertEqual(e, number.exact_log2(n), "expected=2**%d, n=%d" % (e, n))
  162. e += 1
  163. else:
  164. self.assertRaises(ValueError, number.exact_log2, n)
  165. n += 1
  166. for e in range(16, 1+64, 2):
  167. self.assertRaises(ValueError, number.exact_log2, 2L**e-1)
  168. self.assertEqual(e, number.exact_log2(2L**e))
  169. self.assertRaises(ValueError, number.exact_log2, 2L**e+1)
  170. def test_exact_div(self):
  171. """Util.number.exact_div"""
  172. # Positive numbers
  173. self.assertEqual(1, number.exact_div(1, 1))
  174. self.assertRaises(ValueError, number.exact_div, 1, 2)
  175. self.assertEqual(1, number.exact_div(2, 2))
  176. self.assertRaises(ValueError, number.exact_div, 3, 2)
  177. self.assertEqual(2, number.exact_div(4, 2))
  178. # Negative numbers
  179. self.assertEqual(-1, number.exact_div(-1, 1))
  180. self.assertEqual(-1, number.exact_div(1, -1))
  181. self.assertRaises(ValueError, number.exact_div, -1, 2)
  182. self.assertEqual(1, number.exact_div(-2, -2))
  183. self.assertEqual(-2, number.exact_div(-4, 2))
  184. # Zero dividend
  185. self.assertEqual(0, number.exact_div(0, 1))
  186. self.assertEqual(0, number.exact_div(0, 2))
  187. # Zero divisor (allow_divzero == False)
  188. self.assertRaises(ZeroDivisionError, number.exact_div, 0, 0)
  189. self.assertRaises(ZeroDivisionError, number.exact_div, 1, 0)
  190. # Zero divisor (allow_divzero == True)
  191. self.assertEqual(0, number.exact_div(0, 0, allow_divzero=True))
  192. self.assertRaises(ValueError, number.exact_div, 1, 0, allow_divzero=True)
  193. def test_floor_div(self):
  194. """Util.number.floor_div"""
  195. self.assertRaises(TypeError, number.floor_div, "1", 1)
  196. for a in range(-10, 10):
  197. for b in range(-10, 10):
  198. if b == 0:
  199. self.assertRaises(ZeroDivisionError, number.floor_div, a, b)
  200. else:
  201. self.assertEqual((a, b, int(math.floor(float(a) / b))),
  202. (a, b, number.floor_div(a, b)))
  203. def test_getStrongPrime(self):
  204. """Util.number.getStrongPrime"""
  205. self.assertRaises(ValueError, number.getStrongPrime, 256)
  206. self.assertRaises(ValueError, number.getStrongPrime, 513)
  207. bits = 512
  208. x = number.getStrongPrime(bits)
  209. self.assertNotEqual(x % 2, 0)
  210. self.assertEqual(x > (1L << bits-1)-1, 1)
  211. self.assertEqual(x < (1L << bits), 1)
  212. e = 2**16+1
  213. x = number.getStrongPrime(bits, e)
  214. self.assertEqual(number.GCD(x-1, e), 1)
  215. self.assertNotEqual(x % 2, 0)
  216. self.assertEqual(x > (1L << bits-1)-1, 1)
  217. self.assertEqual(x < (1L << bits), 1)
  218. e = 2**16+2
  219. x = number.getStrongPrime(bits, e)
  220. self.assertEqual(number.GCD((x-1)>>1, e), 1)
  221. self.assertNotEqual(x % 2, 0)
  222. self.assertEqual(x > (1L << bits-1)-1, 1)
  223. self.assertEqual(x < (1L << bits), 1)
  224. def test_isPrime(self):
  225. """Util.number.isPrime"""
  226. self.assertEqual(number.isPrime(-3), False) # Regression test: negative numbers should not be prime
  227. self.assertEqual(number.isPrime(-2), False) # Regression test: negative numbers should not be prime
  228. self.assertEqual(number.isPrime(1), False) # Regression test: isPrime(1) caused some versions of PyCrypto to crash.
  229. self.assertEqual(number.isPrime(2), True)
  230. self.assertEqual(number.isPrime(3), True)
  231. self.assertEqual(number.isPrime(4), False)
  232. self.assertEqual(number.isPrime(2L**1279-1), True)
  233. self.assertEqual(number.isPrime(-(2L**1279-1)), False) # Regression test: negative numbers should not be prime
  234. # test some known gmp pseudo-primes taken from
  235. # http://www.trnicely.net/misc/mpzspsp.html
  236. for composite in (43 * 127 * 211, 61 * 151 * 211, 15259 * 30517,
  237. 346141L * 692281L, 1007119L * 2014237L, 3589477L * 7178953L,
  238. 4859419L * 9718837L, 2730439L * 5460877L,
  239. 245127919L * 490255837L, 963939391L * 1927878781L,
  240. 4186358431L * 8372716861L, 1576820467L * 3153640933L):
  241. self.assertEqual(number.isPrime(long(composite)), False)
  242. def test_size(self):
  243. self.assertEqual(number.size(2),2)
  244. self.assertEqual(number.size(3),2)
  245. self.assertEqual(number.size(0xa2),8)
  246. self.assertEqual(number.size(0xa2ba40),8*3)
  247. self.assertEqual(number.size(0xa2ba40ee07e3b2bd2f02ce227f36a195024486e49c19cb41bbbdfbba98b22b0e577c2eeaffa20d883a76e65e394c69d4b3c05a1e8fadda27edb2a42bc000fe888b9b32c22d15add0cd76b3e7936e19955b220dd17d4ea904b1ec102b2e4de7751222aa99151024c7cb41cc5ea21d00eeb41f7c800834d2c6e06bce3bce7ea9a5L), 1024)
  248. class FastmathTests(unittest.TestCase):
  249. def setUp(self):
  250. global number
  251. from Crypto.Util import number
  252. def test_negative_number_roundtrip_mpzToLongObj_longObjToMPZ(self):
  253. """Test that mpzToLongObj and longObjToMPZ (internal functions) roundtrip negative numbers correctly."""
  254. n = -100000000000000000000000000000000000L
  255. e = 2L
  256. k = number._fastmath.rsa_construct(n, e)
  257. self.assertEqual(n, k.n)
  258. self.assertEqual(e, k.e)
  259. def test_isPrime_randfunc_exception(self):
  260. """Test that when isPrime is called, an exception raised in randfunc is propagated."""
  261. def randfunc(n):
  262. raise MyError
  263. prime = 3536384141L # Needs to be large enough so that rabinMillerTest will be invoked
  264. self.assertRaises(MyError, number._fastmath.isPrime, prime, randfunc=randfunc)
  265. def test_getStrongPrime_randfunc_exception(self):
  266. """Test that when getStrongPrime is called, an exception raised in randfunc is propagated."""
  267. def randfunc(n):
  268. raise MyError
  269. self.assertRaises(MyError, number._fastmath.getStrongPrime, 512, randfunc=randfunc)
  270. def test_isPrime_randfunc_bogus(self):
  271. """Test that when isPrime is called, an exception is raised if randfunc returns something bogus."""
  272. def randfunc(n):
  273. return None
  274. prime = 3536384141L # Needs to be large enough so that rabinMillerTest will be invoked
  275. self.assertRaises(TypeError, number._fastmath.isPrime, prime, randfunc=randfunc)
  276. def test_getStrongPrime_randfunc_bogus(self):
  277. """Test that when getStrongPrime is called, an exception is raised if randfunc returns something bogus."""
  278. def randfunc(n):
  279. return None
  280. self.assertRaises(TypeError, number._fastmath.getStrongPrime, 512, randfunc=randfunc)
  281. def get_tests(config={}):
  282. from Crypto.SelfTest.st_common import list_test_cases
  283. tests = list_test_cases(MiscTests)
  284. try:
  285. from Crypto.PublicKey import _fastmath
  286. tests += list_test_cases(FastmathTests)
  287. except ImportError:
  288. from Crypto.SelfTest.st_common import handle_fastmath_import_error
  289. handle_fastmath_import_error()
  290. return tests
  291. if __name__ == '__main__':
  292. suite = lambda: unittest.TestSuite(get_tests())
  293. unittest.main(defaultTest='suite')
  294. # vim:set ts=4 sw=4 sts=4 expandtab: