├── .github └── workflows │ └── codeql-analysis.yml ├── LICENSE ├── README.md ├── TODO └── src ├── bin ├── 2pass.c ├── challenge.c ├── charsets.h ├── derive.c ├── respond.c └── tests │ └── test.sh ├── common.c ├── common.h ├── jni.c ├── makefile ├── sphinx.c ├── sphinx.h └── tests └── test.c /.github/workflows/codeql-analysis.yml: -------------------------------------------------------------------------------- 1 | name: "CodeQL" 2 | 3 | on: 4 | push: 5 | branches: [master, ] 6 | pull_request: 7 | # The branches below must be a subset of the branches above 8 | branches: [master] 9 | schedule: 10 | - cron: '0 3 * * 2' 11 | 12 | jobs: 13 | analyze: 14 | name: Analyze 15 | runs-on: ubuntu-latest 16 | 17 | steps: 18 | - name: Checkout repository 19 | uses: actions/checkout@v3 20 | with: 21 | # We must fetch at least the immediate parents so that if this is 22 | # a pull request then we can checkout the head. 23 | fetch-depth: 2 24 | 25 | # Initializes the CodeQL tools for scanning. 26 | - name: Initialize CodeQL 27 | uses: github/codeql-action/init@v2 28 | # Override language selection by uncommenting this and choosing your languages 29 | # with: 30 | # languages: go, javascript, csharp, python, cpp, java 31 | 32 | # Autobuild attempts to build any compiled languages (C/C++, C#, or Java). 33 | # If this step fails, then you should remove it and run the build manually (see below) 34 | #- name: Autobuild 35 | # uses: github/codeql-action/autobuild@v2 36 | 37 | # ℹ️ Command-line programs to run using the OS shell. 38 | # 📚 https://git.io/JvXDl 39 | 40 | # ✏️ If the Autobuild fails above, remove it and uncomment the following three lines 41 | # and modify them (or add more) to build your code if your project 42 | # uses a compiled language 43 | 44 | - run: | 45 | cd src 46 | sudo apt-get update 47 | sudo apt-get install libsodium-dev pkgconf 48 | make bin libsphinx.so tests/sphinx 49 | 50 | - name: Perform CodeQL Analysis 51 | uses: github/codeql-action/analyze@v2 52 | -------------------------------------------------------------------------------- /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 | # THIS PROJECT IS EOL 2 | 3 | libsphinx has been replaced by liboprf https://github.com/stef/liboprf. 4 | it is here only for usage in the v1-legacy branch of pwdsphinx 5 | http://github.com/stef/pwdsphinx 6 | 7 | ## About 8 | 9 | sphinx: a password **S**tore that **P**erfectly **H**ides from **I**tself 10 | (**N**o **X**aggeration) 11 | 12 | libsphinx is a cryptographic password storage as described in 13 | https://eprint.iacr.org/2015/1099 14 | 15 | and as presented by the Levchin Prize winner 2018 Hugo Krawczyk on 16 | Real World Crypto https://www.youtube.com/watch?v=px8hiyf81iM 17 | 18 | ## What is this thing? 19 | 20 | It allows you to have only a few (at least one) passwords that you 21 | need to remember, while at the same time provides unique 40 (ASCII) 22 | character long very random passwords (256 bit entropy). Your master 23 | password is encrypted (blinded) and sent to the password storage 24 | server which (without decrypting) combines your encrypted password 25 | with a big random number and sends this (still encrypted) back to you, 26 | where you can decrypt it (it's a kind of end-to-end encryption of 27 | passwords) and use the resulting unique, strong and very random 28 | password to register/login to various services. The resulting strong 29 | passwords make offline password cracking attempts infeasible. If say 30 | you use this with google and their password database is leaked your 31 | password will still be safe. 32 | 33 | How is this different from my password storage which stores the 34 | passwords in an encrypted database? Most importantly using an 35 | encrypted database is not "end-to-end" encrypted. Your master password 36 | is used to decrypt the database read out the password and send it back 37 | to you. This means whoever has your database can try to crack your 38 | master password on it, or can capture your master password while you 39 | type or send it over the network. Then all your passwords are 40 | compromised. If some attacker compromises your traditional password 41 | store it's mostly game over for you. Using sphinx the attacker 42 | controlling your password store learns nothing about your master nor 43 | your individual passwords. Also even if your strong password leaks, 44 | it's unique and cannot be used to login to other sites or services. 45 | 46 | ## Installing 47 | 48 | Install `libsodium` and `libsodium-dev` using your operating system provided 49 | package management. 50 | 51 | Building everything should (hopefully) be quite simple afterwards: 52 | 53 | ``` 54 | cd src 55 | make 56 | ``` 57 | 58 | ## Library 59 | 60 | libsphinx builds a library, which you can use to build your 61 | own password manager either in C/C++ or any other language that can 62 | bind to this library. 63 | 64 | ### The Sphinx API 65 | The Library exposes the following 3 functions for the FK-PTR protocol 66 | (the password storage): 67 | 68 | ``` 69 | void sphinx_challenge(const uint8_t *pwd, const size_t p_len, uint8_t *bfac, uint8_t *chal); 70 | ``` 71 | * pwd, p_len: are input params, containing the master password and its length 72 | * bfac: is an output param, it's a pointer to an array of 73 | `SPHINX_255_SCALAR_BYTES` (32) bytes - the blinding factor 74 | * chal: is an output param, it's a pointer to an array of 75 | `SPHINX_255_SER_BYTES` (32) bytes - the challenge 76 | 77 | ``` 78 | int sphinx_respond(const uint8_t *chal, const uint8_t *secret, uint8_t *resp); 79 | ``` 80 | * chal: is an input param, it is the challenge from the challenge() 81 | function, it has to be a `SPHINX_255_SER_BYTES` (32) bytes big array 82 | * secret: is an input param, it is the "secret" contribution from the 83 | device, it is a `SPHINX_255_SCALAR_BYTES` (32) bytes long array 84 | * resp: is an output parameter, it is the result of this step, it 85 | must be a `SPHINX_255_SER_BYTES` (32) byte sized array 86 | * the function returns 1 on error, 0 on success 87 | 88 | ``` 89 | int sphinx_finish(const uint8_t *pwd, const size_t p_len, 90 | const uint8_t *bfac, const uint8_t *resp, 91 | uint8_t *rwd); 92 | ``` 93 | 94 | * pwd: is an input param, it specifies the password again. 95 | * p_len: is an input param, it specifies the password length 96 | * bfac: is an input param, it is the bfac output from challenge(), 97 | it is array of `SPHINX_255_SCALAR_BYTES` (32) bytes 98 | * resp: is an input parameter, it's the response from respond(), it 99 | is a `SPHINX_255_SER_BYTES` (32) byte sized array 100 | * rwd: is an output param, the derived (binary) password, it is a 101 | `SPHINX_255_SER_BYTES` (32) byte array 102 | * this function returns 1 on error, 0 on success 103 | 104 | ## Standalone Binaries 105 | 106 | libsphinx comes with very simple binaries implementing the sphinx 107 | protocol, so you can build your own password storage even from shell 108 | scripts. Each step in the SPHINX protocol is handled by one binary: 109 | 110 | ### step 1 - challenge 111 | The following creates a challenge for a device: 112 | ``` 113 | echo -n "shitty master password" | ./challenge >c 2>b 114 | ``` 115 | The master password is passed in through standard input. 116 | 117 | The challenge is sent to standard output. 118 | 119 | A blinding factor is stored in a tempfile, the name of this file is output to 120 | stderr. This tempfile is needed in the last step again. 121 | 122 | ### step 2 - device responds 123 | Pass the challenge from step 1 on standard input like: 124 | ``` 125 | ./respond secret r0 126 | ``` 127 | The response is sent to standard output. 128 | 129 | ### step 3 - derive password 130 | To derive a (currently hex) password, pass the response from step 2 on standard 131 | input and the filename of the tempfile and the challenge from step 1 like: 132 | 133 | ``` 134 | fname=$(cat b) ./derive $fname c pwd0 135 | ``` 136 | 137 | The derived password is sent to standard output and currently is a 32 138 | byte binary string. Please note that currently this only outputs the 139 | unblinded H(pwd)^k, for the full protocol this should be hashed again 140 | with the password prepended. 141 | 142 | ### step 4 - transform into ASCII password 143 | 144 | The output from step 3 is a 32 byte binary string, most passwords have some 145 | limitations to accept only printable - ASCII - chars. `bin2pass.py` is a python 146 | script in the [pwdsphinx](https://github.com/stef/pwdsphinx) python module which takes a binary input on standard 147 | input and transforms it into an ASCII password. It can have max two parameters 148 | the classes of characters allowed ([**u**]pper-, [**l**]ower-case letters, 149 | [**d**]igits and [**s**]ymbols) and the size of the password. The following 150 | examples should make this clear: 151 | 152 | Full ASCII, max size: 153 | ``` 154 | ./bin2pass.py . 20 | */ 21 | 22 | #include 23 | #include 24 | #include 25 | #include 26 | #include 27 | #include 28 | 29 | #include "charsets.h" 30 | 31 | static const int chars_size[]={ 32 | // 0 0 33 | 0, 34 | // 1 26 35 | 26, 36 | // 2 26 37 | 26, 38 | // 3 26 + 26 39 | 52, 40 | // 4 33 41 | 33, 42 | // 5 33 26 43 | 59, 44 | // 6 33 + 26 45 | 59, 46 | // 7 33 + 26 + 26 47 | 85, 48 | // 8 10 49 | 10, 50 | // 9 10 + 26 51 | 36, 52 | // a 10 + 26 53 | 36, 54 | // b 10 + 26 + 26 55 | 62, 56 | // c 10 + 33 57 | 43, 58 | // d 10 + 33 + 26 59 | 69, 60 | // e 10 + 33 + 26 61 | 69, 62 | // f 10 + 33 + 26 + 26 63 | 95 64 | }; 65 | 66 | 67 | static void usage(const char* prg) { 68 | fprintf(stderr,"usage: %s \n", prg); 69 | exit(1); 70 | } 71 | 72 | static long tolong(const char* str) { 73 | char *endptr; 74 | long val; 75 | errno = 0; 76 | val = strtol(str, &endptr, 10); 77 | 78 | /* Check for various possible errors */ 79 | if ((errno == ERANGE && (val == LONG_MAX || val == LONG_MIN)) || (errno != 0 && val == 0)) { 80 | return -1; 81 | } 82 | if (endptr == str) { 83 | return -1; 84 | } 85 | return val; 86 | } 87 | 88 | static int torules(const char* str, const char *prg) { 89 | const char *ptr; 90 | int res=0; 91 | for(ptr=str;*ptr;ptr++) { 92 | if(*ptr == 'u' || *ptr == 'U') res|=1<<0; 93 | else if(*ptr == 'l' || *ptr == 'l') res|=1<<1; 94 | else if(*ptr == 's' || *ptr == 's') res|=1<<2; 95 | else if(*ptr == 'd' || *ptr == 'd') res|=1<<3; 96 | else usage(prg); 97 | } 98 | return res; 99 | } 100 | 101 | int main(int argc, char** argv) { 102 | long size=-1; 103 | int rules=0; 104 | if(argc>1) { 105 | size=tolong(argv[1]); 106 | if(-1==size) rules=torules(argv[1], argv[0]); 107 | if(argc>2) { 108 | if(-1==size) size=tolong(argv[2]); 109 | else rules=torules(argv[2], argv[0]); 110 | if(-1==size || 0==rules) usage(argv[0]); 111 | } else if(-1==size && 0==rules) usage(argv[0]); 112 | } 113 | if(0==rules) rules=0xf; 114 | if(-1==size) size=LONG_MAX; 115 | char chars[chars_size[rules]], *cptr=chars; 116 | if(rules & 1) {memcpy(cptr,UPPER,sizeof UPPER); cptr+=sizeof UPPER;} 117 | if(rules & 2) {memcpy(cptr,LOWER,sizeof LOWER); cptr+=sizeof LOWER;} 118 | if(rules & 4) {memcpy(cptr,SYMBOLS,sizeof SYMBOLS); cptr+=sizeof SYMBOLS;} 119 | if(rules & 8) {memcpy(cptr,DIGITS,sizeof DIGITS); cptr+=sizeof DIGITS;} 120 | 121 | // start processing stdin 122 | uint8_t buf[256]; 123 | int rsize; 124 | int i,j; 125 | unsigned x=0, y=0; 126 | while(!feof(stdin) && size>0) { 127 | rsize=fread(buf, 1, 256, stdin); 128 | i=0; 129 | while(size>0 && (i0)) { 130 | y=x; 131 | for(j=3;j>=0 && i. 20 | */ 21 | #include 22 | #include 23 | #include 24 | #include 25 | #include 26 | 27 | int main(void) { 28 | // hash the master password from stdin 29 | 30 | crypto_generichash_state state; 31 | uint8_t hash[crypto_core_ristretto255_HASHBYTES]; 32 | // hash x with H0 33 | crypto_generichash_init(&state, 0, 0, sizeof hash); 34 | 35 | uint8_t buf[32768]; // 32KB blocks 36 | int size; 37 | while(!feof(stdin)) { 38 | size=fread(buf, 1, 32768, stdin); 39 | crypto_generichash_update(&state, buf, size); 40 | } 41 | crypto_generichash_final(&state, hash, sizeof hash); 42 | 43 | // hash x with H0 44 | unsigned char H0[crypto_core_ristretto255_BYTES]; 45 | crypto_core_ristretto255_from_hash(H0, hash); 46 | 47 | // blinding factor 48 | unsigned char blinder[crypto_core_ristretto255_SCALARBYTES]; 49 | crypto_core_ristretto255_scalar_random(blinder); 50 | 51 | // persist the blinding factor 52 | char fname[]="/tmp/sphinxXXXXXX"; 53 | int fd = mkstemp(fname); 54 | if(fd==-1) { 55 | fprintf(stderr, "failed to open temp file to persist blinding factor\nabort.\n"); 56 | return 1; 57 | } 58 | if(write(fd, blinder, sizeof blinder)!=sizeof blinder) { 59 | fprintf(stderr,"failed to persist blinding factor\nabort.\n"); 60 | return 1; 61 | } 62 | close(fd); 63 | fprintf(stderr,"%s",fname); 64 | 65 | unsigned char challenge[crypto_core_ristretto255_BYTES]; 66 | if (crypto_scalarmult_ristretto255(challenge, blinder, H0) != 0) { 67 | return -1; 68 | } 69 | 70 | // output the challenge 71 | size_t i; 72 | for(i=0;i. 22 | */ 23 | 24 | const char SYMBOLS[]={' ', '!', '"', '#', '$', '%', '&', '\'', '(', ')', '*', 25 | '+', ',', '-', '.', '/', ':', ';', '<', '=', '>', '?', 26 | '@', '[', '\\', ']', '^', '_', '`', '{', '|', '}', '~'}; 27 | const char DIGITS[]={'0', '1', '2', '3', '4', '5', '6', '7', '8', '9'}; 28 | const char LOWER[]={'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'}; 29 | const char UPPER[]={'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'}; 30 | #endif // charsets_h 31 | -------------------------------------------------------------------------------- /src/bin/derive.c: -------------------------------------------------------------------------------- 1 | /* 2 | @copyright 2018-2021, sphinx@ctrlc.hu 3 | This file is part of libsphinx. 4 | 5 | SPDX-FileCopyrightText: 2018-21, Stefan Marsiske 6 | SPDX-License-Identifier: LGPL-3.0-or-later 7 | 8 | libsphinx is free software: you can redistribute it and/or 9 | modify it under the terms of the GNU General Public License 10 | as published by the Free Software Foundation, either version 3 of 11 | the License, or (at your option) any later version. 12 | 13 | libsphinx is distributed in the hope that it will be useful, 14 | but WITHOUT ANY WARRANTY; without even the implied warranty of 15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 16 | GNU General Public License for more details. 17 | 18 | You should have received a copy of the GNU General Public License 19 | along with libsphinx. If not, see . 20 | */ 21 | 22 | #include 23 | #include 24 | #include 25 | #include 26 | #include 27 | 28 | int main(int argc, char **argv) { 29 | (void) argc; 30 | uint8_t blind[crypto_core_ristretto255_SCALARBYTES], 31 | chal[crypto_core_ristretto255_BYTES], 32 | resp[crypto_core_ristretto255_BYTES]; 33 | 34 | // read response from stdin 35 | if(fread(resp, 32, 1, stdin)!=1) { 36 | fprintf(stderr, "expected 32B response on stdin\n"); 37 | return 1; 38 | } 39 | 40 | // read blinding factor from file passed in argv[1] 41 | FILE *f = fopen(argv[1], "r"); 42 | if(f==NULL) { 43 | fprintf(stderr,"could not open %s\n", argv[1]); 44 | return 1; 45 | } 46 | if(fread(blind, 32, 1, f)!=1) { 47 | fprintf(stderr, "expected 32B blinding factor in %s\n", argv[1]); 48 | return 1; 49 | } 50 | fclose(f); 51 | 52 | // read original challenge from file passed in argv[2] 53 | f = fopen(argv[2], "r"); 54 | if(f==NULL) { 55 | fprintf(stderr,"could not open %s\n", argv[2]); 56 | return 1; 57 | } 58 | if(fread(chal, sizeof chal, 1, f)!=1) { 59 | fprintf(stderr, "expected 32B challenge in %s\n", argv[2]); 60 | return 1; 61 | } 62 | fclose(f); 63 | 64 | if(memcmp(chal,resp,sizeof resp)==0) { 65 | fprintf(stderr, "challenge and response are equal\n"); 66 | return 1; 67 | } 68 | 69 | // invert r = 1/r 70 | unsigned char ir[crypto_core_ristretto255_SCALARBYTES]; 71 | if (crypto_core_ristretto255_scalar_invert(ir, blind) != 0) { 72 | return -1; 73 | } 74 | 75 | // beta^(1/r) = h(pwd)^k 76 | unsigned char H0_k[crypto_core_ristretto255_BYTES]; 77 | if (crypto_scalarmult_ristretto255(H0_k, ir, resp) != 0) { 78 | return -1; 79 | } 80 | 81 | // hash(pwd||H0^k) 82 | crypto_generichash_state state; 83 | uint8_t out[32]; 84 | // hash x with H0 85 | crypto_generichash_init(&state, 0, 0, sizeof out); 86 | 87 | uint8_t buf[32768]; // 32KB blocks 88 | int size; 89 | while(!feof(stdin)) { 90 | size=fread(buf, 1, 32768, stdin); 91 | crypto_generichash_update(&state, buf, size); 92 | } 93 | crypto_generichash_update(&state, H0_k, sizeof H0_k); 94 | crypto_generichash_final(&state, out, 32); 95 | 96 | size_t i; 97 | for(i=0;i. 20 | */ 21 | 22 | #include 23 | #include 24 | #include 25 | 26 | int main(int argc, char** argv) { 27 | uint8_t challenge[crypto_core_ristretto255_BYTES]; 28 | uint8_t secret[crypto_core_ristretto255_SCALARBYTES]; 29 | 30 | // read challenge from stdin 31 | if(fread(challenge, 32, 1, stdin)!=1) { 32 | fprintf(stderr, "expected 32B challenge on stdin\n"); 33 | return 1; 34 | } 35 | 36 | // read secret key from file passed in argv[1] 37 | FILE *f = fopen(argv[1], "r"); 38 | if(f==NULL) { 39 | fprintf(stderr,"could not open %s\n", argv[1]); 40 | return 1; 41 | } 42 | if(fread(secret, 32, 1, f)!=1) { 43 | fprintf(stderr, "expected 32B secret in %s\n", argv[1]); 44 | return 1; 45 | } 46 | fclose(f); 47 | 48 | uint8_t out[crypto_core_ristretto255_BYTES]; 49 | if (crypto_scalarmult_ristretto255(out, secret, challenge) != 0) { 50 | return -1; 51 | } 52 | 53 | // output the response 54 | size_t i; 55 | for(i=0;i/dev/null 7 | } 8 | 9 | echo "first run" 10 | 11 | # create challenge for device, store blinding factor in tmp which name is in b 12 | echo "run 1 create challenge" 13 | echo -n "shitty master password" | ../challenge >c 2>b 14 | 15 | # respond to challenge on device using the secret 16 | echo "run 1 respond to challenge" 17 | ../respond secret r0 18 | 19 | fname=$(cat b) 20 | echo "run 1 derive password from response" 21 | { cat r0; echo -n "shitty master password"; } | ../derive $fname c >pwd0 22 | 23 | echo "second run" 24 | echo "run 2 create challenge" 25 | echo -n "shitty master password" | ../challenge >c 2>b 26 | echo "run 2 respond to challenge" 27 | ../respond secret r1 28 | fname=$(cat b) 29 | echo "run 2 derive password from response" 30 | { cat r1; echo -n "shitty master password"; } | ../derive $fname c >pwd1 31 | 32 | rm c b 33 | 34 | echo -n "verify blinding factors differ: " 35 | cmp r0 r1 >/dev/null 2>/dev/null && { 36 | echo "fail the two blinding factors are identical" 37 | rm pwd0 pwd1 38 | exit 1 39 | } 40 | echo "ok" 41 | rm r0 r1 42 | 43 | echo -n "verify the passwords from the two runs are the same: " 44 | cmp pwd0 pwd1 2>/dev/null >/dev/null || { 45 | echo "fail, the derived password from the two runs are not the same" 46 | exit 1 47 | } 48 | echo "ok" 49 | rm pwd1 50 | echo "success two runs produced the same password output" 51 | 52 | echo "transforming into ascii passwords" 53 | echo -n "full ascii, max size: " 54 | ../2pass . 20 | */ 21 | 22 | #include "common.h" 23 | 24 | #ifdef TRACE 25 | void dump(const uint8_t *p, const size_t len, const char* msg) { 26 | size_t i; 27 | fprintf(stderr,"%s ",msg); 28 | for(i=0;i. 22 | */ 23 | 24 | #include 25 | #include 26 | #include 27 | 28 | //#define TRACE 1 29 | //#define NORANDOM 1 30 | 31 | #ifdef TRACE 32 | #include 33 | void dump(const uint8_t *p, const size_t len, const char* msg); 34 | #endif 35 | 36 | #ifdef NORANDOM 37 | void a_randombytes(void* const buf, const size_t len); 38 | void a_randomscalar(unsigned char* buf); 39 | #define crypto_core_ristretto255_scalar_random a_randomscalar 40 | #define randombytes a_randombytes 41 | #endif 42 | 43 | 44 | int sphinx_oprf(const uint8_t *pwd, const size_t pwd_len, 45 | const uint8_t k[crypto_core_ristretto255_SCALARBYTES], 46 | const uint8_t *key, const size_t key_len, 47 | uint8_t rwd[crypto_generichash_BYTES]); 48 | 49 | int sphinx_blindPW(const uint8_t *pw, const size_t pwlen, uint8_t *r, uint8_t *alpha); 50 | 51 | /* 52 | * This is a simple utility function that can be used to calculate 53 | * f_k(c), where c is a constant, this is useful if the peers want to 54 | * authenticate each other. 55 | */ 56 | void sphinx_f(const uint8_t *k, const size_t k_len, const uint8_t val, uint8_t *res); 57 | 58 | #endif //COMMON_H 59 | -------------------------------------------------------------------------------- /src/jni.c: -------------------------------------------------------------------------------- 1 | /* 2 | @copyright 2018-2021, sphinx@ctrlc.hu 3 | This file is part of libsphinx. 4 | 5 | SPDX-FileCopyrightText: 2018-21, VSzA 6 | SPDX-License-Identifier: LGPL-3.0-or-later 7 | 8 | libsphinx is free software: you can redistribute it and/or 9 | modify it under the terms of the GNU Lesser General Public License 10 | as published by the Free Software Foundation, either version 3 of 11 | the License, or (at your option) any later version. 12 | 13 | libsphinx is distributed in the hope that it will be useful, 14 | but WITHOUT ANY WARRANTY; without even the implied warranty of 15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 16 | GNU General Public License for more details. 17 | 18 | You should have received a copy of the GNU General Public License 19 | along with libsphinx. If not, see . 20 | */ 21 | 22 | #include 23 | #include "sphinx.h" 24 | #include 25 | 26 | JNIEXPORT void JNICALL Java_org_hsbp_androsphinx_Sphinx_challenge(JNIEnv *env, jobject ignore, jbyteArray pwd, jbyteArray salt, jbyteArray bfac, jbyteArray chal) { 27 | jbyte* bufferPtrPwd = (*env)->GetByteArrayElements(env, pwd, NULL); 28 | jbyte* bufferPtrSalt = (*env)->GetByteArrayElements(env, salt, NULL); 29 | jbyte* bufferPtrBfac = (*env)->GetByteArrayElements(env, bfac, NULL); 30 | jbyte* bufferPtrChal = (*env)->GetByteArrayElements(env, chal, NULL); 31 | jsize pwdLen = (*env)->GetArrayLength(env, pwd); 32 | jsize saltLen = (*env)->GetArrayLength(env, salt); 33 | 34 | sphinx_challenge(bufferPtrPwd, pwdLen, bufferPtrSalt, saltLen, bufferPtrBfac, bufferPtrChal); 35 | 36 | (*env)->ReleaseByteArrayElements(env, pwd, bufferPtrPwd, JNI_ABORT); 37 | (*env)->ReleaseByteArrayElements(env, salt, bufferPtrSalt, JNI_ABORT); 38 | (*env)->ReleaseByteArrayElements(env, bfac, bufferPtrBfac, 0); 39 | (*env)->ReleaseByteArrayElements(env, chal, bufferPtrChal, 0); 40 | } 41 | 42 | JNIEXPORT jbyteArray JNICALL Java_org_hsbp_androsphinx_Sphinx_respond(JNIEnv *env, jobject ignore, jbyteArray chal, jbyteArray secret) { 43 | jbyte* bufferPtrChal = (*env)->GetByteArrayElements(env, chal, NULL); 44 | jbyte* bufferPtrSecret = (*env)->GetByteArrayElements(env, secret, NULL); 45 | 46 | jbyteArray resp = (*env)->NewByteArray(env, SPHINX_255_SER_BYTES); 47 | jbyte* bufferPtrResp = (*env)->GetByteArrayElements(env, resp, NULL); 48 | 49 | int result = sphinx_respond(bufferPtrChal, bufferPtrSecret, bufferPtrResp); 50 | 51 | (*env)->ReleaseByteArrayElements(env, resp, bufferPtrResp, result ? JNI_ABORT : 0); 52 | (*env)->ReleaseByteArrayElements(env, chal, bufferPtrChal, JNI_ABORT); 53 | (*env)->ReleaseByteArrayElements(env, secret, bufferPtrSecret, JNI_ABORT); 54 | 55 | return result ? NULL : resp; 56 | } 57 | 58 | JNIEXPORT jbyteArray JNICALL Java_org_hsbp_androsphinx_Sphinx_finish(JNIEnv *env, jobject ignore, jbyteArray pwd, jbyteArray bfac, jbyteArray salt, jbyteArray resp) { 59 | jbyte* bufferPtrPwd = (*env)->GetByteArrayElements(env, pwd, NULL); 60 | jbyte* bufferPtrBfac = (*env)->GetByteArrayElements(env, bfac, NULL); 61 | jbyte* bufferPtrSalt = (*env)->GetByteArrayElements(env, salt, NULL); 62 | jbyte* bufferPtrResp = (*env)->GetByteArrayElements(env, resp, NULL); 63 | jsize pwdLen = (*env)->GetArrayLength(env, pwd); 64 | 65 | jbyteArray rwd = (*env)->NewByteArray(env, SPHINX_255_SER_BYTES); 66 | jbyte* bufferPtrRwd = (*env)->GetByteArrayElements(env, rwd, NULL); 67 | 68 | int result = sphinx_finish(bufferPtrPwd, pwdLen, bufferPtrBfac, bufferPtrResp, bufferPtrSalt, bufferPtrRwd); 69 | 70 | (*env)->ReleaseByteArrayElements(env, rwd, bufferPtrRwd, result ? JNI_ABORT : 0); 71 | (*env)->ReleaseByteArrayElements(env, salt, bufferPtrSalt, JNI_ABORT); 72 | (*env)->ReleaseByteArrayElements(env, resp, bufferPtrResp, JNI_ABORT); 73 | (*env)->ReleaseByteArrayElements(env, bfac, bufferPtrBfac, JNI_ABORT); 74 | (*env)->ReleaseByteArrayElements(env, pwd, bufferPtrPwd, JNI_ABORT); 75 | 76 | return result ? NULL : rwd; 77 | } 78 | 79 | JNIEXPORT jbyteArray JNICALL Java_org_hsbp_androsphinx_Sodium_genericHash(JNIEnv *env, jobject ignore, jbyteArray msg, jbyteArray salt, jint outlen) { 80 | if (outlen <= 0) return NULL; 81 | 82 | jbyte* bufferPtrMsg = (*env)->GetByteArrayElements(env, msg, NULL); 83 | jbyte* bufferPtrSalt = (*env)->GetByteArrayElements(env, salt, NULL); 84 | jsize msgLen = (*env)->GetArrayLength(env, msg); 85 | jsize saltLen = (*env)->GetArrayLength(env, salt); 86 | 87 | jbyteArray hash = (*env)->NewByteArray(env, outlen); 88 | jbyte* bufferPtrHash = (*env)->GetByteArrayElements(env, hash, NULL); 89 | 90 | crypto_generichash(bufferPtrHash, outlen, 91 | bufferPtrMsg, msgLen, bufferPtrSalt, saltLen); 92 | 93 | (*env)->ReleaseByteArrayElements(env, msg, bufferPtrMsg, JNI_ABORT); 94 | (*env)->ReleaseByteArrayElements(env, salt, bufferPtrSalt, JNI_ABORT); 95 | (*env)->ReleaseByteArrayElements(env, hash, bufferPtrHash, 0); 96 | 97 | return hash; 98 | } 99 | 100 | JNIEXPORT jbyteArray JNICALL Java_org_hsbp_androsphinx_Sodium_randomBytes(JNIEnv *env, jobject ignore, jint length) { 101 | jbyteArray result = (*env)->NewByteArray(env, length); 102 | jbyte* bufferPtrResult = (*env)->GetByteArrayElements(env, result, NULL); 103 | 104 | randombytes_buf(bufferPtrResult, length); 105 | 106 | (*env)->ReleaseByteArrayElements(env, result, bufferPtrResult, 0); 107 | 108 | return result; 109 | } 110 | 111 | JNIEXPORT jbyteArray JNICALL Java_org_hsbp_androsphinx_Sodium_cryptoSignSeedKeypair(JNIEnv *env, jobject ignore, jbyteArray seed) { 112 | unsigned char ignored_pk[crypto_sign_PUBLICKEYBYTES]; 113 | 114 | jbyteArray result = (*env)->NewByteArray(env, crypto_sign_SECRETKEYBYTES); 115 | jbyte* bufferPtrResult = (*env)->GetByteArrayElements(env, result, NULL); 116 | jbyte* bufferPtrSeed = (*env)->GetByteArrayElements(env, seed, NULL); 117 | 118 | crypto_sign_seed_keypair(ignored_pk, bufferPtrResult, bufferPtrSeed); 119 | 120 | (*env)->ReleaseByteArrayElements(env, result, bufferPtrResult, 0); 121 | (*env)->ReleaseByteArrayElements(env, seed, bufferPtrSeed, JNI_ABORT); 122 | 123 | return result; 124 | } 125 | 126 | JNIEXPORT jbyteArray JNICALL Java_org_hsbp_androsphinx_Sodium_cryptoSignEd25519SkToPk(JNIEnv *env, jobject ignore, jbyteArray sk) { 127 | jbyteArray result = (*env)->NewByteArray(env, crypto_sign_PUBLICKEYBYTES); 128 | jbyte* bufferPtrResult = (*env)->GetByteArrayElements(env, result, NULL); 129 | jbyte* bufferPtrSk = (*env)->GetByteArrayElements(env, sk, NULL); 130 | 131 | crypto_sign_ed25519_sk_to_pk(bufferPtrResult, bufferPtrSk); 132 | 133 | (*env)->ReleaseByteArrayElements(env, result, bufferPtrResult, 0); 134 | (*env)->ReleaseByteArrayElements(env, sk, bufferPtrSk, JNI_ABORT); 135 | 136 | return result; 137 | } 138 | 139 | JNIEXPORT jbyteArray JNICALL Java_org_hsbp_androsphinx_Sodium_cryptoSignDetached(JNIEnv *env, jobject ignore, jbyteArray sk, jbyteArray msg) { 140 | jbyteArray result = (*env)->NewByteArray(env, crypto_sign_BYTES); 141 | jbyte* bufferPtrResult = (*env)->GetByteArrayElements(env, result, NULL); 142 | jbyte* bufferPtrSk = (*env)->GetByteArrayElements(env, sk, NULL); 143 | jbyte* bufferPtrMsg = (*env)->GetByteArrayElements(env, msg, NULL); 144 | jsize msgLen = (*env)->GetArrayLength(env, msg); 145 | 146 | unsigned long long ignored_siglen = crypto_sign_BYTES; 147 | 148 | crypto_sign_detached(bufferPtrResult, &ignored_siglen, bufferPtrMsg, msgLen, bufferPtrSk); 149 | 150 | (*env)->ReleaseByteArrayElements(env, result, bufferPtrResult, 0); 151 | (*env)->ReleaseByteArrayElements(env, sk, bufferPtrSk, JNI_ABORT); 152 | (*env)->ReleaseByteArrayElements(env, msg, bufferPtrMsg, JNI_ABORT); 153 | 154 | return result; 155 | } 156 | 157 | JNIEXPORT jbyteArray JNICALL Java_org_hsbp_androsphinx_Sodium_cryptoAeadXchachaPoly1305IetfEasy(JNIEnv *env, jobject ignore, jbyteArray msg, jbyteArray ad, jbyteArray key) { 158 | jbyte* bufferPtrKey = (*env)->GetByteArrayElements(env, key, NULL); 159 | jbyte* bufferPtrMsg = (*env)->GetByteArrayElements(env, msg, NULL); 160 | jbyte* bufferPtrAd = (*env)->GetByteArrayElements(env, ad, NULL); 161 | jsize msgLen = (*env)->GetArrayLength(env, msg); 162 | jsize adLen = (*env)->GetArrayLength(env, ad); 163 | 164 | jbyteArray result = (*env)->NewByteArray(env, crypto_aead_xchacha20poly1305_ietf_NPUBBYTES + msgLen + crypto_aead_xchacha20poly1305_ietf_ABYTES); 165 | jbyte* bufferPtrResult = (*env)->GetByteArrayElements(env, result, NULL); 166 | 167 | randombytes_buf(bufferPtrResult, crypto_aead_xchacha20poly1305_ietf_NPUBBYTES); 168 | 169 | int sodium_result = crypto_aead_xchacha20poly1305_ietf_encrypt(bufferPtrResult + crypto_aead_xchacha20poly1305_ietf_NPUBBYTES, 170 | NULL, bufferPtrMsg, msgLen, bufferPtrAd, adLen, NULL, bufferPtrResult, bufferPtrKey); 171 | 172 | (*env)->ReleaseByteArrayElements(env, result, bufferPtrResult, sodium_result ? JNI_ABORT : 0); 173 | (*env)->ReleaseByteArrayElements(env, ad, bufferPtrAd , JNI_ABORT); 174 | (*env)->ReleaseByteArrayElements(env, msg, bufferPtrMsg, JNI_ABORT); 175 | (*env)->ReleaseByteArrayElements(env, key, bufferPtrKey, JNI_ABORT); 176 | 177 | return sodium_result ? NULL : result; 178 | } 179 | 180 | JNIEXPORT jbyteArray JNICALL Java_org_hsbp_androsphinx_Sodium_cryptoAeadXchachaPoly1305IetfOpenEasy(JNIEnv *env, jobject ignore, jbyteArray msg, jbyteArray ad, jbyteArray key) { 181 | jbyte* bufferPtrKey = (*env)->GetByteArrayElements(env, key, NULL); 182 | jbyte* bufferPtrMsg = (*env)->GetByteArrayElements(env, msg, NULL); 183 | jbyte* bufferPtrAd = (*env)->GetByteArrayElements(env, ad, NULL); 184 | jsize msgLen = (*env)->GetArrayLength(env, msg); 185 | jsize adLen = (*env)->GetArrayLength(env, ad); 186 | 187 | jbyteArray result = (*env)->NewByteArray(env, msgLen - (crypto_aead_xchacha20poly1305_ietf_NPUBBYTES + crypto_aead_xchacha20poly1305_ietf_ABYTES)); 188 | jbyte* bufferPtrResult = (*env)->GetByteArrayElements(env, result, NULL); 189 | 190 | int sodium_result = crypto_aead_xchacha20poly1305_ietf_decrypt(bufferPtrResult, 191 | NULL, NULL, bufferPtrMsg + crypto_aead_xchacha20poly1305_ietf_NPUBBYTES, 192 | msgLen - crypto_aead_xchacha20poly1305_ietf_NPUBBYTES, 193 | bufferPtrAd, adLen, bufferPtrMsg, bufferPtrKey); 194 | 195 | (*env)->ReleaseByteArrayElements(env, result, bufferPtrResult, sodium_result ? JNI_ABORT : 0); 196 | (*env)->ReleaseByteArrayElements(env, ad, bufferPtrAd , JNI_ABORT); 197 | (*env)->ReleaseByteArrayElements(env, msg, bufferPtrMsg, JNI_ABORT); 198 | (*env)->ReleaseByteArrayElements(env, key, bufferPtrKey, JNI_ABORT); 199 | 200 | return sodium_result ? NULL : result; 201 | } 202 | -------------------------------------------------------------------------------- /src/makefile: -------------------------------------------------------------------------------- 1 | PREFIX?=/usr/local 2 | INSTALL?=install 3 | LIBS=-lsodium 4 | UNAME := $(shell uname -s) 5 | ifeq ($(UNAME),Darwin) 6 | CFLAGS+=-Wall -fPIC -O2 -g $(INC) #-DTRACE -DNORANDOM 7 | SOEXT=dylib 8 | SOFLAGS=-Wl,-install_name,libsphinx.$(SOEXT) 9 | else 10 | CFLAGS+=-Wall -fPIC -O2 -g -Wl,-z,defs $(INC) #-DTRACE -DNORANDOM 11 | SOEXT=so 12 | SOFLAGS=-Wl,-soname,libsphinx.$(SOEXT).0 13 | endif 14 | LDFLAGS+=-g $(LIBS) 15 | CC=gcc 16 | 17 | all: bin libsphinx.$(SOEXT) tests 18 | bin: bin/challenge bin/respond bin/derive bin/2pass 19 | 20 | win: CC=x86_64-w64-mingw32-gcc 21 | win: INC=-Iwin/libsodium-win64/include/sodium -Iwin/libsodium-win64/include 22 | win: LIBS=-L. -Lwin/libsodium-win64/lib/ -Wl,-Bstatic -lsodium -Wl,-Bdynamic 23 | win: SOEXT=dll 24 | win: EXT=.exe 25 | win: MAKETARGET=win 26 | win: win/libsodium-win64 exe libsphinx.$(SOEXT) tests$(EXT) 27 | exe: bin/challenge$(EXT) bin/respond$(EXT) bin/derive$(EXT) 28 | 29 | android: INC=-I$(SODIUM) -I$(SODIUM)/sodium 30 | android: LIBS=-Wl,-Bstatic -Wl,-Bdynamic -lsodium -L. 31 | android: EXTRA_OBJECTS=jni.o 32 | android: jni.o libsphinx.so 33 | 34 | tests$(EXT): tests/sphinx$(EXT) 35 | 36 | bin/challenge$(EXT): bin/challenge.c 37 | $(CC) $(CFLAGS) -o bin/challenge$(EXT) bin/challenge.c $(LDFLAGS) 38 | 39 | bin/respond$(EXT): bin/respond.c 40 | $(CC) $(CFLAGS) -o bin/respond$(EXT) bin/respond.c $(LDFLAGS) 41 | 42 | bin/derive$(EXT): bin/derive.c 43 | $(CC) $(CFLAGS) -o bin/derive$(EXT) bin/derive.c $(LDFLAGS) 44 | 45 | bin/2pass$(EXT): bin/2pass.c 46 | $(CC) $(CFLAGS) -o bin/2pass$(EXT) bin/2pass.c $(LDFLAGS) 47 | 48 | libsphinx.$(SOEXT): common.o sphinx.o $(EXTRA_OBJECTS) 49 | $(CC) -shared -fpic $(CFLAGS) $(SOFLAGS) -o libsphinx.$(SOEXT) common.o sphinx.o $(EXTRA_OBJECTS) $(LDFLAGS) 50 | 51 | tests/sphinx$(EXT): tests/test.c libsphinx.$(SOEXT) 52 | $(CC) $(CFLAGS) -o tests/sphinx$(EXT) tests/test.c -L. -lsphinx $(LDFLAGS) 53 | 54 | win/libsodium-win64: 55 | @echo 'win/libsodium-win64 not found.' 56 | @echo 'download and unpack latest libsodium-*-mingw.tar.gz and unpack into win/' 57 | @echo 'https://download.libsodium.org/libsodium/releases/' 58 | @false 59 | 60 | install: $(DESTDIR)$(PREFIX)/lib/libsphinx.$(SOEXT) $(DESTDIR)$(PREFIX)/include/sphinx.h 61 | 62 | $(DESTDIR)$(PREFIX)/lib/libsphinx.$(SOEXT): libsphinx.$(SOEXT) 63 | $(INSTALL) -D $< $@ 64 | 65 | $(DESTDIR)$(PREFIX)/include/sphinx.h: sphinx.h 66 | $(INSTALL) -D $< $@ 67 | 68 | %.o: %.c 69 | $(CC) $(CFLAGS) -o $@ -c $< 70 | 71 | clean: 72 | rm -f bin/sphinx bin/challenge bin/respond bin/derive bin/2pass libsphinx.$(SOEXT) 73 | rm -f tests/sphinx tests/sphinx.exe *.o 74 | rm -f bin/sphinx.exe bin/challenge.exe bin/respond.exe bin/derive.exe libsphinx.dll 75 | 76 | .PHONY: bin clean install 77 | -------------------------------------------------------------------------------- /src/sphinx.c: -------------------------------------------------------------------------------- 1 | /* 2 | @copyright 2018-2021, sphinx@ctrlc.hu 3 | This file is part of libsphinx. 4 | 5 | SPDX-FileCopyrightText: 2018-21, Stefan Marsiske 6 | SPDX-License-Identifier: LGPL-3.0-or-later 7 | 8 | libsphinx is free software: you can redistribute it and/or 9 | modify it under the terms of the GNU Lesser General Public License 10 | as published by the Free Software Foundation, either version 3 of 11 | the License, or (at your option) any later version. 12 | 13 | libsphinx is distributed in the hope that it will be useful, 14 | but WITHOUT ANY WARRANTY; without even the implied warranty of 15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 16 | GNU General Public License for more details. 17 | 18 | You should have received a copy of the GNU General Public License 19 | along with libsphinx. If not, see . 20 | */ 21 | 22 | #include 23 | #include 24 | #include "sphinx.h" 25 | #include 26 | #ifdef TRACE 27 | #include "common.h" 28 | #endif 29 | 30 | /* params: 31 | * 32 | * pwd, p_len: (input) the master password and its length 33 | * salt, salt_len: (input) salt for hashing the password, can both be NULL/0 34 | * bfac: (output) pointer to array of crypto_core_ristretto255_SCALARBYTES (32) bytes - the blinding factor 35 | * chal: (output) pointer to array of crypto_core_ristretto255_BYTES (32) bytes - the challenge 36 | * returns -1 on error, 0 on success 37 | */ 38 | int sphinx_challenge(const uint8_t *pwd, const size_t p_len, const uint8_t *salt, const size_t salt_len, uint8_t bfac[crypto_core_ristretto255_SCALARBYTES], uint8_t chal[crypto_core_ristretto255_BYTES]) { 39 | int ret = -1; 40 | #ifdef TRACE 41 | dump(pwd, p_len, "pwd"); 42 | dump(salt, salt_len, "salt"); 43 | #endif 44 | // do the blinding 45 | uint8_t h0[crypto_core_ristretto255_HASHBYTES]; 46 | if(-1==sodium_mlock(h0,sizeof h0)) return -1; 47 | // hash x with H0 48 | crypto_generichash(h0, crypto_core_ristretto255_HASHBYTES, pwd, p_len, salt, salt_len); 49 | #ifdef TRACE 50 | dump(h0, sizeof h0, "h0"); 51 | #endif 52 | unsigned char H0[crypto_core_ristretto255_BYTES]; 53 | if(-1==sodium_mlock(H0,sizeof H0)) { 54 | sodium_munlock(h0,sizeof h0); 55 | return -1; 56 | } 57 | crypto_core_ristretto255_from_hash(H0, h0); 58 | sodium_munlock(h0,sizeof h0); 59 | #ifdef TRACE 60 | dump(H0, sizeof H0, "H0"); 61 | #endif 62 | 63 | // random blinding factor 64 | crypto_core_ristretto255_scalar_random(bfac); 65 | #ifdef TRACE 66 | dump(bfac, crypto_core_ristretto255_SCALARBYTES, "r"); 67 | #endif 68 | 69 | // chal = H0^r 70 | if (crypto_scalarmult_ristretto255(chal, bfac, H0) == 0) { 71 | ret = 0; 72 | } 73 | sodium_munlock(H0,sizeof H0); 74 | #ifdef TRACE 75 | dump(chal, crypto_core_ristretto255_BYTES, "alpha"); 76 | #endif 77 | 78 | return ret; 79 | } 80 | 81 | /* params 82 | * chal: (input) the challenge, crypto_core_ristretto255_BYTES(32) bytes array 83 | * secret: (input) the secret contributing, crypto_core_ristretto255_SCALARBYTES (32) bytes array 84 | * resp: (output) the response, crypto_core_ristretto255_BYTES (32) bytes array 85 | * returns -1 on error, 0 on success 86 | */ 87 | int sphinx_respond(const uint8_t chal[crypto_core_ristretto255_BYTES], const uint8_t secret[crypto_core_ristretto255_SCALARBYTES], uint8_t resp[crypto_core_ristretto255_BYTES]) { 88 | #ifdef TRACE 89 | dump(chal, crypto_core_ristretto255_BYTES, "alpha"); 90 | #endif 91 | #ifdef TRACE 92 | dump(secret, crypto_core_ristretto255_SCALARBYTES, "k"); 93 | #endif 94 | // Checks that chal ∈ G^∗ . If not, abort; 95 | if(crypto_core_ristretto255_is_valid_point(chal)!=1) return -1; 96 | // server contributes k 97 | 98 | int ret = crypto_scalarmult_ristretto255(resp, secret, chal); 99 | #ifdef TRACE 100 | dump(resp, crypto_core_ristretto255_BYTES, "beta"); 101 | #endif 102 | return ret; 103 | } 104 | 105 | /* params 106 | * pwd: (input) the password 107 | * p_len: (input) the password length 108 | * bfac: (input) bfac from challenge(), array of crypto_core_ristretto255_SCALARBYTES (32) bytes 109 | * chal: (input) the challenge generated in sphinx_challenge, crypto_core_ristretto255_BYTES(32) bytes array 110 | * resp: (input) the response from respond(), crypto_core_ristretto255_BYTES (32) bytes array 111 | * salt: (input) salt for the final password hashing, crypto_pwhash_SALTBYTES bytes array 112 | * rwd: (output) the derived password, crypto_core_ristretto255_BYTES (32) bytes array 113 | * returns -1 on error, 0 on success 114 | */ 115 | int sphinx_finish(const uint8_t *pwd, const size_t p_len, 116 | const uint8_t bfac[crypto_core_ristretto255_SCALARBYTES], 117 | const uint8_t chal[crypto_core_ristretto255_BYTES], 118 | const uint8_t resp[crypto_core_ristretto255_BYTES], 119 | const uint8_t salt[crypto_pwhash_SALTBYTES], 120 | uint8_t rwd[crypto_core_ristretto255_BYTES]) { 121 | #ifdef TRACE 122 | dump(bfac, crypto_core_ristretto255_SCALARBYTES, "r"); 123 | dump(chal, crypto_core_ristretto255_BYTES, "alpha"); 124 | dump(resp, crypto_core_ristretto255_BYTES, "beta"); 125 | dump(pwd, p_len, "pwd"); 126 | dump(salt, crypto_pwhash_SALTBYTES, "salt"); 127 | #endif 128 | // Checks that resp ∈ G^∗ . If not, abort; 129 | if(crypto_core_ristretto255_is_valid_point(resp)!=1) return -1; 130 | if(memcmp(chal,resp,crypto_core_ristretto255_BYTES)==0) { 131 | return -1; 132 | } 133 | 134 | // invert bfac = 1/bfac 135 | unsigned char ir[crypto_core_ristretto255_SCALARBYTES]; 136 | if(0!=sodium_mlock(ir,sizeof ir)) return -1; 137 | if (crypto_core_ristretto255_scalar_invert(ir, bfac) != 0) { 138 | sodium_munlock(ir, sizeof ir); 139 | return -1; 140 | } 141 | #ifdef TRACE 142 | dump(ir, crypto_core_ristretto255_SCALARBYTES, "ir"); 143 | #endif 144 | 145 | // resp^(1/bfac) = h(pwd)^secret == H0^k 146 | unsigned char H0_k[crypto_core_ristretto255_BYTES]; 147 | if(-1==sodium_mlock(H0_k,sizeof H0_k)) { 148 | sodium_munlock(ir, sizeof ir); 149 | return -1; 150 | } 151 | if (crypto_scalarmult_ristretto255(H0_k, ir, resp) != 0) { 152 | sodium_munlock(ir, sizeof ir); 153 | sodium_munlock(H0_k,sizeof H0_k); 154 | return -1; 155 | } 156 | sodium_munlock(ir, sizeof ir); 157 | #ifdef TRACE 158 | dump(H0_k, crypto_core_ristretto255_BYTES, "H0_k"); 159 | #endif 160 | 161 | // hash(pwd||H0^k) 162 | crypto_generichash_state state; 163 | if(-1==sodium_mlock(&state,sizeof state)) { 164 | sodium_munlock(H0_k,sizeof H0_k); 165 | return -1; 166 | } 167 | crypto_generichash_init(&state, 0, 0, crypto_core_ristretto255_BYTES); 168 | crypto_generichash_update(&state, pwd, p_len); 169 | crypto_generichash_update(&state, H0_k, sizeof H0_k); 170 | 171 | uint8_t rwd0[crypto_core_ristretto255_BYTES]; 172 | if(-1==sodium_mlock(&rwd0,sizeof rwd0)) { 173 | sodium_munlock(H0_k,sizeof H0_k); 174 | sodium_munlock(&state,sizeof state); 175 | return -1; 176 | } 177 | crypto_generichash_final(&state, rwd0, crypto_core_ristretto255_BYTES); 178 | sodium_munlock(H0_k,sizeof H0_k); 179 | sodium_munlock(&state,sizeof state); 180 | #ifdef TRACE 181 | dump(rwd0, crypto_core_ristretto255_BYTES, "rwd0"); 182 | #endif 183 | 184 | if (crypto_pwhash(rwd, crypto_core_ristretto255_BYTES, (const char*) rwd0, crypto_core_ristretto255_BYTES, salt, 185 | crypto_pwhash_OPSLIMIT_INTERACTIVE, crypto_pwhash_MEMLIMIT_INTERACTIVE, crypto_pwhash_ALG_DEFAULT) != 0) { 186 | /* out of memory */ 187 | sodium_munlock(rwd0,sizeof rwd0); 188 | return -1; 189 | } 190 | sodium_munlock(rwd0,sizeof rwd0); 191 | #ifdef TRACE 192 | dump(rwd, crypto_core_ristretto255_BYTES, "rwd"); 193 | #endif 194 | 195 | return 0; 196 | } 197 | -------------------------------------------------------------------------------- /src/sphinx.h: -------------------------------------------------------------------------------- 1 | #ifndef sphinx_h 2 | #define sphinx_h 3 | /* 4 | @copyright 2018-2021, sphinx@ctrlc.hu 5 | This file is part of libsphinx. 6 | 7 | SPDX-FileCopyrightText: 2018-21, Marsiske Stefan 8 | SPDX-License-Identifier: GPL-3.0-or-later 9 | 10 | libsphinx is free software: you can redistribute it and/or 11 | modify it under the terms of the GNU Lesser General Public License 12 | as published by the Free Software Foundation, either version 3 of 13 | the License, or (at your option) any later version. 14 | 15 | libsphinx is distributed in the hope that it will be useful, 16 | but WITHOUT ANY WARRANTY; without even the implied warranty of 17 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 18 | GNU General Public License for more details. 19 | 20 | You should have received a copy of the GNU General Public License 21 | along with libsphinx. If not, see . 22 | */ 23 | 24 | #include 25 | #include 26 | #include 27 | 28 | #define SPHINX_255_SCALAR_BYTES crypto_core_ristretto255_SCALARBYTES 29 | #define SPHINX_255_SER_BYTES crypto_core_ristretto255_BYTES 30 | 31 | int sphinx_challenge(const uint8_t *pwd, const size_t p_len, 32 | const uint8_t *salt, 33 | const size_t salt_len, 34 | uint8_t bfac[crypto_core_ristretto255_SCALARBYTES], 35 | uint8_t chal[crypto_core_ristretto255_BYTES]); 36 | int sphinx_respond(const uint8_t chal[crypto_core_ristretto255_BYTES], 37 | const uint8_t secret[crypto_core_ristretto255_SCALARBYTES], 38 | uint8_t resp[crypto_core_ristretto255_BYTES]); 39 | int sphinx_finish(const uint8_t *pwd, const size_t p_len, 40 | const uint8_t bfac[crypto_core_ristretto255_SCALARBYTES], 41 | const uint8_t chal[crypto_core_ristretto255_BYTES], 42 | const uint8_t resp[crypto_core_ristretto255_BYTES], 43 | const uint8_t salt[crypto_pwhash_SALTBYTES], 44 | uint8_t rwd[crypto_core_ristretto255_BYTES]); 45 | 46 | #endif // sphinx_h 47 | -------------------------------------------------------------------------------- /src/tests/test.c: -------------------------------------------------------------------------------- 1 | #include "../sphinx.h" 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | int main(void) { 8 | const uint8_t pwd[]="shitty password"; 9 | const uint8_t secret[SPHINX_255_SCALAR_BYTES]={2}; 10 | const uint8_t salt[crypto_pwhash_SALTBYTES]={1}; 11 | uint8_t bfac[SPHINX_255_SCALAR_BYTES], 12 | chal[SPHINX_255_SER_BYTES], 13 | resp[SPHINX_255_SER_BYTES], 14 | rwd[SPHINX_255_SER_BYTES]; 15 | 16 | sphinx_challenge(pwd, strlen((char*) pwd), salt, crypto_pwhash_SALTBYTES, bfac, chal); 17 | if(0!=sphinx_respond(chal, secret, resp)) { 18 | return 1; 19 | } 20 | if(0!=sphinx_finish(pwd, strlen((char*) pwd), bfac, chal, resp, salt, rwd)) { 21 | return 1; 22 | } 23 | 24 | unsigned i; 25 | for(i=0;i