PageRenderTime 54ms CodeModel.GetById 14ms RepoModel.GetById 0ms app.codeStats 0ms

/security/nss/lib/freebl/mpi/mpi-test.c

http://github.com/zpao/v8monkey
C | 1986 lines | 1411 code | 408 blank | 167 comment | 215 complexity | 7d1c4dee610122234eae24abe881795c MD5 | raw file
Possible License(s): MPL-2.0-no-copyleft-exception, LGPL-3.0, AGPL-1.0, LGPL-2.1, BSD-3-Clause, GPL-2.0, JSON, Apache-2.0, 0BSD
  1. /*
  2. * mpi-test.c
  3. *
  4. * This is a general test suite for the MPI library, which tests
  5. * all the functions in the library with known values. The program
  6. * exits with a zero (successful) status if the tests pass, or a
  7. * nonzero status if the tests fail.
  8. *
  9. * ***** BEGIN LICENSE BLOCK *****
  10. * Version: MPL 1.1/GPL 2.0/LGPL 2.1
  11. *
  12. * The contents of this file are subject to the Mozilla Public License Version
  13. * 1.1 (the "License"); you may not use this file except in compliance with
  14. * the License. You may obtain a copy of the License at
  15. * http://www.mozilla.org/MPL/
  16. *
  17. * Software distributed under the License is distributed on an "AS IS" basis,
  18. * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
  19. * for the specific language governing rights and limitations under the
  20. * License.
  21. *
  22. * The Original Code is the MPI Arbitrary Precision Integer Arithmetic library.
  23. *
  24. * The Initial Developer of the Original Code is
  25. * Michael J. Fromberger.
  26. * Portions created by the Initial Developer are Copyright (C) 1999
  27. * the Initial Developer. All Rights Reserved.
  28. *
  29. * Contributor(s):
  30. * Netscape Communications Corporation
  31. *
  32. * Alternatively, the contents of this file may be used under the terms of
  33. * either the GNU General Public License Version 2 or later (the "GPL"), or
  34. * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
  35. * in which case the provisions of the GPL or the LGPL are applicable instead
  36. * of those above. If you wish to allow use of your version of this file only
  37. * under the terms of either the GPL or the LGPL, and not to allow others to
  38. * use your version of this file under the terms of the MPL, indicate your
  39. * decision by deleting the provisions above and replace them with the notice
  40. * and other provisions required by the GPL or the LGPL. If you do not delete
  41. * the provisions above, a recipient may use your version of this file under
  42. * the terms of any one of the MPL, the GPL or the LGPL.
  43. *
  44. * ***** END LICENSE BLOCK ***** */
  45. /* $Id: mpi-test.c,v 1.13 2005/02/25 04:30:11 julien.pierre.bugs%sun.com Exp $ */
  46. #include <stdio.h>
  47. #include <stdlib.h>
  48. #include <string.h>
  49. #include <stdarg.h>
  50. #include <limits.h>
  51. #include <time.h>
  52. #include "mpi.h"
  53. #include "mpprime.h"
  54. #include "test-info.c"
  55. /* ZS means Zero Suppressed (no leading zeros) */
  56. #if MP_USE_LONG_DIGIT
  57. #define ZS_DIGIT_FMT "%lX"
  58. #elif MP_USE_LONG_LONG_DIGIT
  59. #define ZS_DIGIT_FMT "%llX"
  60. #elif MP_USE_UINT_DIGIT
  61. #define ZS_DIGIT_FMT "%X"
  62. #else
  63. #error "unknown type of digit"
  64. #endif
  65. /*
  66. Test vectors
  67. If you intend to change any of these values, you must also recompute
  68. the corresponding solutions below. Basically, these are just hex
  69. strings (for the big integers) or integer values (for the digits).
  70. The comparison tests think they know what relationships hold between
  71. these values. If you change that, you may have to adjust the code
  72. for the comparison tests accordingly. Most of the other tests
  73. should be fine as long as you re-compute the solutions, though.
  74. */
  75. const char *mp1 = "639A868CDA0C569861B";
  76. const char *mp2 = "AAFC0A3FE45E5E09DBE2C29";
  77. const char *mp3 = "B55AA8DF8A7E83241F38AC7A9E479CAEF2E4D7C5";
  78. const char *mp4 = "-63DBC2265B88268DC801C10EA68476B7BDE0090F";
  79. const char *mp5 = "F595CB42";
  80. const char *mp5a = "-4B597E";
  81. const char *mp6 = "0";
  82. const char *mp7 = "EBFA7121CD838CE6439CC59DDB4CBEF3";
  83. const char *mp8 = "5";
  84. const char *mp9 = "F74A2876A1432698923B0767DA19DCF3D71795EE";
  85. const char *mp10 = "9184E72A000";
  86. const char *mp11 = "54D79A3557E8";
  87. const char *mp12 = "10000000000000000";
  88. const char *mp13 =
  89. "34584F700C15A341E40BF7BFDD88A6630C8FF2B2067469372D391342BDAB6163963C"
  90. "D5A5C79F708BDE26E0CCF2DB66CD6D6089E29A877C45F2B050D226E6DA88";
  91. const char *mp14 =
  92. "AC3FA0EABAAC45724814D798942A1E28E14C81E0DE8055CED630E7689DA648683645DB6E"
  93. "458D9F5338CC3D4E33A5D1C9BF42780133599E60DEE0049AFA8F9489501AE5C9AA2B8C13"
  94. "FD21285A538B2CA87A626BB56E0A654C8707535E637FF4E39174157402BDE3AA30C9F134"
  95. "0C1307BAA864B075A9CC828B6A5E2B2BF1AE406D920CC5E7657D7C0E697DEE5375773AF9"
  96. "E200A1B8FAD7CD141F9EE47ABB55511FEB9A4D99EBA22F3A3FF6792FA7EE9E5DC0EE94F7"
  97. "7A631EDF3D7DD7C2DAAAFDF234D60302AB63D5234CEAE941B9AF0ADDD9E6E3A940A94EE5"
  98. "5DB45A7C66E61EDD0477419BBEFA44C325129601C4F45671C6A0E64665DF341D17FBC71F"
  99. "77418BD9F4375DDB3B9D56126526D8E5E0F35A121FD4F347013DA880020A752324F31DDD"
  100. "9BCDB13A3B86E207A2DE086825E6EEB87B3A64232CFD8205B799BC018634AAE193F19531"
  101. "D6EBC19A75F27CFFAA03EB5974898F53FD569AA5CE60F431B53B0CDE715A5F382405C9C4"
  102. "761A8E24888328F09F7BCE4E8D80C957DF177629C8421ACCD0C268C63C0DD47C3C0D954F"
  103. "D79F7D7297C6788DF4B3E51381759864D880ACA246DF09533739B8BB6085EAF7AE8DC2D9"
  104. "F224E6874926C8D24D34B457FD2C9A586C6B99582DC24F787A39E3942786CF1D494B6EB4"
  105. "A513498CDA0B217C4E80BCE7DA1C704C35E071AC21E0DA9F57C27C3533F46A8D20B04137"
  106. "C1B1384BE4B2EB46";
  107. const char *mp15 =
  108. "39849CF7FD65AF2E3C4D87FE5526221103D90BA26A6642FFE3C3ECC0887BBBC57E011BF1"
  109. "05D822A841653509C68F79EBE51C0099B8CBB04DEF31F36F5954208A3209AC122F0E11D8"
  110. "4AE67A494D78336A2066D394D42E27EF6B03DDAF6D69F5112C93E714D27C94F82FC7EF77"
  111. "445768C68EAE1C4A1407BE1B303243391D325090449764AE469CC53EC8012C4C02A72F37"
  112. "07ED7275D2CC8D0A14B5BCC6BF264941520EBA97E3E6BAE4EE8BC87EE0DDA1F5611A6ECB"
  113. "65F8AEF4F184E10CADBDFA5A2FEF828901D18C20785E5CC63473D638762DA80625003711"
  114. "9E984AC43E707915B133543AF9D5522C3E7180DC58E1E5381C1FB7DC6A5F4198F3E88FA6"
  115. "CBB6DFA8B2D1C763226B253E18BCCB79A29EE82D2DE735078C8AE3C3C86D476AAA08434C"
  116. "09C274BDD40A1D8FDE38D6536C22F44E807EB73DE4FB36C9F51E0BC835DDBE3A8EFCF2FE"
  117. "672B525769DC39230EE624D5EEDBD837C82A52E153F37378C3AD68A81A7ADBDF3345DBCE"
  118. "8FA18CA1DE618EF94DF72EAD928D4F45B9E51632ACF158CF8332C51891D1D12C2A7E6684"
  119. "360C4BF177C952579A9F442CFFEC8DAE4821A8E7A31C4861D8464CA9116C60866C5E72F7"
  120. "434ADBED36D54ACDFDFF70A4EFB46E285131FE725F1C637D1C62115EDAD01C4189716327"
  121. "BFAA79618B1656CBFA22C2C965687D0381CC2FE0245913C4D8D96108213680BD8E93E821"
  122. "822AD9DDBFE4BD04";
  123. const char *mp16 = "4A724340668DB150339A70";
  124. const char *mp17 = "8ADB90F58";
  125. const char *mp18 = "C64C230AB20E5";
  126. const char *mp19 =
  127. "F1C9DACDA287F2E3C88DCE2393B8F53DAAAC1196DC36510962B6B59454CFE64B";
  128. const char *mp20 =
  129. "D445662C8B6FE394107B867797750C326E0F4A967E135FC430F6CD7207913AC7";
  130. const char* mp21 = "2";
  131. const mp_digit md1 = 0;
  132. const mp_digit md2 = 0x1;
  133. const mp_digit md3 = 0x80;
  134. const mp_digit md4 = 0x9C97;
  135. const mp_digit md5 = 0xF5BF;
  136. const mp_digit md6 = 0x14A0;
  137. const mp_digit md7 = 0x03E8;
  138. const mp_digit md8 = 0x0101;
  139. const mp_digit md9 = 0xA;
  140. /*
  141. Solutions of the form x_mpABC, where:
  142. x = (p)roduct, (s)um, (d)ifference, (q)uotient, (r)emainder, (g)cd,
  143. (i)nverse, (e)xponent, square roo(t), (g)cd, (l)cm. A
  144. leading 'm' indicates a modular operation, e.g. ms_mp12 is the
  145. modular sum of operands 1 and 2
  146. ABC are the operand numbers involved in the computation. If a 'd'
  147. precedes the number, it is a digit operand; if a 'c' precedes it,
  148. it is a constant; otherwise, it is a full integer.
  149. */
  150. const char *p_mp12 = "4286AD72E095C9FE009938750743174ADDD7FD1E53";
  151. const char *p_mp34 = "-46BDBD66CA108C94A8CF46C325F7B6E2F2BA82D35"
  152. "A1BFD6934C441EE369B60CA29BADC26845E918B";
  153. const char *p_mp57 = "E260C265A0A27C17AD5F4E59D6E0360217A2EBA6";
  154. const char *p_mp22 = "7233B5C1097FFC77CCF55928FDC3A5D31B712FDE7A1E91";
  155. const char *p_mp1d4 = "3CECEA2331F4220BEF68DED";
  156. const char *p_mp8d6 = "6720";
  157. const char *p_mp1113 =
  158. "11590FC3831C8C3C51813142C88E566408DB04F9E27642F6471A1822E0100B12F7F1"
  159. "5699A127C0FA9D26DCBFF458522661F30C6ADA4A07C8C90F9116893F6DBFBF24C3A2"
  160. "4340";
  161. const char *p_mp1415 =
  162. "26B36540DE8B3586699CCEAE218A2842C7D5A01590E70C4A26E789107FBCDB06AA2C"
  163. "6DDC39E6FA18B16FCB2E934C9A5F844DAD60EE3B1EA82199EC5E9608F67F860FB965"
  164. "736055DF0E8F2540EB28D07F47E309B5F5D7C94FF190AB9C83A6970160CA700B1081"
  165. "F60518132AF28C6CEE6B7C473E461ABAC52C39CED50A08DD4E7EA8BA18DAD545126D"
  166. "A388F6983C29B6BE3F9DCBC15766E8E6D626A92C5296A9C4653CAE5788350C0E2107"
  167. "F57E5E8B6994C4847D727FF1A63A66A6CEF42B9C9E6BD04C92550B85D5527DE8A132"
  168. "E6BE89341A9285C7CE7FB929D871BBCBD0ED2863B6B078B0DBB30FCA66D6C64284D6"
  169. "57F394A0271E15B6EC7A9D530EBAC6CA262EF6F97E1A29FCE7749240E4AECA591ECF"
  170. "272122BC587370F9371B67BB696B3CDC1BC8C5B64B6280994EBA00CDEB8EB0F5D06E"
  171. "18F401D65FDCECF23DD7B9BB5B4C5458AEF2CCC09BA7F70EACB844750ACFD027521E"
  172. "2E047DE8388B35F8512D3DA46FF1A12D4260213602BF7BFFDB6059439B1BD0676449"
  173. "8D98C74F48FB3F548948D5BA0C8ECFCD054465132DC43466D6BBD59FBAF8D6D4E157"
  174. "2D612B40A956C7D3E140F3B8562EF18568B24D335707D5BAC7495014DF2444172426"
  175. "FD099DED560D30D1F945386604AFC85C64BD1E5F531F5C7840475FC0CF0F79810012"
  176. "4572BAF5A9910CDBD02B27FFCC3C7E5E88EF59F3AE152476E33EDA696A4F751E0AE4"
  177. "A3D2792DEA78E25B9110E12A19EFD09EA47FF9D6594DA445478BEB6901EAF8A35B2D"
  178. "FD59BEE9BF7AA8535B7D326EFA5AA2121B5EBE04DD85827A3D43BD04F4AA6D7B62A2"
  179. "B6D7A3077286A511A431E1EF75FCEBA3FAE9D5843A8ED17AA02BBB1B571F904699C5"
  180. "A6073F87DDD012E2322AB3F41F2A61F428636FE86914148E19B8EF8314ED83332F2F"
  181. "8C2ADE95071E792C0A68B903E060DD322A75FD0C2B992059FCCBB58AFA06B50D1634"
  182. "BBD93F187FCE0566609FCC2BABB269C66CEB097598AA17957BB4FDA3E64A1B30402E"
  183. "851CF9208E33D52E459A92C63FBB66435BB018E155E2C7F055E0B7AB82CD58FC4889"
  184. "372ED9EEAC2A07E8E654AB445B9298D2830D6D4DFD117B9C8ABE3968927DC24B3633"
  185. "BAD6E6466DB45DDAE87A0AB00336AC2CCCE176704F7214FCAB55743AB76C2B6CA231"
  186. "7984610B27B5786DE55C184DDF556EDFEA79A3652831940DAD941E243F482DC17E50"
  187. "284BC2FB1AD712A92542C573E55678878F02DFD9E3A863C7DF863227AEDE14B47AD3"
  188. "957190124820ADC19F5353878EDB6BF7D0C77352A6E3BDB53EEB88F5AEF6226D6E68"
  189. "756776A8FB49B77564147A641664C2A54F7E5B680CCC6A4D22D894E464DF20537094"
  190. "548F1732452F9E7F810C0B4B430C073C0FBCE03F0D03F82630654BCE166AA772E1EE"
  191. "DD0C08D3E3EBDF0AF54203B43AFDFC40D8FC79C97A4B0A4E1BEB14D8FCEFDDED8758"
  192. "6ED65B18";
  193. const char *p_mp2121 = "4";
  194. const char *mp_mp345 = "B9B6D3A3";
  195. const char *mp_mp335 = "16609C2D";
  196. const char *s_mp13 = "B55AA8DF8A7E83241F38B2B446B06A4FB84E5DE0";
  197. const char *s_mp34 = "517EE6B92EF65C965736EB6BF7C325F73504CEB6";
  198. const char *s_mp46 = "-63DBC2265B88268DC801C10EA68476B7BDE0090F";
  199. const char *s_mp5d4 = "F59667D9";
  200. const char *s_mp2d5 = "AAFC0A3FE45E5E09DBF21E8";
  201. const char *s_mp1415 =
  202. "E5C43DE2B811F4A084625F96E9504039E5258D8348E698CEB9F4D4292622042DB446"
  203. "F75F4B65C1FB7A317257FA354BB5A45E789AEC254EAECE11F80A53E3B513822491DB"
  204. "D9399DEC4807A2A3A10360129AC93F4A42388D3BF20B310DD0E9E9F4BE07FC88D53A"
  205. "78A26091E0AB506A70813712CCBFBDD440A69A906E650EE090FDD6A42A95AC1A414D"
  206. "317F1A9F781E6A30E9EE142ECDA45A1E3454A1417A7B9A613DA90831CF88EA1F2E82"
  207. "41AE88CC4053220903C2E05BCDD42F02B8CF8868F84C64C5858BAD356143C5494607"
  208. "EE22E11650148BAF65A985F6FC4CA540A55697F2B5AA95D6B8CF96EF638416DE1DD6"
  209. "3BA9E2C09E22D03E75B60BE456C642F86B82A709253E5E087B507DE3A45F8392423F"
  210. "4DBC284E8DC88C43CA77BC8DCEFB6129A59025F80F90FF978116DEBB9209E306FBB9"
  211. "1B6111F8B8CFACB7C7C9BC12691C22EE88303E1713F1DFCEB622B8EA102F6365678B"
  212. "C580ED87225467AA78E875868BD53B17574BA59305BC1AC666E4B7E9ED72FCFC200E"
  213. "189D98FC8C5C7533739C53F52DDECDDFA5A8668BFBD40DABC9640F8FCAE58F532940"
  214. "8162261320A25589E9FB51B50F80056471F24B7E1AEC35D1356FC2747FFC13A04B34"
  215. "24FCECE10880BD9D97CA8CDEB2F5969BF4F30256EB5ED2BCD1DC64BDC2EE65217848"
  216. "48A37FB13F84ED4FB7ACA18C4639EE64309BDD3D552AEB4AAF44295943DC1229A497"
  217. "A84A";
  218. const char *ms_mp345 = "1E71E292";
  219. const char *d_mp12 = "-AAFBA6A55DD183FD854A60E";
  220. const char *d_mp34 = "119366B05E606A9B1E73A6D8944CC1366B0C4E0D4";
  221. const char *d_mp5d4 = "F5952EAB";
  222. const char *d_mp6d2 = "-1";
  223. const char *md_mp345 = "26596B86";
  224. const char *q_mp42 = "-95825A1FFA1A155D5";
  225. const char *r_mp42 = "-6312E99D7700A3DCB32ADF2";
  226. const char *q_mp45a = "15344CDA3D841F661D2B61B6EDF7828CE36";
  227. const char *r_mp45a = "-47C47B";
  228. const char *q_mp7c2 = "75FD3890E6C1C67321CE62CEEDA65F79";
  229. const char *q_mp3d6 = "8CAFD53C272BD6FE8B0847BDC3B539EFAB5C3";
  230. const char *r_mp3d6 = "1E5";
  231. const char *r_mp5d5 = "1257";
  232. const char *r_mp47 = "B3A9018D970281A90FB729A181D95CB8";
  233. const char *q_mp1404 =
  234. "-1B994D869142D3EF6123A3CBBC3C0114FA071CFCEEF4B7D231D65591D32501AD80F"
  235. "FF49AE4EC80514CC071EF6B42521C2508F4CB2FEAD69A2D2EF3934087DCAF88CC4C4"
  236. "659F1CA8A7F4D36817D802F778F1392337FE36302D6865BF0D4645625DF8BB044E19"
  237. "930635BE2609FAC8D99357D3A9F81F2578DE15A300964188292107DAC980E0A08CD7"
  238. "E938A2135FAD45D50CB1D8C2D4C4E60C27AB98B9FBD7E4DBF752C57D2674520E4BB2"
  239. "7E42324C0EFE84FB3E38CF6950E699E86FD45FE40D428400F2F94EDF7E94FAE10B45"
  240. "89329E1BF61E5A378C7B31C9C6A234F8254D4C24823B84D0BF8D671D8BC9154DFAC9"
  241. "49BD8ACABD6BD32DD4DC587F22C86153CB3954BDF7C2A890D623642492C482CF3E2C"
  242. "776FC019C3BBC61688B485E6FD35D6376089C1E33F880E84C4E51E8ABEACE1B3FB70"
  243. "3EAD0E28D2D44E7F1C0A859C840775E94F8C1369D985A3C5E8114B21D68B3CBB75D2"
  244. "791C586153C85B90CAA483E57A40E2D97950AAB84920A4396C950C87C7FFFE748358"
  245. "42A0BF65445B26D40F05BE164B822CA96321F41D85A289C5F5CD5F438A78704C9683"
  246. "422299D21899A22F853B0C93081CC9925E350132A0717A611DD932A68A0ACC6E4C7F"
  247. "7F685EF8C1F4910AEA5DC00BB5A36FCA07FFEAA490C547F6E14A08FE87041AB803E1"
  248. "BD9E23E4D367A2C35762F209073DFF48F3";
  249. const char *r_mp1404 = "12FF98621ABF63144BFFC3207AC8FC10D8D1A09";
  250. const char *q_mp13c =
  251. "34584F700C15A341E40BF7BFDD88A6630C8FF2B2067469372D391342"
  252. "BDAB6163963CD5A5C79F708BDE26E0CCF2DB66CD6D6089E29A877C45";
  253. const char *r_mp13c = "F2B050D226E6DA88";
  254. const char *q_mp9c16 = "F74A2876A1432698923B0767DA19DCF3D71795E";
  255. const char *r_mp9c16 = "E";
  256. const char *e_mp5d9 = "A8FD7145E727A20E52E73D22990D35D158090307A"
  257. "13A5215AAC4E9AB1E96BD34E531209E03310400";
  258. const char *e_mp78 = "AA5F72C737DFFD8CCD108008BFE7C79ADC01A819B"
  259. "32B75FB82EC0FB8CA83311DA36D4063F1E57857A2"
  260. "1AB226563D84A15BB63CE975FF1453BD6750C58D9"
  261. "D113175764F5D0B3C89B262D4702F4D9640A3";
  262. const char *me_mp817 = "E504493ACB02F7F802B327AB13BF25";
  263. const char *me_mp5d47 = "1D45ED0D78F2778157992C951DD2734C";
  264. const char *me_mp1512 = "FB5B2A28D902B9D9";
  265. const char *me_mp161718 = "423C6AC6DBD74";
  266. const char *me_mp5114 =
  267. "64F0F72807993578BBA3C7C36FFB184028F9EB9A810C92079E1498D8A80FC848E1F0"
  268. "25F1DE43B7F6AC063F5CC29D8A7C2D7A66269D72BF5CDC327AF88AF8EF9E601DCB0A"
  269. "3F35BFF3525FB1B61CE3A25182F17C0A0633B4089EA15BDC47664A43FEF639748AAC"
  270. "19CF58E83D8FA32CD10661D2D4210CC84792937E6F36CB601851356622E63ADD4BD5"
  271. "542412C2E0C4958E51FD2524AABDC7D60CFB5DB332EEC9DC84210F10FAE0BA2018F2"
  272. "14C9D6867C9D6E49CF28C18D06CE009FD4D04BFC8837C3FAAA773F5CCF6DED1C22DE"
  273. "181786AFE188540586F2D74BF312E595244E6936AE52E45742109BAA76C36F2692F5"
  274. "CEF97AD462B138BE92721194B163254CBAAEE9B9864B21CCDD5375BCAD0D24132724"
  275. "113D3374B4BCF9AA49BA5ACBC12288C0BCF46DCE6CB4A241A91BD559B130B6E9CD3D"
  276. "D7A2C8B280C2A278BA9BF5D93244D563015C9484B86D9FEB602501DC16EEBC3EFF19"
  277. "53D7999682BF1A1E3B2E7B21F4BDCA3C355039FEF55B9C0885F98DC355CA7A6D8ECF"
  278. "5F7F1A6E11A764F2343C823B879B44616B56BF6AE3FA2ACF5483660E618882018E3F"
  279. "C8459313BACFE1F93CECC37B2576A5C0B2714BD3EEDEEC22F0E7E3E77B11396B9B99"
  280. "D683F2447A4004BBD4A57F6A616CDDFEC595C4FC19884CC2FC21CF5BF5B0B81E0F83"
  281. "B9DDA0CF4DFF35BB8D31245912BF4497FD0BD95F0C604E26EA5A8EA4F5EAE870A5BD"
  282. "FE8C";
  283. const char *e_mpc2d3 = "100000000000000000000000000000000";
  284. const char *t_mp9 = "FB9B6E32FF0452A34746";
  285. const char *i_mp27 = "B6AD8DCCDAF92B6FE57D062FFEE3A99";
  286. const char *i_mp2019 =
  287. "BDF3D88DC373A63EED92903115B03FC8501910AF68297B4C41870AED3EA9F839";
  288. /* "15E3FE09E8AE5523AABA197BD2D16318D3CA148EDF4AE1C1C52FC96AFAF5680B"; */
  289. const char *t_mp15 =
  290. "795853094E59B0008093BCA8DECF68587C64BDCA2F3F7F8963DABC12F1CFFFA9B8C4"
  291. "365232FD4751870A0EF6CA619287C5D8B7F1747D95076AB19645EF309773E9EACEA0"
  292. "975FA4AE16251A8DA5865349C3A903E3B8A2C0DEA3C0720B6020C7FED69AFF62BB72"
  293. "10FAC443F9FFA2950776F949E819260C2AF8D94E8A1431A40F8C23C1973DE5D49AA2"
  294. "0B3FF5DA5C1D5324E712A78FF33A9B1748F83FA529905924A31DF38643B3F693EF9B"
  295. "58D846BB1AEAE4523ECC843FF551C1B300A130B65C1677402778F98C51C10813250E"
  296. "2496882877B069E877B59740DC1226F18A5C0F66F64A5F59A9FAFC5E9FC45AEC0E7A"
  297. "BEE244F7DD3AC268CF512A0E52E4F5BE5B94";
  298. const char *g_mp71 = "1";
  299. const char *g_mp25 = "7";
  300. const char *l_mp1011 = "C589E3D7D64A6942A000";
  301. /* mp9 in radices from 5 to 64 inclusive */
  302. #define LOW_RADIX 5
  303. #define HIGH_RADIX 64
  304. const char *v_mp9[] = {
  305. "404041130042310320100141302000203430214122130002340212132414134210033",
  306. "44515230120451152500101352430105520150025145320010504454125502",
  307. "644641136612541136016610100564613624243140151310023515322",
  308. "173512120732412062323044435407317550316717172705712756",
  309. "265785018434285762514442046172754680368422060744852",
  310. "1411774500397290569709059837552310354075408897518",
  311. "184064268501499311A17746095910428222A241708032A",
  312. "47706011B225950B02BB45602AA039893118A85950892",
  313. "1A188C826B982353CB58422563AC602B783101671A86",
  314. "105957B358B89B018958908A9114BC3DDC410B77982",
  315. "CB7B3387E23452178846C55DD9D70C7CA9AEA78E8",
  316. "F74A2876A1432698923B0767DA19DCF3D71795EE",
  317. "17BF7C3673B76D7G7A5GA836277296F806E7453A",
  318. "2EBG8HH3HFA6185D6H0596AH96G24C966DD3HG2",
  319. "6G3HGBFEG8I3F25EAF61B904EIA40CFDH2124F",
  320. "10AHC3D29EBHDF3HD97905CG0JA8061855C3FI",
  321. "3BA5A55J5K699B2D09C38A4B237CH51IHA132",
  322. "EDEA90DJ0B5CB3FGG1C8587FEB99D3C143CA",
  323. "31M26JI1BBD56K3I028MML4EEDMAJK60LGLE",
  324. "GGG5M3142FKKG82EJ28111D70EMHC241E4E",
  325. "4446F4D5H10982023N297BF0DKBBHLLJB0I",
  326. "12E9DEEOBMKAKEP0IM284MIP7FO1O521M46",
  327. "85NN0HD48NN2FDDB1F5BMMKIB8CK20MDPK",
  328. "2D882A7A0O0JPCJ4APDRIB77IABAKDGJP2",
  329. "MFMCI0R7S27AAA3O3L2S8K44HKA7O02CN",
  330. "7IGQS73FFSHC50NNH44B6PTTNLC3M6H78",
  331. "2KLUB3U9850CSN6ANIDNIF1LB29MJ43LH",
  332. "UT52GTL18CJ9H4HR0TJTK6ESUFBHF5FE",
  333. "BTVL87QQBMUGF8PFWU4W3VU7U922QTMW",
  334. "4OG10HW0MSWJBIDEE2PDH24GA7RIHIAA",
  335. "1W8W9AX2DRUX48GXOLMK0PE42H0FEUWN",
  336. "SVWI84VBH069WR15W1U2VTK06USY8Z2",
  337. "CPTPNPDa5TYCPPNLALENT9IMX2GL0W2",
  338. "5QU21UJMRaUYYYYYN6GHSMPOYOXEEUY",
  339. "2O2Q7C6RPPB1SXJ9bR4035SPaQQ3H2W",
  340. "18d994IbT4PHbD7cGIPCRP00bbQO0bc",
  341. "NcDUEEWRO7XT76260WGeBHPVa72RdA",
  342. "BbX2WCF9VfSB5LPdJAdeXKV1fd6LC2",
  343. "60QDKW67P4JSQaTdQg7JE9ISafLaVU",
  344. "33ba9XbDbRdNF4BeDB2XYMhAVDaBdA",
  345. "1RIPZJA8gT5L5H7fTcaRhQ39geMMTc",
  346. "d65j70fBATjcDiidPYXUGcaBVVLME",
  347. "LKA9jhPabDG612TXWkhfT2gMXNIP2",
  348. "BgNaYhjfT0G8PBcYRP8khJCR3C9QE",
  349. "6Wk8RhJTAgDh10fYAiUVB1aM0HacG",
  350. "3dOCjaf78kd5EQNViUZWj3AfFL90I",
  351. "290VWkL3aiJoW4MBbHk0Z0bDo22Ni",
  352. "1DbDZ1hpPZNUDBUp6UigcJllEdC26",
  353. "dFSOLBUM7UZX8Vnc6qokGIOiFo1h",
  354. "NcoUYJOg0HVmKI9fR2ag0S8R2hrK",
  355. "EOpiJ5Te7oDe2pn8ZhAUKkhFHlZh",
  356. "8nXK8rp8neV8LWta1WDgd1QnlWsU",
  357. "5T3d6bcSBtHgrH9bCbu84tblaa7r",
  358. "3PlUDIYUvMqOVCir7AtquK5dWanq",
  359. "2A70gDPX2AtiicvIGGk9poiMtgvu",
  360. "1MjiRxjk10J6SVAxFguv9kZiUnIc",
  361. "rpre2vIDeb4h3sp50r1YBbtEx9L",
  362. "ZHcoip0AglDAfibrsUcJ9M1C8fm",
  363. "NHP18+eoe6uU54W49Kc6ZK7+bT2",
  364. "FTAA7QXGoQOaZi7PzePtFFN5vNk"
  365. };
  366. const unsigned char b_mp4[] = {
  367. 0x01,
  368. #if MP_DIGIT_MAX > MP_32BIT_MAX
  369. 0x00, 0x00, 0x00, 0x00,
  370. #endif
  371. 0x63, 0xDB, 0xC2, 0x26,
  372. 0x5B, 0x88, 0x26, 0x8D,
  373. 0xC8, 0x01, 0xC1, 0x0E,
  374. 0xA6, 0x84, 0x76, 0xB7,
  375. 0xBD, 0xE0, 0x09, 0x0F
  376. };
  377. /* Search for a test suite name in the names table */
  378. int find_name(char *name);
  379. void reason(char *fmt, ...);
  380. /*------------------------------------------------------------------------*/
  381. /*------------------------------------------------------------------------*/
  382. char g_intbuf[4096]; /* buffer for integer comparison */
  383. char a_intbuf[4096]; /* buffer for integer comparison */
  384. int g_verbose = 1; /* print out reasons for failure? */
  385. int res;
  386. #define IFOK(x) { if (MP_OKAY > (res = (x))) { \
  387. reason("test %s failed: error %d\n", #x, res); return 1; }}
  388. int main(int argc, char *argv[])
  389. {
  390. int which, res;
  391. srand((unsigned int)time(NULL));
  392. if (argc < 2) {
  393. fprintf(stderr, "Usage: %s <test-suite> | list\n"
  394. "Type '%s help' for assistance\n", argv[0], argv[0]);
  395. return 2;
  396. } else if(argc > 2) {
  397. if(strcmp(argv[2], "quiet") == 0)
  398. g_verbose = 0;
  399. }
  400. if(strcmp(argv[1], "help") == 0) {
  401. fprintf(stderr, "Help for mpi-test\n\n"
  402. "This program is a test driver for the MPI library, which\n"
  403. "tests all the various functions in the library to make sure\n"
  404. "they are working correctly. The syntax is:\n"
  405. " %s <suite-name>\n"
  406. "...where <suite-name> is the name of the test you wish to\n"
  407. "run. To get a list of the tests, use '%s list'.\n\n"
  408. "The program exits with a status of zero if the test passes,\n"
  409. "or non-zero if it fails. Ordinarily, failure is accompanied\n"
  410. "by a diagnostic message to standard error. To suppress this\n"
  411. "add the keyword 'quiet' after the suite-name on the command\n"
  412. "line.\n\n", argv[0], argv[0]);
  413. return 0;
  414. }
  415. if ((which = find_name(argv[1])) < 0) {
  416. fprintf(stderr, "%s: test suite '%s' is not known\n", argv[0], argv[1]);
  417. return 2;
  418. }
  419. if((res = (g_tests[which])()) < 0) {
  420. fprintf(stderr, "%s: test suite not implemented yet\n", argv[0]);
  421. return 2;
  422. } else {
  423. return res;
  424. }
  425. }
  426. /*------------------------------------------------------------------------*/
  427. int find_name(char *name)
  428. {
  429. int ix = 0;
  430. while(ix < g_count) {
  431. if (strcmp(name, g_names[ix]) == 0)
  432. return ix;
  433. ++ix;
  434. }
  435. return -1;
  436. }
  437. /*------------------------------------------------------------------------*/
  438. int test_list(void)
  439. {
  440. int ix;
  441. fprintf(stderr, "There are currently %d test suites available\n",
  442. g_count);
  443. for(ix = 1; ix < g_count; ix++)
  444. fprintf(stdout, "%-20s %s\n", g_names[ix], g_descs[ix]);
  445. return 0;
  446. }
  447. /*------------------------------------------------------------------------*/
  448. int test_copy(void)
  449. {
  450. mp_int a, b;
  451. int ix;
  452. mp_init(&a); mp_init(&b);
  453. mp_read_radix(&a, mp3, 16);
  454. mp_copy(&a, &b);
  455. if(SIGN(&a) != SIGN(&b) || USED(&a) != USED(&b)) {
  456. if(SIGN(&a) != SIGN(&b)) {
  457. reason("error: sign of original is %d, sign of copy is %d\n",
  458. SIGN(&a), SIGN(&b));
  459. } else {
  460. reason("error: original precision is %d, copy precision is %d\n",
  461. USED(&a), USED(&b));
  462. }
  463. mp_clear(&a); mp_clear(&b);
  464. return 1;
  465. }
  466. for(ix = 0; ix < USED(&b); ix++) {
  467. if(DIGIT(&a, ix) != DIGIT(&b, ix)) {
  468. reason("error: digit %d " DIGIT_FMT " != " DIGIT_FMT "\n",
  469. ix, DIGIT(&a, ix), DIGIT(&b, ix));
  470. mp_clear(&a); mp_clear(&b);
  471. return 1;
  472. }
  473. }
  474. mp_clear(&a); mp_clear(&b);
  475. return 0;
  476. }
  477. /*------------------------------------------------------------------------*/
  478. int test_exch(void)
  479. {
  480. mp_int a, b;
  481. mp_init(&a); mp_init(&b);
  482. mp_read_radix(&a, mp7, 16); mp_read_radix(&b, mp1, 16);
  483. mp_exch(&a, &b);
  484. mp_toradix(&a, g_intbuf, 16);
  485. mp_clear(&a);
  486. if(strcmp(g_intbuf, mp1) != 0) {
  487. mp_clear(&b);
  488. reason("error: exchange failed\n");
  489. return 1;
  490. }
  491. mp_toradix(&b, g_intbuf, 16);
  492. mp_clear(&b);
  493. if(strcmp(g_intbuf, mp7) != 0) {
  494. reason("error: exchange failed\n");
  495. return 1;
  496. }
  497. return 0;
  498. }
  499. /*------------------------------------------------------------------------*/
  500. int test_zero(void)
  501. {
  502. mp_int a;
  503. mp_init(&a); mp_read_radix(&a, mp7, 16);
  504. mp_zero(&a);
  505. if(USED(&a) != 1 || DIGIT(&a, 1) != 0) {
  506. mp_toradix(&a, g_intbuf, 16);
  507. reason("error: result is %s\n", g_intbuf);
  508. mp_clear(&a);
  509. return 1;
  510. }
  511. mp_clear(&a);
  512. return 0;
  513. }
  514. /*------------------------------------------------------------------------*/
  515. int test_set(void)
  516. {
  517. mp_int a;
  518. /* Test single digit set */
  519. mp_init(&a); mp_set(&a, 5);
  520. if(DIGIT(&a, 0) != 5) {
  521. mp_toradix(&a, g_intbuf, 16);
  522. reason("error: result is %s, expected 5\n", g_intbuf);
  523. mp_clear(&a);
  524. return 1;
  525. }
  526. /* Test integer set */
  527. mp_set_int(&a, -4938110);
  528. mp_toradix(&a, g_intbuf, 16);
  529. mp_clear(&a);
  530. if(strcmp(g_intbuf, mp5a) != 0) {
  531. reason("error: result is %s, expected %s\n", g_intbuf, mp5a);
  532. return 1;
  533. }
  534. return 0;
  535. }
  536. /*------------------------------------------------------------------------*/
  537. int test_abs(void)
  538. {
  539. mp_int a;
  540. mp_init(&a); mp_read_radix(&a, mp4, 16);
  541. mp_abs(&a, &a);
  542. if(SIGN(&a) != ZPOS) {
  543. reason("error: sign of result is negative\n");
  544. mp_clear(&a);
  545. return 1;
  546. }
  547. mp_clear(&a);
  548. return 0;
  549. }
  550. /*------------------------------------------------------------------------*/
  551. int test_neg(void)
  552. {
  553. mp_int a;
  554. mp_sign s;
  555. mp_init(&a); mp_read_radix(&a, mp4, 16);
  556. s = SIGN(&a);
  557. mp_neg(&a, &a);
  558. if(SIGN(&a) == s) {
  559. reason("error: sign of result is same as sign of nonzero input\n");
  560. mp_clear(&a);
  561. return 1;
  562. }
  563. mp_clear(&a);
  564. return 0;
  565. }
  566. /*------------------------------------------------------------------------*/
  567. int test_add_d(void)
  568. {
  569. mp_int a;
  570. mp_init(&a);
  571. mp_read_radix(&a, mp5, 16);
  572. mp_add_d(&a, md4, &a);
  573. mp_toradix(&a, g_intbuf, 16);
  574. if(strcmp(g_intbuf, s_mp5d4) != 0) {
  575. reason("error: computed %s, expected %s\n", g_intbuf, s_mp5d4);
  576. mp_clear(&a);
  577. return 1;
  578. }
  579. mp_read_radix(&a, mp2, 16);
  580. mp_add_d(&a, md5, &a);
  581. mp_toradix(&a, g_intbuf, 16);
  582. if(strcmp(g_intbuf, s_mp2d5) != 0) {
  583. reason("error: computed %s, expected %s\n", g_intbuf, s_mp2d5);
  584. mp_clear(&a);
  585. return 1;
  586. }
  587. mp_clear(&a);
  588. return 0;
  589. }
  590. /*------------------------------------------------------------------------*/
  591. int test_add(void)
  592. {
  593. mp_int a, b;
  594. int res = 0;
  595. mp_init(&a); mp_init(&b);
  596. mp_read_radix(&a, mp1, 16); mp_read_radix(&b, mp3, 16);
  597. mp_add(&a, &b, &a);
  598. mp_toradix(&a, g_intbuf, 16);
  599. if(strcmp(g_intbuf, s_mp13) != 0) {
  600. reason("error: computed %s, expected %s\n", g_intbuf, s_mp13);
  601. res = 1; goto CLEANUP;
  602. }
  603. mp_read_radix(&a, mp4, 16);
  604. mp_add(&a, &b, &a);
  605. mp_toradix(&a, g_intbuf, 16);
  606. if(strcmp(g_intbuf, s_mp34) != 0) {
  607. reason("error: computed %s, expected %s\n", g_intbuf, s_mp34);
  608. res = 1; goto CLEANUP;
  609. }
  610. mp_read_radix(&a, mp4, 16); mp_read_radix(&b, mp6, 16);
  611. mp_add(&a, &b, &a);
  612. mp_toradix(&a, g_intbuf, 16);
  613. if(strcmp(g_intbuf, s_mp46) != 0) {
  614. reason("error: computed %s, expected %s\n", g_intbuf, s_mp46);
  615. res = 1; goto CLEANUP;
  616. }
  617. mp_read_radix(&a, mp14, 16); mp_read_radix(&b, mp15, 16);
  618. mp_add(&a, &b, &a);
  619. mp_toradix(&a, g_intbuf, 16);
  620. if(strcmp(g_intbuf, s_mp1415) != 0) {
  621. reason("error: computed %s, expected %s\n", g_intbuf, s_mp1415);
  622. res = 1;
  623. }
  624. CLEANUP:
  625. mp_clear(&a); mp_clear(&b);
  626. return res;
  627. }
  628. /*------------------------------------------------------------------------*/
  629. int test_sub_d(void)
  630. {
  631. mp_int a;
  632. mp_init(&a);
  633. mp_read_radix(&a, mp5, 16);
  634. mp_sub_d(&a, md4, &a);
  635. mp_toradix(&a, g_intbuf, 16);
  636. if(strcmp(g_intbuf, d_mp5d4) != 0) {
  637. reason("error: computed %s, expected %s\n", g_intbuf, d_mp5d4);
  638. mp_clear(&a);
  639. return 1;
  640. }
  641. mp_read_radix(&a, mp6, 16);
  642. mp_sub_d(&a, md2, &a);
  643. mp_toradix(&a, g_intbuf, 16);
  644. mp_clear(&a);
  645. if(strcmp(g_intbuf, d_mp6d2) != 0) {
  646. reason("error: computed %s, expected %s\n", g_intbuf, d_mp6d2);
  647. return 1;
  648. }
  649. return 0;
  650. }
  651. /*------------------------------------------------------------------------*/
  652. int test_sub(void)
  653. {
  654. mp_int a, b;
  655. mp_init(&a); mp_init(&b);
  656. mp_read_radix(&a, mp1, 16); mp_read_radix(&b, mp2, 16);
  657. mp_sub(&a, &b, &a);
  658. mp_toradix(&a, g_intbuf, 16);
  659. if(strcmp(g_intbuf, d_mp12) != 0) {
  660. reason("error: computed %s, expected %s\n", g_intbuf, d_mp12);
  661. mp_clear(&a); mp_clear(&b);
  662. return 1;
  663. }
  664. mp_read_radix(&a, mp3, 16); mp_read_radix(&b, mp4, 16);
  665. mp_sub(&a, &b, &a);
  666. mp_toradix(&a, g_intbuf, 16);
  667. if(strcmp(g_intbuf, d_mp34) != 0) {
  668. reason("error: computed %s, expected %s\n", g_intbuf, d_mp34);
  669. mp_clear(&a); mp_clear(&b);
  670. return 1;
  671. }
  672. mp_clear(&a); mp_clear(&b);
  673. return 0;
  674. }
  675. /*------------------------------------------------------------------------*/
  676. int test_mul_d(void)
  677. {
  678. mp_int a;
  679. mp_init(&a);
  680. mp_read_radix(&a, mp1, 16);
  681. IFOK( mp_mul_d(&a, md4, &a) );
  682. mp_toradix(&a, g_intbuf, 16);
  683. if(strcmp(g_intbuf, p_mp1d4) != 0) {
  684. reason("error: computed %s, expected %s\n", g_intbuf, p_mp1d4);
  685. mp_clear(&a);
  686. return 1;
  687. }
  688. mp_read_radix(&a, mp8, 16);
  689. IFOK( mp_mul_d(&a, md6, &a) );
  690. mp_toradix(&a, g_intbuf, 16);
  691. mp_clear(&a);
  692. if(strcmp(g_intbuf, p_mp8d6) != 0) {
  693. reason("error: computed %s, expected %s\n", g_intbuf, p_mp8d6);
  694. return 1;
  695. }
  696. return 0;
  697. }
  698. /*------------------------------------------------------------------------*/
  699. int test_mul(void)
  700. {
  701. mp_int a, b;
  702. int res = 0;
  703. mp_init(&a); mp_init(&b);
  704. mp_read_radix(&a, mp1, 16); mp_read_radix(&b, mp2, 16);
  705. IFOK( mp_mul(&a, &b, &a) );
  706. mp_toradix(&a, g_intbuf, 16);
  707. if(strcmp(g_intbuf, p_mp12) != 0) {
  708. reason("error: computed %s, expected %s\n", g_intbuf, p_mp12);
  709. res = 1; goto CLEANUP;
  710. }
  711. mp_read_radix(&a, mp3, 16); mp_read_radix(&b, mp4, 16);
  712. IFOK( mp_mul(&a, &b, &a) );
  713. mp_toradix(&a, g_intbuf, 16);
  714. if(strcmp(g_intbuf, p_mp34) !=0) {
  715. reason("error: computed %s, expected %s\n", g_intbuf, p_mp34);
  716. res = 1; goto CLEANUP;
  717. }
  718. mp_read_radix(&a, mp5, 16); mp_read_radix(&b, mp7, 16);
  719. IFOK( mp_mul(&a, &b, &a) );
  720. mp_toradix(&a, g_intbuf, 16);
  721. if(strcmp(g_intbuf, p_mp57) != 0) {
  722. reason("error: computed %s, expected %s\n", g_intbuf, p_mp57);
  723. res = 1; goto CLEANUP;
  724. }
  725. mp_read_radix(&a, mp11, 16); mp_read_radix(&b, mp13, 16);
  726. IFOK( mp_mul(&a, &b, &a) );
  727. mp_toradix(&a, g_intbuf, 16);
  728. if(strcmp(g_intbuf, p_mp1113) != 0) {
  729. reason("error: computed %s, expected %s\n", g_intbuf, p_mp1113);
  730. res = 1; goto CLEANUP;
  731. }
  732. mp_read_radix(&a, mp14, 16); mp_read_radix(&b, mp15, 16);
  733. IFOK( mp_mul(&a, &b, &a) );
  734. mp_toradix(&a, g_intbuf, 16);
  735. if(strcmp(g_intbuf, p_mp1415) != 0) {
  736. reason("error: computed %s, expected %s\n", g_intbuf, p_mp1415);
  737. res = 1;
  738. }
  739. mp_read_radix(&a, mp21, 10); mp_read_radix(&b, mp21, 10);
  740. IFOK( mp_mul(&a, &b, &a) );
  741. mp_toradix(&a, g_intbuf, 10);
  742. if(strcmp(g_intbuf, p_mp2121) != 0) {
  743. reason("error: computed %s, expected %s\n", g_intbuf, p_mp2121);
  744. res = 1; goto CLEANUP;
  745. }
  746. CLEANUP:
  747. mp_clear(&a); mp_clear(&b);
  748. return res;
  749. }
  750. /*------------------------------------------------------------------------*/
  751. int test_sqr(void)
  752. {
  753. mp_int a;
  754. mp_init(&a); mp_read_radix(&a, mp2, 16);
  755. mp_sqr(&a, &a);
  756. mp_toradix(&a, g_intbuf, 16);
  757. mp_clear(&a);
  758. if(strcmp(g_intbuf, p_mp22) != 0) {
  759. reason("error: computed %s, expected %s\n", g_intbuf, p_mp22);
  760. return 1;
  761. }
  762. return 0;
  763. }
  764. /*------------------------------------------------------------------------*/
  765. int test_div_d(void)
  766. {
  767. mp_int a, q;
  768. mp_digit r;
  769. int err = 0;
  770. mp_init(&a); mp_init(&q);
  771. mp_read_radix(&a, mp3, 16);
  772. IFOK( mp_div_d(&a, md6, &q, &r) );
  773. mp_toradix(&q, g_intbuf, 16);
  774. if(strcmp(g_intbuf, q_mp3d6) != 0) {
  775. reason("error: computed q = %s, expected %s\n", g_intbuf, q_mp3d6);
  776. ++err;
  777. }
  778. sprintf(g_intbuf, ZS_DIGIT_FMT, r);
  779. if(strcmp(g_intbuf, r_mp3d6) != 0) {
  780. reason("error: computed r = %s, expected %s\n", g_intbuf, r_mp3d6);
  781. ++err;
  782. }
  783. mp_read_radix(&a, mp9, 16);
  784. IFOK( mp_div_d(&a, 16, &q, &r) );
  785. mp_toradix(&q, g_intbuf, 16);
  786. if(strcmp(g_intbuf, q_mp9c16) != 0) {
  787. reason("error: computed q = %s, expected %s\n", g_intbuf, q_mp9c16);
  788. ++err;
  789. }
  790. sprintf(g_intbuf, ZS_DIGIT_FMT, r);
  791. if(strcmp(g_intbuf, r_mp9c16) != 0) {
  792. reason("error: computed r = %s, expected %s\n", g_intbuf, r_mp9c16);
  793. ++err;
  794. }
  795. mp_clear(&a); mp_clear(&q);
  796. return err;
  797. }
  798. /*------------------------------------------------------------------------*/
  799. int test_div_2(void)
  800. {
  801. mp_int a;
  802. mp_init(&a); mp_read_radix(&a, mp7, 16);
  803. IFOK( mp_div_2(&a, &a) );
  804. mp_toradix(&a, g_intbuf, 16);
  805. mp_clear(&a);
  806. if(strcmp(g_intbuf, q_mp7c2) != 0) {
  807. reason("error: computed %s, expected %s\n", g_intbuf, q_mp7c2);
  808. return 1;
  809. }
  810. return 0;
  811. }
  812. /*------------------------------------------------------------------------*/
  813. int test_div_2d(void)
  814. {
  815. mp_int a, q, r;
  816. mp_init(&q); mp_init(&r);
  817. mp_init(&a); mp_read_radix(&a, mp13, 16);
  818. IFOK( mp_div_2d(&a, 64, &q, &r) );
  819. mp_clear(&a);
  820. mp_toradix(&q, g_intbuf, 16);
  821. if(strcmp(g_intbuf, q_mp13c) != 0) {
  822. reason("error: computed %s, expected %s\n", g_intbuf, q_mp13c);
  823. mp_clear(&q); mp_clear(&r);
  824. return 1;
  825. }
  826. mp_clear(&q);
  827. mp_toradix(&r, g_intbuf, 16);
  828. if(strcmp(g_intbuf, r_mp13c) != 0) {
  829. reason("error, computed %s, expected %s\n", g_intbuf, r_mp13c);
  830. mp_clear(&r);
  831. return 1;
  832. }
  833. mp_clear(&r);
  834. return 0;
  835. }
  836. /*------------------------------------------------------------------------*/
  837. int test_div(void)
  838. {
  839. mp_int a, b, r;
  840. int err = 0;
  841. mp_init(&a); mp_init(&b); mp_init(&r);
  842. mp_read_radix(&a, mp4, 16); mp_read_radix(&b, mp2, 16);
  843. IFOK( mp_div(&a, &b, &a, &r) );
  844. mp_toradix(&a, g_intbuf, 16);
  845. if(strcmp(g_intbuf, q_mp42) != 0) {
  846. reason("error: test 1 computed quot %s, expected %s\n", g_intbuf, q_mp42);
  847. ++err;
  848. }
  849. mp_toradix(&r, g_intbuf, 16);
  850. if(strcmp(g_intbuf, r_mp42) != 0) {
  851. reason("error: test 1 computed rem %s, expected %s\n", g_intbuf, r_mp42);
  852. ++err;
  853. }
  854. mp_read_radix(&a, mp4, 16); mp_read_radix(&b, mp5a, 16);
  855. IFOK( mp_div(&a, &b, &a, &r) );
  856. mp_toradix(&a, g_intbuf, 16);
  857. if(strcmp(g_intbuf, q_mp45a) != 0) {
  858. reason("error: test 2 computed quot %s, expected %s\n", g_intbuf, q_mp45a);
  859. ++err;
  860. }
  861. mp_toradix(&r, g_intbuf, 16);
  862. if(strcmp(g_intbuf, r_mp45a) != 0) {
  863. reason("error: test 2 computed rem %s, expected %s\n", g_intbuf, r_mp45a);
  864. ++err;
  865. }
  866. mp_read_radix(&a, mp14, 16); mp_read_radix(&b, mp4, 16);
  867. IFOK( mp_div(&a, &b, &a, &r) );
  868. mp_toradix(&a, g_intbuf, 16);
  869. if(strcmp(g_intbuf, q_mp1404) != 0) {
  870. reason("error: test 3 computed quot %s, expected %s\n", g_intbuf, q_mp1404);
  871. ++err;
  872. }
  873. mp_toradix(&r, g_intbuf, 16);
  874. if(strcmp(g_intbuf, r_mp1404) != 0) {
  875. reason("error: test 3 computed rem %s, expected %s\n", g_intbuf, r_mp1404);
  876. ++err;
  877. }
  878. mp_clear(&a); mp_clear(&b); mp_clear(&r);
  879. return err;
  880. }
  881. /*------------------------------------------------------------------------*/
  882. int test_expt_d(void)
  883. {
  884. mp_int a;
  885. mp_init(&a); mp_read_radix(&a, mp5, 16);
  886. mp_expt_d(&a, md9, &a);
  887. mp_toradix(&a, g_intbuf, 16);
  888. mp_clear(&a);
  889. if(strcmp(g_intbuf, e_mp5d9) != 0) {
  890. reason("error: computed %s, expected %s\n", g_intbuf, e_mp5d9);
  891. return 1;
  892. }
  893. return 0;
  894. }
  895. /*------------------------------------------------------------------------*/
  896. int test_expt(void)
  897. {
  898. mp_int a, b;
  899. mp_init(&a); mp_init(&b);
  900. mp_read_radix(&a, mp7, 16); mp_read_radix(&b, mp8, 16);
  901. mp_expt(&a, &b, &a);
  902. mp_toradix(&a, g_intbuf, 16);
  903. mp_clear(&a); mp_clear(&b);
  904. if(strcmp(g_intbuf, e_mp78) != 0) {
  905. reason("error: computed %s, expected %s\n", g_intbuf, e_mp78);
  906. return 1;
  907. }
  908. return 0;
  909. }
  910. /*------------------------------------------------------------------------*/
  911. int test_2expt(void)
  912. {
  913. mp_int a;
  914. mp_init(&a);
  915. mp_2expt(&a, md3);
  916. mp_toradix(&a, g_intbuf, 16);
  917. mp_clear(&a);
  918. if(strcmp(g_intbuf, e_mpc2d3) != 0) {
  919. reason("error: computed %s, expected %s\n", g_intbuf, e_mpc2d3);
  920. return 1;
  921. }
  922. return 0;
  923. }
  924. /*------------------------------------------------------------------------*/
  925. int test_sqrt(void)
  926. {
  927. mp_int a;
  928. int res = 0;
  929. mp_init(&a); mp_read_radix(&a, mp9, 16);
  930. mp_sqrt(&a, &a);
  931. mp_toradix(&a, g_intbuf, 16);
  932. if(strcmp(g_intbuf, t_mp9) != 0) {
  933. reason("error: computed %s, expected %s\n", g_intbuf, t_mp9);
  934. res = 1; goto CLEANUP;
  935. }
  936. mp_read_radix(&a, mp15, 16);
  937. mp_sqrt(&a, &a);
  938. mp_toradix(&a, g_intbuf, 16);
  939. if(strcmp(g_intbuf, t_mp15) != 0) {
  940. reason("error: computed %s, expected %s\n", g_intbuf, t_mp15);
  941. res = 1;
  942. }
  943. CLEANUP:
  944. mp_clear(&a);
  945. return res;
  946. }
  947. /*------------------------------------------------------------------------*/
  948. int test_mod_d(void)
  949. {
  950. mp_int a;
  951. mp_digit r;
  952. mp_init(&a); mp_read_radix(&a, mp5, 16);
  953. IFOK( mp_mod_d(&a, md5, &r) );
  954. sprintf(g_intbuf, ZS_DIGIT_FMT, r);
  955. mp_clear(&a);
  956. if(strcmp(g_intbuf, r_mp5d5) != 0) {
  957. reason("error: computed %s, expected %s\n", g_intbuf, r_mp5d5);
  958. return 1;
  959. }
  960. return 0;
  961. }
  962. /*------------------------------------------------------------------------*/
  963. int test_mod(void)
  964. {
  965. mp_int a, m;
  966. mp_init(&a); mp_init(&m);
  967. mp_read_radix(&a, mp4, 16); mp_read_radix(&m, mp7, 16);
  968. IFOK( mp_mod(&a, &m, &a) );
  969. mp_toradix(&a, g_intbuf, 16);
  970. mp_clear(&a); mp_clear(&m);
  971. if(strcmp(g_intbuf, r_mp47) != 0) {
  972. reason("error: computed %s, expected %s\n", g_intbuf, r_mp47);
  973. return 1;
  974. }
  975. return 0;
  976. }
  977. /*------------------------------------------------------------------------*/
  978. int test_addmod(void)
  979. {
  980. mp_int a, b, m;
  981. mp_init(&a); mp_init(&b); mp_init(&m);
  982. mp_read_radix(&a, mp3, 16); mp_read_radix(&b, mp4, 16);
  983. mp_read_radix(&m, mp5, 16);
  984. IFOK( mp_addmod(&a, &b, &m, &a) );
  985. mp_toradix(&a, g_intbuf, 16);
  986. mp_clear(&a); mp_clear(&b); mp_clear(&m);
  987. if(strcmp(g_intbuf, ms_mp345) != 0) {
  988. reason("error: computed %s, expected %s\n", g_intbuf, ms_mp345);
  989. return 1;
  990. }
  991. return 0;
  992. }
  993. /*------------------------------------------------------------------------*/
  994. int test_submod(void)
  995. {
  996. mp_int a, b, m;
  997. mp_init(&a); mp_init(&b); mp_init(&m);
  998. mp_read_radix(&a, mp3, 16); mp_read_radix(&b, mp4, 16);
  999. mp_read_radix(&m, mp5, 16);
  1000. IFOK( mp_submod(&a, &b, &m, &a) );
  1001. mp_toradix(&a, g_intbuf, 16);
  1002. mp_clear(&a); mp_clear(&b); mp_clear(&m);
  1003. if(strcmp(g_intbuf, md_mp345) != 0) {
  1004. reason("error: computed %s, expected %s\n", g_intbuf, md_mp345);
  1005. return 1;
  1006. }
  1007. return 0;
  1008. }
  1009. /*------------------------------------------------------------------------*/
  1010. int test_mulmod(void)
  1011. {
  1012. mp_int a, b, m;
  1013. mp_init(&a); mp_init(&b); mp_init(&m);
  1014. mp_read_radix(&a, mp3, 16); mp_read_radix(&b, mp4, 16);
  1015. mp_read_radix(&m, mp5, 16);
  1016. IFOK( mp_mulmod(&a, &b, &m, &a) );
  1017. mp_toradix(&a, g_intbuf, 16);
  1018. mp_clear(&a); mp_clear(&b); mp_clear(&m);
  1019. if(strcmp(g_intbuf, mp_mp345) != 0) {
  1020. reason("error: computed %s, expected %s\n", g_intbuf, mp_mp345);
  1021. return 1;
  1022. }
  1023. return 0;
  1024. }
  1025. /*------------------------------------------------------------------------*/
  1026. int test_sqrmod(void)
  1027. {
  1028. mp_int a, m;
  1029. mp_init(&a); mp_init(&m);
  1030. mp_read_radix(&a, mp3, 16); mp_read_radix(&m, mp5, 16);
  1031. IFOK( mp_sqrmod(&a, &m, &a) );
  1032. mp_toradix(&a, g_intbuf, 16);
  1033. mp_clear(&a); mp_clear(&m);
  1034. if(strcmp(g_intbuf, mp_mp335) != 0) {
  1035. reason("error: computed %s, expected %s\n", g_intbuf, mp_mp335);
  1036. return 1;
  1037. }
  1038. return 0;
  1039. }
  1040. /*------------------------------------------------------------------------*/
  1041. int test_exptmod(void)
  1042. {
  1043. mp_int a, b, m;
  1044. int res = 0;
  1045. mp_init(&a); mp_init(&b); mp_init(&m);
  1046. mp_read_radix(&a, mp8, 16); mp_read_radix(&b, mp1, 16);
  1047. mp_read_radix(&m, mp7, 16);
  1048. IFOK( mp_exptmod(&a, &b, &m, &a) );
  1049. mp_toradix(&a, g_intbuf, 16);
  1050. if(strcmp(g_intbuf, me_mp817) != 0) {
  1051. reason("case 1: error: computed %s, expected %s\n", g_intbuf, me_mp817);
  1052. res = 1; goto CLEANUP;
  1053. }
  1054. mp_read_radix(&a, mp1, 16); mp_read_radix(&b, mp5, 16);
  1055. mp_read_radix(&m, mp12, 16);
  1056. IFOK( mp_exptmod(&a, &b, &m, &a) );
  1057. mp_toradix(&a, g_intbuf, 16);
  1058. if(strcmp(g_intbuf, me_mp1512) != 0) {
  1059. reason("case 2: error: computed %s, expected %s\n", g_intbuf, me_mp1512);
  1060. res = 1; goto CLEANUP;
  1061. }
  1062. mp_read_radix(&a, mp5, 16); mp_read_radix(&b, mp1, 16);
  1063. mp_read_radix(&m, mp14, 16);
  1064. IFOK( mp_exptmod(&a, &b, &m, &a) );
  1065. mp_toradix(&a, g_intbuf, 16);
  1066. if(strcmp(g_intbuf, me_mp5114) != 0) {
  1067. reason("case 3: error: computed %s, expected %s\n", g_intbuf, me_mp5114);
  1068. res = 1;
  1069. }
  1070. mp_read_radix(&a, mp16, 16); mp_read_radix(&b, mp17, 16);
  1071. mp_read_radix(&m, mp18, 16);
  1072. IFOK( mp_exptmod(&a, &b, &m, &a) );
  1073. mp_toradix(&a, g_intbuf, 16);
  1074. if(strcmp(g_intbuf, me_mp161718) != 0) {
  1075. reason("case 4: error: computed %s, expected %s\n", g_intbuf, me_mp161718);
  1076. res = 1;
  1077. }
  1078. CLEANUP:
  1079. mp_clear(&a); mp_clear(&b); mp_clear(&m);
  1080. return res;
  1081. }
  1082. /*------------------------------------------------------------------------*/
  1083. int test_exptmod_d(void)
  1084. {
  1085. mp_int a, m;
  1086. mp_init(&a); mp_init(&m);
  1087. mp_read_radix(&a, mp5, 16); mp_read_radix(&m, mp7, 16);
  1088. IFOK( mp_exptmod_d(&a, md4, &m, &a) );
  1089. mp_toradix(&a, g_intbuf, 16);
  1090. mp_clear(&a); mp_clear(&m);
  1091. if(strcmp(g_intbuf, me_mp5d47) != 0) {
  1092. reason("error: computed %s, expected %s\n", g_intbuf, me_mp5d47);
  1093. return 1;
  1094. }
  1095. return 0;
  1096. }
  1097. /*------------------------------------------------------------------------*/
  1098. int test_invmod(void)
  1099. {
  1100. mp_int a, m, c;
  1101. mp_int p1, p2, p3, p4, p5;
  1102. mp_int t1, t2, t3, t4;
  1103. mp_err res;
  1104. /* 5 128-bit primes. */
  1105. static const char ivp1[] = { "AAD8A5A2A2BEF644BAEE7DB0CA643719" };
  1106. static const char ivp2[] = { "CB371AD2B79A90BCC88D0430663E40B9" };
  1107. static const char ivp3[] = { "C6C818D4DF2618406CA09280C0400099" };
  1108. static const char ivp4[] = { "CE949C04512E68918006B1F0D7E93F27" };
  1109. static const char ivp5[] = { "F8EE999B6416645040687440E0B89F51" };
  1110. mp_init(&a); mp_init(&m);
  1111. mp_read_radix(&a, mp2, 16); mp_read_radix(&m, mp7, 16);
  1112. IFOK( mp_invmod(&a, &m, &a) );
  1113. mp_toradix(&a, g_intbuf, 16);
  1114. mp_clear(&a); mp_clear(&m);
  1115. if(strcmp(g_intbuf, i_mp27) != 0) {
  1116. reason("error: invmod test 1 computed %s, expected %s\n", g_intbuf, i_mp27);
  1117. return 1;
  1118. }
  1119. mp_init(&a); mp_init(&m);
  1120. mp_read_radix(&a, mp20, 16); mp_read_radix(&m, mp19, 16);
  1121. IFOK( mp_invmod(&a, &m, &a) );
  1122. mp_toradix(&a, g_intbuf, 16);
  1123. mp_clear(&a); mp_clear(&m);
  1124. if(strcmp(g_intbuf, i_mp2019) != 0) {
  1125. reason("error: invmod test 2 computed %s, expected %s\n", g_intbuf, i_mp2019);
  1126. return 1;
  1127. }
  1128. /* Need the following test cases:
  1129. Odd modulus
  1130. - a is odd, relatively prime to m
  1131. - a is odd, not relatively prime to m
  1132. - a is even, relatively prime to m
  1133. - a is even, not relatively prime to m
  1134. Even modulus
  1135. - a is even (should fail)
  1136. - a is odd, not relatively prime to m
  1137. - a is odd, relatively prime to m,
  1138. m is not a power of 2
  1139. - m has factor 2**k, k < 32
  1140. - m has factor 2**k, k > 32
  1141. m is a power of 2, 2**k
  1142. - k < 32
  1143. - k > 32
  1144. */
  1145. mp_init(&a); mp_init(&m); mp_init(&c);
  1146. mp_init(&p1); mp_init(&p2); mp_init(&p3); mp_init(&p4); mp_init(&p5);
  1147. mp_init(&t1); mp_init(&t2); mp_init(&t3); mp_init(&t4);
  1148. mp_read_radix(&p1, ivp1, 16);
  1149. mp_read_radix(&p2, ivp2, 16);
  1150. mp_read_radix(&p3, ivp3, 16);
  1151. mp_read_radix(&p4, ivp4, 16);
  1152. mp_read_radix(&p5, ivp5, 16);
  1153. IFOK( mp_2expt(&t2, 68) ); /* t2 = 2**68 */
  1154. IFOK( mp_2expt(&t3, 128) ); /* t3 = 2**128 */
  1155. IFOK( mp_2expt(&t4, 31) ); /* t4 = 2**31 */
  1156. /* test 3: Odd modulus - a is odd, relatively prime to m */
  1157. IFOK( mp_mul(&p1, &p2, &a) );
  1158. IFOK( mp_mul(&p3, &p4, &m) );
  1159. IFOK( mp_invmod(&a, &m, &t1) );
  1160. IFOK( mp_invmod_xgcd(&a, &m, &c) );
  1161. if (mp_cmp(&t1, &c) != 0) {
  1162. mp_toradix(&t1, g_intbuf, 16);
  1163. mp_toradix(&c, a_intbuf, 16);
  1164. reason("error: invmod test 3 computed %s, expected %s\n",
  1165. g_intbuf, a_intbuf);
  1166. return 1;
  1167. }
  1168. mp_clear(&a); mp_clear(&t1); mp_clear(&c);
  1169. mp_init(&a); mp_init(&t1); mp_init(&c);
  1170. /* test 4: Odd modulus - a is odd, NOT relatively prime to m */
  1171. IFOK( mp_mul(&p1, &p3, &a) );
  1172. /* reuse same m as before */
  1173. res = mp_invmod_xgcd(&a, &m, &c);
  1174. if (res != MP_UNDEF)
  1175. goto CLEANUP4;
  1176. res = mp_invmod(&a, &m, &t1); /* we expect this to fail. */
  1177. if (res != MP_UNDEF) {
  1178. CLEANUP4:
  1179. reason("error: invmod test 4 succeeded, should have failed.\n");
  1180. return 1;
  1181. }
  1182. mp_clear(&a); mp_clear(&t1); mp_clear(&c);
  1183. mp_init(&a); mp_init(&t1); mp_init(&c);
  1184. /* test 5: Odd modulus - a is even, relatively prime to m */
  1185. IFOK( mp_mul(&p1, &t2, &a) );
  1186. /* reuse m */
  1187. IFOK( mp_invmod(&a, &m, &t1) );
  1188. IFOK( mp_invmod_xgcd(&a, &m, &c) );
  1189. if (mp_cmp(&t1, &c) != 0) {
  1190. mp_toradix(&t1, g_intbuf, 16);
  1191. mp_toradix(&c, a_intbuf, 16);
  1192. reason("error: invmod test 5 computed %s, expected %s\n",
  1193. g_intbuf, a_intbuf);
  1194. return 1;
  1195. }
  1196. mp_clear(&a); mp_clear(&t1); mp_clear(&c);
  1197. mp_init(&a); mp_init(&t1); mp_init(&c);
  1198. /* test 6: Odd modulus - a is odd, NOT relatively prime to m */
  1199. /* reuse t2 */
  1200. IFOK( mp_mul(&t2, &p3, &a) );
  1201. /* reuse same m as before */
  1202. res = mp_invmod_xgcd(&a, &m, &c);
  1203. if (res != MP_UNDEF)
  1204. goto CLEANUP6;
  1205. res = mp_invmod(&a, &m, &t1); /* we expect this to fail. */
  1206. if (res != MP_UNDEF) {
  1207. CLEANUP6:
  1208. reason("error: invmod test 6 succeeded, should have failed.\n");
  1209. return 1;
  1210. }
  1211. mp_clear(&a); mp_clear(&m); mp_clear(&c); mp_clear(&t1);
  1212. mp_init(&a); mp_init(&m); mp_init(&c); mp_init(&t1);
  1213. /* test 7: Even modulus, even a, should fail */
  1214. IFOK( mp_mul(&p3, &t3, &m) ); /* even m */
  1215. /* reuse t2 */
  1216. IFOK( mp_mul(&p1, &t2, &a) ); /* even a */
  1217. res = mp_invmod_xgcd(&a, &m, &c);
  1218. if (res != MP_UNDEF)
  1219. goto CLEANUP7;
  1220. res = mp_invmod(&a, &m, &t1); /* we expect this to fail. */
  1221. if (res != MP_UNDEF) {
  1222. CLEANUP7:
  1223. reason("error: invmod test 7 succeeded, should have failed.\n");
  1224. return 1;
  1225. }
  1226. mp_clear(&a); mp_clear(&c); mp_clear(&t1);
  1227. mp_init(&a); mp_init(&c); mp_init(&t1);
  1228. /* test 8: Even modulus - a is odd, not relatively prime to m */
  1229. /* reuse m */
  1230. IFOK( mp_mul(&p3, &p1, &a) ); /* even a */
  1231. res = mp_invmod_xgcd(&a, &m, &c);
  1232. if (res != MP_UNDEF)
  1233. goto CLEANUP8;
  1234. res = mp_invmod(&a, &m, &t1); /* we expect this to fail. */
  1235. if (res != MP_UNDEF) {
  1236. CLEANUP8:
  1237. reason("error: invmod test 8 succeeded, should have failed.\n");
  1238. return 1;
  1239. }
  1240. mp_clear(&a); mp_clear(&m); mp_clear(&c); mp_clear(&t1);
  1241. mp_init(&a); mp_init(&m); mp_init(&c); mp_init(&t1);
  1242. /* test 9: Even modulus - m has factor 2**k, k < 32
  1243. * - a is odd, relatively prime to m,
  1244. */
  1245. IFOK( mp_mul(&p3, &t4, &m) ); /* even m */
  1246. IFOK( mp_mul(&p1, &p2, &a) );
  1247. IFOK( mp_invmod(&a, &m, &t1) );
  1248. IFOK( mp_invmod_xgcd(&a, &m, &c) );
  1249. if (mp_cmp(&t1, &c) != 0) {
  1250. mp_toradix(&t1, g_intbuf, 16);
  1251. mp_toradix(&c, a_intbuf, 16);
  1252. reason("error: invmod test 9 computed %s, expected %s\n",
  1253. g_intbuf, a_intbuf);
  1254. return 1;
  1255. }
  1256. mp_clear(&m); mp_clear(&t1); mp_clear(&c);
  1257. mp_init(&m); mp_init(&t1); mp_init(&c);
  1258. /* test 10: Even modulus - m has factor 2**k, k > 32
  1259. * - a is odd, relatively prime to m,
  1260. */
  1261. IFOK( mp_mul(&p3, &t3, &m) ); /* even m */
  1262. /* reuse a */
  1263. IFOK( mp_invmod(&a, &m, &t1) );
  1264. IFOK( mp_invmod_xgcd(&a, &m, &c) );
  1265. if (mp_cmp(&t1, &c) != 0) {
  1266. mp_toradix(&t1, g_intbuf, 16);
  1267. mp_toradix(&c, a_intbuf, 16);
  1268. reason("error: invmod test 10 computed %s, expected %s\n",
  1269. g_intbuf, a_intbuf);
  1270. return 1;
  1271. }
  1272. mp_clear(&t1); mp_clear(&c);
  1273. mp_init(&t1); mp_init(&c);
  1274. /* test 11: Even modulus - m is a power of 2, 2**k | k < 32
  1275. * - a is odd, relatively prime to m,
  1276. */
  1277. IFOK( mp_invmod(&a, &t4, &t1) );
  1278. IFOK( mp_invmod_xgcd(&a, &t4, &c) );
  1279. if (mp_cmp(&t1, &c) != 0) {
  1280. mp_toradix(&t1, g_intbuf, 16);
  1281. mp_toradix(&c, a_intbuf, 16);
  1282. reason("error: invmod test 11 computed %s, expected %s\n",
  1283. g_intbuf, a_intbuf);
  1284. return 1;
  1285. }
  1286. mp_clear(&t1); mp_clear(&c);
  1287. mp_init(&t1); mp_init(&c);
  1288. /* test 12: Even modulus - m is a power of 2, 2**k | k > 32
  1289. * - a is odd, relatively prime to m,
  1290. */
  1291. IFOK( mp_invmod(&a, &t3, &t1) );
  1292. IFOK( mp_invmod_xgcd(&a, &t3, &c) );
  1293. if (mp_cmp(&t1, &c) != 0) {
  1294. mp_toradix(&t1, g_intbuf, 16);
  1295. mp_toradix(&c, a_intbuf, 16);
  1296. reason("error: invmod test 12 computed %s, expected %s\n",
  1297. g_intbuf, a_intbuf);
  1298. return 1;
  1299. }
  1300. mp_clear(&a); mp_clear(&m); mp_clear(&c);
  1301. mp_clear(&t1); mp_clear(&t2); mp_clear(&t3); mp_clear(&t4);
  1302. mp_clear(&p1); mp_clear(&p2); mp_clear(&p3); mp_clear(&p4); mp_clear(&p5);
  1303. return 0;
  1304. }
  1305. /*------------------------------------------------------------------------*/
  1306. int test_cmp_d(void)
  1307. {
  1308. mp_int a;
  1309. mp_init(&a); mp_read_radix(&a, mp8, 16);
  1310. if(mp_cmp_d(&a, md8) >= 0) {
  1311. reason("error: %s >= " DIGIT_FMT "\n", mp8, md8);
  1312. mp_clear(&a);
  1313. return 1;
  1314. }
  1315. mp_read_radix(&a, mp5, 16);
  1316. if(mp_cmp_d(&a, md8) <= 0) {
  1317. reason("error: %s <= " DIGIT_FMT "\n", mp5, md8);
  1318. mp_clear(&a);
  1319. return 1;
  1320. }
  1321. mp_read_radix(&a, mp6, 16);
  1322. if(mp_cmp_d(&a, md1) != 0) {
  1323. reason("error: %s != " DIGIT_FMT "\n", mp6, md1);
  1324. mp_clear(&a);
  1325. return 1;
  1326. }
  1327. mp_clear(&a);
  1328. return 0;
  1329. }
  1330. /*------------------------------------------------------------------------*/
  1331. int test_cmp_z(void)
  1332. {
  1333. mp_int a;
  1334. mp_init(&a); mp_read_radix(&a, mp6, 16);
  1335. if(mp_cmp_z(&a) != 0) {
  1336. reason("error: someone thinks a zero value is non-zero\n");
  1337. mp_clear(&a);
  1338. return 1;
  1339. }
  1340. mp_read_radix(&a, mp1, 16);
  1341. if(mp_cmp_z(&a) <= 0) {
  1342. reason("error: someone thinks a positive value is non-positive\n");
  1343. mp_clear(&a);
  1344. return 1;
  1345. }
  1346. mp_read_radix(&a, mp4, 16);
  1347. if(mp_cmp_z(&a) >= 0) {
  1348. reason("error: someone thinks a negative value is non-negative\n");
  1349. mp_clear(&a);
  1350. return 1;
  1351. }
  1352. mp_clear(&a);
  1353. return 0;
  1354. }
  1355. /*------------------------------------------------------------------------*/
  1356. int test_cmp(void)
  1357. {
  1358. mp_int a, b;
  1359. mp_init(&a); mp_init(&b);
  1360. mp_read_radix(&a, mp3, 16); mp_read_radix(&b, mp4, 16);
  1361. if(mp_cmp(&a, &b) <= 0) {
  1362. reason("error: %s <= %s\n", mp3, mp4);
  1363. mp_clear(&a); mp_clear(&b);
  1364. return 1;
  1365. }
  1366. mp_read_radix(&b, mp3, 16);
  1367. if(mp_cmp(&a, &b) != 0) {
  1368. reason("error: %s != %s\n", mp3, mp3);
  1369. mp_clear(&a); mp_clear(&b);
  1370. return 1;
  1371. }
  1372. mp_read_radix(&a, mp5, 16);
  1373. if(mp_cmp(&a, &b) >= 0) {
  1374. reason("error: %s >= %s\n", mp5, mp3);
  1375. mp_clear(&a); mp_clear(&b);
  1376. return 1;
  1377. }
  1378. mp_read_radix(&a, mp5a, 16);
  1379. if(mp_cmp_int(&a, 1000000) >= 0 ||
  1380. (mp_cmp_int(&a, -5000000) <= 0) ||
  1381. (mp_cmp_int(&a, -4938110) != 0)) {
  1382. reason("error: long integer comparison failed (%s)", mp5a);
  1383. mp_clear(&a); mp_clear(&b);
  1384. return 1;
  1385. }
  1386. mp_clear(&a); mp_clear(&b);
  1387. return 0;
  1388. }
  1389. /*------------------------------------------------------------------------*/
  1390. int test_cmp_mag(void)
  1391. {
  1392. mp_int a, b;
  1393. mp_init(&a); mp_init(&b);
  1394. mp_read_radix(&a, mp5, 16); mp_read_radix(&b, mp4, 16);
  1395. if(mp_cmp_mag(&a, &b) >= 0) {
  1396. reason("error: %s >= %s\n", mp5, mp4);
  1397. mp_clear(&a); mp_clear(&b);
  1398. return 1;
  1399. }
  1400. mp_read_radix(&b, mp5, 16);
  1401. if(mp_cmp_mag(&a, &b) != 0) {
  1402. reason("error: %s != %s\n", mp5, mp5);
  1403. mp_clear(&a); mp_clear(&b);
  1404. return 1;
  1405. }
  1406. mp_read_radix(&a, mp1, 16);
  1407. if(mp_cmp_mag(&b, &a) >= 0) {
  1408. reason("error: %s >= %s\n", mp5, mp1);
  1409. mp_clear(&a); mp_clear(&b);
  1410. return 1;
  1411. }
  1412. mp_clear(&a); mp_clear(&b);
  1413. return 0;
  1414. }
  1415. /*------------------------------------------------------------------------*/
  1416. int test_parity(void)
  1417. {
  1418. mp_int a;
  1419. mp_init(&a); mp_read_radix(&a, mp1, 16);
  1420. if(!mp_isodd(&a)) {
  1421. reason("error: expected operand to be odd, but it isn't\n");
  1422. mp_clear(&a);
  1423. return 1;
  1424. }
  1425. mp_read_radix(&a, mp6, 16);
  1426. if(!mp_iseven(&a)) {
  1427. reason("error: expected operand to be even, but it isn't\n");
  1428. mp_clear(&a);
  1429. return 1;
  1430. }
  1431. mp_clear(&a);
  1432. return 0;
  1433. }
  1434. /*------------------------------------------------------------------------*/
  1435. int test_gcd(void)
  1436. {
  1437. mp_int a, b;
  1438. int out = 0;
  1439. mp_init(&a); mp_init(&b);
  1440. mp_read_radix(&a, mp7, 16); mp_read_radix(&b, mp1, 16);
  1441. mp_gcd(&a, &b, &a);
  1442. mp_toradix(&a, g_intbuf, 16);
  1443. if(strcmp(g_intbuf, g_mp71) != 0) {
  1444. reason("error: computed %s, expected %s\n", g_intbuf, g_mp71);
  1445. out = 1;
  1446. }
  1447. mp_clear(&a); mp_clear(&b);
  1448. return out;
  1449. }
  1450. /*------------------------------------------------------------------------*/
  1451. int test_lcm(void)
  1452. {
  1453. mp_int a, b;
  1454. int out = 0;
  1455. mp_init(&a); mp_init(&b);
  1456. mp_read_radix(&a, mp10, 16); mp_read_radix(&b, mp11, 16);
  1457. mp_lcm(&a, &b, &a);
  1458. mp_toradix(&a, g_intbuf, 16);
  1459. if(strcmp(g_intbuf, l_mp1011) != 0) {
  1460. reason("error: computed %s, expected%s\n", g_intbuf, l_mp1011);
  1461. out = 1;
  1462. }
  1463. mp_clear(&a); mp_clear(&b);
  1464. return out;
  1465. }
  1466. /*------------------------------------------------------------------------*/
  1467. int test_convert(void)
  1468. {
  1469. int ix;
  1470. mp_int a;
  1471. mp_init(&a); mp_read_radix(&a, mp9, 16);
  1472. for(ix = LOW_RADIX; ix <= HIGH_RADIX; ix++) {
  1473. mp_toradix(&a, g_intbuf, ix);
  1474. if(strcmp(g_intbuf, v_mp9[ix - LOW_RADIX]) != 0) {
  1475. reason("error: radix %d, computed %s, expected %s\n",
  1476. ix, g_intbuf, v_mp9[ix - LOW_RADIX]);
  1477. mp_clear(&a);
  1478. return 1;
  1479. }
  1480. }
  1481. mp_clear(&a);
  1482. return 0;
  1483. }
  1484. /*------------------------------------------------------------------------*/
  1485. int test_raw(void)
  1486. {
  1487. int len, out = 0;
  1488. mp_int a;
  1489. char *buf;
  1490. mp_init(&a); mp_read_radix(&a, mp4, 16);
  1491. len = mp_raw_size(&a);
  1492. if(len != sizeof(b_mp4)) {
  1493. reason("error: test_raw: expected length %d, computed %d\n", sizeof(b_mp4),
  1494. len);
  1495. mp_clear(&a);
  1496. return 1;
  1497. }
  1498. buf = calloc(len, sizeof(char));
  1499. mp_toraw(&a, buf);
  1500. if(memcmp(buf, b_mp4, sizeof(b_mp4)) != 0) {
  1501. reason("error: test_raw: binary output does not match test vector\n");
  1502. out = 1;
  1503. }
  1504. free(buf);
  1505. mp_clear(&a);
  1506. return out;
  1507. }
  1508. /*------------------------------------------------------------------------*/
  1509. int test_pprime(void)
  1510. {
  1511. mp_int p;
  1512. int err = 0;
  1513. mp_err res;
  1514. mp_init(&p);
  1515. mp_read_radix(&p, mp7, 16);
  1516. if(mpp_pprime(&p, 5) != MP_YES) {
  1517. reason("error: %s failed Rabin-Miller test, but is prime\n", mp7);
  1518. err = 1;
  1519. }
  1520. IFOK( mp_set_int(&p, 9) );
  1521. res = mpp_pprime(&p, 50);
  1522. if (res == MP_YES) {
  1523. reason("error: 9 is composite but passed Rabin-Miller test\n");
  1524. err = 1;
  1525. } else if (res != MP_NO) {
  1526. reason("test mpp_pprime(9, 50) failed: error %d\n", res);
  1527. err = 1;
  1528. }
  1529. IFOK( mp_set_int(&p, 15) );
  1530. res = mpp_pprime(&p, 50);
  1531. if (res == MP_YES) {
  1532. reason("error: 15 is composite but passed Rabin-Miller test\n");
  1533. err = 1;
  1534. } else if (res != MP_NO) {
  1535. reason("test mpp_pprime(15, 50) failed: error %d\n", res);
  1536. err = 1;
  1537. }
  1538. mp_clear(&p);
  1539. return err;
  1540. }
  1541. /*------------------------------------------------------------------------*/
  1542. int test_fermat(void)
  1543. {
  1544. mp_int p;
  1545. mp_err res;
  1546. int err = 0;
  1547. mp_init(&p);
  1548. mp_read_radix(&p, mp7, 16);
  1549. if((res = mpp_fermat(&p, 2)) != MP_YES) {
  1550. reason("error: %s failed Fermat test on 2: %s\n", mp7,
  1551. mp_strerror(res));
  1552. ++err;
  1553. }
  1554. if((res = mpp_fermat(&p, 3)) != MP_YES) {
  1555. reason("error: %s failed Fermat test on 3: %s\n", mp7,
  1556. mp_strerror(res));
  1557. ++err;
  1558. }
  1559. mp_clear(&p);
  1560. return err;
  1561. }
  1562. /*------------------------------------------------------------------------*/
  1563. /* Like fprintf(), but only if we are behaving in a verbose manner */
  1564. void reason(char *fmt, ...)
  1565. {
  1566. va_list ap;
  1567. if(!g_verbose)
  1568. return;
  1569. va_start(ap, fmt);
  1570. vfprintf(stderr, fmt, ap);
  1571. va_end(ap);
  1572. }
  1573. /*------------------------------------------------------------------------*/
  1574. /* HERE THERE BE DRAGONS */