├── .gitignore ├── CMakeLists.txt ├── LICENSE ├── README.md ├── include ├── precision.h ├── sm2.h └── sm3.h ├── install_miracl.sh ├── src ├── sm2 │ ├── inner_utils.cpp │ ├── inner_utils.h │ ├── sm2_enc.cpp │ ├── sm2_enc.h │ ├── sm2_sign.cpp │ └── sm2_sign.h └── sm3 │ ├── sm3_miracl_wrapper.cpp │ ├── sm3_miracl_wrapper.h │ ├── sm3_reference.cpp │ └── sm3_reference.h └── test ├── sm2 └── test_sm2.cpp ├── sm3 └── test_sm3.cpp └── test_miracl_env.cpp /.gitignore: -------------------------------------------------------------------------------- 1 | .idea/ 2 | miracl/ 3 | cmake-build-debug/ -------------------------------------------------------------------------------- /CMakeLists.txt: -------------------------------------------------------------------------------- 1 | cmake_minimum_required(VERSION 3.13) # CMake version check 2 | project(simple_example) # Create project "simple_example" 3 | set(CMAKE_CXX_STANDARD 11) # Enable c++14 standard 4 | add_definitions(-std=c++11) 5 | set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -m64 -O2 ") 6 | 7 | #include 8 | include_directories(include) 9 | 10 | include_directories(src) 11 | 12 | 13 | # miracl 14 | include_directories(miracl) 15 | add_library(LIBMIRACL miracl/miracl.a) 16 | set_target_properties(LIBMIRACL PROPERTIES LINKER_LANGUAGE CXX) 17 | add_library(LIBBIG miracl/big.cpp miracl/big.h) 18 | 19 | set(LIB_SOURCE 20 | miracl/big.cpp 21 | miracl/ecn.cpp) 22 | 23 | set(HEADER_SOURCE 24 | include/sm2.h 25 | include/sm3.h) 26 | set(INNER_HEADER_SOURCE 27 | src/sm2/inner_utils.h 28 | src/sm3/sm3_miracl_wrapper.h 29 | src/sm3/sm3_reference.h 30 | src/sm2/sm2_enc.h 31 | src/sm2/sm2_sign.h) 32 | set(MAIN_SOURCE 33 | src/sm2/inner_utils.cpp 34 | src/sm3/sm3_miracl_wrapper.cpp 35 | src/sm3/sm3_reference.cpp 36 | src/sm2/sm2_enc.cpp 37 | src/sm2/sm2_sign.cpp) 38 | 39 | # sm2 lib 40 | add_library(SM2 ${HEADER_SOURCE} ${MAIN_SOURCE}) 41 | 42 | # executable target 43 | add_executable(TestMiracl test/test_miracl_env.cpp) 44 | target_link_libraries(TestMiracl ${LIBMIRACL} LIBBIG) 45 | 46 | add_executable(SM3UnitTest test/sm3/test_sm3.cpp ${HEADER_SOURCE} ${MAIN_SOURCE} miracl/big.cpp) 47 | target_link_libraries(SM3UnitTest ${LIBMIRACL} LIBBIG) 48 | 49 | add_executable(SM2UnitTest test/sm2/test_sm2.cpp ${LIB_SOURCE}) 50 | target_link_libraries(SM2UnitTest ${LIBMIRACL} LIBBIG SM2) -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # SM2密码方案C++实现 2 | 3 | ## 环境 4 | 5 | 使用MIRACL库来完成大数运算，通过C++运算符重载以直接通过一般的运算表达式完成大数运算。 6 | 在Linux环境下可以使用`install_miracl.sh`来安装，将会在项目文件夹下创建`miracl`目录，并将源代码和静态链接库安装到`/usr/include/miracl`和`/usr/lib`。 7 | 8 | ## 运行与调试 9 | 10 | 通过`CMakeLisst.txt`组织项目代码，可以通过CLion加载该文件来调试运行对应的测试。 11 | 12 | `test`下包含Catch2测试用例，负责对应模块的单元测试。 13 | -------------------------------------------------------------------------------- /include/precision.h: -------------------------------------------------------------------------------- 1 | // 2 | // Created by acherstyx on 8/8/20. 3 | // 4 | 5 | #ifndef SIMPLE_EXAMPLE_PRECISION_H 6 | #define SIMPLE_EXAMPLE_PRECISION_H 7 | 8 | #include "big.h" 9 | 10 | #ifndef BINARY_PRECISION 11 | #define BINARY_PRECISION 1024 12 | Miracl precision(BINARY_PRECISION, 2); 13 | #endif 14 | 15 | #endif //SIMPLE_EXAMPLE_PRECISION_H 16 | -------------------------------------------------------------------------------- /include/sm2.h: -------------------------------------------------------------------------------- 1 | // 2 | // Created by acherstyx on 8/5/20. 3 | // 4 | 5 | #ifndef SM2_SM2_H 6 | #define SM2_SM2_H 7 | 8 | // miracl lib 9 | #include 10 | #include 11 | 12 | // std lib 13 | #include 14 | #include 15 | #include 16 | 17 | // inner header file 18 | #include 19 | #include 20 | 21 | #endif //SM2_SM2_H 22 | -------------------------------------------------------------------------------- /include/sm3.h: -------------------------------------------------------------------------------- 1 | // 2 | // Created by acherstyx on 8/6/20. 3 | // 4 | 5 | #ifndef SIMPLE_EXAMPLE_SM3_H 6 | #define SIMPLE_EXAMPLE_SM3_H 7 | 8 | // miracl lib 9 | #include 10 | 11 | // std lib 12 | #include 13 | #include 14 | #include 15 | 16 | // inner header file 17 | #include 18 | #include 19 | 20 | #endif //SIMPLE_EXAMPLE_SM3_H 21 | -------------------------------------------------------------------------------- /install_miracl.sh: -------------------------------------------------------------------------------- 1 | #!/bin/bash 2 | mkdir miracl 3 | cd miracl 4 | wget https://codeload.github.com/miracl/MIRACL/zip/master -O MIRACL-master.zip 5 | unzip -j -aa -L MIRACL-master.zip 6 | echo "INFO: Compiling" 7 | bash linux64 8 | echo "INFO: Copy miracl.a to /usr/lib/libmiracl.a ..." 9 | sudo cp miracl.a /usr/lib/libmiracl.a 10 | sudo mkdir -p /usr/include/miracl 11 | sudo cp *.h /usr/include/miracl 12 | -------------------------------------------------------------------------------- /src/sm2/inner_utils.cpp: -------------------------------------------------------------------------------- 1 | // 2 | // Created by acherstyx on 8/5/20. 3 | // 4 | #include 5 | #include 6 | #include "inner_utils.h" 7 | 8 | #include "big.h" 9 | 10 | extern "C" { 11 | #include "miracl.h" 12 | } 13 | 14 | Big gen_SEED() { 15 | time_t seed; 16 | time(&seed); 17 | 18 | struct timespec tn; 19 | clock_gettime(CLOCK_REALTIME, &tn); 20 | 21 | irand(unsigned(tn.tv_nsec)); 22 | 23 | return rand(int(random()) % (512 - 192) + 192, 2); 24 | } 25 | 26 | Big Hash_256(const Big &SEED) { 27 | return SM3_Hash_256(SEED); 28 | } 29 | 30 | 31 | void gen_ECC_a_b(const Big &H, const Big &p, Big &a_, Big &b_) { 32 | #define R H 33 | while (true) { 34 | Big r = R % p; 35 | 36 | b_ = r; 37 | a_ = rand(p.len() + 10, 2) % p; 38 | if (valid_ECC_a_b(a_, b_, p)) 39 | return; 40 | else 41 | continue; 42 | } 43 | 44 | #undef R 45 | } 46 | 47 | 48 | bool valid_ECC_a_b(const Big &a, const Big &b, const Big &p) { 49 | Big condition = (4 * a * a * a + 27 * b * b) % p; 50 | // cout << condition; 51 | if (condition == 0) 52 | return false; 53 | else 54 | return true; 55 | } 56 | 57 | 58 | -------------------------------------------------------------------------------- /src/sm2/inner_utils.h: -------------------------------------------------------------------------------- 1 | // 2 | // Created by acherstyx on 8/5/20. 3 | // 4 | 5 | #ifndef SIMPLE_EXAMPLE_INNER_UTILS_H 6 | #define SIMPLE_EXAMPLE_INNER_UTILS_H 7 | 8 | #include "big.h" 9 | #include "sm3.h" 10 | 11 | Big gen_SEED(); 12 | 13 | Big Hash_256(const Big &SEED); 14 | 15 | void gen_ECC_a_b(const Big &H, const Big &p, Big &a, Big &b); 16 | 17 | bool valid_ECC_a_b(const Big &a, const Big &b, const Big &p); 18 | 19 | #endif //SIMPLE_EXAMPLE_INNER_UTILS_H 20 | -------------------------------------------------------------------------------- /src/sm2/sm2_enc.cpp: -------------------------------------------------------------------------------- 1 | // 2 | // Created by acherstyx on 8/7/20. 3 | // 4 | 5 | #include 6 | #include 7 | #include "sm2_enc.h" 8 | #include "big.h" 9 | #include "ecn.h" 10 | 11 | //#define SM2_ENC_DEBUG 12 | 13 | struct FPECC Ecc256 = { 14 | "FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFF", 15 | "FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFC", 16 | "28E9FA9E9D9F5E344D5A9E4BCF6509A7F39789F515AB8F92DDBCBD414D940E93", 17 | "FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFF7203DF6B21C6052B53BBF40939D54123", 18 | "32C4AE2C1F1981195F9904466A39C9948FE30BBFF2660BE1715A4589334C74C7", 19 | "BC3736A2F4F6779C59BDCEE36B692153D0A9877CC62A474002DF32E52139F0A0", 20 | }; 21 | 22 | void sm2_key_gen(Big &x, Big &y, Big &private_key) { 23 | Big a, b, p, n; 24 | miracl *mip = mirsys(20, 0); 25 | epoint *g; 26 | 27 | mip->IOBASE = 16; 28 | 29 | // use static ecc parameter 30 | cinstr(p.getbig(), Ecc256.p); 31 | cinstr(a.getbig(), Ecc256.a); 32 | cinstr(b.getbig(), Ecc256.b); 33 | cinstr(n.getbig(), Ecc256.n); 34 | cinstr(x.getbig(), Ecc256.x); 35 | cinstr(y.getbig(), Ecc256.y); 36 | 37 | // define ecc 38 | ecurve_init(a.getbig(), b.getbig(), p.getbig(), MR_PROJECTIVE); 39 | g = epoint_init(); 40 | epoint_set(x.getbig(), y.getbig(), 0, g); 41 | // rand private key 42 | struct timespec tn; 43 | clock_gettime(CLOCK_REALTIME, &tn); 44 | irand(unsigned(tn.tv_nsec)); 45 | 46 | bigrand(n.getbig(), private_key.getbig()); 47 | // point 48 | ecurve_mult(private_key.getbig(), g, g); 49 | epoint_get(g, x.getbig(), y.getbig()); 50 | mip->IOBASE = 10; 51 | } 52 | 53 | int kdf(unsigned char *zl, unsigned char *zr, int klen, unsigned char *kbuf) { 54 | /* 55 | return 0: kbuf is 0, unusable 56 | 1: kbuf is OK 57 | */ 58 | unsigned char buf[70]; 59 | unsigned char digest[32]; 60 | unsigned int ct = 0x00000001; 61 | int i, m, n; 62 | unsigned char *p; 63 | 64 | memcpy(buf, zl, 32); 65 | memcpy(buf + 32, zr, 32); 66 | 67 | m = klen / 32; 68 | n = klen % 32; 69 | p = kbuf; 70 | 71 | for (i = 0; i < m; i++) { 72 | buf[64] = (ct >> 24) & 0xFF; 73 | buf[65] = (ct >> 16) & 0xFF; 74 | buf[66] = (ct >> 8) & 0xFF; 75 | buf[67] = ct & 0xFF; 76 | SM3Calc(buf, 68, p); 77 | p += 32; 78 | ct++; 79 | } 80 | 81 | if (n != 0) { 82 | buf[64] = (ct >> 24) & 0xFF; 83 | buf[65] = (ct >> 16) & 0xFF; 84 | buf[66] = (ct >> 8) & 0xFF; 85 | buf[67] = ct & 0xFF; 86 | SM3Calc(buf, 68, digest); 87 | } 88 | 89 | memcpy(p, digest, n); 90 | 91 | for (i = 0; i < klen; i++) { 92 | if (kbuf[i] != 0) 93 | break; 94 | } 95 | 96 | if (i < klen) 97 | return 1; 98 | else 99 | return 0; 100 | } 101 | 102 | int sm2_enc(unsigned char *msg, int msg_len, Big x, Big y, unsigned char *msg_after_enc) { 103 | Big a, b, p, n; 104 | Big g_x, g_y; // g = 105 | Big k; // random number for encrypt 106 | FPECC ecc_config = Ecc256; // default ecc 107 | miracl *mip = mirsys(20, 0); 108 | epoint *g, *pb; // public key 109 | Big x1, y1; 110 | Big x2, y2; 111 | unsigned char zl[32], zr[32]; 112 | 113 | mip->IOBASE = 16; 114 | 115 | // get ecc parameter 116 | cinstr(p.getbig(), ecc_config.p); 117 | cinstr(a.getbig(), ecc_config.a); 118 | cinstr(b.getbig(), ecc_config.b); 119 | cinstr(n.getbig(), ecc_config.n); 120 | 121 | ecurve_init(a.getbig(), b.getbig(), p.getbig(), MR_PROJECTIVE); 122 | // read g 123 | cinstr(g_x.getbig(), ecc_config.x); 124 | cinstr(g_y.getbig(), ecc_config.y); 125 | g = epoint_init(); 126 | epoint_set(g_x.getbig(), g_y.getbig(), 0, g); 127 | 128 | // read pb 129 | pb = epoint_init(); 130 | epoint_set(x.getbig(), y.getbig(), 0, pb); 131 | 132 | restart_encrypt: 133 | 134 | // random k 135 | struct timespec tn; 136 | clock_gettime(CLOCK_REALTIME, &tn); 137 | irand(unsigned(tn.tv_nsec)); 138 | bigrand(n.getbig(), k.getbig()); 139 | 140 | #ifdef SM2_ENC_DEBUG 141 | cout << "[enc] rand k: " << k << "\n"; 142 | #endif 143 | 144 | // c1 145 | ecurve_mult(k.getbig(), g, g); 146 | epoint_get(g, x1.getbig(), y1.getbig()); 147 | big_to_bytes(32, x1.getbig(), (char *) msg_after_enc, TRUE); 148 | big_to_bytes(32, y1.getbig(), (char *) msg_after_enc + 32, TRUE); 149 | 150 | #ifdef SM2_ENC_DEBUG 151 | cout << "[enc] x1: " << x1 << " y1: " << y1 << "\n"; 152 | #endif 153 | 154 | // c2, c2 ^= msg 155 | ecurve_mult(k.getbig(), pb, pb); 156 | epoint_get(pb, x2.getbig(), y2.getbig()); 157 | 158 | #ifdef SM2_ENC_DEBUG 159 | cout << "[enc] x2: " << x2 << " y2: " << y2 << '\n'; 160 | #endif 161 | 162 | big_to_bytes(32, x2.getbig(), (char *) zl, TRUE); 163 | big_to_bytes(32, y2.getbig(), (char *) zr, TRUE); 164 | 165 | if (kdf(zl, zr, msg_len, msg_after_enc + 64) == 0) 166 | goto restart_encrypt; 167 | 168 | for (int i = 0; i < msg_len; i++) { 169 | msg_after_enc[i + 64] ^= msg[i]; 170 | } 171 | 172 | // c3 173 | unsigned char *temp = (unsigned char *) malloc(sizeof(unsigned char) * (32 + 32 + msg_len)); 174 | memcpy(temp, zl, 32); 175 | memcpy(temp + msg_len, msg, msg_len); 176 | memcpy(temp + msg_len + 32, zr, msg_len); 177 | SM3Calc(temp, 63 + msg_len, msg_after_enc + 64 + msg_len); 178 | 179 | mip->IOBASE = 10; 180 | return msg_len + 96; // [0:64] C1, [64:msg_len+64]: C2->KDF^msg, [msg_len+64:msg_len+96] C3(sm3_hash) 181 | } 182 | 183 | int sm2_dec(unsigned char *msg, int msg_len, Big d, unsigned char *msg_dec) { 184 | int klen = msg_len - 96; 185 | Big a, b, p, n; 186 | epoint *pb; 187 | FPECC ecc_config = Ecc256; // default ecc 188 | miracl *mip = mirsys(20, 0); 189 | Big x1, y1; // c1 190 | Big x2, y2; 191 | unsigned char zl[32], zr[32]; 192 | 193 | mip->IOBASE = 16; 194 | 195 | // get ecc parameter 196 | cinstr(p.getbig(), ecc_config.p); 197 | cinstr(a.getbig(), ecc_config.a); 198 | cinstr(b.getbig(), ecc_config.b); 199 | cinstr(n.getbig(), ecc_config.n); 200 | 201 | bytes_to_big(32, (char *) msg, x1.getbig()); 202 | bytes_to_big(32, (char *) msg + 32, y1.getbig()); 203 | 204 | // t 205 | ecurve_init(a.getbig(), b.getbig(), p.getbig(), MR_PROJECTIVE); 206 | pb = epoint_init(); 207 | epoint_set(x1.getbig(), y1.getbig(), 0, pb); 208 | ecurve_mult(d.getbig(), pb, pb); 209 | epoint_get(pb, x2.getbig(), y2.getbig()); 210 | big_to_bytes(32, x2.getbig(), (char *) zl, TRUE); 211 | big_to_bytes(32, y2.getbig(), (char *) zr, TRUE); 212 | 213 | #ifdef SM2_ENC_DEBUG 214 | cout << "[dec] x2: " << x2 << " y2: " << y2 << '\n'; 215 | cout << "[dec] should be the same with in [enc]!\n"; 216 | #endif 217 | 218 | kdf(zl, zr, klen, msg_dec); 219 | 220 | for (int i = 0; i < klen; i++) { 221 | msg_dec[i] ^= msg[i + 64]; 222 | } 223 | 224 | mip->IOBASE = 10; 225 | 226 | return klen; 227 | } -------------------------------------------------------------------------------- /src/sm2/sm2_enc.h: -------------------------------------------------------------------------------- 1 | // 2 | // Created by acherstyx on 8/7/20. 3 | // 4 | 5 | #ifndef SIMPLE_EXAMPLE_SM2_ENC_H 6 | #define SIMPLE_EXAMPLE_SM2_ENC_H 7 | 8 | #include "ecn.h" 9 | #include "big.h" 10 | #include "sm3/sm3_miracl_wrapper.h" 11 | 12 | typedef struct FPECC { 13 | char *p; 14 | char *a; 15 | char *b; 16 | char *n; 17 | char *x; 18 | char *y; 19 | } FPECC; 20 | 21 | /*SM2*/ 22 | extern struct FPECC Ecc256; 23 | 24 | void sm2_key_gen(Big &x, Big &y, Big &private_key); 25 | 26 | int sm2_enc(unsigned char *msg, int msg_len, Big x, Big y, unsigned char *msg_after_enc); 27 | 28 | int sm2_dec(unsigned char *msg, int msg_len, Big d, unsigned char *msg_dec); 29 | 30 | #endif //SIMPLE_EXAMPLE_SM2_ENC_H 31 | -------------------------------------------------------------------------------- /src/sm2/sm2_sign.cpp: -------------------------------------------------------------------------------- 1 | // 2 | // Created by acherstyx on 8/16/20. 3 | // 4 | 5 | #include "sm2_sign.h" 6 | #include 7 | #include 8 | 9 | //#define SM2_SIGN_DEBUG 10 | 11 | Big hash_Za(unsigned char *ID_A, unsigned int ID_A_len, const Big &a, const Big &b, 12 | const Big &x_g, const Big &y_g, const Big &x_a, const Big &y_a) { 13 | #ifdef SM2_SIGN_DEBUG 14 | cout << "ID: " << ID_A << " ID len: " << ID_A_len << "\n"; 15 | cout << "a: " << a << " b: " << b << "\n"; 16 | cout << "xa: " << x_a << "\n" << "ya: " << y_a << "\n"; 17 | #endif 18 | unsigned char ENTL[2], a_char[1000], b_char[1000], x_g_char[1000], y_g_char[1000], x_a_char[1000], y_a_char[1000]; 19 | unsigned int ENTL_len, a_len, b_len, x_g_len, y_g_len, x_a_len, y_a_len; 20 | 21 | unsigned char message[6002]; 22 | unsigned char hash_result[32]; 23 | 24 | big2char(Big(ID_A_len % 0xffff), ENTL, ENTL_len); 25 | if (ENTL_len > 2) 26 | throw exception(); 27 | 28 | big2char(a, a_char, a_len); 29 | big2char(b, b_char, b_len); 30 | big2char(x_g, x_g_char, x_g_len); 31 | big2char(y_g, y_g_char, y_g_len); 32 | big2char(x_a, x_a_char, x_a_len); 33 | big2char(y_a, y_a_char, y_a_len); 34 | 35 | memcpy(message, ENTL, ENTL_len); 36 | memcpy(message + ENTL_len, ID_A, ID_A_len); 37 | memcpy(message + ENTL_len + ID_A_len, a_char, a_len); 38 | memcpy(message + ENTL_len + ID_A_len + a_len, b_char, b_len); 39 | memcpy(message + ENTL_len + ID_A_len + a_len + b_len, x_g_char, x_g_len); 40 | memcpy(message + ENTL_len + ID_A_len + a_len + b_len + x_g_len, y_g_char, y_g_len); 41 | memcpy(message + ENTL_len + ID_A_len + a_len + b_len + x_g_len + y_g_len, x_a_char, x_a_len); 42 | memcpy(message + ENTL_len + ID_A_len + a_len + b_len + x_g_len + y_g_len + x_a_len, y_a_char, y_a_len); 43 | 44 | SM3Calc(message, ENTL_len + ID_A_len + a_len + b_len + x_g_len + y_g_len + x_a_len + y_a_len, hash_result); 45 | 46 | 47 | #ifdef SM2_SIGN_DEBUG 48 | cout << "Z_A: " << char2big(hash_result, 32) << "\n"; 49 | #endif 50 | return char2big(hash_result, 32); 51 | } 52 | 53 | 54 | void sm2_sign(unsigned char *ID_A, unsigned int ID_A_len, unsigned char *message, unsigned int message_len, 55 | const Big &key, Big &r, Big &s) { 56 | miracl *mip = mirsys(20, 0); 57 | FPECC ecc_config = Ecc256; 58 | Big a, b, p, n, g_x, g_y; 59 | 60 | unsigned char *M; 61 | unsigned char Za_char[1000]; 62 | unsigned int Za_len; 63 | unsigned char e_char[32]; // hash 256 64 | Big Za, e, k, x1, y1, xd, yd, z; 65 | epoint *g; 66 | 67 | // ecc parameter 68 | mip->IOBASE = 16; 69 | cinstr(p.getbig(), ecc_config.p); 70 | cinstr(a.getbig(), ecc_config.a); 71 | cinstr(b.getbig(), ecc_config.b); 72 | cinstr(n.getbig(), ecc_config.n); 73 | cinstr(g_x.getbig(), ecc_config.x); 74 | cinstr(g_y.getbig(), ecc_config.y); 75 | mip->IOBASE = 10; 76 | // init ecc 77 | ecurve_init(a.getbig(), b.getbig(), p.getbig(), MR_PROJECTIVE); 78 | g = epoint_init(); 79 | epoint_set(g_x.getbig(), g_y.getbig(), 0, g); 80 | 81 | // Za 82 | epoint *pa = epoint_init(); 83 | epoint_set(g_x.getbig(), g_y.getbig(), 0, pa); 84 | ecurve_mult(key.getbig(), pa, pa); 85 | Big xa, ya; 86 | epoint_get(pa, xa.getbig(), ya.getbig()); 87 | Za = hash_Za(ID_A, ID_A_len, a, b, g_x, g_y, xa, ya); 88 | 89 | // Z_a || M 90 | big2char(Za, Za_char, Za_len); 91 | M = (unsigned char *) malloc(sizeof(unsigned char) * (message_len + Za_len)); 92 | memcpy(M, Za_char, Za_len); 93 | memcpy(M + Za_len, message, message_len); 94 | #ifdef SM2_SIGN_DEBUG 95 | cout << "Za len: " << Za_len << "\n"; 96 | #endif 97 | 98 | // hash(M) 99 | SM3Calc(M, message_len + Za_len, e_char); 100 | free(M); 101 | e = char2big(e_char, 32); 102 | #ifdef SM2_SIGN_DEBUG 103 | cout << "e in sign: " << e << "\n"; 104 | #endif 105 | 106 | restart_sign: 107 | 108 | // random k 109 | struct timespec tn{}; 110 | clock_gettime(CLOCK_REALTIME, &tn); 111 | irand(unsigned(tn.tv_nsec)); 112 | bigrand(n.getbig(), k.getbig()); 113 | 114 | #ifdef SM2_SIGN_DEBUG 115 | cout << "rand k: " << k << "\n"; 116 | #endif 117 | 118 | // c1 -> 119 | ecurve_mult(k.getbig(), g, g); 120 | epoint_get(g, x1.getbig(), y1.getbig()); 121 | 122 | // r, s 123 | r = (e + x1) % n; 124 | if (r == 0 || r + k == n) goto restart_sign; 125 | xgcd((1 + key).getbig(), n.getbig(), xd.getbig(), yd.getbig(), z.getbig()); 126 | if (z != 1) throw exception(); // check 127 | s = ((xd * (k - r * key)) % n + n) % n; 128 | if (s == 0) goto restart_sign; 129 | } 130 | 131 | bool sm2_verify(unsigned char *ID_A, unsigned int ID_A_len, unsigned char *message, unsigned int message_len, 132 | const Big &r, const Big &s, const Big &xa, const Big &ya) { 133 | miracl *mip = mirsys(20, 0); 134 | FPECC ecc_config = Ecc256; 135 | Big a, b, p, n, g_x, g_y; 136 | epoint *g, *pa; 137 | 138 | unsigned char *M; 139 | unsigned char e_char[32]; // hash 256 140 | Big Za, e, t, x1, y1, R; 141 | 142 | // ecc parameter 143 | mip->IOBASE = 16; 144 | cinstr(p.getbig(), ecc_config.p); 145 | cinstr(a.getbig(), ecc_config.a); 146 | cinstr(b.getbig(), ecc_config.b); 147 | cinstr(n.getbig(), ecc_config.n); 148 | cinstr(g_x.getbig(), ecc_config.x); 149 | cinstr(g_y.getbig(), ecc_config.y); 150 | mip->IOBASE = 10; 151 | // init ecc 152 | ecurve_init(a.getbig(), b.getbig(), p.getbig(), MR_PROJECTIVE); 153 | g = epoint_init(); 154 | pa = epoint_init(); 155 | epoint_set(g_x.getbig(), g_y.getbig(), 0, g); 156 | epoint_set(xa.getbig(), ya.getbig(), 0, pa); 157 | 158 | // Za 159 | epoint_get(pa, xa.getbig(), ya.getbig()); 160 | Za = hash_Za(ID_A, ID_A_len, a, b, g_x, g_y, xa, ya); 161 | 162 | // check r, s 163 | if (r < 1 || r >= n) { 164 | #ifdef SM2_SIGN_DEBUG 165 | cout << "Signature invalid: r < 1 or r >= n" << "\n"; 166 | #endif 167 | return false; 168 | } 169 | if (s < 1 || s >= n) { 170 | #ifdef SM2_SIGN_DEBUG 171 | cout << "Signature invalid: s < 1 or s >= n" << "\n"; 172 | #endif 173 | return false; 174 | } 175 | 176 | // Za 177 | unsigned int Za_len; 178 | unsigned char Za_char[1000]; 179 | big2char(Za, Za_char, Za_len); 180 | // Za || M 181 | M = (unsigned char *) malloc(sizeof(char) * (Za_len + message_len)); 182 | memcpy(M, Za_char, Za_len); 183 | memcpy(M + Za_len, message, message_len); 184 | 185 | // e 186 | SM3Calc(M, (unsigned int) (Za_len + message_len), e_char); 187 | free(M); 188 | e = char2big(e_char, 32); 189 | #ifdef SM2_SIGN_DEBUG 190 | cout << "e in verify: " << e << "\n"; 191 | #endif 192 | 193 | // t 194 | t = (r + s) % n; 195 | #ifdef SM2_SIGN_DEBUG 196 | cout << "t: " << t << "\n"; 197 | #endif 198 | if (t == 0) { 199 | #ifdef SM2_SIGN_DEBUG 200 | cout << "Signature invalid: t!=0" << "\n"; 201 | #endif 202 | return false; 203 | } 204 | 205 | ecurve_mult(s.getbig(), g, g); 206 | ecurve_mult(t.getbig(), pa, pa); 207 | ecurve_add(pa, g); // g = pa+g <- s*G+t*P_A 208 | 209 | epoint_get(g, x1.getbig(), y1.getbig()); 210 | 211 | R = (e + x1) % n; 212 | #ifdef SM2_SIGN_DEBUG 213 | cout << "R: " << R << "\n" << "r: " << r << "\n"; 214 | #endif 215 | return R == r ? true : false; 216 | } 217 | -------------------------------------------------------------------------------- /src/sm2/sm2_sign.h: -------------------------------------------------------------------------------- 1 | // 2 | // Created by acherstyx on 8/16/20. 3 | // 4 | 5 | #ifndef SIMPLE_EXAMPLE_SM2_SIGN_H 6 | #define SIMPLE_EXAMPLE_SM2_SIGN_H 7 | 8 | #include "big.h" 9 | 10 | #include "sm2/sm2_enc.h" 11 | #include "sm3/sm3_miracl_wrapper.h" 12 | 13 | Big hash_Za(unsigned char *ID_A, unsigned int ID_A_len, const Big &a, const Big &b, 14 | const Big &x_g, const Big &y_g, const Big &x_a, const Big &y_a); 15 | 16 | void sm2_sign(unsigned char *ID_A, unsigned int ID_A_len, unsigned char *message, unsigned int message_len, 17 | const Big &key, Big &r, Big &s); 18 | 19 | bool sm2_verify(unsigned char *ID_A, unsigned int ID_A_len, unsigned char *message, unsigned int message_len, 20 | const Big &r, const Big &s, const Big &xa, const Big &ya); 21 | 22 | #endif //SIMPLE_EXAMPLE_SM2_SIGN_H 23 | -------------------------------------------------------------------------------- /src/sm3/sm3_miracl_wrapper.cpp: -------------------------------------------------------------------------------- 1 | // 2 | // Created by acherstyx on 8/6/20. 3 | // 4 | 5 | #include "sm3_reference.h" 6 | #include "sm3_miracl_wrapper.h" 7 | 8 | #include "big.h" 9 | 10 | #define BUFFER_MAX 10000 11 | 12 | Big char2big(unsigned char *message, unsigned int len) { 13 | Big sum = 0; 14 | for (int i = 0; i < len; i++) { 15 | sum = sum * 256; 16 | sum += message[i]; 17 | } 18 | return sum; 19 | } 20 | 21 | void big2char(Big message, unsigned char *ret_message, unsigned int &len) { 22 | int i = 0; 23 | unsigned char temp[BUFFER_MAX]; 24 | while (message != 0) { 25 | temp[i++] = message % 256; 26 | message = message / 256; 27 | } 28 | len = i; 29 | for (i = 0; i < len; i++) { 30 | ret_message[i] = temp[len - i - 1]; 31 | } 32 | } 33 | 34 | Big SM3_Hash_256(const Big &message) { 35 | unsigned char char_msg[BUFFER_MAX]; 36 | unsigned char hash_string[SM3_HASH_SIZE]; 37 | unsigned int len; 38 | 39 | big2char(message, char_msg, len); 40 | 41 | SM3Calc(char_msg, len, hash_string); 42 | 43 | return char2big(hash_string, 32); 44 | } 45 | -------------------------------------------------------------------------------- /src/sm3/sm3_miracl_wrapper.h: -------------------------------------------------------------------------------- 1 | // 2 | // Created by acherstyx on 8/6/20. 3 | // 4 | 5 | #ifndef INNER_SM3_SM3_MIRACL_WRAPPER_H 6 | #define INNER_SM3_SM3_MIRACL_WRAPPER_H 7 | 8 | #include "big.h" 9 | #include "sm3_reference.h" 10 | 11 | // transfer between two data format 12 | Big char2big(unsigned char *message, unsigned int len); 13 | 14 | void big2char(Big message, unsigned char *ret_message, unsigned int &len); 15 | 16 | Big SM3_Hash_256(const Big &message); 17 | 18 | #endif //INNER_SM3_SM3_MIRACL_WRAPPER_H 19 | 20 | -------------------------------------------------------------------------------- /src/sm3/sm3_reference.cpp: -------------------------------------------------------------------------------- 1 | // 2 | // Created by acherstyx on 8/5/20. 3 | // 4 | 5 | #include "sm3_reference.h" 6 | 7 | unsigned char *SM3Calc(const unsigned char *message, unsigned int messageLen, unsigned char digest[SM3_HASH_SIZE]) { 8 | 9 | SM3Context context; 10 | unsigned int i, remainder, bitLen; 11 | /* 初始化上下文 */ 12 | SM3Init(&context); 13 | 14 | /* 对前面的消息分组进行处理 */ 15 | for (i = 0; i < messageLen / 64; i++) //i是Bi分组数目（512bits），只有一组则不处理，因为0< 0不成立 16 | { 17 | memcpy(context.messageBlock, message + i * 64, 64); 18 | SM3ProcessMessageBlock(&context); 19 | } 20 | 21 | /* 填充消息分组，并处理 */ 22 | bitLen = messageLen * 8; //消息的比特长度，用于待会的填充 23 | if (IsLittleEndian()) 24 | ReverseWord(&bitLen); 25 | remainder = messageLen % 64; 26 | memcpy(context.messageBlock, message + i * 64, remainder); 27 | context.messageBlock[remainder] = 0x80; 28 | if (remainder <= 55) { 29 | memset(context.messageBlock + remainder + 1, 0, 64 - remainder - 1 - 8 + 4); 30 | memcpy(context.messageBlock + 64 - 4, &bitLen, 4); //最后四字节存放信息长度 31 | SM3ProcessMessageBlock(&context); 32 | } else { 33 | memset(context.messageBlock + remainder + 1, 0, 64 - remainder - 1);//本组余下的全填零 34 | SM3ProcessMessageBlock(&context); 35 | memset(context.messageBlock, 0, 64 - 4); 36 | memcpy(context.messageBlock + 64 - 4, &bitLen, 4); 37 | SM3ProcessMessageBlock(&context); 38 | } 39 | 40 | /* 返回结果 */ 41 | if (IsLittleEndian()) 42 | for (i = 0; i < 8; i++) 43 | ReverseWord(context.intermediateHash + i); 44 | memcpy(digest, context.intermediateHash, SM3_HASH_SIZE); 45 | 46 | return digest; 47 | } 48 | 49 | void SM3ProcessMessageBlock(SM3Context *context) { 50 | int i; 51 | unsigned int W[68]; 52 | unsigned int W_[64]; 53 | unsigned int A, B, C, D, E, F, G, H, SS1, SS2, TT1, TT2; 54 | 55 | /* 消息扩展 */ 56 | //printf("扩展后的消息 W0-W67:\n"); 57 | for (i = 0; i < 16; i++) { 58 | W[i] = *(unsigned int *) (context->messageBlock + i * 4); 59 | if (IsLittleEndian()) 60 | ReverseWord(W + i); 61 | //if((i % 8) == 0) printf("%02d: ",i); 62 | //printf(" %08x",W[i]); 63 | //if(((i+1) % 8) == 0) printf("\n"); 64 | } 65 | for (i = 16; i < 68; i++) { 66 | W[i] = P1(W[i - 16] ^ W[i - 9] ^ LeftRotate(W[i - 3], 15)) 67 | ^ LeftRotate(W[i - 13], 7) 68 | ^ W[i - 6]; 69 | //if((i % 8) == 0) printf("%02d: ",i); 70 | //printf(" %08x", W[i]); 71 | //if(((i+1) % 8) == 0) printf("\n"); 72 | } 73 | //printf("\n扩展后的消息 W'0-W'63:\n"); 74 | for (i = 0; i < 64; i++) { 75 | W_[i] = W[i] ^ W[i + 4]; 76 | //if((i % 8) == 0) printf("%02d: ",i); 77 | //printf(" %08x",W_[i]); 78 | //if(((i+1) % 8) == 0) printf("\n"); 79 | } 80 | 81 | /* 消息压缩 */ 82 | A = context->intermediateHash[0]; 83 | B = context->intermediateHash[1]; 84 | C = context->intermediateHash[2]; 85 | D = context->intermediateHash[3]; 86 | E = context->intermediateHash[4]; 87 | F = context->intermediateHash[5]; 88 | G = context->intermediateHash[6]; 89 | H = context->intermediateHash[7]; 90 | //printf("迭代压缩中间值:\n"); 91 | //printf("i A B C D E F G H\n"); 92 | //printf(" %08x %08x %08x %08x %08x %08x %08x %08x\n",A,B,C,D,E,F,G,H); 93 | for (i = 0; i < 64; i++) { 94 | SS1 = LeftRotate((LeftRotate(A, 12) + E + LeftRotate(T(i), i)), 7); 95 | SS2 = SS1 ^ LeftRotate(A, 12); 96 | TT1 = FF(A, B, C, i) + D + SS2 + W_[i]; 97 | TT2 = GG(E, F, G, i) + H + SS1 + W[i]; 98 | D = C; 99 | C = LeftRotate(B, 9); 100 | B = A; 101 | A = TT1; 102 | H = G; 103 | G = LeftRotate(F, 19); 104 | F = E; 105 | E = P0(TT2); 106 | //printf("%02d %08x %08x %08x %08x %08x %08x %08x %08x\n",i,A,B,C,D,E,F,G,H); 107 | } 108 | context->intermediateHash[0] ^= A; 109 | context->intermediateHash[1] ^= B; 110 | context->intermediateHash[2] ^= C; 111 | context->intermediateHash[3] ^= D; 112 | context->intermediateHash[4] ^= E; 113 | context->intermediateHash[5] ^= F; 114 | context->intermediateHash[6] ^= G; 115 | context->intermediateHash[7] ^= H; 116 | } 117 | 118 | void SM3Init(SM3Context *context) { 119 | context->intermediateHash[0] = 0x7380166F; 120 | context->intermediateHash[1] = 0x4914B2B9; 121 | context->intermediateHash[2] = 0x172442D7; 122 | context->intermediateHash[3] = 0xDA8A0600; 123 | context->intermediateHash[4] = 0xA96F30BC; 124 | context->intermediateHash[5] = 0x163138AA; 125 | context->intermediateHash[6] = 0xE38DEE4D; 126 | context->intermediateHash[7] = 0xB0FB0E4E; 127 | } 128 | 129 | unsigned int P1(unsigned int X) { 130 | return X ^ LeftRotate(X, 15) ^ LeftRotate(X, 23); 131 | } 132 | 133 | unsigned int P0(unsigned int X) { 134 | return X ^ LeftRotate(X, 9) ^ LeftRotate(X, 17); 135 | } 136 | 137 | unsigned int GG(unsigned int X, unsigned int Y, unsigned int Z, int i) { 138 | if (i >= 0 && i <= 15) 139 | return X ^ Y ^ Z; 140 | else if (i >= 16 && i <= 63) 141 | return (X & Y) | (~X & Z); 142 | else 143 | return 0; 144 | } 145 | 146 | unsigned int FF(unsigned int X, unsigned int Y, unsigned int Z, int i) { 147 | if (i >= 0 && i <= 15) 148 | return X ^ Y ^ Z; 149 | else if (i >= 16 && i <= 63) 150 | return (X & Y) | (X & Z) | (Y & Z); 151 | else 152 | return 0; 153 | } 154 | 155 | unsigned int T(int i) { 156 | if (i >= 0 && i <= 15) 157 | return 0x79CC4519; 158 | else if (i >= 16 && i <= 63) 159 | return 0x7A879D8A; 160 | else 161 | return 0; 162 | } 163 | 164 | unsigned int *ReverseWord(unsigned int *word) { 165 | unsigned char *byte, temp; 166 | 167 | byte = (unsigned char *) word; 168 | temp = byte[0]; 169 | byte[0] = byte[3]; 170 | byte[3] = temp; 171 | 172 | temp = byte[1]; 173 | byte[1] = byte[2]; 174 | byte[2] = temp; 175 | return word; 176 | } 177 | -------------------------------------------------------------------------------- /src/sm3/sm3_reference.h: -------------------------------------------------------------------------------- 1 | // 2 | // Created by acherstyx on 8/5/20. 3 | // 4 | 5 | #ifndef SM3_SM3_H 6 | #define SM3_SM3_H 7 | 8 | #include 9 | #include 10 | /* 11 | * SM3算法产生的哈希值大小（单位：字节） 12 | */ 13 | #define SM3_HASH_SIZE 32 14 | 15 | /* 16 | * SM3上下文 17 | */ 18 | typedef struct SM3Context { 19 | unsigned int intermediateHash[SM3_HASH_SIZE / 4]; 20 | unsigned char messageBlock[64]; 21 | } SM3Context; 22 | 23 | /* 24 | * SM3计算函数 25 | */ 26 | unsigned char *SM3Calc(const unsigned char *message, unsigned int messageLen, unsigned char digest[SM3_HASH_SIZE]); 27 | 28 | /* 29 | * 判断运行环境是否为小端 30 | */ 31 | static const int endianTest = 1; 32 | #define IsLittleEndian() (*(char *)&endianTest == 1) 33 | 34 | /* 35 | * 向左循环移位 36 | */ 37 | #define LeftRotate(word, bits) ( (word) << (bits) | (word) >> (32 - (bits)) ) 38 | 39 | /* 40 | * 反转四字节整型字节序 41 | */ 42 | unsigned int *ReverseWord(unsigned int *word); 43 | 44 | /* 45 | * T 46 | */ 47 | unsigned int T(int i); 48 | 49 | /* 50 | * FF 51 | */ 52 | unsigned int FF(unsigned int X, unsigned int Y, unsigned int Z, int i); 53 | 54 | /* 55 | * GG 56 | */ 57 | unsigned int GG(unsigned int X, unsigned int Y, unsigned int Z, int i); 58 | 59 | /* 60 | * P0 61 | */ 62 | unsigned int P0(unsigned int X); 63 | 64 | /* 65 | * P1 66 | */ 67 | unsigned int P1(unsigned int X); 68 | 69 | /* 70 | * 初始化函数 71 | */ 72 | void SM3Init(SM3Context *context); 73 | 74 | /* 75 | * 处理消息块 76 | */ 77 | void SM3ProcessMessageBlock(SM3Context *context); 78 | 79 | /* 80 | * SM3算法主函数 81 | */ 82 | unsigned char *SM3Calc(const unsigned char *message, unsigned int messageLen, unsigned char digest[SM3_HASH_SIZE]); 83 | 84 | 85 | #endif //SM3_SM3_H 86 | -------------------------------------------------------------------------------- /test/sm2/test_sm2.cpp: -------------------------------------------------------------------------------- 1 | // 2 | // Created by acherstyx on 8/5/20. 3 | // 4 | 5 | #define CATCH_CONFIG_MAIN 6 | 7 | #include 8 | #include "big.h" 9 | 10 | #include "precision.h" 11 | 12 | #include "sm2/inner_utils.h" 13 | 14 | TEST_CASE("Utils") { 15 | SECTION("Rand SEED test", "utils") { 16 | for (int i = 0; i < 100; i++) { 17 | Big a = gen_SEED(); 18 | Big b = gen_SEED(); 19 | cout << "case " << i << '\n'; 20 | cout << "[a]: " << a.len() << " " << a << '\n'; 21 | cout << "[b]: " << b.len() << " " << b << '\n'; 22 | // REQUIRE(a != b); 23 | // REQUIRE(a.len() >= 192); 24 | // REQUIRE(b.len() >= 192); 25 | } 26 | } 27 | 28 | SECTION("Hash 256 test", "utils") { 29 | for (int i = 0; i < 100; i++) { 30 | gen_SEED(); 31 | Big a = Hash_256(gen_SEED()); 32 | cout << a.len() << '\n'; 33 | REQUIRE(a.len() <= 256); 34 | } 35 | } 36 | 37 | SECTION("Gen a, b for ECC", "utils") { 38 | for (int i = 0; i < 100; i++) { 39 | Big hash_seed = Hash_256(gen_SEED()); 40 | Big p, a, b; 41 | p = 99997867; 42 | gen_ECC_a_b(hash_seed, p, a, b); 43 | cout << "[seed: " << hash_seed << " "; 44 | cout << "p: " << p << " "; 45 | cout << "a: " << a << " "; 46 | cout << "b: " << b << "]\n"; 47 | REQUIRE(valid_ECC_a_b(a, b, p)); 48 | } 49 | } 50 | 51 | SECTION("Valid a, b for ECC", "utils") { 52 | REQUIRE(valid_ECC_a_b(-3, 2, 200) == false); 53 | REQUIRE(valid_ECC_a_b(-3, 2, 108) == false); 54 | REQUIRE(valid_ECC_a_b(3, 2, 100) == true); 55 | REQUIRE(valid_ECC_a_b(3, 2, 216) == false); 56 | } 57 | } 58 | 59 | 60 | #include "sm2/sm2_enc.h" 61 | 62 | TEST_CASE("SM2 encryption") { 63 | 64 | SECTION("SM2 Key gen") { 65 | Big x, y, key; 66 | 67 | sm2_key_gen(x, y, key); 68 | cout << "x: " << x << " y: " << y << " key: " << key << "\n"; 69 | } 70 | 71 | SECTION("SM2 encrypt and decrypt") { 72 | Big x, y, key; 73 | unsigned char msg[50] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19}; 74 | unsigned char msg_dec[50] = {0}; 75 | int klen = 19; 76 | int enc_klen; 77 | unsigned char out[1000]; 78 | 79 | sm2_key_gen(x, y, key); 80 | 81 | cout << "key generation:" << "\n"; 82 | cout << "\t" << "x: " << x << " y: " << y << "\n"; 83 | cout << "\t" << "private key(d): " << key << "\n"; 84 | 85 | cout << "message before encrypt: "; 86 | for (int i = 0; i < klen; i++) 87 | cout << int(msg[i]) << " "; 88 | cout << "\n"; 89 | 90 | enc_klen = sm2_enc(msg, klen, x, y, out); 91 | 92 | cout << "message after encrypt: "; 93 | for (int i = 0; i < enc_klen; i++) { 94 | cout << int(out[i]) << " "; 95 | }; 96 | cout << "\n"; 97 | 98 | REQUIRE(enc_klen == klen + 96); 99 | 100 | int ret = sm2_dec(out, enc_klen, key, msg_dec); 101 | 102 | cout << "decrypt result: "; 103 | for (int i = 0; i < ret; i++) 104 | cout << int(msg_dec[i]) << " "; 105 | cout << "\n"; 106 | 107 | REQUIRE(ret == klen); 108 | 109 | for (int i = 0; i < klen; i++) { 110 | REQUIRE(msg[i] == msg_dec[i]); 111 | } 112 | } 113 | } 114 | 115 | #include "sm2/sm2_sign.h" 116 | 117 | TEST_CASE("SM2 Signature") { 118 | 119 | SECTION("Calculate hash value Z_A") { 120 | cout << "[Calculate hash value Z_A]" << "\n"; 121 | 122 | Big x_a, y_a, key; 123 | sm2_key_gen(x_a, y_a, key); 124 | 125 | miracl *mip = mirsys(20, 0); 126 | mip->IOBASE = 16; 127 | Big a, b, x_g, y_g; 128 | cinstr(a.getbig(), Ecc256.a); 129 | cinstr(b.getbig(), Ecc256.b); 130 | cinstr(x_g.getbig(), Ecc256.x); 131 | cinstr(y_g.getbig(), Ecc256.y); 132 | mip->IOBASE = 10; 133 | 134 | cout << hash_Za((unsigned char *) "test id", strlen("test id"), a, b, x_g, y_g, x_a, y_a) << "\n"; 135 | cout << hash_Za((unsigned char *) "id2", strlen("id2"), a, b, x_g, y_g, x_a, y_a) << "\n"; 136 | cout << hash_Za((unsigned char *) "3", strlen("3"), a, b, x_g, y_g, x_a, y_a) << "\n"; 137 | } 138 | 139 | SECTION("SM2 sign") { 140 | cout << "[SM2 sign]" << "\n"; 141 | 142 | Big x_a, y_a, key; 143 | sm2_key_gen(x_a, y_a, key); 144 | 145 | char id_a[100] = "test_user"; 146 | char message_to_sign[100] = "Hello, SM2!"; 147 | Big r, s; 148 | 149 | sm2_sign((unsigned char *) id_a, strlen(id_a), 150 | (unsigned char *) message_to_sign, strlen(message_to_sign), 151 | key, r, s); 152 | 153 | cout << "r: " << r << "\n"; 154 | cout << "s: " << s << "\n"; 155 | } 156 | 157 | SECTION("SM2 Verify") { 158 | for (int i = 1; i <= 1000; i++) { 159 | cout << "[SM2 Verify](Case " << i << ")\n"; 160 | 161 | Big x_a, y_a, key; 162 | char id_a[100] = "test_user"; 163 | char message_to_sign[100] = "Hello, SM2!"; 164 | Big r, s; 165 | 166 | cout << "(Key gen)\n"; 167 | sm2_key_gen(x_a, y_a, key); 168 | 169 | cout << "(Sign)\n"; 170 | sm2_sign((unsigned char *) id_a, strlen(id_a), 171 | (unsigned char *) message_to_sign, strlen(message_to_sign), 172 | key, r, s); 173 | 174 | cout << "r: " << r << "\n"; 175 | cout << "s: " << s << "\n"; 176 | 177 | cout << "(Verify)\n"; 178 | REQUIRE(sm2_verify((unsigned char *) id_a, strlen(id_a), 179 | (unsigned char *) message_to_sign, strlen(message_to_sign), 180 | r, s, x_a, y_a)); 181 | } 182 | } 183 | 184 | } -------------------------------------------------------------------------------- /test/sm3/test_sm3.cpp: -------------------------------------------------------------------------------- 1 | // 2 | // Created by acherstyx on 8/6/20. 3 | // 4 | 5 | #define CATCH_CONFIG_MAIN 6 | 7 | #include 8 | #include 9 | 10 | #include 11 | #include 12 | 13 | using namespace std; 14 | 15 | TEST_CASE("SM3 hash test") { 16 | unsigned char words[100] = "123456kjhkjh7890"; 17 | unsigned char message[1000] = {0}; 18 | SM3Calc(words, 10, message); 19 | for (int i = 0; i < 100; i++) { 20 | if (i == 32) { 21 | cout << "|256 bit|"; 22 | } 23 | cout << '[' << int(message[i]) << ']'; 24 | } 25 | } 26 | 27 | TEST_CASE("Transfer between [unsigned char] and [Big]") { 28 | SECTION("unsigned char to Big") { 29 | unsigned char message[100] = {2, 0}; 30 | REQUIRE(char2big(message, 2) == 512); 31 | } 32 | 33 | SECTION("Big->char->Big") { 34 | for (int i = 0; i < 100; i++) { // random test case 35 | unsigned char message[1000]; 36 | Big a = rand(200, 2); 37 | Big b; 38 | unsigned int len; 39 | cout << a << '\n'; 40 | big2char(a, message, len); 41 | 42 | for (int ii = 0; ii < 100; ii++) { 43 | cout << '[' << int(message[ii]) << ']'; 44 | } 45 | cout << "\n"; 46 | 47 | b = char2big(message, len); 48 | REQUIRE(a == b); 49 | } 50 | } 51 | } 52 | 53 | TEST_CASE("SM3 hash wrapper") { 54 | for (int i = 0; i < 1000; i++) { 55 | Big msg = rand(500, 2); 56 | Big hash_256 = SM3_Hash_256(msg); 57 | cout << hash_256 << "\n"; 58 | cout << hash_256.len() << '\n'; 59 | REQUIRE(hash_256.len() <= 256); 60 | } 61 | } -------------------------------------------------------------------------------- /test/test_miracl_env.cpp: -------------------------------------------------------------------------------- 1 | // 2 | // Created by acherstyx on 8/5/20. 3 | // 4 | 5 | #define CATCH_CONFIG_MAIN 6 | 7 | #include "catch2/catch.hpp" 8 | 9 | #include "big.h" 10 | 11 | extern "C" { 12 | #include "miracl.h" 13 | } 14 | 15 | Miracl precision(500, 10); // This makes sure that MIRACL 16 | 17 | int run2(int n) { 18 | Big nf = 1; 19 | 20 | while (n > 1) 21 | nf *= (n--); 22 | cout << nf << "\n"; 23 | return 0; 24 | } 25 | 26 | 27 | int run1() { 28 | big a, b, c; 29 | miracl *mip = mirsys(5000, 16); 30 | a = mirvar(8); 31 | b = mirvar(7); 32 | c = mirvar(0); 33 | add(a, b, c); 34 | cotnum(c, stdout); 35 | return 0; 36 | } 37 | 38 | TEST_CASE("Test miracl.h function") { 39 | REQUIRE(run1() == 0); 40 | } 41 | 42 | TEST_CASE("Test big.h function") { 43 | REQUIRE(run2(100) == 0); 44 | } --------------------------------------------------------------------------------