pax_global_header00006660000000000000000000000064143421316600014512gustar00rootroot0000000000000052 comment=425554d4327eeeb60c39e3d4a1b7bc5e36b63953 guile-gcrypt/000077500000000000000000000000001434213166000134715ustar00rootroot00000000000000guile-gcrypt/.gitignore000066400000000000000000000004261434213166000154630ustar00rootroot00000000000000*~ .#* *.go *.log *.trs autom4te.cache/ Makefile Makefile.in /configure /env /config.status /config.log /aclocal.m4 /pre-inst-env /missing /test-driver /install-sh /gcrypt/package-config.scm /build-aux/install-sh /build-aux/missing /guile-gcrypt-*.tar.gz /INSTALL /config.cache guile-gcrypt/AUTHORS000066400000000000000000000003511434213166000145400ustar00rootroot00000000000000Guile-Gcrypt was initially written by: Christopher Lemmer Webber Ludovic Courtès … but ‘git log’ may show other names. In fact, we’d like to see yours too, consider joining us! guile-gcrypt/COPYING000066400000000000000000001045131434213166000145300ustar00rootroot00000000000000 GNU GENERAL PUBLIC LICENSE Version 3, 29 June 2007 Copyright (C) 2007 Free Software Foundation, Inc. Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The GNU General Public License is a free, copyleft license for software and other kinds of works. The licenses for most software and other practical works are designed to take away your freedom to share and change the works. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change all versions of a program--to make sure it remains free software for all its users. We, the Free Software Foundation, use the GNU General Public License for most of our software; it applies also to any other work released this way by its authors. You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for them if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs, and that you know you can do these things. To protect your rights, we need to prevent others from denying you these rights or asking you to surrender the rights. Therefore, you have certain responsibilities if you distribute copies of the software, or if you modify it: responsibilities to respect the freedom of others. For example, if you distribute copies of such a program, whether gratis or for a fee, you must pass on to the recipients the same freedoms that you received. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. Developers that use the GNU GPL protect your rights with two steps: (1) assert copyright on the software, and (2) offer you this License giving you legal permission to copy, distribute and/or modify it. For the developers' and authors' protection, the GPL clearly explains that there is no warranty for this free software. For both users' and authors' sake, the GPL requires that modified versions be marked as changed, so that their problems will not be attributed erroneously to authors of previous versions. Some devices are designed to deny users access to install or run modified versions of the software inside them, although the manufacturer can do so. This is fundamentally incompatible with the aim of protecting users' freedom to change the software. The systematic pattern of such abuse occurs in the area of products for individuals to use, which is precisely where it is most unacceptable. Therefore, we have designed this version of the GPL to prohibit the practice for those products. If such problems arise substantially in other domains, we stand ready to extend this provision to those domains in future versions of the GPL, as needed to protect the freedom of users. Finally, every program is threatened constantly by software patents. States should not allow patents to restrict development and use of software on general-purpose computers, but in those that do, we wish to avoid the special danger that patents applied to a free program could make it effectively proprietary. To prevent this, the GPL assures that patents cannot be used to render the program non-free. The precise terms and conditions for copying, distribution and modification follow. TERMS AND CONDITIONS 0. Definitions. "This License" refers to version 3 of the GNU General Public License. "Copyright" also means copyright-like laws that apply to other kinds of works, such as semiconductor masks. "The Program" refers to any copyrightable work licensed under this License. Each licensee is addressed as "you". "Licensees" and "recipients" may be individuals or organizations. To "modify" a work means to copy from or adapt all or part of the work in a fashion requiring copyright permission, other than the making of an exact copy. The resulting work is called a "modified version" of the earlier work or a work "based on" the earlier work. A "covered work" means either the unmodified Program or a work based on the Program. To "propagate" a work means to do anything with it that, without permission, would make you directly or secondarily liable for infringement under applicable copyright law, except executing it on a computer or modifying a private copy. Propagation includes copying, distribution (with or without modification), making available to the public, and in some countries other activities as well. To "convey" a work means any kind of propagation that enables other parties to make or receive copies. Mere interaction with a user through a computer network, with no transfer of a copy, is not conveying. An interactive user interface displays "Appropriate Legal Notices" to the extent that it includes a convenient and prominently visible feature that (1) displays an appropriate copyright notice, and (2) tells the user that there is no warranty for the work (except to the extent that warranties are provided), that licensees may convey the work under this License, and how to view a copy of this License. If the interface presents a list of user commands or options, such as a menu, a prominent item in the list meets this criterion. 1. Source Code. The "source code" for a work means the preferred form of the work for making modifications to it. "Object code" means any non-source form of a work. A "Standard Interface" means an interface that either is an official standard defined by a recognized standards body, or, in the case of interfaces specified for a particular programming language, one that is widely used among developers working in that language. The "System Libraries" of an executable work include anything, other than the work as a whole, that (a) is included in the normal form of packaging a Major Component, but which is not part of that Major Component, and (b) serves only to enable use of the work with that Major Component, or to implement a Standard Interface for which an implementation is available to the public in source code form. A "Major Component", in this context, means a major essential component (kernel, window system, and so on) of the specific operating system (if any) on which the executable work runs, or a compiler used to produce the work, or an object code interpreter used to run it. The "Corresponding Source" for a work in object code form means all the source code needed to generate, install, and (for an executable work) run the object code and to modify the work, including scripts to control those activities. However, it does not include the work's System Libraries, or general-purpose tools or generally available free programs which are used unmodified in performing those activities but which are not part of the work. For example, Corresponding Source includes interface definition files associated with source files for the work, and the source code for shared libraries and dynamically linked subprograms that the work is specifically designed to require, such as by intimate data communication or control flow between those subprograms and other parts of the work. The Corresponding Source need not include anything that users can regenerate automatically from other parts of the Corresponding Source. The Corresponding Source for a work in source code form is that same work. 2. Basic Permissions. All rights granted under this License are granted for the term of copyright on the Program, and are irrevocable provided the stated conditions are met. This License explicitly affirms your unlimited permission to run the unmodified Program. The output from running a covered work is covered by this License only if the output, given its content, constitutes a covered work. This License acknowledges your rights of fair use or other equivalent, as provided by copyright law. You may make, run and propagate covered works that you do not convey, without conditions so long as your license otherwise remains in force. You may convey covered works to others for the sole purpose of having them make modifications exclusively for you, or provide you with facilities for running those works, provided that you comply with the terms of this License in conveying all material for which you do not control copyright. Those thus making or running the covered works for you must do so exclusively on your behalf, under your direction and control, on terms that prohibit them from making any copies of your copyrighted material outside their relationship with you. Conveying under any other circumstances is permitted solely under the conditions stated below. Sublicensing is not allowed; section 10 makes it unnecessary. 3. Protecting Users' Legal Rights From Anti-Circumvention Law. No covered work shall be deemed part of an effective technological measure under any applicable law fulfilling obligations under article 11 of the WIPO copyright treaty adopted on 20 December 1996, or similar laws prohibiting or restricting circumvention of such measures. When you convey a covered work, you waive any legal power to forbid circumvention of technological measures to the extent such circumvention is effected by exercising rights under this License with respect to the covered work, and you disclaim any intention to limit operation or modification of the work as a means of enforcing, against the work's users, your or third parties' legal rights to forbid circumvention of technological measures. 4. Conveying Verbatim Copies. You may convey verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice; keep intact all notices stating that this License and any non-permissive terms added in accord with section 7 apply to the code; keep intact all notices of the absence of any warranty; and give all recipients a copy of this License along with the Program. You may charge any price or no price for each copy that you convey, and you may offer support or warranty protection for a fee. 5. Conveying Modified Source Versions. You may convey a work based on the Program, or the modifications to produce it from the Program, in the form of source code under the terms of section 4, provided that you also meet all of these conditions: a) The work must carry prominent notices stating that you modified it, and giving a relevant date. b) The work must carry prominent notices stating that it is released under this License and any conditions added under section 7. This requirement modifies the requirement in section 4 to "keep intact all notices". c) You must license the entire work, as a whole, under this License to anyone who comes into possession of a copy. This License will therefore apply, along with any applicable section 7 additional terms, to the whole of the work, and all its parts, regardless of how they are packaged. This License gives no permission to license the work in any other way, but it does not invalidate such permission if you have separately received it. d) If the work has interactive user interfaces, each must display Appropriate Legal Notices; however, if the Program has interactive interfaces that do not display Appropriate Legal Notices, your work need not make them do so. A compilation of a covered work with other separate and independent works, which are not by their nature extensions of the covered work, and which are not combined with it such as to form a larger program, in or on a volume of a storage or distribution medium, is called an "aggregate" if the compilation and its resulting copyright are not used to limit the access or legal rights of the compilation's users beyond what the individual works permit. Inclusion of a covered work in an aggregate does not cause this License to apply to the other parts of the aggregate. 6. Conveying Non-Source Forms. You may convey a covered work in object code form under the terms of sections 4 and 5, provided that you also convey the machine-readable Corresponding Source under the terms of this License, in one of these ways: a) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by the Corresponding Source fixed on a durable physical medium customarily used for software interchange. b) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by a written offer, valid for at least three years and valid for as long as you offer spare parts or customer support for that product model, to give anyone who possesses the object code either (1) a copy of the Corresponding Source for all the software in the product that is covered by this License, on a durable physical medium customarily used for software interchange, for a price no more than your reasonable cost of physically performing this conveying of source, or (2) access to copy the Corresponding Source from a network server at no charge. c) Convey individual copies of the object code with a copy of the written offer to provide the Corresponding Source. This alternative is allowed only occasionally and noncommercially, and only if you received the object code with such an offer, in accord with subsection 6b. d) Convey the object code by offering access from a designated place (gratis or for a charge), and offer equivalent access to the Corresponding Source in the same way through the same place at no further charge. You need not require recipients to copy the Corresponding Source along with the object code. If the place to copy the object code is a network server, the Corresponding Source may be on a different server (operated by you or a third party) that supports equivalent copying facilities, provided you maintain clear directions next to the object code saying where to find the Corresponding Source. Regardless of what server hosts the Corresponding Source, you remain obligated to ensure that it is available for as long as needed to satisfy these requirements. e) Convey the object code using peer-to-peer transmission, provided you inform other peers where the object code and Corresponding Source of the work are being offered to the general public at no charge under subsection 6d. A separable portion of the object code, whose source code is excluded from the Corresponding Source as a System Library, need not be included in conveying the object code work. A "User Product" is either (1) a "consumer product", which means any tangible personal property which is normally used for personal, family, or household purposes, or (2) anything designed or sold for incorporation into a dwelling. In determining whether a product is a consumer product, doubtful cases shall be resolved in favor of coverage. For a particular product received by a particular user, "normally used" refers to a typical or common use of that class of product, regardless of the status of the particular user or of the way in which the particular user actually uses, or expects or is expected to use, the product. A product is a consumer product regardless of whether the product has substantial commercial, industrial or non-consumer uses, unless such uses represent the only significant mode of use of the product. "Installation Information" for a User Product means any methods, procedures, authorization keys, or other information required to install and execute modified versions of a covered work in that User Product from a modified version of its Corresponding Source. The information must suffice to ensure that the continued functioning of the modified object code is in no case prevented or interfered with solely because modification has been made. If you convey an object code work under this section in, or with, or specifically for use in, a User Product, and the conveying occurs as part of a transaction in which the right of possession and use of the User Product is transferred to the recipient in perpetuity or for a fixed term (regardless of how the transaction is characterized), the Corresponding Source conveyed under this section must be accompanied by the Installation Information. But this requirement does not apply if neither you nor any third party retains the ability to install modified object code on the User Product (for example, the work has been installed in ROM). The requirement to provide Installation Information does not include a requirement to continue to provide support service, warranty, or updates for a work that has been modified or installed by the recipient, or for the User Product in which it has been modified or installed. Access to a network may be denied when the modification itself materially and adversely affects the operation of the network or violates the rules and protocols for communication across the network. Corresponding Source conveyed, and Installation Information provided, in accord with this section must be in a format that is publicly documented (and with an implementation available to the public in source code form), and must require no special password or key for unpacking, reading or copying. 7. Additional Terms. "Additional permissions" are terms that supplement the terms of this License by making exceptions from one or more of its conditions. Additional permissions that are applicable to the entire Program shall be treated as though they were included in this License, to the extent that they are valid under applicable law. If additional permissions apply only to part of the Program, that part may be used separately under those permissions, but the entire Program remains governed by this License without regard to the additional permissions. When you convey a copy of a covered work, you may at your option remove any additional permissions from that copy, or from any part of it. (Additional permissions may be written to require their own removal in certain cases when you modify the work.) You may place additional permissions on material, added by you to a covered work, for which you have or can give appropriate copyright permission. Notwithstanding any other provision of this License, for material you add to a covered work, you may (if authorized by the copyright holders of that material) supplement the terms of this License with terms: a) Disclaiming warranty or limiting liability differently from the terms of sections 15 and 16 of this License; or b) Requiring preservation of specified reasonable legal notices or author attributions in that material or in the Appropriate Legal Notices displayed by works containing it; or c) Prohibiting misrepresentation of the origin of that material, or requiring that modified versions of such material be marked in reasonable ways as different from the original version; or d) Limiting the use for publicity purposes of names of licensors or authors of the material; or e) Declining to grant rights under trademark law for use of some trade names, trademarks, or service marks; or f) Requiring indemnification of licensors and authors of that material by anyone who conveys the material (or modified versions of it) with contractual assumptions of liability to the recipient, for any liability that these contractual assumptions directly impose on those licensors and authors. All other non-permissive additional terms are considered "further restrictions" within the meaning of section 10. If the Program as you received it, or any part of it, contains a notice stating that it is governed by this License along with a term that is a further restriction, you may remove that term. If a license document contains a further restriction but permits relicensing or conveying under this License, you may add to a covered work material governed by the terms of that license document, provided that the further restriction does not survive such relicensing or conveying. If you add terms to a covered work in accord with this section, you must place, in the relevant source files, a statement of the additional terms that apply to those files, or a notice indicating where to find the applicable terms. Additional terms, permissive or non-permissive, may be stated in the form of a separately written license, or stated as exceptions; the above requirements apply either way. 8. Termination. You may not propagate or modify a covered work except as expressly provided under this License. Any attempt otherwise to propagate or modify it is void, and will automatically terminate your rights under this License (including any patent licenses granted under the third paragraph of section 11). However, if you cease all violation of this License, then your license from a particular copyright holder is reinstated (a) provisionally, unless and until the copyright holder explicitly and finally terminates your license, and (b) permanently, if the copyright holder fails to notify you of the violation by some reasonable means prior to 60 days after the cessation. Moreover, your license from a particular copyright holder is reinstated permanently if the copyright holder notifies you of the violation by some reasonable means, this is the first time you have received notice of violation of this License (for any work) from that copyright holder, and you cure the violation prior to 30 days after your receipt of the notice. Termination of your rights under this section does not terminate the licenses of parties who have received copies or rights from you under this License. If your rights have been terminated and not permanently reinstated, you do not qualify to receive new licenses for the same material under section 10. 9. Acceptance Not Required for Having Copies. You are not required to accept this License in order to receive or run a copy of the Program. Ancillary propagation of a covered work occurring solely as a consequence of using peer-to-peer transmission to receive a copy likewise does not require acceptance. However, nothing other than this License grants you permission to propagate or modify any covered work. These actions infringe copyright if you do not accept this License. Therefore, by modifying or propagating a covered work, you indicate your acceptance of this License to do so. 10. Automatic Licensing of Downstream Recipients. Each time you convey a covered work, the recipient automatically receives a license from the original licensors, to run, modify and propagate that work, subject to this License. You are not responsible for enforcing compliance by third parties with this License. An "entity transaction" is a transaction transferring control of an organization, or substantially all assets of one, or subdividing an organization, or merging organizations. If propagation of a covered work results from an entity transaction, each party to that transaction who receives a copy of the work also receives whatever licenses to the work the party's predecessor in interest had or could give under the previous paragraph, plus a right to possession of the Corresponding Source of the work from the predecessor in interest, if the predecessor has it or can get it with reasonable efforts. You may not impose any further restrictions on the exercise of the rights granted or affirmed under this License. For example, you may not impose a license fee, royalty, or other charge for exercise of rights granted under this License, and you may not initiate litigation (including a cross-claim or counterclaim in a lawsuit) alleging that any patent claim is infringed by making, using, selling, offering for sale, or importing the Program or any portion of it. 11. Patents. A "contributor" is a copyright holder who authorizes use under this License of the Program or a work on which the Program is based. The work thus licensed is called the contributor's "contributor version". A contributor's "essential patent claims" are all patent claims owned or controlled by the contributor, whether already acquired or hereafter acquired, that would be infringed by some manner, permitted by this License, of making, using, or selling its contributor version, but do not include claims that would be infringed only as a consequence of further modification of the contributor version. For purposes of this definition, "control" includes the right to grant patent sublicenses in a manner consistent with the requirements of this License. Each contributor grants you a non-exclusive, worldwide, royalty-free patent license under the contributor's essential patent claims, to make, use, sell, offer for sale, import and otherwise run, modify and propagate the contents of its contributor version. In the following three paragraphs, a "patent license" is any express agreement or commitment, however denominated, not to enforce a patent (such as an express permission to practice a patent or covenant not to sue for patent infringement). To "grant" such a patent license to a party means to make such an agreement or commitment not to enforce a patent against the party. If you convey a covered work, knowingly relying on a patent license, and the Corresponding Source of the work is not available for anyone to copy, free of charge and under the terms of this License, through a publicly available network server or other readily accessible means, then you must either (1) cause the Corresponding Source to be so available, or (2) arrange to deprive yourself of the benefit of the patent license for this particular work, or (3) arrange, in a manner consistent with the requirements of this License, to extend the patent license to downstream recipients. "Knowingly relying" means you have actual knowledge that, but for the patent license, your conveying the covered work in a country, or your recipient's use of the covered work in a country, would infringe one or more identifiable patents in that country that you have reason to believe are valid. If, pursuant to or in connection with a single transaction or arrangement, you convey, or propagate by procuring conveyance of, a covered work, and grant a patent license to some of the parties receiving the covered work authorizing them to use, propagate, modify or convey a specific copy of the covered work, then the patent license you grant is automatically extended to all recipients of the covered work and works based on it. A patent license is "discriminatory" if it does not include within the scope of its coverage, prohibits the exercise of, or is conditioned on the non-exercise of one or more of the rights that are specifically granted under this License. You may not convey a covered work if you are a party to an arrangement with a third party that is in the business of distributing software, under which you make payment to the third party based on the extent of your activity of conveying the work, and under which the third party grants, to any of the parties who would receive the covered work from you, a discriminatory patent license (a) in connection with copies of the covered work conveyed by you (or copies made from those copies), or (b) primarily for and in connection with specific products or compilations that contain the covered work, unless you entered into that arrangement, or that patent license was granted, prior to 28 March 2007. Nothing in this License shall be construed as excluding or limiting any implied license or other defenses to infringement that may otherwise be available to you under applicable patent law. 12. No Surrender of Others' Freedom. If conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot convey a covered work so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not convey it at all. For example, if you agree to terms that obligate you to collect a royalty for further conveying from those to whom you convey the Program, the only way you could satisfy both those terms and this License would be to refrain entirely from conveying the Program. 13. Use with the GNU Affero General Public License. Notwithstanding any other provision of this License, you have permission to link or combine any covered work with a work licensed under version 3 of the GNU Affero General Public License into a single combined work, and to convey the resulting work. The terms of this License will continue to apply to the part which is the covered work, but the special requirements of the GNU Affero General Public License, section 13, concerning interaction through a network will apply to the combination as such. 14. Revised Versions of this License. The Free Software Foundation may publish revised and/or new versions of the GNU General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies that a certain numbered version of the GNU General Public License "or any later version" applies to it, you have the option of following the terms and conditions either of that numbered version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the GNU General Public License, you may choose any version ever published by the Free Software Foundation. If the Program specifies that a proxy can decide which future versions of the GNU General Public License can be used, that proxy's public statement of acceptance of a version permanently authorizes you to choose that version for the Program. Later license versions may give you additional or different permissions. However, no additional obligations are imposed on any author or copyright holder as a result of your choosing to follow a later version. 15. Disclaimer of Warranty. THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. Limitation of Liability. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. 17. Interpretation of Sections 15 and 16. If the disclaimer of warranty and limitation of liability provided above cannot be given local legal effect according to their terms, reviewing courts shall apply local law that most closely approximates an absolute waiver of all civil liability in connection with the Program, unless a warranty or assumption of liability accompanies a copy of the Program in return for a fee. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively state the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see . Also add information on how to contact you by electronic and paper mail. If the program does terminal interaction, make it output a short notice like this when it starts in an interactive mode: Copyright (C) This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, your program's commands might be different; for a GUI interface, you would use an "about box". You should also get your employer (if you work as a programmer) or school, if any, to sign a "copyright disclaimer" for the program, if necessary. For more information on this, and how to apply and follow the GNU GPL, see . The GNU General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Lesser General Public License instead of this License. But first, please read . guile-gcrypt/ChangeLog000066400000000000000000000000321434213166000152360ustar00rootroot00000000000000Please use ‘git log’. guile-gcrypt/Makefile.am000066400000000000000000000055231434213166000155320ustar00rootroot00000000000000## Copyright (C) 2015, 2017 Christopher Allan Webber ## parts of this automake recipe borrowed from: ## GNU Guix --- Functional package management for GNU ## Copyright © 2012, 2013, 2014, 2015, 2019 Ludovic Courtès ## Copyright © 2013 Andreas Enge ## Copyright © 2015 Alex Kost ## Sly ## Copyright (C) 2013, 2014 David Thompson ## This program is free software: you can redistribute it and/or ## modify it under the terms of the GNU General Public License as ## published by the Free Software Foundation, either version 3 of the ## License, or (at your option) any later version. ## ## This program is distributed in the hope that it will be useful, but ## WITHOUT ANY WARRANTY; without even the implied warranty of ## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU ## General Public License for more details. ## ## You should have received a copy of the GNU General Public License ## along with this program. If not, see ## . GOBJECTS = $(SOURCES:%.scm=%.go) nobase_mod_DATA = $(SOURCES) nobase_go_DATA = $(GOBJECTS) # Make sure source files are installed first, so that the mtime of # installed compiled files is greater than that of installed source # files. See # # for details. guile_install_go_files = install-nobase_goDATA $(guile_install_go_files): install-nobase_modDATA GUILE_WARNINGS = -Wunbound-variable -Warity-mismatch -Wformat SUFFIXES = .scm .go .scm.go: $(AM_V_GEN)$(top_builddir)/pre-inst-env $(GUILD) \ compile $(GUILE_TARGET) $(GUILE_WARNINGS) -o "$@" "$<" moddir=$(prefix)/share/guile/site/$(GUILE_EFFECTIVE_VERSION) godir = $(libdir)/guile/$(GUILE_EFFECTIVE_VERSION)/site-ccache SOURCES = \ gcrypt/base16.scm \ gcrypt/base64.scm \ gcrypt/common.scm \ gcrypt/hash.scm \ gcrypt/hmac.scm \ gcrypt/internal.scm \ gcrypt/mac.scm \ gcrypt/package-config.scm \ gcrypt/pk-crypto.scm \ gcrypt/random.scm \ gcrypt/utils.scm TESTS = \ tests/base16.scm \ tests/base64.scm \ tests/hash.scm \ tests/hmac.scm \ tests/mac.scm \ tests/pk-crypto.scm TEST_EXTENSIONS = .scm SCM_LOG_DRIVER = \ $(top_builddir)/pre-inst-env \ $(GUILE) --no-auto-compile -e main \ $(top_srcdir)/build-aux/test-driver.scm # Tell 'build-aux/test-driver.scm' to display only source file names, # not indivdual test names. AM_SCM_LOG_DRIVER_FLAGS = --brief=yes AM_SCM_LOG_FLAGS = --no-auto-compile -L $(top_srcdir) CLEANFILES = \ $(GOBJECTS) \ $(TESTS:tests/%.scm=%.log) \ *.log *.tar.gz EXTRA_DIST = \ $(SOURCES) \ $(TESTS) \ guix.scm \ build-aux/test-driver.scm \ pre-inst-env.in info_TEXINFOS = guile-gcrypt.texi guile_gcrypt_TEXINFOS = fdl-1.3.texi guile-gcrypt/NEWS000066400000000000000000000032471434213166000141760ustar00rootroot00000000000000 -*- org -*- #+TITLE: Guile-Gcrypt NEWS – history of user-visible changes #+STARTUP: content hidestars Copyright © 2019, 2020, 2022 Ludovic Courtès Copying and distribution of this file, with or without modification, are permitted in any medium without royalty provided the copyright notice and this notice are preserved. Run “info guile-gcrypt” for details about the changes described below. Please send Guix bug reports to . * Changes in 0.4.0 (since 0.3.0) ** ‘base64-encode’ and ‘base64-decode’ now let you optionally control padding ** New supported algorithms added to (gcrypt hash) ** New supported algorithms added to (gcrypt mac) ** Improvements and fixes to the manual * Changes in 0.3.0 (since 0.2.1) ** ‘sexp->canonical-sexp->sexp’ now accepts integers ** (gcrypt common) exports ‘error/’ constants and error handling procedures ** ‘verify’ now throws upon errors other than ‘error/bad-signature’ ** (gcrypt hmac) and (gcrypt hash) export bindings for their syntax literals ** New ‘hash-algorithm-name’ and ‘mac-algorithm-name’ procedures * Changes in 0.2.1 (since 0.2.0) ** libgcrypt is now always properly initialized (https://bugs.gnu.org/37616) ** (gcrypt base64) no longer imports (rnrs) * Changes in 0.2.0 (since 0.1.0) ** (gcrypt hash) now exposes all the algorithms supported by Libgcrypt ** (guix mac) now exposes all the MAC algorithms, not just HMAC ** (guix hmac) is deprecated in favor of (guix mac) ** Guile-Gcrypt can now be compiled with Guile 2.9 (future 3.0) ** Guile-Gcrypt can now be cross-compiled guile-gcrypt/README000066400000000000000000000013231434213166000143500ustar00rootroot00000000000000Guile-Gcrypt — Guile bindings to Libgcrypt ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Guile-Gcrypt provides a Guile 3.x/2.x interface to a subset of the GNU Libgcrypt crytographic library, which is itself used by the GNU Privacy Guard (GPG). Guile-Gcrypt provides modules for cryptographic hash functions, message authentication codes (MAC), public-key cryptography, strong randomness, and more. It is implemented using the foreign function interface (FFI) of Guile. Requirements: • GNU Guile 3.x or 2.x >= 2.0.10, https://gnu.org/software/guile/ • GNU Libgcrypt 1.8.x or later, https://gnupg.org/ For more information, patches, bug reports, and all that, see: https://notabug.org/cwebber/guile-gcrypt guile-gcrypt/bootstrap.sh000077500000000000000000000000331434213166000160410ustar00rootroot00000000000000#!/bin/sh autoreconf -vif guile-gcrypt/build-aux/000077500000000000000000000000001434213166000153635ustar00rootroot00000000000000guile-gcrypt/build-aux/test-driver.scm000066400000000000000000000172751434213166000203530ustar00rootroot00000000000000;;;; test-driver.scm - Guile test driver for Automake testsuite harness (define script-version "2017-03-22.13") ;UTC ;;; Copyright © 2015, 2016 Mathieu Lirzin ;;; ;;; This program is free software; you can redistribute it and/or modify it ;;; under the terms of the GNU General Public License as published by ;;; the Free Software Foundation; either version 3 of the License, or (at ;;; your option) any later version. ;;; ;;; This program is distributed in the hope that it will be useful, but ;;; WITHOUT ANY WARRANTY; without even the implied warranty of ;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the ;;; GNU General Public License for more details. ;;; ;;; You should have received a copy of the GNU General Public License ;;; along with this program. If not, see . ;;;; Commentary: ;;; ;;; This script provides a Guile test driver using the SRFI-64 Scheme API for ;;; test suites. SRFI-64 is distributed with Guile since version 2.0.9. ;;; ;;;; Code: (use-modules (ice-9 getopt-long) (ice-9 pretty-print) (srfi srfi-26) (srfi srfi-64)) (define (show-help) (display "Usage: test-driver --test-name=NAME --log-file=PATH --trs-file=PATH [--expect-failure={yes|no}] [--color-tests={yes|no}] [--enable-hard-errors={yes|no}] [--brief={yes|no}}] [--] TEST-SCRIPT [TEST-SCRIPT-ARGUMENTS] The '--test-name', '--log-file' and '--trs-file' options are mandatory.\n")) (define %options '((test-name (value #t)) (log-file (value #t)) (trs-file (value #t)) (color-tests (value #t)) (expect-failure (value #t)) ;XXX: not implemented yet (enable-hard-errors (value #t)) ;not implemented in SRFI-64 (brief (value #t)) (help (single-char #\h) (value #f)) (version (single-char #\V) (value #f)))) (define (option->boolean options key) "Return #t if the value associated with KEY in OPTIONS is \"yes\"." (and=> (option-ref options key #f) (cut string=? <> "yes"))) (define* (test-display field value #:optional (port (current-output-port)) #:key pretty?) "Display \"FIELD: VALUE\\n\" on PORT." (if pretty? (begin (format port "~A:~%" field) (pretty-print value port #:per-line-prefix "+ ")) (format port "~A: ~S~%" field value))) (define* (result->string symbol #:key colorize?) "Return SYMBOL as an upper case string. Use colors when COLORIZE is #t." (let ((result (string-upcase (symbol->string symbol)))) (if colorize? (string-append (case symbol ((pass) "") ;green ((xfail) "") ;light green ((skip) "") ;blue ((fail xpass) "") ;red ((error) "")) ;magenta result "") ;no color result))) (define* (test-runner-gnu test-name #:key color? brief? out-port trs-port) "Return an custom SRFI-64 test runner. TEST-NAME is a string specifying the file name of the current the test. COLOR? specifies whether to use colors, and BRIEF?, well, you know. OUT-PORT and TRS-PORT must be output ports. The current output port is supposed to be redirected to a '.log' file." (define (test-on-test-begin-gnu runner) ;; Procedure called at the start of an individual test case, before the ;; test expression (and expected value) are evaluated. (let ((result (cute assq-ref (test-result-alist runner) <>))) (format #t "test-name: ~A~%" (result 'test-name)) (format #t "location: ~A~%" (string-append (result 'source-file) ":" (number->string (result 'source-line)))) (test-display "source" (result 'source-form) #:pretty? #t))) (define (test-on-test-end-gnu runner) ;; Procedure called at the end of an individual test case, when the result ;; of the test is available. (let* ((results (test-result-alist runner)) (result? (cut assq <> results)) (result (cut assq-ref results <>))) (unless brief? ;; Display the result of each test case on the console. (format out-port "~A: ~A - ~A~%" (result->string (test-result-kind runner) #:colorize? color?) test-name (test-runner-test-name runner))) (when (result? 'expected-value) (test-display "expected-value" (result 'expected-value))) (when (result? 'expected-error) (test-display "expected-error" (result 'expected-error) #:pretty? #t)) (when (result? 'actual-value) (test-display "actual-value" (result 'actual-value))) (when (result? 'actual-error) (test-display "actual-error" (result 'actual-error) #:pretty? #t)) (format #t "result: ~a~%" (result->string (result 'result-kind))) (newline) (format trs-port ":test-result: ~A ~A~%" (result->string (test-result-kind runner)) (test-runner-test-name runner)))) (define (test-on-group-end-gnu runner) ;; Procedure called by a 'test-end', including at the end of a test-group. (let ((fail (or (positive? (test-runner-fail-count runner)) (positive? (test-runner-xpass-count runner)))) (skip (or (positive? (test-runner-skip-count runner)) (positive? (test-runner-xfail-count runner))))) ;; XXX: The global results need some refinements for XPASS. (format trs-port ":global-test-result: ~A~%" (if fail "FAIL" (if skip "SKIP" "PASS"))) (format trs-port ":recheck: ~A~%" (if fail "yes" "no")) (format trs-port ":copy-in-global-log: ~A~%" (if (or fail skip) "yes" "no")) (when brief? ;; Display the global test group result on the console. (format out-port "~A: ~A~%" (result->string (if fail 'fail (if skip 'skip 'pass)) #:colorize? color?) test-name)) #f)) (let ((runner (test-runner-null))) (test-runner-on-test-begin! runner test-on-test-begin-gnu) (test-runner-on-test-end! runner test-on-test-end-gnu) (test-runner-on-group-end! runner test-on-group-end-gnu) (test-runner-on-bad-end-name! runner test-on-bad-end-name-simple) runner)) ;;; ;;; Entry point. ;;; (define (main . args) (let* ((opts (getopt-long (command-line) %options)) (option (cut option-ref opts <> <>))) (cond ((option 'help #f) (show-help)) ((option 'version #f) (format #t "test-driver.scm ~A" script-version)) (else (let ((log (open-file (option 'log-file "") "w0")) (trs (open-file (option 'trs-file "") "wl")) (out (duplicate-port (current-output-port) "wl"))) (redirect-port log (current-output-port)) (redirect-port log (current-warning-port)) (redirect-port log (current-error-port)) (test-with-runner (test-runner-gnu (option 'test-name #f) #:color? (option->boolean opts 'color-tests) #:brief? (option->boolean opts 'brief) #:out-port out #:trs-port trs) (load-from-path (option 'test-name #f))) (close-port log) (close-port trs) (close-port out)))) (exit 0))) ;;; Local Variables: ;;; eval: (add-hook 'write-file-functions 'time-stamp) ;;; time-stamp-start: "(define script-version \"" ;;; time-stamp-format: "%:y-%02m-%02d.%02H" ;;; time-stamp-time-zone: "UTC" ;;; time-stamp-end: "\") ;UTC" ;;; End: ;;;; test-driver.scm ends here. guile-gcrypt/configure.ac000066400000000000000000000044561434213166000157700ustar00rootroot00000000000000AC_INIT([Guile-Gcrypt], [0.4.0], [guile-user@gnu.org], [guile-gcrypt], [https://notabug.org/cwebber/guile-gcrypt]) AC_CONFIG_AUX_DIR([build-aux]) AC_CONFIG_MACRO_DIR([m4]) AM_INIT_AUTOMAKE([-Wall -Werror gnu]) AM_SILENT_RULES([yes]) dnl We require guile.m4, from Guile. Make sure it's available. m4_pattern_forbid([^GUILE_P]) m4_pattern_allow([^GUILE_PKG_ERRORS]) GUILE_PKG([3.0 2.2 2.0]) GUILE_PROGS AC_CONFIG_FILES([Makefile gcrypt/package-config.scm]) AC_CONFIG_FILES([pre-inst-env], [chmod +x pre-inst-env]) dnl Prepare a version of $datadir that does not contain references to dnl shell variables. (Borrowed from Sly, which borrowed from Guix...) guile_gcrypt_prefix="`eval echo $prefix | sed -e"s|NONE|/usr/local|g"`" guile_gcrypt_datadir="`eval eval echo $datadir | sed -e "s|NONE|$guile_gcrypt_prefix|g"`" AC_SUBST([guile_gcrypt_datadir]) LIBGCRYPT="libgcrypt" LIBGCRYPT_LIBDIR="no" LIBGCRYPT_PREFIX="no" AC_ARG_WITH([libgcrypt-prefix], [AS_HELP_STRING([--with-libgcrypt-prefix=DIR], [search for GNU libgcrypt in DIR])], [case "$withval" in yes|no) ;; *) LIBGCRYPT="$withval/lib/libgcrypt" LIBGCRYPT_PREFIX="$withval" LIBGCRYPT_LIBDIR="$withval/lib" ;; esac]) AC_ARG_WITH([libgcrypt-libdir], [AS_HELP_STRING([--with-libgcrypt-libdir=DIR], [search for GNU libgcrypt's shared library in DIR])], [case "$withval" in yes|no) LIBGCRYPT="libgcrypt" LIBGCRYPT_LIBDIR="no" ;; *) LIBGCRYPT="$withval/libgcrypt" LIBGCRYPT_LIBDIR="$withval" ;; esac]) dnl If none of the --with-libgcrypt-* options was used, try to determine the dnl absolute file name of libgcrypt.so. case "x$LIBGCRYPT_PREFIX$LIBGCRYPT_LIBDIR" in xnono) GUIX_LIBGCRYPT_LIBDIR([LIBGCRYPT_LIBDIR]) if test "x$LIBGCRYPT_LIBDIR" != x; then LIBGCRYPT="$LIBGCRYPT_LIBDIR/libgcrypt" else dnl 'config-daemon.ac' expects "no" in this case. LIBGCRYPT_LIBDIR="no" fi ;; esac dnl Library name suitable for `dynamic-link'. AC_MSG_CHECKING([for libgcrypt shared library name]) AC_MSG_RESULT([$LIBGCRYPT]) AC_SUBST([LIBGCRYPT]) AC_SUBST([LIBGCRYPT_PREFIX]) AC_SUBST([LIBGCRYPT_LIBDIR]) if test "$cross_compiling" = "no"; then GUIX_ASSERT_LIBGCRYPT_USABLE else GUILE_TARGET="--target=$host_alias" AC_SUBST([GUILE_TARGET]) fi AC_OUTPUT guile-gcrypt/fdl-1.3.texi000066400000000000000000000556071434213166000154450ustar00rootroot00000000000000@c The GNU Free Documentation License. @center Version 1.3, 3 November 2008 @c This file is intended to be included within another document, @c hence no sectioning command or @node. @display Copyright @copyright{} 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc. @uref{http://fsf.org/} Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. @end display @enumerate 0 @item PREAMBLE The purpose of this License is to make a manual, textbook, or other functional and useful document @dfn{free} in the sense of freedom: to assure everyone the effective freedom to copy and redistribute it, with or without modifying it, either commercially or noncommercially. Secondarily, this License preserves for the author and publisher a way to get credit for their work, while not being considered responsible for modifications made by others. This License is a kind of ``copyleft'', which means that derivative works of the document must themselves be free in the same sense. It complements the GNU General Public License, which is a copyleft license designed for free software. We have designed this License in order to use it for manuals for free software, because free software needs free documentation: a free program should come with manuals providing the same freedoms that the software does. But this License is not limited to software manuals; it can be used for any textual work, regardless of subject matter or whether it is published as a printed book. We recommend this License principally for works whose purpose is instruction or reference. @item APPLICABILITY AND DEFINITIONS This License applies to any manual or other work, in any medium, that contains a notice placed by the copyright holder saying it can be distributed under the terms of this License. Such a notice grants a world-wide, royalty-free license, unlimited in duration, to use that work under the conditions stated herein. The ``Document'', below, refers to any such manual or work. Any member of the public is a licensee, and is addressed as ``you''. You accept the license if you copy, modify or distribute the work in a way requiring permission under copyright law. A ``Modified Version'' of the Document means any work containing the Document or a portion of it, either copied verbatim, or with modifications and/or translated into another language. A ``Secondary Section'' is a named appendix or a front-matter section of the Document that deals exclusively with the relationship of the publishers or authors of the Document to the Document's overall subject (or to related matters) and contains nothing that could fall directly within that overall subject. (Thus, if the Document is in part a textbook of mathematics, a Secondary Section may not explain any mathematics.) The relationship could be a matter of historical connection with the subject or with related matters, or of legal, commercial, philosophical, ethical or political position regarding them. The ``Invariant Sections'' are certain Secondary Sections whose titles are designated, as being those of Invariant Sections, in the notice that says that the Document is released under this License. If a section does not fit the above definition of Secondary then it is not allowed to be designated as Invariant. The Document may contain zero Invariant Sections. If the Document does not identify any Invariant Sections then there are none. The ``Cover Texts'' are certain short passages of text that are listed, as Front-Cover Texts or Back-Cover Texts, in the notice that says that the Document is released under this License. A Front-Cover Text may be at most 5 words, and a Back-Cover Text may be at most 25 words. A ``Transparent'' copy of the Document means a machine-readable copy, represented in a format whose specification is available to the general public, that is suitable for revising the document straightforwardly with generic text editors or (for images composed of pixels) generic paint programs or (for drawings) some widely available drawing editor, and that is suitable for input to text formatters or for automatic translation to a variety of formats suitable for input to text formatters. A copy made in an otherwise Transparent file format whose markup, or absence of markup, has been arranged to thwart or discourage subsequent modification by readers is not Transparent. An image format is not Transparent if used for any substantial amount of text. A copy that is not ``Transparent'' is called ``Opaque''. Examples of suitable formats for Transparent copies include plain ASCII without markup, Texinfo input format, La@TeX{} input format, SGML or XML using a publicly available DTD, and standard-conforming simple HTML, PostScript or PDF designed for human modification. Examples of transparent image formats include PNG, XCF and JPG. Opaque formats include proprietary formats that can be read and edited only by proprietary word processors, SGML or XML for which the DTD and/or processing tools are not generally available, and the machine-generated HTML, PostScript or PDF produced by some word processors for output purposes only. The ``Title Page'' means, for a printed book, the title page itself, plus such following pages as are needed to hold, legibly, the material this License requires to appear in the title page. For works in formats which do not have any title page as such, ``Title Page'' means the text near the most prominent appearance of the work's title, preceding the beginning of the body of the text. The ``publisher'' means any person or entity that distributes copies of the Document to the public. A section ``Entitled XYZ'' means a named subunit of the Document whose title either is precisely XYZ or contains XYZ in parentheses following text that translates XYZ in another language. (Here XYZ stands for a specific section name mentioned below, such as ``Acknowledgements'', ``Dedications'', ``Endorsements'', or ``History''.) To ``Preserve the Title'' of such a section when you modify the Document means that it remains a section ``Entitled XYZ'' according to this definition. The Document may include Warranty Disclaimers next to the notice which states that this License applies to the Document. These Warranty Disclaimers are considered to be included by reference in this License, but only as regards disclaiming warranties: any other implication that these Warranty Disclaimers may have is void and has no effect on the meaning of this License. @item VERBATIM COPYING You may copy and distribute the Document in any medium, either commercially or noncommercially, provided that this License, the copyright notices, and the license notice saying this License applies to the Document are reproduced in all copies, and that you add no other conditions whatsoever to those of this License. You may not use technical measures to obstruct or control the reading or further copying of the copies you make or distribute. However, you may accept compensation in exchange for copies. If you distribute a large enough number of copies you must also follow the conditions in section 3. You may also lend copies, under the same conditions stated above, and you may publicly display copies. @item COPYING IN QUANTITY If you publish printed copies (or copies in media that commonly have printed covers) of the Document, numbering more than 100, and the Document's license notice requires Cover Texts, you must enclose the copies in covers that carry, clearly and legibly, all these Cover Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on the back cover. Both covers must also clearly and legibly identify you as the publisher of these copies. The front cover must present the full title with all words of the title equally prominent and visible. You may add other material on the covers in addition. Copying with changes limited to the covers, as long as they preserve the title of the Document and satisfy these conditions, can be treated as verbatim copying in other respects. If the required texts for either cover are too voluminous to fit legibly, you should put the first ones listed (as many as fit reasonably) on the actual cover, and continue the rest onto adjacent pages. If you publish or distribute Opaque copies of the Document numbering more than 100, you must either include a machine-readable Transparent copy along with each Opaque copy, or state in or with each Opaque copy a computer-network location from which the general network-using public has access to download using public-standard network protocols a complete Transparent copy of the Document, free of added material. If you use the latter option, you must take reasonably prudent steps, when you begin distribution of Opaque copies in quantity, to ensure that this Transparent copy will remain thus accessible at the stated location until at least one year after the last time you distribute an Opaque copy (directly or through your agents or retailers) of that edition to the public. It is requested, but not required, that you contact the authors of the Document well before redistributing any large number of copies, to give them a chance to provide you with an updated version of the Document. @item MODIFICATIONS You may copy and distribute a Modified Version of the Document under the conditions of sections 2 and 3 above, provided that you release the Modified Version under precisely this License, with the Modified Version filling the role of the Document, thus licensing distribution and modification of the Modified Version to whoever possesses a copy of it. In addition, you must do these things in the Modified Version: @enumerate A @item Use in the Title Page (and on the covers, if any) a title distinct from that of the Document, and from those of previous versions (which should, if there were any, be listed in the History section of the Document). You may use the same title as a previous version if the original publisher of that version gives permission. @item List on the Title Page, as authors, one or more persons or entities responsible for authorship of the modifications in the Modified Version, together with at least five of the principal authors of the Document (all of its principal authors, if it has fewer than five), unless they release you from this requirement. @item State on the Title page the name of the publisher of the Modified Version, as the publisher. @item Preserve all the copyright notices of the Document. @item Add an appropriate copyright notice for your modifications adjacent to the other copyright notices. @item Include, immediately after the copyright notices, a license notice giving the public permission to use the Modified Version under the terms of this License, in the form shown in the Addendum below. @item Preserve in that license notice the full lists of Invariant Sections and required Cover Texts given in the Document's license notice. @item Include an unaltered copy of this License. @item Preserve the section Entitled ``History'', Preserve its Title, and add to it an item stating at least the title, year, new authors, and publisher of the Modified Version as given on the Title Page. If there is no section Entitled ``History'' in the Document, create one stating the title, year, authors, and publisher of the Document as given on its Title Page, then add an item describing the Modified Version as stated in the previous sentence. @item Preserve the network location, if any, given in the Document for public access to a Transparent copy of the Document, and likewise the network locations given in the Document for previous versions it was based on. These may be placed in the ``History'' section. You may omit a network location for a work that was published at least four years before the Document itself, or if the original publisher of the version it refers to gives permission. @item For any section Entitled ``Acknowledgements'' or ``Dedications'', Preserve the Title of the section, and preserve in the section all the substance and tone of each of the contributor acknowledgements and/or dedications given therein. @item Preserve all the Invariant Sections of the Document, unaltered in their text and in their titles. Section numbers or the equivalent are not considered part of the section titles. @item Delete any section Entitled ``Endorsements''. Such a section may not be included in the Modified Version. @item Do not retitle any existing section to be Entitled ``Endorsements'' or to conflict in title with any Invariant Section. @item Preserve any Warranty Disclaimers. @end enumerate If the Modified Version includes new front-matter sections or appendices that qualify as Secondary Sections and contain no material copied from the Document, you may at your option designate some or all of these sections as invariant. To do this, add their titles to the list of Invariant Sections in the Modified Version's license notice. These titles must be distinct from any other section titles. You may add a section Entitled ``Endorsements'', provided it contains nothing but endorsements of your Modified Version by various parties---for example, statements of peer review or that the text has been approved by an organization as the authoritative definition of a standard. You may add a passage of up to five words as a Front-Cover Text, and a passage of up to 25 words as a Back-Cover Text, to the end of the list of Cover Texts in the Modified Version. Only one passage of Front-Cover Text and one of Back-Cover Text may be added by (or through arrangements made by) any one entity. If the Document already includes a cover text for the same cover, previously added by you or by arrangement made by the same entity you are acting on behalf of, you may not add another; but you may replace the old one, on explicit permission from the previous publisher that added the old one. The author(s) and publisher(s) of the Document do not by this License give permission to use their names for publicity for or to assert or imply endorsement of any Modified Version. @item COMBINING DOCUMENTS You may combine the Document with other documents released under this License, under the terms defined in section 4 above for modified versions, provided that you include in the combination all of the Invariant Sections of all of the original documents, unmodified, and list them all as Invariant Sections of your combined work in its license notice, and that you preserve all their Warranty Disclaimers. The combined work need only contain one copy of this License, and multiple identical Invariant Sections may be replaced with a single copy. If there are multiple Invariant Sections with the same name but different contents, make the title of each such section unique by adding at the end of it, in parentheses, the name of the original author or publisher of that section if known, or else a unique number. Make the same adjustment to the section titles in the list of Invariant Sections in the license notice of the combined work. In the combination, you must combine any sections Entitled ``History'' in the various original documents, forming one section Entitled ``History''; likewise combine any sections Entitled ``Acknowledgements'', and any sections Entitled ``Dedications''. You must delete all sections Entitled ``Endorsements.'' @item COLLECTIONS OF DOCUMENTS You may make a collection consisting of the Document and other documents released under this License, and replace the individual copies of this License in the various documents with a single copy that is included in the collection, provided that you follow the rules of this License for verbatim copying of each of the documents in all other respects. You may extract a single document from such a collection, and distribute it individually under this License, provided you insert a copy of this License into the extracted document, and follow this License in all other respects regarding verbatim copying of that document. @item AGGREGATION WITH INDEPENDENT WORKS A compilation of the Document or its derivatives with other separate and independent documents or works, in or on a volume of a storage or distribution medium, is called an ``aggregate'' if the copyright resulting from the compilation is not used to limit the legal rights of the compilation's users beyond what the individual works permit. When the Document is included in an aggregate, this License does not apply to the other works in the aggregate which are not themselves derivative works of the Document. If the Cover Text requirement of section 3 is applicable to these copies of the Document, then if the Document is less than one half of the entire aggregate, the Document's Cover Texts may be placed on covers that bracket the Document within the aggregate, or the electronic equivalent of covers if the Document is in electronic form. Otherwise they must appear on printed covers that bracket the whole aggregate. @item TRANSLATION Translation is considered a kind of modification, so you may distribute translations of the Document under the terms of section 4. Replacing Invariant Sections with translations requires special permission from their copyright holders, but you may include translations of some or all Invariant Sections in addition to the original versions of these Invariant Sections. You may include a translation of this License, and all the license notices in the Document, and any Warranty Disclaimers, provided that you also include the original English version of this License and the original versions of those notices and disclaimers. In case of a disagreement between the translation and the original version of this License or a notice or disclaimer, the original version will prevail. If a section in the Document is Entitled ``Acknowledgements'', ``Dedications'', or ``History'', the requirement (section 4) to Preserve its Title (section 1) will typically require changing the actual title. @item TERMINATION You may not copy, modify, sublicense, or distribute the Document except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense, or distribute it is void, and will automatically terminate your rights under this License. However, if you cease all violation of this License, then your license from a particular copyright holder is reinstated (a) provisionally, unless and until the copyright holder explicitly and finally terminates your license, and (b) permanently, if the copyright holder fails to notify you of the violation by some reasonable means prior to 60 days after the cessation. Moreover, your license from a particular copyright holder is reinstated permanently if the copyright holder notifies you of the violation by some reasonable means, this is the first time you have received notice of violation of this License (for any work) from that copyright holder, and you cure the violation prior to 30 days after your receipt of the notice. Termination of your rights under this section does not terminate the licenses of parties who have received copies or rights from you under this License. If your rights have been terminated and not permanently reinstated, receipt of a copy of some or all of the same material does not give you any rights to use it. @item FUTURE REVISIONS OF THIS LICENSE The Free Software Foundation may publish new, revised versions of the GNU Free Documentation License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. See @uref{http://www.gnu.org/copyleft/}. Each version of the License is given a distinguishing version number. If the Document specifies that a particular numbered version of this License ``or any later version'' applies to it, you have the option of following the terms and conditions either of that specified version or of any later version that has been published (not as a draft) by the Free Software Foundation. If the Document does not specify a version number of this License, you may choose any version ever published (not as a draft) by the Free Software Foundation. If the Document specifies that a proxy can decide which future versions of this License can be used, that proxy's public statement of acceptance of a version permanently authorizes you to choose that version for the Document. @item RELICENSING ``Massive Multiauthor Collaboration Site'' (or ``MMC Site'') means any World Wide Web server that publishes copyrightable works and also provides prominent facilities for anybody to edit those works. A public wiki that anybody can edit is an example of such a server. A ``Massive Multiauthor Collaboration'' (or ``MMC'') contained in the site means any set of copyrightable works thus published on the MMC site. ``CC-BY-SA'' means the Creative Commons Attribution-Share Alike 3.0 license published by Creative Commons Corporation, a not-for-profit corporation with a principal place of business in San Francisco, California, as well as future copyleft versions of that license published by that same organization. ``Incorporate'' means to publish or republish a Document, in whole or in part, as part of another Document. An MMC is ``eligible for relicensing'' if it is licensed under this License, and if all works that were first published under this License somewhere other than this MMC, and subsequently incorporated in whole or in part into the MMC, (1) had no cover texts or invariant sections, and (2) were thus incorporated prior to November 1, 2008. The operator of an MMC Site may republish an MMC contained in the site under CC-BY-SA on the same site at any time before August 1, 2009, provided the MMC is eligible for relicensing. @end enumerate @page @heading ADDENDUM: How to use this License for your documents To use this License in a document you have written, include a copy of the License in the document and put the following copyright and license notices just after the title page: @smallexample @group Copyright (C) @var{year} @var{your name}. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled ``GNU Free Documentation License''. @end group @end smallexample If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts, replace the ``with@dots{}Texts.''@: line with this: @smallexample @group with the Invariant Sections being @var{list their titles}, with the Front-Cover Texts being @var{list}, and with the Back-Cover Texts being @var{list}. @end group @end smallexample If you have Invariant Sections without Cover Texts, or some other combination of the three, merge those two alternatives to suit the situation. If your document contains nontrivial examples of program code, we recommend releasing these examples in parallel under your choice of free software license, such as the GNU General Public License, to permit their use in free software. @c Local Variables: @c ispell-local-pdict: "ispell-dict" @c End: guile-gcrypt/gcrypt/000077500000000000000000000000001434213166000150015ustar00rootroot00000000000000guile-gcrypt/gcrypt/base16.scm000066400000000000000000000062741434213166000165770ustar00rootroot00000000000000;;; guile-gcrypt --- crypto tooling for guile ;;; Copyright © 2012, 2014, 2017 Ludovic Courtès ;;; ;;; This file is part of guile-gcrypt. ;;; ;;; guile-gcrypt is free software; you can redistribute it and/or modify it ;;; under the terms of the GNU General Public License as published by ;;; the Free Software Foundation; either version 3 of the License, or ;;; (at your option) any later version. ;;; ;;; guile-gcrypt is distributed in the hope that it will be useful, but ;;; WITHOUT ANY WARRANTY; without even the implied warranty of ;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU ;;; General Public License for more details. ;;; ;;; You should have received a copy of the GNU General Public License ;;; along with guile-gcrypt. If not, see . (define-module (gcrypt base16) #:use-module (srfi srfi-1) #:use-module (srfi srfi-26) #:use-module (srfi srfi-60) #:use-module (rnrs bytevectors) #:use-module (ice-9 vlist) #:use-module (ice-9 format) #:export (bytevector->base16-string base16-string->bytevector)) ;;; ;;; Base 16. ;;; (define (bytevector->base16-string bv) "Return the hexadecimal representation of BV's contents." (define len (bytevector-length bv)) (let-syntax ((base16-chars (lambda (s) (syntax-case s () (_ (let ((v (list->vector (unfold (cut > <> 255) (lambda (n) (format #f "~2,'0x" n)) 1+ 0)))) v)))))) (define chars base16-chars) (let loop ((i len) (r '())) (if (zero? i) (string-concatenate r) (let ((i (- i 1))) (loop i (cons (vector-ref chars (bytevector-u8-ref bv i)) r))))))) (define base16-string->bytevector (let ((chars->value (fold (lambda (i r) (vhash-consv (string-ref (number->string i 16) 0) i r)) vlist-null (iota 16)))) (lambda (s) "Return the bytevector whose hexadecimal representation is string S." (define bv (make-bytevector (quotient (string-length s) 2) 0)) (string-fold (lambda (chr i) (let ((j (quotient i 2)) (v (and=> (vhash-assv chr chars->value) cdr))) (if v (if (zero? (logand i 1)) (bytevector-u8-set! bv j (arithmetic-shift v 4)) (let ((w (bytevector-u8-ref bv j))) (bytevector-u8-set! bv j (logior v w)))) (error "invalid hexadecimal character" chr))) (+ i 1)) 0 s) bv))) guile-gcrypt/gcrypt/base64.scm000066400000000000000000000401721434213166000165750ustar00rootroot00000000000000;; -*- mode: scheme; coding: utf-8 -*- ;; ;; This module was renamed from (weinholt text base64 (1 0 20100612)) to ;; (guix base64) by Nikita Karetnikov on ;; February 12, 2014. It was later renamed to (gcrypt base64) by ;; Christopher Allan Webber on May 20, 2017. ;; ;; Some optimizations made by Ludovic Courtès , 2015. ;; Turned into a Guile module (instead of R6RS). ;; ;; This program is free software: you can redistribute it and/or modify ;; it under the terms of the GNU General Public License as published by ;; the Free Software Foundation, either version 3 of the License, or ;; (at your option) any later version. ;; ;; This program is distributed in the hope that it will be useful, ;; but WITHOUT ANY WARRANTY; without even the implied warranty of ;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the ;; GNU General Public License for more details. ;; ;; You should have received a copy of the GNU General Public License ;; along with this program. If not, see . ;; ;; This file incorporates work covered by the following copyright and ;; permission notice: ;; ;; Copyright © 2009, 2010, 2012, 2013, 2018 Göran Weinholt ;; ;; Permission is hereby granted, free of charge, to any person obtaining a ;; copy of this software and associated documentation files (the "Software"), ;; to deal in the Software without restriction, including without limitation ;; the rights to use, copy, modify, merge, publish, distribute, sublicense, ;; and/or sell copies of the Software, and to permit persons to whom the ;; Software is furnished to do so, subject to the following conditions: ;; ;; The above copyright notice and this permission notice shall be included in ;; all copies or substantial portions of the Software. ;; ;; THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR ;; IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, ;; FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL ;; THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER ;; LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING ;; FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER ;; DEALINGS IN THE SOFTWARE. ;; RFC 4648 Base-N Encodings (define-module (gcrypt base64) #:export (base64-encode base64-decode base64-alphabet base64url-alphabet get-delimited-base64 put-delimited-base64) #:use-module (srfi srfi-11) #:use-module (srfi srfi-60) #:use-module (rnrs bytevectors) #:use-module (rnrs io ports)) (define-syntax define-alias (syntax-rules () ((_ new old) (define-syntax new (identifier-syntax old))))) ;; Force the use of Guile's own primitives to avoid the overhead of its 'fx' ;; procedures. (define-alias fxbit-field bit-field) (define-alias fxarithmetic-shift ash) (define-alias fxarithmetic-shift-left ash) (define-alias fxand logand) (define-alias fxior logior) (define-alias fxxor logxor) (define-alias fx=? =) (define-alias fx<=? <=) (define-alias fxzero? zero?) (define-alias fx+ +) (define-alias fx- -) (define-alias fxmod modulo) (define-alias mod modulo) (define-syntax-rule (assert exp) (unless exp (throw 'assertion-failure 'exp))) (define base64-alphabet "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/") (define base64url-alphabet "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_") (define base64-encode (case-lambda ;; Simple interface. Returns a string containing the canonical ;; base64 representation of the given bytevector. ((bv) (base64-encode bv 0 (bytevector-length bv) #f #f base64-alphabet #f)) ((bv start) (base64-encode bv start (bytevector-length bv) #f #f base64-alphabet #f)) ((bv start end) (base64-encode bv start end #f #f base64-alphabet #f)) ((bv start end line-length) (base64-encode bv start end line-length #f base64-alphabet #f)) ((bv start end line-length no-padding) (base64-encode bv start end line-length no-padding base64-alphabet #f)) ((bv start end line-length no-padding alphabet) (base64-encode bv start end line-length no-padding alphabet #f)) ;; Base64 encodes the bytes [start,end[ in the given bytevector. ;; Lines are limited to line-length characters (unless #f), ;; which must be a multiple of four. To omit the padding ;; characters (#\=) set no-padding to a true value. If port is ;; #f, returns a string. ((bv start end line-length no-padding alphabet port) (assert (or (not line-length) (zero? (mod line-length 4)))) (let-values (((p extract) (if port (values port (lambda () (values))) (open-string-output-port)))) (letrec ((put (if line-length (let ((chars 0)) (lambda (p c) (when (fx=? chars line-length) (set! chars 0) (put-char p #\linefeed)) (set! chars (fx+ chars 1)) (put-char p c))) put-char))) (let lp ((i start)) (cond ((= i end)) ((<= (+ i 3) end) (let ((x (bytevector-uint-ref bv i (endianness big) 3))) (put p (string-ref alphabet (fxbit-field x 18 24))) (put p (string-ref alphabet (fxbit-field x 12 18))) (put p (string-ref alphabet (fxbit-field x 6 12))) (put p (string-ref alphabet (fxbit-field x 0 6))) (lp (+ i 3)))) ((<= (+ i 2) end) (let ((x (fxarithmetic-shift-left (bytevector-u16-ref bv i (endianness big)) 8))) (put p (string-ref alphabet (fxbit-field x 18 24))) (put p (string-ref alphabet (fxbit-field x 12 18))) (put p (string-ref alphabet (fxbit-field x 6 12))) (unless no-padding (put p #\=)))) (else (let ((x (fxarithmetic-shift-left (bytevector-u8-ref bv i) 16))) (put p (string-ref alphabet (fxbit-field x 18 24))) (put p (string-ref alphabet (fxbit-field x 12 18))) (unless no-padding (put p #\=) (put p #\=))))))) (extract))))) ;; Create a lookup table for the alphabet and remember the latest table. (define get-decode-table (let ((ascii-table #f) (extra-table '()) ;in the unlikely case of unicode chars (table-alphabet #f)) (lambda (alphabet) (unless (eq? alphabet table-alphabet) ;; Rebuild the table. (do ((ascii (make-vector 128 #f)) (extra '()) (i 0 (+ i 1))) ((= i (string-length alphabet)) (set! ascii-table ascii) (set! extra-table extra)) (let ((c (char->integer (string-ref alphabet i)))) (if (fx<=? c 127) (vector-set! ascii c i) (set! extra (cons (cons c i) extra))))) (set! table-alphabet alphabet)) (values ascii-table extra-table)))) ;; Decodes a base64 string, optionally ignoring non-alphabet ;; characters and lack of padding. (define base64-decode (case-lambda ((str) (base64-decode str base64-alphabet #f)) ((str alphabet) (base64-decode str alphabet #f)) ((str alphabet port) (base64-decode str alphabet port #t)) ((str alphabet port strict?) (base64-decode str alphabet port strict? #t)) ((str alphabet port strict? strict-padding?) (define (pad? c) (eqv? c (char->integer #\=))) (let-values (((p extract) (if port (values port (lambda () (values))) (open-bytevector-output-port))) ((ascii extra) (get-decode-table alphabet))) (define-syntax lookup (syntax-rules () ((_ c) (or (and (fx<=? c 127) (vector-ref ascii c)) (cond ((assv c extra) => cdr) (else #f)))))) (let lp-restart ((str str)) (let* ((len (if strict? (string-length str) (let lp ((i (fx- (string-length str) 1))) ;; Skip trailing invalid chars. (cond ((fxzero? i) 0) ((let ((c (char->integer (string-ref str i)))) (or (lookup c) (pad? c))) (fx+ i 1)) (else (lp (fx- i 1)))))))) (let lp ((i 0)) (cond ((fx=? i len) (extract)) ((fx<=? i (fx- len 4)) (let lp* ((c1 (char->integer (string-ref str i))) (c2 (char->integer (string-ref str (fx+ i 1)))) (c3 (char->integer (string-ref str (fx+ i 2)))) (c4 (char->integer (string-ref str (fx+ i 3)))) (i i)) (let ((i1 (lookup c1)) (i2 (lookup c2)) (i3 (lookup c3)) (i4 (lookup c4))) (cond ((and i1 i2 i3 i4) ;; All characters present and accounted for. ;; The most common case. (let ((x (fxior (fxarithmetic-shift-left i1 18) (fxarithmetic-shift-left i2 12) (fxarithmetic-shift-left i3 6) i4))) (put-u8 p (fxbit-field x 16 24)) (put-u8 p (fxbit-field x 8 16)) (put-u8 p (fxbit-field x 0 8)) (lp (fx+ i 4)))) ((and i1 i2 i3 (pad? c4) (= i (- len 4))) ;; One padding character at the end of the input. (let ((x (fxior (fxarithmetic-shift-left i1 18) (fxarithmetic-shift-left i2 12) (fxarithmetic-shift-left i3 6)))) (put-u8 p (fxbit-field x 16 24)) (put-u8 p (fxbit-field x 8 16)) (lp (fx+ i 4)))) ((and i1 i2 (pad? c3) (pad? c4) (= i (- len 4))) ;; Two padding characters. (let ((x (fxior (fxarithmetic-shift-left i1 18) (fxarithmetic-shift-left i2 12)))) (put-u8 p (fxbit-field x 16 24)) (lp (fx+ i 4)))) ((not strict?) ;; Non-alphabet characters. (let lp ((i i) (c* '()) (n 4)) (cond ((fxzero? n) ;; Found four valid characters. (lp* (cadddr c*) (caddr c*) (cadr c*) (car c*) (fx- i 4))) ((fx=? i len) (error 'base64-decode "Invalid input in non-strict mode." i c*)) (else ;; Gather alphabetic (or valid ;; padding) characters. (let ((c (char->integer (string-ref str i)))) (cond ((or (lookup c) (and (pad? c) (fx<=? n 2) (fx=? i (fx- len n)))) (lp (fx+ i 1) (cons c c*) (fx- n 1))) (else (lp (fx+ i 1) c* n)))))))) (else (error 'base64-decode "Invalid input in strict mode." c1 c2 c3 c4)))))) ((not strict-padding?) ;; Append an appropriate amount of padding after the ;; remaining characters. (if (<= 2 (- len i) 3) (lp-restart (string-append (substring str i (string-length str)) (if (= (- len i) 2) "==" "="))) (error 'base64-decode "The input is too short." i))) (else (error 'base64-decode "The input is too short, it may be missing padding." i)))))))))) (define (get-line-comp f port) (if (port-eof? port) (eof-object) (f (get-line port)))) ;; Reads the common -----BEGIN/END type----- delimited format from ;; the given port. Returns two values: a string with the type and a ;; bytevector containing the base64 decoded data. The second value ;; is the eof object if there is an eof before the BEGIN delimiter. (define get-delimited-base64 (case-lambda ((port) (get-delimited-base64 port #t)) ((port strict) (define (get-first-data-line port) ;; Some MIME data has header fields in the same format as mail ;; or http. These are ignored. (let ((line (get-line-comp string-trim-both port))) (cond ((eof-object? line) line) ((string-index line #\:) (let lp () ;read until empty line (let ((line (get-line-comp string-trim-both port))) (if (string=? line "") (get-line-comp string-trim-both port) (lp))))) (else line)))) (let ((line (get-line-comp string-trim-both port))) (cond ((eof-object? line) (values "" (eof-object))) ((string=? line "") (get-delimited-base64 port)) ((and (string-prefix? "-----BEGIN " line) (string-suffix? "-----" line)) (let* ((type (substring line 11 (- (string-length line) 5))) (endline (string-append "-----END " type "-----"))) (let-values ([(outp extract) (open-bytevector-output-port)]) (let lp ((previous "") (line (get-first-data-line port))) (cond ((eof-object? line) (error 'get-delimited-base64 "unexpected end of file")) ((string-prefix? "-" line) (unless (string=? line endline) (error 'get-delimited-base64 "bad end delimiter" type line)) (values type (extract))) ((and (= (string-length line) 5) (string-prefix? "=" line)) ;; Skip Radix-64 checksum (lp previous (get-line-comp string-trim-both port))) ((not (fxzero? (fxmod (fx+ (string-length previous) (string-length line)) 4))) ;; OpenSSH outputs lines with a bad length (lp (string-append previous line) (get-line-comp string-trim-both port))) (else (base64-decode (string-append previous line) base64-alphabet outp) (lp "" (get-line-comp string-trim-both port)))))))) (else ;skip garbage (like in openssl x509 -in foo -text output). (get-delimited-base64 port))))))) (define put-delimited-base64 (case-lambda ((port type bv line-length) (display (string-append "-----BEGIN " type "-----\n") port) (base64-encode bv 0 (bytevector-length bv) line-length #f base64-alphabet port) (display (string-append "\n-----END " type "-----\n") port)) ((port type bv) (put-delimited-base64 port type bv 76)))) guile-gcrypt/gcrypt/common.scm000066400000000000000000000247401434213166000170040ustar00rootroot00000000000000;;; guile-gcrypt --- crypto tooling for guile ;;; Copyright © 2013, 2014, 2015, 2019, 2020 Ludovic Courtès ;;; Copyright © 2019 Mathieu Othacehe ;;; ;;; This file is part of guile-gcrypt. ;;; ;;; guile-gcrypt is free software; you can redistribute it and/or modify it ;;; under the terms of the GNU General Public License as published by ;;; the Free Software Foundation; either version 3 of the License, or ;;; (at your option) any later version. ;;; ;;; guile-gcrypt is distributed in the hope that it will be useful, but ;;; WITHOUT ANY WARRANTY; without even the implied warranty of ;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU ;;; General Public License for more details. ;;; ;;; You should have received a copy of the GNU General Public License ;;; along with guile-gcrypt. If not, see . (define-module (gcrypt common) #:use-module (gcrypt internal) #:use-module (system foreign) #:use-module (ice-9 match) #:re-export (gcrypt-version) #:export (gcrypt-error strip-error-source error-code=? error-source error-string)) ;;; Commentary: ;;; ;;; Common code for the GNU Libgcrypt bindings. ;;; ;;; Code: (define-syntax GPG_ERR_SOURCE_GCRYPT ;from (identifier-syntax 1)) (define-inlinable (strip-error-source error) "Strip the error source bits from ERROR, a libgpg-error error code." (logand error #xfffff)) (define-inlinable (gcrypt-error value) "Return VALUE as a libgpg-error code originating from Libgcrypt." (logior (ash GPG_ERR_SOURCE_GCRYPT 24) (strip-error-source value))) (define-inlinable (error-code=? error1 error2) "Return true if ERROR1 and ERROR2 denote the same error code, regardless of the error source." (= (strip-error-source error1) (strip-error-source error2))) (define-syntax define-error-codes (syntax-rules () "Define one variable for each error code given, using GPG_ERR_SOURCE_GCRYPT as the error source." ((_ name value rest ...) (begin (define-public name value) (define-error-codes rest ...))) ((_) #t))) ;; GPG_ERR_ values of 'gpg_err_code_t' in . (define-error-codes error/no-error 0 error/general 1 error/unknown-packet 2 error/unknown-version 3 error/public-key-algo 4 error/digest-algo 5 error/bad-public-key 6 error/bad-secret-key 7 error/bad-signature 8 error/no-public-key 9 error/checksum 10 error/bad-passphrase 11 error/cipher-algo 12 error/keyring-open 13 error/invalid-packet 14 error/invalid-armor 15 error/no-user-id 16 error/no-secret-key 17 error/wrong-secret-key 18 error/bad-key 19 error/compr-algo 20 error/no-prime 21 error/no-encoding-method 22 error/no-encryption-scheme 23 error/no-signature-scheme 24 error/invalid-attr 25 error/no-value 26 error/not-found 27 error/value-not-found 28 error/syntax 29 error/bad-mpi 30 error/invalid-passphrase 31 error/sig-class 32 error/resource-limit 33 error/invalid-keyring 34 error/trustdb 35 error/bad-cert 36 error/invalid-user-id 37 error/unexpected 38 error/time-conflict 39 error/keyserver 40 error/wrong-public-key-algo 41 error/weak-key 43 ;; The answer. error/invalid-key-length 44 error/invalid-argument 45 error/bad-uri 46 error/invalid-uri 47 error/network 48 error/unknown-host 49 error/selftest-failed 50 error/not-encrypted 51 error/not-processed 52 error/unusable-public-key 53 error/unusable-secret-key 54 error/invalid-value 55 error/bad-cert-chain 56 error/missing-cert 57 error/no-data 58 error/bug 59 error/not-supported 60 error/invalid-op 61 error/timeout 62 error/internal 63 error/eof-gcrypt 64 error/invalid-object 65 error/too-short 66 error/too-large 67 error/no-obj 68 error/not-implemented 69 error/conflict 70 error/invalid-cipher-mode 71 error/invalid-flag 72 error/invalid-handle 73 error/truncated 74 error/incomplete-line 75 error/invalid-response 76 error/no-agent 77 error/agent 78 error/invalid-data 79 error/assuan-server-fault 80 error/assuan 81 error/invalid-session-key 82 error/invalid-sexp 83 error/unsupported-algorithm 84 error/no-pin-entry 85 error/pin-entry 86 error/bad-pin 87 error/invalid-name 88 error/bad-data 89 error/invalid-parameter 90 error/wrong-card 91 error/no-dirmngr 92 error/dirmngr 93 error/cert-revoked 94 error/no-crl-known 95 error/crl-too-old 96 error/line-too-long 97 error/not-trusted 98 error/canceled 99 error/bad-ca-cert 100 error/cert-expired 101 error/cert-too-young 102 error/unsupported-cert 103 error/unknown-sexp 104 error/unsupported-protection 105 error/corrupted-protection 106 error/ambiguous-name 107 error/card 108 error/card-reset 109 error/card-removed 110 error/invalid-card 111 error/card-not-present 112 error/no-pkcs15-app 113 error/not-confirmed 114 error/configuration 115 error/no-policy-match 116 error/invalid-index 117 error/invalid-id 118 error/no-scdaemon 119 error/scdaemon 120 error/unsupported-protocol 121 error/bad-pin-method 122 error/card-not-initialized 123 error/unsupported-operation 124 error/wrong-key-usage 125 error/nothing-found 126 error/wrong-blob-type 127 error/missing-value 128 error/hardware 129 error/pin-blocked 130 error/use-conditions 131 error/pin-not-synced 132 error/invalid-crl 133 error/bad-ber 134 error/invalid-ber 135 error/element-not-found 136 error/identifier-not-found 137 error/invalid-tag 138 error/invalid-length 139 error/invalid-keyinfo 140 error/unexpected-tag 141 error/not-der-encoded 142 error/no-cms-obj 143 error/invalid-cms-obj 144 error/unknown-cms-obj 145 error/unsupported-cms-obj 146 error/unsupported-encoding 147 error/unsupported-cms-version 148 error/unknown-algorithm 149 error/invalid-engine 150 error/public-key-not-trusted 151 error/decrypt-failed 152 error/key-expired 153 error/sig-expired 154 error/encoding-problem 155 error/invalid-state 156 error/dup-value 157 error/missing-action 158 error/module-not-found 159 error/invalid-oid-string 160 error/invalid-time 161 error/invalid-crl-obj 162 error/unsupported-crl-version 163 error/invalid-cert-obj 164 error/unknown-name 165 error/locale-problem 166 error/not-locked 167 error/protocol-violation 168 error/invalid-mac 169 error/invalid-request 170 error/unknown-extn 171 error/unknown-crit-extn 172 error/locked 173 error/unknown-option 174 error/unknown-command 175 error/not-operational 176 error/no-passphrase 177 error/no-pin 178 error/not-enabled 179 error/no-engine 180 error/missing-key 181 error/too-many 182 error/limit-reached 183 error/not-initialized 184 error/missing-issuer-cert 185 error/no-keyserver 186 error/invalid-curve 187 error/unknown-curve 188 error/dup-key 189 error/ambiguous 190 error/no-crypt-ctx 191 error/wrong-crypt-ctx 192 error/bad-crypt-ctx 193 error/crypt-ctx-conflict 194 error/broken-public-key 195 error/broken-secret-key 196 error/mac-algo 197 error/fully-canceled 198 error/unfinished 199 error/buffer-too-short 200 error/sexp-invalid-len-spec 201 error/sexp-string-too-long 202 error/sexp-unmatched-paren 203 error/sexp-not-canonical 204 error/sexp-bad-character 205 error/sexp-bad-quotation 206 error/sexp-zero-prefix 207 error/sexp-nested-dh 208 error/sexp-unmatched-dh 209 error/sexp-unexpected-punc 210 error/sexp-bad-hex-char 211 error/sexp-odd-hex-numbers 212 error/sexp-bad-oct-char 213 error/subkeys-exp-or-rev 217 error/db-corrupted 218 error/server-failed 219 error/no-name 220 error/no-key 221 error/legacy-key 222 error/request-too-short 223 error/request-too-long 224 error/obj-term-state 225 error/no-cert-chain 226 error/cert-too-large 227 error/invalid-record 228 error/bad-mac 229 error/unexpected-msg 230 error/compr-failed 231 error/would-wrap 232 error/fatal-alert 233 error/no-cipher 234 error/missing-client-cert 235 error/close-notify 236 error/ticket-expired 237 error/bad-ticket 238 error/unknown-identity 239 error/bad-hs-cert 240 error/bad-hs-cert-req 241 error/bad-hs-cert-ver 242 error/bad-hs-change-cipher 243 error/bad-hs-client-hello 244 error/bad-hs-server-hello 245 error/bad-hs-server-hello-done 246 error/bad-hs-finished 247 error/bad-hs-server-kex 248 error/bad-hs-client-kex 249 error/bogus-string 250 error/forbidden 251 error/key-disabled 252 error/key-on-card 253 error/invalid-lock-obj 254 error/true 255 error/false 256 error/ass-general 257 error/ass-accept-failed 258 error/ass-connect-failed 259 error/ass-invalid-response 260 error/ass-invalid-value 261 error/ass-incomplete-line 262 error/ass-line-too-long 263 error/ass-nested-commands 264 error/ass-no-data-cb 265 error/ass-no-inquire-cb 266 error/ass-not-a-server 267 error/ass-not-a-client 268 error/ass-server-start 269 error/ass-read-error 270 error/ass-write-error 271 error/ass-too-much-data 273 error/ass-unexpected-cmd 274 error/ass-unknown-cmd 275 error/ass-syntax 276 error/ass-canceled 277 error/ass-no-input 278 error/ass-no-output 279 error/ass-parameter 280 error/ass-unknown-inquire 281 error/engine-too-old 300 error/window-too-small 301 error/window-too-large 302 error/missing-envvar 303 error/user-id-exists 304 error/name-exists 305 error/dup-name 306 error/too-young 307 error/too-old 308 error/unknown-flag 309 error/invalid-order 310 error/already-fetched 311 error/try-later 312 error/wrong-name 313 error/no-auth 314 error/bad-auth 315 error/system-bug 666) (define error-source (let ((proc (libgcrypt->procedure '* "gcry_strsource" (list int)))) (lambda (err) "Return the error source (a string) for ERR, an error code as thrown along with 'gcry-error'." (pointer->string (proc err))))) (define error-string (let ((proc (libgcrypt->procedure '* "gcry_strerror" (list int)))) (lambda (err) "Return the error description (a string) for ERR, an error code as thrown along with 'gcry-error'." (pointer->string (proc err))))) (define (gcrypt-error-printer port key args default-printer) "Print the gcrypt error specified by ARGS." (match args ((proc err) (format port "In procedure ~a: ~a: ~a" proc (error-source err) (error-string err))))) (set-exception-printer! 'gcry-error gcrypt-error-printer) ;;; gcrypt.scm ends here guile-gcrypt/gcrypt/hash.scm000066400000000000000000000174121434213166000164350ustar00rootroot00000000000000;;; guile-gcrypt --- crypto tooling for guile ;;; Copyright © 2012, 2013, 2014, 2015, 2016, 2019, 2020, 2022 Ludovic Courtès ;;; Copyright © 2019 Mathieu Othacehe ;;; ;;; This file is part of guile-gcrypt. ;;; ;;; guile-gcrypt is free software; you can redistribute it and/or modify it ;;; under the terms of the GNU General Public License as published by ;;; the Free Software Foundation; either version 3 of the License, or ;;; (at your option) any later version. ;;; ;;; guile-gcrypt is distributed in the hope that it will be useful, but ;;; WITHOUT ANY WARRANTY; without even the implied warranty of ;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU ;;; General Public License for more details. ;;; ;;; You should have received a copy of the GNU General Public License ;;; along with guile-gcrypt. If not, see . (define-module (gcrypt hash) #:use-module (gcrypt utils) #:use-module (gcrypt internal) #:use-module (rnrs bytevectors) #:use-module (ice-9 binary-ports) #:use-module (system foreign) #:use-module (srfi srfi-11) #:use-module (srfi srfi-26) #:export (hash-algorithm lookup-hash-algorithm hash-algorithm-name hash-size bytevector-hash open-hash-port port-hash file-hash open-hash-input-port open-sha256-port port-sha256 file-sha256 open-sha256-input-port)) ;;; Commentary: ;;; ;;; Cryptographic hashes. ;;; ;;; Code: ;;; ;;; Hash. ;;; (define-syntax-rule (define-hash-algorithms name->integer symbol->integer integer->symbol hash-size (name id size) ...) "Define hash algorithms with their NAME, numerical ID, and SIZE in bytes." (begin ;; Make sure NAME is bound to follow best practices for syntax matching ;; (info "(guile) Syntax Rules"). As a bonus, it provides convenient ;; shorthand procedures. (define-public name (cut bytevector-hash <> id)) ... (define-enumerate-type name->integer symbol->integer integer->symbol (name id) ...) (define-lookup-procedure hash-size "Return the size in bytes of a digest of the given hash algorithm." (id size) ...))) (define %hash-size ;; This procedure was used to double-check the hash sizes below. (We ;; cannot use it at macro-expansion time because it wouldn't work when ;; cross-compiling.) (libgcrypt->procedure unsigned-int "gcry_md_get_algo_dlen" (list int))) ;; 'GCRY_MD_' values as of Libgcrypt 1.8.8. (define-hash-algorithms hash-algorithm lookup-hash-algorithm hash-algorithm-name hash-size (md5 1 16) (sha1 2 20) (rmd160 3 20) ;; (md2 5 0) (tiger 6 24) ;TIGER/192 as used by gpg <= 1.3.2 (haval 7 20) ;HAVAL, 5 pass, 160 bit (sha256 8 32) (sha384 9 48) (sha512 10 64) (sha224 11 28) (md4 301 16) (crc32 302 4) (crc32-rfc1510 303 4) (crc24-rfc2440 304 3) (whirlpool 305 64) (tiger1 306 24) ;TIGER fixed (tiger2 307 24) ;TIGER2 variant (gostr3411-94 308 32) ;GOST R 34.11-94 (stribog256 309 32) ;GOST R 34.11-2012, 256 bit (stribog512 310 64) ;GOST R 34.11-2012, 512 bit (gostr3411-cp 311 32) ;GOST R 34.11-94 with CryptoPro-A S-Box (sha3-224 312 28) (sha3-256 313 32) (sha3-384 314 48) (sha3-512 315 64) ;; (shake128 316 0) ;; (shake256 317 0) (blake2b-512 318 64) (blake2b-384 319 48) (blake2b-256 320 32) (blake2b-160 321 20) (blake2s-256 322 32) (blake2s-224 323 28) (blake2s-160 324 20) (blake2s-128 325 16) (sm3 326 32) (sha512-256 327 32) (sha512-224 328 28)) (define bytevector-hash (let ((proc (libgcrypt->procedure void "gcry_md_hash_buffer" `(,int * * ,size_t)))) (lambda (bv algorithm) "Return the hash ALGORITHM of BV as a bytevector." (let ((digest (make-bytevector (hash-size algorithm)))) (proc algorithm (bytevector->pointer digest) (bytevector->pointer bv) (bytevector-length bv)) digest)))) (define open-md (let ((proc (libgcrypt->procedure int "gcry_md_open" `(* ,int ,unsigned-int)))) (lambda (algorithm) (let* ((md (bytevector->pointer (make-bytevector (sizeof '*)))) (err (proc md algorithm 0))) (if (zero? err) (dereference-pointer md) (throw 'gcrypt-error err)))))) (define md-write (libgcrypt->procedure void "gcry_md_write" `(* * ,size_t))) (define md-read (libgcrypt->procedure '* "gcry_md_read" `(* ,int))) (define md-close (libgcrypt->procedure void "gcry_md_close" '(*))) (define (open-hash-port algorithm) "Return two values: an output port, and a thunk. When the thunk is called, it returns the hash (a bytevector) for ALGORITHM of all the data written to the output port." (define md (open-md algorithm)) (define md-size (hash-size algorithm)) (define digest #f) (define position 0) (define (finalize!) (let ((ptr (md-read md 0))) (set! digest (bytevector-copy (pointer->bytevector ptr md-size))) (md-close md))) (define (write! bv offset len) (if (zero? len) (begin (finalize!) 0) (let ((ptr (bytevector->pointer bv offset))) (md-write md ptr len) (set! position (+ position len)) len))) (define (get-position) position) (define (close) (unless digest (finalize!))) (values (make-custom-binary-output-port "hash" write! get-position #f close) (lambda () (unless digest (finalize!)) digest))) (define (port-hash algorithm port) "Return the ALGORITHM hash (a bytevector) of all the data drained from PORT." (let-values (((out get) (open-hash-port algorithm))) (dump-port port out) (close-port out) (get))) (define (file-hash algorithm file) "Return the ALGORITHM hash (a bytevector) of FILE." (call-with-input-file file (cut port-hash algorithm <>))) (define (open-hash-input-port algorithm port) "Return an input port that wraps PORT and a thunk to get the hash of all the data read from PORT. The thunk always returns the same value." (define md (open-md algorithm)) (define md-size (hash-size algorithm)) (define (read! bv start count) (let ((n (get-bytevector-n! port bv start count))) (if (eof-object? n) 0 (begin (unless digest (let ((ptr (bytevector->pointer bv start))) (md-write md ptr n))) n)))) (define digest #f) (define (finalize!) (let ((ptr (md-read md 0))) (set! digest (bytevector-copy (pointer->bytevector ptr md-size))) (md-close md))) (define (get-hash) (unless digest (finalize!)) digest) (define (unbuffered port) ;; Guile <= 2.0.9 does not support 'setvbuf' on custom binary input ports. ;; If you get a wrong-type-arg error here, the fix is to upgrade Guile. :-) (setvbuf port (cond-expand ((and guile-2 (not guile-2.2)) _IONBF) (else 'none))) port) (values (unbuffered (make-custom-binary-input-port "hash-input" read! #f #f #f)) get-hash)) (define open-sha256-port (cut open-hash-port (hash-algorithm sha256))) (define port-sha256 (cut port-hash (hash-algorithm sha256) <>)) (define file-sha256 (cut file-hash (hash-algorithm sha256) <>)) (define open-sha256-input-port (cut open-hash-input-port (hash-algorithm sha256) <>)) ;;; hash.scm ends here guile-gcrypt/gcrypt/hmac.scm000066400000000000000000000046161434213166000164240ustar00rootroot00000000000000;;; guile-gcrypt --- crypto tooling for guile ;;; Copyright © 2019 Ludovic Courtès ;;; ;;; This file is part of guile-gcrypt. ;;; ;;; guile-gcrypt is free software; you can redistribute it and/or modify it ;;; under the terms of the GNU General Public License as published by ;;; the Free Software Foundation; either version 3 of the License, or ;;; (at your option) any later version. ;;; ;;; guile-gcrypt is distributed in the hope that it will be useful, but ;;; WITHOUT ANY WARRANTY; without even the implied warranty of ;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU ;;; General Public License for more details. ;;; ;;; You should have received a copy of the GNU General Public License ;;; along with guile-gcrypt. If not, see . (define-module (gcrypt hmac) #:use-module ((gcrypt mac) #:prefix mac:) #:export (sign-data sign-data-base64 verify-sig verify-sig-base64 gen-signing-key)) ;;; Code: ;;; ;;; This module is deprecated and provided for compatibility with ;;; Guile-Gcrypt 0.1.0. Use (gcrypt mac) instead. ;;; ;;; Commentary: (define (symbol->algorithm symbol) "Convert SYMBOL (e.g., 'sha256) to the corresponding MAC algorithm." ;; Note: In 0.1.0, only a few hmac algorithms were supported, without the ;; 'hmac-' prefix. (mac:lookup-mac-algorithm (symbol-append 'hmac- symbol))) (define* (sign-data key data #:key (algorithm 'sha512)) "Signs DATA with KEY for ALGORITHM. Returns a bytevector." (mac:sign-data key data #:algorithm (symbol->algorithm algorithm))) (define* (sign-data-base64 key data #:key (algorithm 'sha512)) "Signs DATA with KEY for ALGORITHM. Returns a bytevector." (mac:sign-data-base64 key data #:algorithm (symbol->algorithm algorithm))) (define* (verify-sig key data sig #:key (algorithm 'sha512)) "Verify that DATA with KEY matches previous signature SIG for ALGORITHM." (mac:valid-signature? key data sig #:algorithm (symbol->algorithm algorithm))) (define* (verify-sig-base64 key data sig #:key (algorithm 'sha512)) "Verify that DATA with KEY matches previous signature SIG for ALGORITHM." (mac:valid-base64-signature? key data sig #:algorithm (symbol->algorithm algorithm))) (define gen-signing-key mac:generate-signing-key) guile-gcrypt/gcrypt/internal.scm000066400000000000000000000110411434213166000173160ustar00rootroot00000000000000;;; guile-gcrypt --- crypto tooling for guile ;;; Copyright © 2019, 2020 Ludovic Courtès ;;; ;;; This file is part of guile-gcrypt. ;;; ;;; guile-gcrypt is free software; you can redistribute it and/or modify it ;;; under the terms of the GNU General Public License as published by ;;; the Free Software Foundation; either version 3 of the License, or ;;; (at your option) any later version. ;;; ;;; guile-gcrypt is distributed in the hope that it will be useful, but ;;; WITHOUT ANY WARRANTY; without even the implied warranty of ;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU ;;; General Public License for more details. ;;; ;;; You should have received a copy of the GNU General Public License ;;; along with guile-gcrypt. If not, see . (define-module (gcrypt internal) #:use-module (gcrypt package-config) #:use-module (system foreign) #:export (libgcrypt->pointer libgcrypt->procedure define-enumerate-type define-lookup-procedure gcrypt-version)) ;;; Code: ;;; ;;; This module provides tools for internal use. The API of this module may ;;; change anytime; you should not rely on it. Loading this module ;;; initializes Libgcrypt as a side effect. ;;; ;;; Comment: (define (libgcrypt->pointer name) "Return a pointer to symbol FUNC in libgcrypt." (catch #t (lambda () (dynamic-func name (dynamic-link %libgcrypt))) (lambda args (lambda _ (throw 'system-error name "~A" (list (strerror ENOSYS)) (list ENOSYS)))))) (define (libgcrypt->procedure return name params) "Return a pointer to symbol FUNC in libgcrypt." (catch #t (lambda () (let ((ptr (dynamic-func name (dynamic-link %libgcrypt)))) ;; The #:return-errno? facility was introduced in Guile 2.0.12. (pointer->procedure return ptr params #:return-errno? #t))) (lambda args (lambda _ (throw 'system-error name "~A" (list (strerror ENOSYS)) (list ENOSYS)))))) (define-syntax-rule (define-enumerate-type name->integer symbol->integer integer->symbol (name id) ...) (begin (define-syntax name->integer (syntax-rules (name ...) "Return hash algorithm NAME." ((_ name) id) ...)) (define symbol->integer (let ((alist '((name . id) ...))) (lambda (symbol) "Look up SYMBOL and return the corresponding integer or #f if it could not be found." (assq-ref alist symbol)))) (define-lookup-procedure integer->symbol "Return the name (a symbol) corresponding to the given integer value." (id name) ...))) (define-syntax define-lookup-procedure (lambda (s) "Define LOOKUP as a procedure that maps an integer to its corresponding value in O(1)." (syntax-case s () ((_ lookup docstring (index value) ...) (let* ((values (map cons (syntax->datum #'(index ...)) #'(value ...))) (min (apply min (syntax->datum #'(index ...)))) (max (apply max (syntax->datum #'(index ...)))) (array (let loop ((i max) (result '())) (if (< i min) result (loop (- i 1) (cons (or (assv-ref values i) *unspecified*) result)))))) #`(define lookup ;; Allocate a big sparse vector. (let ((values '#(#,@array))) (lambda (integer) docstring (and (<= integer #,max) (>= integer #,min) (let ((result (vector-ref values (- integer #,min)))) (if (unspecified? result) #f result))))))))))) (define gcrypt-version ;; According to the manual, this function must be called before any other, ;; and it's not clear whether it can be called more than once. So call it ;; right here from the top level. During cross-compilation, the call to ;; PROC fails with a 'system-error exception; catch it. (let* ((proc (libgcrypt->procedure '* "gcry_check_version" '(*))) (version (catch 'system-error (lambda () (pointer->string (proc %null-pointer))) (const "")))) (lambda () "Return the version number of libgcrypt as a string." version))) guile-gcrypt/gcrypt/mac.scm000066400000000000000000000226111434213166000162470ustar00rootroot00000000000000;;; guile-gcrypt --- crypto tooling for guile ;;; Copyright © 2016 Christopher Allan Webber ;;; Copyright © 2019 Mathieu Othacehe ;;; Copyright © 2019, 2020, 2022 Ludovic Courtès ;;; ;;; This file is part of guile-gcrypt. ;;; ;;; guile-gcrypt is free software; you can redistribute it and/or modify it ;;; under the terms of the GNU General Public License as published by ;;; the Free Software Foundation; either version 3 of the License, or ;;; (at your option) any later version. ;;; ;;; guile-gcrypt is distributed in the hope that it will be useful, but ;;; WITHOUT ANY WARRANTY; without even the implied warranty of ;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU ;;; General Public License for more details. ;;; ;;; You should have received a copy of the GNU General Public License ;;; along with guile-gcrypt. If not, see . (define-module (gcrypt mac) #:use-module (ice-9 format) #:use-module (ice-9 match) #:use-module (gcrypt base64) #:use-module (gcrypt internal) #:use-module (gcrypt random) #:use-module (rnrs bytevectors) #:use-module (system foreign) #:export (mac-algorithm lookup-mac-algorithm mac-algorithm-name mac-size sign-data sign-data-base64 valid-signature? valid-base64-signature? generate-signing-key)) (define-syntax-rule (define-syntax-public name value) (begin (define-syntax name value) (export name))) (define-syntax-rule (define-mac-algorithms name->integer symbol->integer integer->symbol mac-size (name id size) ...) "Define hash algorithms with their NAME, numerical ID, and SIZE in bytes." (begin ;; Make sure NAME is bound to follow best practices for syntax matching ;; (info "(guile) Syntax Rules"). (define-syntax-public name (lambda (s) (syntax-violation 'name "\ syntactic keyword is meant to be used with 'mac-algorithm'" s s))) ... (define-enumerate-type name->integer symbol->integer integer->symbol (name id) ...) (define-lookup-procedure mac-size "Return the size in bytes of a digest of the given hash algorithm." (id size) ...))) (define-mac-algorithms mac-algorithm lookup-mac-algorithm mac-algorithm-name mac-size ;; GCRY_MAC_* (hmac-sha256 101 32) (hmac-sha224 102 28) (hmac-sha512 103 64) (hmac-sha384 104 48) (hmac-sha1 105 20) (hmac-md5 106 16) (hmac-md4 107 16) (hmac-rmd160 108 20) (hmac-tiger1 109 24) (hmac-whirlpool 110 64) (hmac-gostr3411-94 111 32) (hmac-stribog256 112 32) (hmac-stribog512 113 64) ;; (hmac-md2 114 0) (hmac-sha3-224 115 28) (hmac-sha3-256 116 32) (hmac-sha3-384 117 48) (hmac-sha3-512 118 64) (hmac-gostr3411-cp 119 32) (hmac-blake2b-512 120 64) (hmac-blake2b-384 121 48) (hmac-blake2b-256 122 32) (hmac-blake2b-160 123 20) (hmac-blake2s-256 124 32) (hmac-blake2s-224 125 28) (hmac-blake2s-160 126 20) (hmac-blake2s-128 127 16) (hmac-sm3 128 32) (hmac-sha512-256 129 32) (hmac-sha512-224 130 28) (cmac-aes 201 16) (cmac-3des 202 8) (cmac-camellia 203 16) (cmac-cast5 204 8) (cmac-blowfish 205 8) (cmac-twofish 206 16) (cmac-serpent 207 16) (cmac-seed 208 16) (cmac-rfc2268 209 8) (cmac-idea 210 8) (cmac-gost28147 211 8) (gmac-aes 401 16) (gmac-camellia 402 16) (gmac-twofish 403 16) (gmac-serpent 404 16) (gmac-seed 405 16) (poly1305 501 16) (poly1305-aes 502 16) (poly1305-camellia 503 16) (poly1305-twofish 504 16) (poly1305-serpent 505 16) (poly1305-seed 506 16)) (define mac-algo-maclen ;; This procedure was used to double-check the hash sizes above. (We ;; cannot use it at macro-expansion time because it wouldn't work when ;; cross-compiling.) (libgcrypt->procedure int "gcry_mac_get_algo_maclen" `(,int))) (define %no-error 0) ; GPG_ERR_NO_ERROR (define-wrapped-pointer-type mac? pointer->mac mac->pointer (lambda (mac port) (format port "#" (pointer-address (mac->pointer mac))))) (define %gcry-mac-open (libgcrypt->procedure int "gcry_mac_open" ;; gcry_mac_hd_t *HD, int ALGO, ;; unsigned int FLAGS, gcry_ctx_t CTX `(* ,int ,unsigned-int *))) (define (mac-open algorithm) "Create a object set to use ALGORITHM" (let* ((mac (bytevector->pointer (make-bytevector (sizeof '*)))) (err (%gcry-mac-open mac algorithm 0 %null-pointer))) (if (= err 0) (pointer->mac (dereference-pointer mac)) (throw 'gcry-error 'mac-open err)))) (define %gcry-mac-setkey (libgcrypt->procedure int "gcry_mac_setkey" `(* * ,size_t))) (define (mac-setkey mac key) "Set the KEY on object MAC In our case, KEY is either a string or a bytevector." (let* ((key (match key ((? bytevector? key) key) ((? string? key) (string->utf8 key)))) (err (%gcry-mac-setkey (mac->pointer mac) (bytevector->pointer key) (bytevector-length key)))) (if (= err 0) #t (throw 'gcry-error 'mac-setkey err)))) (define mac-close (let ((proc (libgcrypt->procedure void "gcry_mac_close" '(*)))) ; gcry_mac_hd_t H (lambda (mac) "Release all resources of MAC. Running this on an already closed might segfault :)" (proc (mac->pointer mac))))) (define mac-write (let ((proc (libgcrypt->procedure int "gcry_mac_write" `(* * ,size_t)))) (lambda (mac obj) "Writes string or bytevector OBJ to MAC" (let* ((bv (match obj ((? bytevector? obj) obj) ((? string? obj) (string->utf8 obj)))) (err (proc (mac->pointer mac) (bytevector->pointer bv) (bytevector-length bv)))) (if (= err 0) #t (throw 'gcry-error 'mac-write err)))))) (define mac-read (let ((proc (libgcrypt->procedure int "gcry_mac_read" `(* * *)))) (lambda (mac algorithm) "Get bytevector representing result of MAC's written, signed data" (define (int-bv* n) ;; Get the pointer to a bytevector holding an integer with this number (let ((bv (make-bytevector (sizeof int)))) (bytevector-uint-set! bv 0 n (native-endianness) (sizeof int)) (bytevector->pointer bv))) (let* ((bv-len (mac-size algorithm)) (bv (make-bytevector bv-len)) (err (proc (mac->pointer mac) (bytevector->pointer bv) (int-bv* bv-len)))) (if (= err 0) bv (throw 'gcry-error 'mac-read err)))))) ;; GPG_ERR_CHECKSUM *should* be 10, but it seems to return here as ;; 16777226... unfortunately this is because we're pulling back an integer ;; rather than the gcry_error_t type. (define mac-verify (let ((proc (libgcrypt->procedure int "gcry_mac_verify" `(* * ,size_t)))) (lambda (mac bv) "Verify that BV matches result calculated in MAC BV should be a bytevector with previously calculated data." (let ((err (proc (mac->pointer mac) (bytevector->pointer bv) (bytevector-length bv)))) (if (= err 0) (values #t err) ;; TODO: This is WRONG! See the comment above ;; this procedure's definition for why. If we could ;; parse it as the appropriate GPG error, GPG_ERR_CHECKSUM ;; should be 10. (values #f err)))))) (define* (sign-data key data #:key (algorithm (mac-algorithm hmac-sha512))) "Signs DATA with KEY for ALGORITHM. Returns a bytevector." (let ((mac (mac-open algorithm))) (mac-setkey mac key) (mac-write mac data) (let ((result (mac-read mac algorithm))) (mac-close mac) result))) (define* (sign-data-base64 key data #:key (algorithm (mac-algorithm hmac-sha512))) "Like sign-data, but conveniently encodes to base64." (base64-encode (sign-data key data #:algorithm algorithm))) (define* (valid-signature? key data sig #:key (algorithm (mac-algorithm hmac-sha512))) "Verify that DATA with KEY matches previous signature SIG for ALGORITHM." (let ((mac (mac-open algorithm))) (mac-setkey mac key) (mac-write mac data) (let ((result (mac-verify mac sig))) (mac-close mac) result))) (define* (valid-base64-signature? key data b64-sig #:key (algorithm (mac-algorithm hmac-sha512))) (valid-signature? key data (base64-decode b64-sig) #:algorithm algorithm)) (define* (generate-signing-key #:optional (key-length 128)) "Generate a signing key (a bytevector). KEY-LENGTH is the length, in bytes, of the key. The default is 128. This should be a multiple of 8." (gen-random-bv key-length %gcry-very-strong-random)) guile-gcrypt/gcrypt/package-config.scm.in000066400000000000000000000021101434213166000207420ustar00rootroot00000000000000;;; guile-gcrypt --- crypto tooling for guile ;;; Copyright © 2016 Christopher Allan Webber ;;; ;;; This file is part of guile-gcrypt. ;;; ;;; guile-gcrypt is free software; you can redistribute it and/or modify it ;;; under the terms of the GNU General Public License as published by ;;; the Free Software Foundation; either version 3 of the License, or ;;; (at your option) any later version. ;;; ;;; guile-gcrypt is distributed in the hope that it will be useful, but ;;; WITHOUT ANY WARRANTY; without even the implied warranty of ;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU ;;; General Public License for more details. ;;; ;;; You should have received a copy of the GNU General Public License ;;; along with guile-gcrypt. If not, see . (define-module (gcrypt package-config) #:export (%libgcrypt %guile-gcrypt-package-name %guile-gcrypt-version)) (define %libgcrypt "@LIBGCRYPT@") (define %guile-gcrypt-package-name "@PACKAGE_NAME@") (define %guile-gcrypt-version "@PACKAGE_VERSION@") guile-gcrypt/gcrypt/pk-crypto.scm000066400000000000000000000402071434213166000174400ustar00rootroot00000000000000;;; guile-gcrypt --- crypto tooling for guile ;;; Copyright © 2013, 2014, 2015, 2017, 2019, 2020 Ludovic Courtès ;;; Copyright © 2019 Mathieu Othacehe ;;; ;;; This file is part of guile-gcrypt. ;;; ;;; guile-gcrypt is free software; you can redistribute it and/or modify it ;;; under the terms of the GNU General Public License as published by ;;; the Free Software Foundation; either version 3 of the License, or ;;; (at your option) any later version. ;;; ;;; guile-gcrypt is distributed in the hope that it will be useful, but ;;; WITHOUT ANY WARRANTY; without even the implied warranty of ;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU ;;; General Public License for more details. ;;; ;;; You should have received a copy of the GNU General Public License ;;; along with guile-gcrypt. If not, see . (define-module (gcrypt pk-crypto) #:use-module (gcrypt base16) #:use-module (gcrypt internal) #:use-module (gcrypt common) #:use-module (system foreign) #:use-module (rnrs bytevectors) #:use-module (ice-9 match) #:use-module (ice-9 rdelim) #:export (canonical-sexp? string->canonical-sexp canonical-sexp->string read-file-sexp number->canonical-sexp canonical-sexp-car canonical-sexp-cdr canonical-sexp-nth canonical-sexp-nth-data canonical-sexp-length canonical-sexp-null? canonical-sexp-list? bytevector->hash-data hash-data->bytevector key-type sign verify generate-key find-sexp-token canonical-sexp->sexp sexp->canonical-sexp) #:re-export (gcrypt-version)) ;;; Commentary: ;;; ;;; Public key cryptographic routines from GNU Libgcrypt. ;;;; ;;; Libgcrypt uses "canonical s-expressions" to represent key material, ;;; parameters, and data. We keep it as an opaque object to map them to ;;; Scheme s-expressions because (1) Libgcrypt sexps may be stored in secure ;;; memory, and (2) the read syntax is different. ;;; ;;; A 'canonical-sexp->sexp' procedure is provided nevertheless, for use in ;;; cases where it is safe to move data out of Libgcrypt---e.g., when ;;; processing ACL entries, public keys, etc. ;;; ;;; Canonical sexps were defined by Rivest et al. in the IETF draft at ;;; for the purposes of SPKI ;;; (see .) ;;; ;;; Code: ;; Libgcrypt "s-expressions". (define-wrapped-pointer-type canonical-sexp? naked-pointer->canonical-sexp canonical-sexp->pointer (lambda (obj port) ;; Don't print OBJ's external representation: we don't want key material ;; to leak in backtraces and such. (format port "#" (number->string (object-address obj) 16) (number->string (pointer-address (canonical-sexp->pointer obj)) 16)))) (define finalize-canonical-sexp! (libgcrypt->pointer "gcry_sexp_release")) (define-inlinable (pointer->canonical-sexp ptr) "Return a that wraps PTR." (let* ((sexp (naked-pointer->canonical-sexp ptr)) (ptr* (canonical-sexp->pointer sexp))) ;; Did we already have a object for PTR? (when (equal? ptr ptr*) ;; No, so we can safely add a finalizer (in Guile 2.0.9 ;; 'set-pointer-finalizer!' *adds* a finalizer rather than replacing the ;; existing one.) (set-pointer-finalizer! ptr finalize-canonical-sexp!)) sexp)) (define string->canonical-sexp (let ((proc (libgcrypt->procedure int "gcry_sexp_new" `(* * ,size_t ,int)))) (lambda (str) "Parse STR and return the corresponding gcrypt s-expression." ;; When STR comes from 'canonical-sexp->string', it may contain ;; characters that are really meant to be interpreted as bytes as in a C ;; 'char *'. Thus, convert STR to ISO-8859-1 so the byte values of the ;; characters are preserved. (let* ((sexp (bytevector->pointer (make-bytevector (sizeof '*)))) (err (proc sexp (string->pointer str "ISO-8859-1") 0 1))) (if (= 0 err) (pointer->canonical-sexp (dereference-pointer sexp)) (throw 'gcry-error 'string->canonical-sexp err)))))) (define-syntax GCRYSEXP_FMT_ADVANCED (identifier-syntax 3)) (define canonical-sexp->string (let ((proc (libgcrypt->procedure size_t "gcry_sexp_sprint" `(* ,int * ,size_t)))) (lambda (sexp) "Return a textual representation of SEXP." (let loop ((len 1024)) (let* ((buf (bytevector->pointer (make-bytevector len))) (size (proc (canonical-sexp->pointer sexp) GCRYSEXP_FMT_ADVANCED buf len))) (if (zero? size) (loop (* len 2)) (pointer->string buf size "ISO-8859-1"))))))) (define (read-file-sexp file) "Return the canonical sexp read from FILE." (call-with-input-file file (compose string->canonical-sexp read-string))) (define canonical-sexp-car (let ((proc (libgcrypt->procedure '* "gcry_sexp_car" '(*)))) (lambda (lst) "Return the first element of LST, an sexp, if that element is a list; return #f if LST or its first element is not a list (this is different from the usual Lisp 'car'.)" (let ((result (proc (canonical-sexp->pointer lst)))) (if (null-pointer? result) #f (pointer->canonical-sexp result)))))) (define canonical-sexp-cdr (let ((proc (libgcrypt->procedure '* "gcry_sexp_cdr" '(*)))) (lambda (lst) "Return the tail of LST, an sexp, or #f if LST is not a list." (let ((result (proc (canonical-sexp->pointer lst)))) (if (null-pointer? result) #f (pointer->canonical-sexp result)))))) (define canonical-sexp-nth (let ((proc (libgcrypt->procedure '* "gcry_sexp_nth" `(* ,int)))) (lambda (lst index) "Return the INDEXth nested element of LST, an s-expression. Return #f if that element does not exist, or if it's an atom. (Note: this is obviously different from Scheme's 'list-ref'.)" (let ((result (proc (canonical-sexp->pointer lst) index))) (if (null-pointer? result) #f (pointer->canonical-sexp result)))))) (define (dereference-size_t p) "Return the size_t value pointed to by P." (bytevector-uint-ref (pointer->bytevector p (sizeof size_t)) 0 (native-endianness) (sizeof size_t))) (define canonical-sexp-length (let ((proc (libgcrypt->procedure int "gcry_sexp_length" '(*)))) (lambda (sexp) "Return the length of SEXP if it's a list (including the empty list); return zero if SEXP is an atom." (proc (canonical-sexp->pointer sexp))))) (define token-string? (let ((token-cs (char-set-union char-set:digit char-set:letter (char-set #\- #\. #\/ #\_ #\: #\* #\+ #\=)))) (lambda (str) "Return #t if STR is a token as per Section 4.3 of ." (and (not (string-null? str)) (string-every token-cs str) (not (char-set-contains? char-set:digit (string-ref str 0))))))) (define canonical-sexp-nth-data (let ((proc (libgcrypt->procedure '* "gcry_sexp_nth_data" `(* ,int *)))) (lambda (lst index) "Return as a symbol (for \"sexp tokens\") or a bytevector (for any other \"octet string\") the INDEXth data element (atom) of LST, an s-expression. Return #f if that element does not exist, or if it's a list." (let* ((size* (bytevector->pointer (make-bytevector (sizeof '*)))) (result (proc (canonical-sexp->pointer lst) index size*))) (if (null-pointer? result) #f (let* ((len (dereference-size_t size*)) (str (pointer->string result len "ISO-8859-1"))) ;; The sexp spec speaks of "tokens" and "octet strings". ;; Sometimes these octet strings are actual strings (text), ;; sometimes they're bytevectors, and sometimes they're ;; multi-precision integers (MPIs). Only the application knows. ;; However, for convenience, we return a symbol when a token is ;; encountered since tokens are frequent (at least in the 'car' ;; of each sexp.) (if (token-string? str) (string->symbol str) ; an sexp "token" (bytevector-copy ; application data, textual or binary (pointer->bytevector result len))))))))) (define (number->canonical-sexp number) "Return an s-expression representing NUMBER." (let ((hex-number (match (number->string number 16) ;; Append a 0 if necessary. For whatever reason gcrypt ;; rejects hex numbers that don't have an even number of ;; digits. ((? (lambda (s) (odd? (string-length s))) odd-string) (string-append "0" odd-string)) (even-str even-str)))) (string->canonical-sexp (string-append "#" hex-number "#")))) (define* (bytevector->hash-data bv #:optional (hash-algo "sha256") #:key (key-type 'ecc)) "Given BV, a bytevector containing a hash of type HASH-ALGO, return an s-expression suitable for use as the 'data' argument for 'sign'. KEY-TYPE must be a symbol: 'dsa, 'ecc, or 'rsa." (string->canonical-sexp (format #f "(data (flags ~a) (hash \"~a\" #~a#))" (case key-type ((ecc dsa) "rfc6979") ((rsa) "pkcs1") (else (error "unknown key type" key-type))) hash-algo (bytevector->base16-string bv)))) (define (key-type sexp) "Return a symbol denoting the type of public or private key represented by SEXP--e.g., 'rsa', 'ecc'--or #f if SEXP does not denote a valid key." (case (canonical-sexp-nth-data sexp 0) ((public-key private-key) (canonical-sexp-nth-data (canonical-sexp-nth sexp 1) 0)) (else #f))) (define* (hash-data->bytevector data) "Return two values: the hash value (a bytevector), and the hash algorithm (a string) extracted from DATA, an sexp as returned by 'bytevector->hash-data'. Return #f if DATA does not conform." (let ((hash (find-sexp-token data 'hash))) (if hash (let ((algo (canonical-sexp-nth-data hash 1)) (value (canonical-sexp-nth-data hash 2))) (values value (symbol->string algo))) (values #f #f)))) (define sign (let ((proc (libgcrypt->procedure int "gcry_pk_sign" '(* * *)))) (lambda (data secret-key) "Sign DATA, a canonical s-expression representing a suitable hash, with SECRET-KEY (a canonical s-expression whose car is 'private-key'.) Note that DATA must be a 'data' s-expression, as returned by 'bytevector->hash-data' (info \"(gcrypt) Cryptographic Functions\")." (let* ((sig (bytevector->pointer (make-bytevector (sizeof '*)))) (err (proc sig (canonical-sexp->pointer data) (canonical-sexp->pointer secret-key)))) (if (= 0 err) (pointer->canonical-sexp (dereference-pointer sig)) (throw 'gcry-error 'sign err)))))) (define verify (let ((proc (libgcrypt->procedure int "gcry_pk_verify" '(* * *)))) (lambda (signature data public-key) "Verify that SIGNATURE is a signature of DATA with PUBLIC-KEY, all of which are gcrypt s-expressions; return #t if the verification was successful, #f otherwise. Raise an error if, for example, one of the given s-expressions is invalid." (let ((err (proc (canonical-sexp->pointer signature) (canonical-sexp->pointer data) (canonical-sexp->pointer public-key)))) (cond ((zero? err) #t) ((error-code=? error/bad-signature err) #f) (else (throw 'gcry-error 'verify err))))))) (define generate-key (let ((proc (libgcrypt->procedure int "gcry_pk_genkey" '(* *)))) (lambda (params) "Return as an s-expression a new key pair for PARAMS. PARAMS must be an s-expression like: (genkey (rsa (nbits 4:2048)))." (let* ((key (bytevector->pointer (make-bytevector (sizeof '*)))) (err (proc key (canonical-sexp->pointer params)))) (if (zero? err) (pointer->canonical-sexp (dereference-pointer key)) (throw 'gcry-error 'generate-key err)))))) (define find-sexp-token (let ((proc (libgcrypt->procedure '* "gcry_sexp_find_token" `(* * ,size_t)))) (lambda (sexp token) "Find in SEXP the first element whose 'car' is TOKEN and return it; return #f if not found." (let* ((token (string->pointer (symbol->string token))) (res (proc (canonical-sexp->pointer sexp) token 0))) (if (null-pointer? res) #f (pointer->canonical-sexp res)))))) (define-inlinable (canonical-sexp-null? sexp) "Return #t if SEXP is the empty-list sexp." (null-pointer? (canonical-sexp->pointer sexp))) (define (canonical-sexp-list? sexp) "Return #t if SEXP is a list." (or (canonical-sexp-null? sexp) (> (canonical-sexp-length sexp) 0))) (define (canonical-sexp-fold proc seed sexp) "Fold PROC (as per SRFI-1) over SEXP, a canonical sexp." (if (canonical-sexp-list? sexp) (let ((len (canonical-sexp-length sexp))) (let loop ((index 0) (result seed)) (if (= index len) result (loop (+ 1 index) ;; XXX: Call 'nth-data' *before* 'nth' to work around ;; , which ;; affects 1.6.0 and earlier versions. (proc (or (canonical-sexp-nth-data sexp index) (canonical-sexp-nth sexp index)) result))))) (error "sexp is not a list" sexp))) (define (canonical-sexp->sexp sexp) "Return a Scheme sexp corresponding to SEXP. This is particularly useful to compare sexps (since Libgcrypt does not provide an 'equal?' procedure), or to use pattern matching." (if (canonical-sexp-list? sexp) (reverse (canonical-sexp-fold (lambda (item result) (cons (if (canonical-sexp? item) (canonical-sexp->sexp item) item) result)) '() sexp)) ;; As of Libgcrypt 1.6.0, there's no function to extract the buffer of a ;; non-list sexp (!), so we first enlist SEXP, then get at its buffer. (let ((sexp (string->canonical-sexp (string-append "(" (canonical-sexp->string sexp) ")")))) (or (canonical-sexp-nth-data sexp 0) (canonical-sexp-nth sexp 0))))) (define (sexp->canonical-sexp sexp) "Return a canonical sexp equivalent to SEXP, a Scheme sexp as returned by 'canonical-sexp->sexp'." (define (string-hex-pad str) (if (odd? (string-length str)) (string-append "0" str) str)) ;; XXX: This is inefficient, but the Libgcrypt API doesn't allow us to do ;; much better. (string->canonical-sexp (call-with-output-string (lambda (port) (define (write item) (cond ((list? item) (display "(" port) (for-each write item) (display ")" port)) ((symbol? item) (format port " ~a" item)) ((bytevector? item) (format port " #~a#" (bytevector->base16-string item))) ((integer? item) (format port " #~a#" (string-hex-pad (number->string item 16)))) (else (error "unsupported sexp item type" item)))) (write sexp))))) ;;; pk-crypto.scm ends here guile-gcrypt/gcrypt/random.scm000066400000000000000000000065541434213166000167770ustar00rootroot00000000000000;;; guile-gcrypt --- crypto tooling for guile ;;; Copyright © 2016 Christopher Allan Webber ;;; Copyright © 2019 Mathieu Othacehe ;;; ;;; This file is part of guile-gcrypt. ;;; ;;; guile-gcrypt is free software; you can redistribute it and/or modify it ;;; under the terms of the GNU General Public License as published by ;;; the Free Software Foundation; either version 3 of the License, or ;;; (at your option) any later version. ;;; ;;; guile-gcrypt is distributed in the hope that it will be useful, but ;;; WITHOUT ANY WARRANTY; without even the implied warranty of ;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU ;;; General Public License for more details. ;;; ;;; You should have received a copy of the GNU General Public License ;;; along with guile-gcrypt. If not, see . (define-module (gcrypt random) #:use-module (gcrypt internal) #:use-module (gcrypt base64) #:use-module (rnrs bytevectors) #:use-module (system foreign) #:use-module (ice-9 match) #:export (%gcry-weak-random %gcry-strong-random %gcry-very-strong-random gen-random-bv random-token)) (define %gcry-weak-random 0) ; not used (define %gcry-strong-random 1) (define %gcry-very-strong-random 2) (define %gcry-randomize (libgcrypt->procedure void "gcry_randomize" `(* ,size_t ,int))) ; buffer, length, level (define* (gen-random-bv #:optional (bv-length 50) (level %gcry-strong-random)) (let* ((bv (make-bytevector bv-length)) (bv-ptr (bytevector->pointer bv))) (%gcry-randomize bv-ptr bv-length %gcry-strong-random) bv)) (define %gcry-create-nonce (libgcrypt->procedure void "gcry_create_nonce" `(* ,size_t))) ; buffer, length (define* (gen-random-nonce #:optional (bv-length 50)) (let* ((bv (make-bytevector bv-length)) (bv-ptr (bytevector->pointer bv))) (%gcry-create-nonce bv-ptr bv-length) bv)) (define* (random-token #:optional (bv-length 30) (type 'strong)) "Generate a random token. Generates a token of bytevector BV-LENGTH, default 30. The default TYPE is 'strong. Possible values are: - strong: Uses libgcrypt's gcry_randomize procedure with level GCRY_STRONG_RANDOM (\"use this level for session keys and similar purposes\"). - very-strong: Also uses libgcrypt's gcry_randomize procedure with level GCRY_VERY_STRONG_RANDOM (\"Use this level for long term key material\") - nonce: Uses libgcrypt's gcry_xcreate_nonce, whose documentation I'll just quote inline: Fill BUFFER with LENGTH unpredictable bytes. This is commonly called a nonce and may also be used for initialization vectors and padding. This is an extra function nearly independent of the other random function for 3 reasons: It better protects the regular random generator's internal state, provides better performance and does not drain the precious entropy pool." (let ((bv (match type ('strong (gen-random-bv bv-length %gcry-strong-random)) ('very-strong (gen-random-bv bv-length %gcry-very-strong-random)) ('nonce (gen-random-nonce bv-length))))) (base64-encode bv 0 bv-length #f #t base64url-alphabet))) guile-gcrypt/gcrypt/utils.scm000066400000000000000000000036161434213166000166530ustar00rootroot00000000000000;;; guile-gcrypt --- crypto tooling for guile ;;; Copyright © 2012, 2013, 2014, 2015, 2016, 2017 Ludovic Courtès ;;; ;;; This file is part of guile-gcrypt. ;;; ;;; guile-gcrypt is free software; you can redistribute it and/or modify it ;;; under the terms of the GNU General Public License as published by ;;; the Free Software Foundation; either version 3 of the License, or ;;; (at your option) any later version. ;;; ;;; guile-gcrypt is distributed in the hope that it will be useful, but ;;; WITHOUT ANY WARRANTY; without even the implied warranty of ;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU ;;; General Public License for more details. ;;; ;;; You should have received a copy of the GNU General Public License ;;; along with guile-gcrypt. If not, see . (define-module (gcrypt utils) #:use-module (rnrs bytevectors) #:use-module (rnrs io ports) #:export (dump-port)) (define* (dump-port in out #:key (buffer-size 16384) (progress (lambda (t k) (k)))) "Read as much data as possible from IN and write it to OUT, using chunks of BUFFER-SIZE bytes. Call PROGRESS at the beginning and after each successful transfer of BUFFER-SIZE bytes or less, passing it the total number of bytes transferred and the continuation of the transfer as a thunk." (define buffer (make-bytevector buffer-size)) (define (loop total bytes) (or (eof-object? bytes) (let ((total (+ total bytes))) (put-bytevector out buffer 0 bytes) (progress total (lambda () (loop total (get-bytevector-n! in buffer 0 buffer-size))))))) ;; Make sure PROGRESS is called when we start so that it can measure ;; throughput. (progress 0 (lambda () (loop 0 (get-bytevector-n! in buffer 0 buffer-size))))) guile-gcrypt/guile-gcrypt.texi000066400000000000000000000347051434213166000170100ustar00rootroot00000000000000\input texinfo @c -*-texinfo-*- @c %**start of header @setfilename guile-gcrypt.info @documentencoding UTF-8 @settitle Guile-Gcrypt Reference Manual @c %**end of header @include version.texi @copying Copyright @copyright{} 2018, 2019, 2020, 2021, 2022 Ludovic Courtès@* Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled ``GNU Free Documentation License''. @end copying @dircategory The Algorithmic Language Scheme @direntry * Guile-Gcrypt: (guile-gcrypt). Cryptographic library for Guile. @end direntry @titlepage @title Guile-Gcrypt Reference Manual @author The Guile-Gcrypt Developers @page @vskip 0pt plus 1filll Edition @value{EDITION} @* @value{UPDATED} @* @insertcopying @end titlepage @contents @c ********************************************************************* @node Top @top Guile-Gcrypt This manual documents Guile-Gcrypt, a Guile 2.x/3.x interface to the GNU@tie{}Libgcrypt crytographic library, which is itself used by the GNU@tie{}Privacy Guard (GPG). @xref{Top,,, gcrypt, The Libgcrypt Library}, for more information on Libgcrypt. Actually this is very much a stub more than an actual manual. Please visit @uref{https://notabug.org/cwebber/guile-gcrypt} or email @email{guile-user@@gnu.org} if you'd like to give a hand! @menu * Introduction:: Getting started. * Hash Functions:: SHA1 and its friends. * Message Authentication Codes:: MACs. * Public-Key Cryptography:: Signing and encrypting. * Random Numbers:: Generating random numbers. * Miscellany:: Bonuses! * GNU Free Documentation License:: The license of this manual. * Index:: Index of concepts and procedures. @end menu @node Introduction @chapter Introduction @cindex modules Libgcrypt functionality is exposed in a set of Guile modules in the @code{(gcrypt @dots{})} name space (@pxref{Modules,,, guile, The Guile Reference Manual}). Each module provides specific functionality from Libgcrypt. For example, the following code imports cryptographic hash functions: @lisp (use-modules (gcrypt hash)) @end lisp @findex string->canonical-sexp Procedure names are not a direct mapping of the C function names; instead, more ``Schemey'' names are chosen for your enjoyment. For example, the Libgcrypt's C function called @code{gcry_sexp_new} is exposed in Scheme as the @code{string->canonical-sexp} procedure in the @code{(gcrypt pk-crypto)}---more pleasant to the eye, no? @cindex error handling @cindex exceptions When an error occurs, Guile-Gcrypt procedures raise an exception with the key @code{'gcry-error} (@pxref{Exceptions,,, guile, The Guile Reference Manual}). Exceptions have two arguments: the name of the procedure that raised it, and an @dfn{error number}. The @code{(gcrypt common)} modules provides procedures to interpret error numbers: @code{error-source} and @code{error-string}. Here's an example showing how you could report Libgcrypt errors to the user: @lisp (catch 'gcry-error (lambda () ;; Do something with Guile-Gcrypt... ) (lambda (key proc err) (format (current-error-port) "error from '~a': ~a: ~a~%" proc (error-source err) (error-string err)))) @end lisp These two procedures are detailed below. You can also refer to one of the @code{error/} constants exported by @code{(gcrypt common)} when looking for a specific error: @lisp (catch 'gcry-error (lambda () ;; Do something with Guile-Gcrypt... ) (lambda (key proc err) (if (error-code=? err error/bad-signature) (format (current-error-port) "Uh oh, bad signature!\n") (format (current-error-port) @dots{})))) @end lisp @deffn {Scheme Procedure} error-source @var{err} Return the error source (a string) for @var{err}, an error code as thrown along with @code{gcry-error}. @end deffn @deffn {Scheme Procedure} error-string @var{err} Return the error description (a string) for @var{err}, an error code as thrown along with @code{gcry-error}. @end deffn @node Hash Functions @chapter Hash Functions The @code{(gcrypt hash)} module exports @dfn{cryptographic hash functions} (@pxref{Hashing,,, gcrypt, The Libgcrypt Library}). The procedures below all take a @dfn{hash algorithm} as an argument; these are constructed using the @code{hash-algorithm} macro, as in this example: @example (hash-algorithm sha1) @end example Alternately, you can look up a hash algorithm by name using the @code{lookup-hash-algorithm} procedure: @example (lookup-hash-algorithm 'blake2b-512) @end example The following macros and procedures allow you to deal with algorithms. @deffn {Scheme Syntax} hash-algorithm @var{id} Return the hash algorithm for @var{id}, a lower-case identifier such as @code{sha1}, @code{whirlpool}, or @code{blake2b-512}. A syntax error is raised when @var{id} doesn't match any know algorithm. @end deffn @deffn {Scheme Procedure} lookup-hash-algorithm @var{id} Return the hash algorithm corresponding to @var{id}, a symbol, or @code{#f} if @var{id} does not denote a known hash algorithm. @end deffn @deffn {Scheme Procedure} hash-algorithm-name @var{algorithm} Return the name, a symbol, of @var{algorithm}, a value as returned by @code{hash-algorithm}. @end deffn @deffn {Scheme Procedure} hash-size @var{algorithm} Return the size in bytes of hashes produced by @var{algorithm}. @end deffn The procedures below offer several ways to compute a hash. @deffn {Scheme Procedure} bytevector-hash @var{bv} @var{algorithm} @deffnx {Scheme Procedure} crc32 @var{bv} @deffnx {Scheme Procedure} sha1 @var{bv} @deffnx {Scheme Procedure} sha256 @var{bv} @deffnx {Scheme Procedure} sha512 @var{bv} @deffnx {Scheme Procedure} sha3-512 @var{bv} Return the hash @var{algorithm} of @var{bv} as a bytevector. Shorthand procedures like @code{sha256} are available for all the algorithms that are valid identifiers for @code{hash-algorithm} though for brevity only a handful are listed here. @end deffn @deffn {Scheme Procedure} open-hash-port @var{algorithm} @deffnx {Scheme Procedure} open-sha256-port Return two values: an output port, and a thunk. When the thunk is called, it returns the hash (a bytevector) for @var{algorithm} of all the data written to the output port. @end deffn @deffn {Scheme Procedure} port-hash @var{algorithm} @var{port} @deffnx {Scheme Procedure} port-sha256 @var{port} Return the @var{algorithm} hash (a bytevector) of all the data drained from @var{port}. @end deffn @deffn {Scheme Procedure} file-hash @var{algorithm} @var{file} @deffnx {Scheme Procedure} file-sha256 @var{file} Return the @var{algorithm} hash (a bytevector) of @var{file}. @end deffn @deffn {Scheme Procedure} open-hash-port @var{algorithm} @var{port} @deffnx {Scheme Procedure} open-sha256-port @var{port} Return an input port that wraps @var{port} and a thunk to get the hash of all the data read from @var{port}. The thunk always returns the same value. @end deffn @deffn {Scheme Procedure} open-hash-input-port @var{algorithm} @var{port} @deffnx {Scheme Procedure} open-sha256-input-port @var{port} Return an input port that wraps @var{port} and a thunk to get the hash of all the data read from @var{port}. The thunk always returns the same value. @end deffn @node Message Authentication Codes @chapter Message Authentication Codes The @code{(gcrypt mac)} module provides procedures to deal with @dfn{message authentication codes} or @dfn{MACs} (@pxref{Message Authentication Codes,,, gcrypt, The Libgcrypt Library}). @quotation Note Guile-Gcrypt 0.1.0 provided this functionality in the @code{(gcrypt hmac)} module. This module is still provided for backward compatibility, with the same interface as before, but it is deprecated and will be removed in future versions. @end quotation Similar to how hash functions are handled (@pxref{Hash Functions}), the @code{mac-algorithm} macro can be used to construct a MAC algorithm: @example (mac-algorithm hmac-sha3-512) @end example The following macros and procedures allow you to deal with algorithms. @deffn {Scheme Syntax} mac-algorithm @var{id} Return the MAC algorithm for @var{id}, a lower-case identifier such as @code{sha256}. A syntax error is raised when @var{id} doesn't match any know algorithm. @end deffn @deffn {Scheme Procedure} lookup-mac-algorithm @var{id} Return the MAC algorithm corresponding to @var{id}, a symbol, or @code{#f} if @var{id} does not denote a known MAC algorithm. @end deffn @deffn {Scheme Procedure} mac-algorithm-name @var{algorithm} Return the name, a symbol, of @var{algorithm}, a value as returned by @code{mac-algorithm}. @end deffn @deffn {Scheme Procedure} mac-size @var{algorithm} Return the size in bytes of MACs produced by @var{algorithm}. @end deffn @c TODO @quotation Warning This section is incomplete. @end quotation @node Public-Key Cryptography @chapter Public-Key Cryptography @cindex public-key cryptography @cindex canonical S-expressions Tools for @dfn{public-key cryptography} (@pxref{Public Key cryptography,,, gcrypt, The Libgcrypt Library}) are provided by the @code{(gcrypt pk-crypto)} module. This module includes code to deal with @dfn{canonical S-expressions} (or ``sexps'') @uref{http://people.csail.mit.edu/rivest/Sexp.txt, as defined by Rivest et al.} They are used to specify public-key cryptography parameters (@pxref{Used S-expressions,,, gcrypt, The Libgcrypt Library}). Naturally, there are procedures to convert a Guile sexp to a Libgcrypt canonical sexp object and @i{vice versa}: @deffn {Scheme Procedure} canonical-sexp->sexp @var{sexp} Return a Scheme sexp corresponding to @var{sexp}. This is particularly useful to compare sexps (since Libgcrypt does not provide an @code{equal?} procedure), or to use pattern matching. @end deffn @deffn {Scheme Procedure} sexp->canonical-sexp @var{sexp} Return a canonical sexp equivalent to @var{sexp}, a Scheme sexp as returned by @code{canonical-sexp->sexp}. @end deffn @deffn {Scheme Procedure} string->canonical-sexp @var{str} Parse @var{str} and return the corresponding gcrypt s-expression. @end deffn @deffn {Scheme Procedure} canonical-sexp->string @var{sexp} Return a textual representation of @var{sexp}. @end deffn @cindex key pair generation @cindex generating key pairs For example, here is how you would generate an Ed25519 key pair and display its public key as a canonical sexp: @findex generate-key @findex find-sexp-token @lisp (use-modules (gcrypt pk-crypto)) (let* ((parameters (sexp->canonical-sexp '(genkey (ecdsa (curve Ed25519) (flags rfc6979))))) (pair (generate-key parameters)) (public (find-sexp-token pair 'public-key))) (display (canonical-sexp->string public))) @print{} (public-key (ecc (curve Ed25519) (q #141D9C42@dots{}CE853B#) ) ) @end lisp Notice that we did @emph{not} pass @code{pair} to @code{canonical-sexp->sexp}: that would have worked, but the private key would have been copied to memory managed by the garbage collector, which is a security risk---Libgcrypt might have stored the private key in so-called ``secure memory'' protected from swap, whereas Guile does no such thing for its objects (@pxref{Initializing the library, secure memory,, gcrypt, The Libgcrypt Library}). Thus the above example uses @code{find-sexp-token}, which accesses the canonical sexp directly, in search for the @code{public-key} symbol. Those canonical sexps are the basic way to communicate information to public-key crytography routines. The following procedures, for example, are available to make and verify cryptographic signatures. @deffn {Scheme Procedure} bytevector->hash-data @var{bv} @ [@var{hash-algo} "sha256"] [#:key-type 'ecc] Given @var{bv}, a bytevector containing a hash of type @var{hash-algo}, return an s-expression suitable for use as the @var{data} argument for @code{sign} (see below). @var{key-type} must be a symbol: @code{'dsa}, @code{'ecc}, or @code{'rsa}. @end deffn @deffn {Scheme Procedure} sign @var{data} @var{secret-key} Sign @var{data}, a canonical s-expression representing a suitable hash, with @var{secret-key} (a canonical s-expression whose car is @code{private-key}.) Note that @var{data} must be a @code{data} s-expression, as returned by @code{bytevector->hash-data} (@pxref{Cryptographic Functions,,, gcrypt, The Libgcrypt Libgcrypt}). @end deffn @deffn {Scheme Procedure} verify @var{signature} @var{data} @var{public-key} Verify that @var{signature} is a signature of @var{data} with @var{public-key}, all of which are gcrypt s-expressions; return @code{#t} if the verification was successful, @code{#f} otherwise. Raise an error if, for example, one of the given s-expressions is invalid. @end deffn As an example, assuming @var{pair} is bound to the canonical sexp representation of a key pair (as returned by @code{generate-key}), the following snippet signs a string and verifies its signature: @lisp (let* ((secret (find-sexp-token pair 'private-key)) (public (find-sexp-token pair 'public-key)) (data (bytevector->hash-data (sha256 (string->utf8 "Hello, world.")) #:key-type (key-type public))) (sig (sign data secret))) (verify sig data public)) @result{} #t @end lisp @xref{Used S-expressions,,, gcrypt, The Libgcrypt Library}, for more information on the canonical sexps consumed and produced by public-key cryptography functions. @node Random Numbers @chapter Random Numbers The @code{(gcrypt random)} module provides tools to generate random number of different quality levels (@pxref{Random Numbers,,, gcrypt, The Libgcrypt Library}). @node Miscellany @chapter Miscellany As a bonus, Guile-Gcrypt provides two useful modules: @itemize @item @code{(gcrypt base16)} provides procedures to encode and decode hexadecimal strings; @item @code{(gcrypt base64)} provides procedures to encode and decode base64 strings as defined in @uref{https://tools.ietf.org/html/rfc4648, RFC 4648}. @end itemize @c ********************************************************************* @node GNU Free Documentation License @appendix GNU Free Documentation License @cindex license, GNU Free Documentation License @include fdl-1.3.texi @c ********************************************************************* @node Index @unnumbered Index @printindex cp @syncodeindex tp fn @syncodeindex vr fn @printindex fn @bye @c Local Variables: @c ispell-local-dictionary: "american"; @c End: guile-gcrypt/guix.scm000066400000000000000000000043771434213166000151640ustar00rootroot00000000000000;;; guile-gcrypt --- crypto tooling for guile ;;; Copyright © 2016 Christopher Allan Webber ;;; ;;; This file is part of guile-gcrypt. ;;; ;;; guile-gcrypt is free software; you can redistribute it and/or modify it ;;; under the terms of the GNU General Public License as published by ;;; the Free Software Foundation; either version 3 of the License, or ;;; (at your option) any later version. ;;; ;;; guile-gcrypt is distributed in the hope that it will be useful, but ;;; WITHOUT ANY WARRANTY; without even the implied warranty of ;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU ;;; General Public License for more details. ;;; ;;; You should have received a copy of the GNU General Public License ;;; along with guile-gcrypt. If not, see . (use-modules (guix packages) (guix build-system gnu) (guix download) (guix git-download) (guix gexp) ((guix build utils) #:select (with-directory-excursion)) (gnu packages) (gnu packages autotools) (gnu packages base) (gnu packages guile) (gnu packages pkg-config) (gnu packages texinfo) (gnu packages gnupg) (guix licenses)) (define %source-dir (dirname (current-filename))) (define guile-gcrypt (package (name "guile-gcrypt") (version "git") (source (local-file %source-dir #:recursive? #t #:select? (git-predicate %source-dir))) (build-system gnu-build-system) (arguments '(#:phases (modify-phases %standard-phases (add-after 'unpack 'bootstrap (lambda _ (zero? (system* "sh" "bootstrap.sh"))))))) (native-inputs `(("pkg-config" ,pkg-config) ("autoconf" ,autoconf) ("automake" ,automake) ("texinfo" ,texinfo))) (inputs `(("guile" ,guile-2.2) ("libgcrypt" ,libgcrypt))) (home-page "https://notabug.org/cwebber/guile-gcrypt") (synopsis "Crypto library for Guile using libgcrypt") (description "guile-gcrypt uses Guile's foreign function interface to wrap libgcrypt to provide a variety of encryption tooling.") (license gpl3+))) guile-gcrypt guile-gcrypt/m4/000077500000000000000000000000001434213166000140115ustar00rootroot00000000000000guile-gcrypt/m4/guix.m4000066400000000000000000000040231434213166000152260ustar00rootroot00000000000000dnl GNU Guix --- Functional package management for GNU dnl Copyright © 2012, 2013, 2014, 2015, 2016 Ludovic Courtès dnl Copyright © 2014 Mark H Weaver dnl dnl This file is part of GNU Guix. dnl dnl GNU Guix is free software; you can redistribute it and/or modify it dnl under the terms of the GNU General Public License as published by dnl the Free Software Foundation; either version 3 of the License, or (at dnl your option) any later version. dnl dnl GNU Guix is distributed in the hope that it will be useful, but dnl WITHOUT ANY WARRANTY; without even the implied warranty of dnl MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the dnl GNU General Public License for more details. dnl dnl You should have received a copy of the GNU General Public License dnl along with GNU Guix. If not, see . dnl GUIX_ASSERT_LIBGCRYPT_USABLE dnl dnl Assert that GNU libgcrypt is usable from Guile. AC_DEFUN([GUIX_ASSERT_LIBGCRYPT_USABLE], [AC_CACHE_CHECK([whether $LIBGCRYPT can be dynamically loaded], [guix_cv_libgcrypt_usable_p], [GUILE_CHECK([retval], [(dynamic-func \"gcry_md_hash_buffer\" (dynamic-link \"$LIBGCRYPT\"))]) if test "$retval" = 0; then guix_cv_libgcrypt_usable_p="yes" else guix_cv_libgcrypt_usable_p="no" fi]) if test "x$guix_cv_libgcrypt_usable_p" != "xyes"; then AC_MSG_ERROR([GNU libgcrypt does not appear to be usable; see `--with-libgcrypt-prefix' and `README'.]) fi]) dnl GUIX_LIBGCRYPT_LIBDIR VAR dnl dnl Attempt to determine libgcrypt's LIBDIR; store the result in VAR. AC_DEFUN([GUIX_LIBGCRYPT_LIBDIR], [ AC_PATH_PROG([LIBGCRYPT_CONFIG], [libgcrypt-config]) AC_CACHE_CHECK([libgcrypt's library directory], [guix_cv_libgcrypt_libdir], [if test "x$LIBGCRYPT_CONFIG" != "x"; then guix_cv_libgcrypt_libdir=`$LIBGCRYPT_CONFIG --libs | grep -e -L | sed -e "s/.*-L\([[^ ]]\+\)[[[:blank:]]]\+-lgcrypt.*/\1/g"` else guix_cv_libgcrypt_libdir="" fi]) $1="$guix_cv_libgcrypt_libdir" ]) guile-gcrypt/pre-inst-env.in000066400000000000000000000025511434213166000163530ustar00rootroot00000000000000#!/bin/sh # srt2vtt --- SRT to WebVTT converter # Copyright © 2015 David Thompson # Copyright © 2015, 2016 Christopher Allan Webber # # srt2vtt is free software; you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 3 of the License, or # (at your option) any later version. # # srt2vtt is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU # General Public License for more details. # # You should have received a copy of the GNU General Public License # along with srt2vtt. If not, see . abs_top_srcdir="`cd "@abs_top_srcdir@" > /dev/null; pwd`" abs_top_builddir="`cd "@abs_top_builddir@" > /dev/null; pwd`" # Override 'GUILE_LOAD_COMPILED_PATH' altogether to avoid loading # gcrypt .go files that could be there and more recent, for instance # because the user ran 'make install' recently. GUILE_LOAD_COMPILED_PATH="$abs_top_builddir" GUILE_LOAD_PATH="$abs_top_builddir:$abs_top_srcdir" export GUILE_LOAD_COMPILED_PATH GUILE_LOAD_PATH PATH="$abs_top_builddir/scripts:$PATH" export PATH GUILE_GCRYPT_DATADIR="$abs_top_builddir/data" export GUILE_GCRYPT_DATADIR exec "$@" guile-gcrypt/tests/000077500000000000000000000000001434213166000146335ustar00rootroot00000000000000guile-gcrypt/tests/base16.scm000066400000000000000000000024031434213166000164170ustar00rootroot00000000000000;;; guile-gcrypt --- crypto tooling for guile ;;; Copyright © 2012, 2017 Ludovic Courtès ;;; ;;; This file is part of guile-gcrypt. ;;; ;;; guile-gcrypt is free software; you can redistribute it and/or modify it ;;; under the terms of the GNU General Public License as published by ;;; the Free Software Foundation; either version 3 of the License, or ;;; (at your option) any later version. ;;; ;;; guile-gcrypt is distributed in the hope that it will be useful, but ;;; WITHOUT ANY WARRANTY; without even the implied warranty of ;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU ;;; General Public License for more details. ;;; ;;; You should have received a copy of the GNU General Public License ;;; along with guile-gcrypt. If not, see . (define-module (test-base16) #:use-module (gcrypt base16) #:use-module (srfi srfi-1) #:use-module (srfi srfi-64) #:use-module (rnrs bytevectors)) (test-begin "base16") (test-assert "bytevector->base16-string->bytevector" (every (lambda (bv) (equal? (base16-string->bytevector (bytevector->base16-string bv)) bv)) (map string->utf8 '("" "f" "fo" "foo" "foob" "fooba" "foobar")))) (test-end "base16") guile-gcrypt/tests/base64.scm000066400000000000000000000052061434213166000164260ustar00rootroot00000000000000;;; guile-gcrypt --- crypto tooling for guile ;;; ;;; Code taken from: ;;; ;;; GNU Guix --- Functional package management for GNU ;;; Copyright © 2014 Nikita Karetnikov ;;; ;;; This file is part of guile-gcrypt. ;;; ;;; guile-gcrypt is free software; you can redistribute it and/or modify it ;;; under the terms of the GNU General Public License as published by ;;; the Free Software Foundation; either version 3 of the License, or ;;; (at your option) any later version. ;;; ;;; guile-gcrypt is distributed in the hope that it will be useful, but ;;; WITHOUT ANY WARRANTY; without even the implied warranty of ;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU ;;; General Public License for more details. ;;; ;;; You should have received a copy of the GNU General Public License ;;; along with guile-gcrypt. If not, see . (define-module (test-base64) #:use-module (gcrypt base64) #:use-module (rnrs bytevectors) #:use-module (srfi srfi-64)) (define (string->base64 str) (base64-encode (string->utf8 str))) (define (base64->string base64) (utf8->string (base64-decode base64))) (define (string->base64-padding str padding) (let ((bv (string->utf8 str))) (base64-encode bv 0 (bytevector-length bv) #f (not padding)))) (define (base64->string-padding base64 padding) (utf8->string (base64-decode base64 base64url-alphabet #f #f padding))) ;;; Test vectors from . (test-begin "base64") ;; Encoding (test-equal "empty string" (string->base64 "") "") (test-equal "f" (string->base64 "f") "Zg==") (test-equal "fo" (string->base64 "fo") "Zm8=") (test-equal "foo" (string->base64 "foo") "Zm9v") (test-equal "foob" (string->base64 "foob") "Zm9vYg==") (test-equal "fooba" (string->base64 "fooba") "Zm9vYmE=") (test-equal "foobar" (string->base64 "foobar") "Zm9vYmFy") (test-equal "foob (no padding)" (string->base64-padding "foob" #f) "Zm9vYg") (test-equal "foob (padding)" (string->base64-padding "foob" #t) "Zm9vYg==") ;; Decoding (test-equal "empty string" (base64->string "") "") (test-equal "f" (base64->string "Zg==") "f") (test-equal "fo" (base64->string "Zm8=") "fo") (test-equal "foo" (base64->string "Zm9v") "foo") (test-equal "foob" (base64->string "Zm9vYg==") "foob") (test-equal "fooba" (base64->string "Zm9vYmE=") "fooba") (test-equal "foobar" (base64->string "Zm9vYmFy") "foobar") (test-equal "foob (no padding)" (base64->string-padding "Zm9vYg" #f) "foob") (test-equal "foob (padding)" (base64->string-padding "Zm9vYg==" #t) "foob") (test-end "base64") guile-gcrypt/tests/hash.scm000066400000000000000000000144731434213166000162730ustar00rootroot00000000000000;;; guile-gcrypt --- crypto tooling for guile ;;; Copyright © 2013, 2014, 2017, 2019, 2020 Ludovic Courtès ;;; ;;; This file is part of guile-gcrypt. ;;; ;;; guile-gcrypt is free software; you can redistribute it and/or modify it ;;; under the terms of the GNU General Public License as published by ;;; the Free Software Foundation; either version 3 of the License, or ;;; (at your option) any later version. ;;; ;;; guile-gcrypt is distributed in the hope that it will be useful, but ;;; WITHOUT ANY WARRANTY; without even the implied warranty of ;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU ;;; General Public License for more details. ;;; ;;; You should have received a copy of the GNU General Public License ;;; along with guile-gcrypt. If not, see . (define-module (test-hash) #:use-module (gcrypt hash) #:use-module (gcrypt base16) #:use-module (srfi srfi-1) #:use-module (srfi srfi-11) #:use-module (srfi srfi-64) #:use-module (rnrs bytevectors) #:use-module (rnrs io ports)) ;; Test the (guix hash) module. (define %empty-sha256 ;; SHA256 hash of the empty string. (base16-string->bytevector "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855")) (define %hello-sha256 ;; SHA256 hash of "hello world" (base16-string->bytevector "b94d27b9934d3e08a52e52d7da7dabfac484efe37a5380ee9088f7ace2efcde9")) (define %hello-sha512 (base16-string->bytevector "309ecc489c12d6eb4cc40f50c902f2b4d0ed77ee511a7c7a9bcd3ca86d4cd86f989dd35bc5ff499670da34255b45b0cfd830e81f605dcf7dc5542e93ae9cd76f")) (define (supports-unbuffered-cbip?) "Return #t if unbuffered custom binary input ports (CBIPs) are supported. In Guile <= 2.0.9, CBIPs were always fully buffered, so the 'open-hash-input-port' does not work there." (false-if-exception (setvbuf (make-custom-binary-input-port "foo" pk #f #f #f) (cond-expand ((and guile-2 (not guile-2.2)) _IONBF) (else 'none))))) (test-begin "hash") (test-equal "lookup-hash-algorithm" (hash-algorithm blake2b-512) (lookup-hash-algorithm 'blake2b-512)) (test-eq "hash-algorithm-name" 'sha3-512 (hash-algorithm-name (hash-algorithm sha3-512))) (test-equal "hash-size" (list 20 32 64) (map hash-size (list (hash-algorithm sha1) (hash-algorithm sha256) (hash-algorithm sha512)))) (test-equal "sha1, empty" (base16-string->bytevector "da39a3ee5e6b4b0d3255bfef95601890afd80709") (sha1 #vu8())) (test-equal "sha1, hello" (base16-string->bytevector "2aae6c35c94fcfb415dbe95f408b9ce91ee846ed") (sha1 (string->utf8 "hello world"))) (test-equal "sha256, empty" %empty-sha256 (sha256 #vu8())) (test-equal "sha256, hello" %hello-sha256 (sha256 (string->utf8 "hello world"))) (test-equal "sha512, empty" "cf83e1357eefb8bdf1542850d66d8007d620e4050b5715dc83f4a921d36ce9ce47d0d13c5d85f2b0ff8318d2877eec2f63b931bd47417a81a538327af927da3e" (bytevector->base16-string (sha512 #vu8()))) (test-equal "sha512, hello" %hello-sha512 (bytevector-hash (string->utf8 "hello world") (hash-algorithm sha512))) (test-equal "open-sha256-port, empty" %empty-sha256 (let-values (((port get) (open-sha256-port))) (close-port port) (get))) (test-equal "open-sha256-port, hello" (list %hello-sha256 (string-length "hello world")) (let-values (((port get) (open-sha256-port))) (put-bytevector port (string->utf8 "hello world")) (force-output port) (list (get) (port-position port)))) (test-equal "open-hash-port, sha512, hello" (list %hello-sha512 (string-length "hello world")) (let-values (((port get) (open-hash-port (hash-algorithm sha512)))) (put-bytevector port (string->utf8 "hello world")) (force-output port) (list (get) (port-position port)))) (test-assert "port-sha256" (let* ((file (search-path %load-path "ice-9/psyntax.scm")) (size (stat:size (stat file))) (contents (call-with-input-file file get-bytevector-all))) (equal? (sha256 contents) (call-with-input-file file port-sha256)))) (test-skip (if (supports-unbuffered-cbip?) 0 4)) (test-equal "open-sha256-input-port, empty" `("" ,%empty-sha256) (let-values (((port get) (open-sha256-input-port (open-string-input-port "")))) (let ((str (get-string-all port))) (list str (get))))) (test-equal "open-sha256-input-port, hello" `("hello world" ,%hello-sha256) (let-values (((port get) (open-sha256-input-port (open-bytevector-input-port (string->utf8 "hello world"))))) (let ((str (get-string-all port))) (list str (get))))) (test-equal "open-hash-input-port, sha512, hello" `("hello world" ,%hello-sha512) (let-values (((port get) (open-hash-input-port (hash-algorithm sha512) (open-bytevector-input-port (string->utf8 "hello world"))))) (let ((str (get-string-all port))) (list str (get))))) (test-equal "open-sha256-input-port, hello, one two" (list (string->utf8 "hel") (string->utf8 "lo") (base16-string->bytevector ; echo -n hello | sha256sum "2cf24dba5fb0a30e26e83b2ac5b9e29e1b161e5c1fa7425e73043362938b9824") " world") (let-values (((port get) (open-sha256-input-port (open-bytevector-input-port (string->utf8 "hello world"))))) (let* ((one (get-bytevector-n port 3)) (two (get-bytevector-n port 2)) (hash (get)) (three (get-string-all port))) (list one two hash three)))) (test-equal "open-sha256-input-port, hello, read from wrapped port" (list (string->utf8 "hello") (base16-string->bytevector ; echo -n hello | sha256sum "2cf24dba5fb0a30e26e83b2ac5b9e29e1b161e5c1fa7425e73043362938b9824") " world") (let*-values (((wrapped) (open-bytevector-input-port (string->utf8 "hello world"))) ((port get) (open-sha256-input-port wrapped))) (let* ((hello (get-bytevector-n port 5)) (hash (get)) ;; Now read from WRAPPED to make sure its current position is ;; correct. (world (get-string-all wrapped))) (list hello hash world)))) (test-end) guile-gcrypt/tests/hmac.scm000066400000000000000000000031011434213166000162420ustar00rootroot00000000000000;;; guile-gcrypt --- crypto tooling for guile ;;; Copyright © 2016 Christopher Allan Webber ;;; Copyright © 2019 Ludovic Courtès ;;; ;;; This file is part of guile-gcrypt. ;;; ;;; guile-gcrypt is free software; you can redistribute it and/or modify it ;;; under the terms of the GNU General Public License as published by ;;; the Free Software Foundation; either version 3 of the License, or ;;; (at your option) any later version. ;;; ;;; guile-gcrypt is distributed in the hope that it will be useful, but ;;; WITHOUT ANY WARRANTY; without even the implied warranty of ;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU ;;; General Public License for more details. ;;; ;;; You should have received a copy of the GNU General Public License ;;; along with guile-gcrypt. If not, see . (define-module (test-mac) #:use-module (rnrs bytevectors) #:use-module (srfi srfi-64) #:use-module (gcrypt hmac)) ;the deprecated module (test-begin "hmac") (define test-key (gen-signing-key)) (let ((sig (sign-data test-key "monkey party" #:algorithm 'sha256))) ;; Should be a bytevector (test-assert (bytevector? sig)) ;; Correct sig succeeds (test-assert (verify-sig test-key "monkey party" sig #:algorithm 'sha256))) (let ((sig (sign-data test-key "monkey party"))) ;; Should be a bytevector (test-assert (bytevector? sig)) ;; Correct sig succeeds (test-assert (verify-sig test-key "monkey party" sig))) (test-end "hmac") guile-gcrypt/tests/mac.scm000066400000000000000000000102631434213166000161010ustar00rootroot00000000000000;;; guile-gcrypt --- crypto tooling for guile ;;; Copyright © 2016 Christopher Allan Webber ;;; Copyright © 2019, 2020 Ludovic Courtès ;;; ;;; This file is part of guile-gcrypt. ;;; ;;; guile-gcrypt is free software; you can redistribute it and/or modify it ;;; under the terms of the GNU General Public License as published by ;;; the Free Software Foundation; either version 3 of the License, or ;;; (at your option) any later version. ;;; ;;; guile-gcrypt is distributed in the hope that it will be useful, but ;;; WITHOUT ANY WARRANTY; without even the implied warranty of ;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU ;;; General Public License for more details. ;;; ;;; You should have received a copy of the GNU General Public License ;;; along with guile-gcrypt. If not, see . (define-module (test-mac) #:use-module (rnrs bytevectors) #:use-module (srfi srfi-64) #:use-module (gcrypt mac)) (test-begin "mac") (test-equal "lookup-mac-algorithm" (mac-algorithm hmac-sha3-256) (lookup-mac-algorithm 'hmac-sha3-256)) (test-eq "mac-algorithm-name" 'hmac-sha3-512 (mac-algorithm-name (mac-algorithm hmac-sha3-512))) (test-equal "mac-size" (list 32 28 64 64) (map mac-size (list (mac-algorithm hmac-sha256) (mac-algorithm hmac-sha224) (mac-algorithm hmac-sha512) (mac-algorithm hmac-sha3-512)))) (define test-key (generate-signing-key)) (let ((sig (sign-data test-key "monkey party" #:algorithm (mac-algorithm hmac-sha256)))) ;; Should be a bytevector (test-assert (bytevector? sig)) ;; Correct sig succeeds (test-assert (valid-signature? test-key "monkey party" sig #:algorithm (mac-algorithm hmac-sha256))) ;; Incorrect data fails (test-assert (not (valid-signature? test-key "something else" sig #:algorithm (mac-algorithm hmac-sha256)))) ;; Fake signature fails (test-assert (not (valid-signature? test-key "monkey party" (string->utf8 "fake sig") #:algorithm (mac-algorithm hmac-sha256)))) ;; Wrong algorithm fails (test-assert (not (valid-signature? test-key "monkey party" sig #:algorithm (mac-algorithm hmac-sha512)))) ;; Should equal a re-run of itself (test-equal sig (sign-data test-key "monkey party" #:algorithm (mac-algorithm hmac-sha256))) ;; Shouldn't equal something different (test-assert (not (equal? sig (sign-data test-key "cookie party" #:algorithm (mac-algorithm hmac-sha256)))))) ;; Now with a CMAC. (let* ((key (generate-signing-key 16)) (sig (sign-data key "monkey party" #:algorithm (mac-algorithm cmac-aes)))) ;; Should be a bytevector (test-assert (bytevector? sig)) ;; Correct sig succeeds (test-assert (valid-signature? key "monkey party" sig #:algorithm (mac-algorithm cmac-aes))) ;; Fake signature fails (test-assert (not (valid-signature? key "monkey party" (string->utf8 "fake sig") #:algorithm (mac-algorithm cmac-aes))))) ;; Now with base64 encoding (let ((sig (sign-data-base64 test-key "monkey party"))) ;; Should be a string (test-assert (string? sig)) ;; Correct sig succeeds (test-assert (valid-base64-signature? test-key "monkey party" sig)) ;; Incorrect data fails (test-assert (not (valid-base64-signature? test-key "something else" sig))) ;; Fake signature fails (test-assert (not (valid-base64-signature? test-key "monkey party" "f41c3516"))) ;; Should equal a re-run of itself (test-equal sig (sign-data-base64 test-key "monkey party")) ;; Shouldn't equal something different (test-assert (not (equal? sig (sign-data-base64 test-key "cookie party"))))) (test-end "mac") guile-gcrypt/tests/pk-crypto.scm000066400000000000000000000301031434213166000172640ustar00rootroot00000000000000;;; guile-gcrypt --- crypto tooling for guile ;;; Copyright © 2013, 2014, 2017, 2019, 2020 Ludovic Courtès ;;; ;;; This file is part of guile-gcrypt. ;;; ;;; guile-gcrypt is free software; you can redistribute it and/or modify it ;;; under the terms of the GNU General Public License as published by ;;; the Free Software Foundation; either version 3 of the License, or ;;; (at your option) any later version. ;;; ;;; guile-gcrypt is distributed in the hope that it will be useful, but ;;; WITHOUT ANY WARRANTY; without even the implied warranty of ;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU ;;; General Public License for more details. ;;; ;;; You should have received a copy of the GNU General Public License ;;; along with guile-gcrypt. If not, see . (define-module (test-pk-crypto) #:use-module (gcrypt pk-crypto) #:use-module (gcrypt utils) #:use-module (gcrypt base16) #:use-module (gcrypt hash) #:use-module (gcrypt common) ;error codes #:use-module (srfi srfi-1) #:use-module (srfi srfi-11) #:use-module (srfi srfi-26) #:use-module (srfi srfi-64) #:use-module (rnrs bytevectors) #:use-module (rnrs io ports) #:use-module (ice-9 match)) ;; Test the (guix pk-crypto) module. (define %key-pair ;; RSA key pair that was generated with: ;; (generate-key (string->canonical-sexp "(genkey (rsa (nbits 4:1024)))")) ;; which takes a bit of time. "(key-data (public-key (rsa (n #00C1F764069F54FFE93A126B02328903E984E4AE3AF6DF402B5B6B3907911B88C385F1BA76A002EC9DEA109A5228EF0E62EE31A06D1A5861CAB474F6C857AC66EB65A1905F25BBA1869579E73A3B7FED13AF5A1667326F88CDFC2FF24B03C14FD1384AA7E73CA89572880B606E3A974E15347963FC7B6378574936A47580DBCB45#) (e #010001#))) (private-key (rsa (n #00C1F764069F54FFE93A126B02328903E984E4AE3AF6DF402B5B6B3907911B88C385F1BA76A002EC9DEA109A5228EF0E62EE31A06D1A5861CAB474F6C857AC66EB65A1905F25BBA1869579E73A3B7FED13AF5A1667326F88CDFC2FF24B03C14FD1384AA7E73CA89572880B606E3A974E15347963FC7B6378574936A47580DBCB45#) (e #010001#) (d #58CAD84653D0046A8EC3F9AA82D9C829B145422109FC3F12DA01A694B92FA296E70D366FB166454D30E632CEE3A033B4C41781BA10325F69FCDC0250CA19C8EEB352FA085992494098DB133E682ED38A931701F0DED1A1E508F4341A4FB446A04F019427C7CB3C44F251EEA9D386100DA80F125E0FD5CE1B0DFEC6D21516EACD#) (p #00D47F185147EC39393CCDA4E7323FFC20FC8B8073E2A54DD63BA392A66975E4204CA48572496A9DFD7522436B852C07472A5AB25B7706F7C14E6F33FBC420FF3B#) (q #00E9AD22F158060BC9AE3601DA623AFC60FFF3058795802CA92371C00097335CF9A23D7782DE353C9DBA93D7BB99E6A24A411107605E722481C5C191F80D7EB77F#) (u #59B45B95AE01A7A7370FAFDB08FE73A4793CE37F228961B09B1B1E7DDAD9F8D3E28F5C5E8B4B067E6B8E0BBF3F690B42991A79E46108DDCDA2514323A66964DE#))))") (define %ecc-key-pair ;; Ed25519 key pair generated with: ;; (generate-key (string->canonical-sexp "(genkey (ecdsa (curve Ed25519) (flags rfc6979 transient)))")) "(key-data (public-key (ecc (curve Ed25519) (q #94869C1B9E69DB8DD910B7F7F4D6E56A63A964A59AE8F90F6703ACDDF6F50C81#))) (private-key (ecc (curve Ed25519) (q #94869C1B9E69DB8DD910B7F7F4D6E56A63A964A59AE8F90F6703ACDDF6F50C81#) (d #6EFB32D0B4EC6B3237B523539F1979379B82726AAA605EB2FBA6775B2B777B78#))))") (test-begin "pk-crypto") (test-assert "version" (gcrypt-version)) (let ((sexps '("(foo bar)" ;; In Libgcrypt 1.5.3 the following integer is rendered as ;; binary, whereas in 1.6.0 it's rendered as is (hexadecimal.) ;;"#C0FFEE#" "(genkey \n (rsa \n (nbits \"1024\")\n )\n )"))) (test-equal "string->canonical-sexp->string" sexps (let ((sexps (map string->canonical-sexp sexps))) (and (every canonical-sexp? sexps) (map (compose string-trim-both canonical-sexp->string) sexps))))) (gc) ; stress test! (let ((sexps `(("(foo bar)" foo -> "(foo bar)") ("(foo (bar (baz 3:123)))" baz -> "(baz \"123\")") ("(foo (bar 3:123))" baz -> #f)))) (test-equal "find-sexp-token" (map (match-lambda ((_ _ '-> expected) expected)) sexps) (map (match-lambda ((input token '-> _) (let ((sexp (find-sexp-token (string->canonical-sexp input) token))) (and sexp (string-trim-both (canonical-sexp->string sexp)))))) sexps))) (gc) (test-equal "canonical-sexp-length" '(0 1 2 4 0 0) (map (compose canonical-sexp-length string->canonical-sexp) '("()" "(a)" "(a b)" "(a #616263# b #C001#)" "a" "#123456#"))) (test-equal "canonical-sexp-list?" '(#t #f #t #f) (map (compose canonical-sexp-list? string->canonical-sexp) '("()" "\"abc\"" "(a b c)" "#123456#"))) (gc) (test-equal "canonical-sexp-car + cdr" '("(b \n (c xyz)\n )") (let ((lst (string->canonical-sexp "(a (b (c xyz)))"))) (map (lambda (sexp) (and sexp (string-trim-both (canonical-sexp->string sexp)))) ;; Note: 'car' returns #f when the first element is an atom. (list (canonical-sexp-car (canonical-sexp-cdr lst)))))) (gc) (test-equal "canonical-sexp-nth" '("(b pqr)" "(c \"456\")" "(d xyz)" #f #f) (let ((lst (string->canonical-sexp "(a (b 3:pqr) (c 3:456) (d 3:xyz))"))) ;; XXX: In Libgcrypt 1.5.3, (canonical-sexp-nth lst 0) returns LST, whereas in ;; 1.6.0 it returns #f. (map (lambda (sexp) (and sexp (string-trim-both (canonical-sexp->string sexp)))) (unfold (cut > <> 5) (cut canonical-sexp-nth lst <>) 1+ 1)))) (gc) (test-equal "canonical-sexp-nth-data" `(Name Otto Meier #f ,(base16-string->bytevector "123456") #f) (let ((lst (string->canonical-sexp "(Name Otto Meier (address Burgplatz) #123456#)"))) (unfold (cut > <> 5) (cut canonical-sexp-nth-data lst <>) 1+ 0))) (let ((bv (base16-string->bytevector "5eff0b55c9c5f5e87b4e34cd60a2d5654ca1eb78c7b3c67c3179fed1cff07b4c"))) (test-equal "hash corrupt due to restrictive locale encoding" bv ;; In Guix up to 0.6 included this test would fail because at some point ;; the hash value would be cropped to ASCII. In practice 'guix ;; authenticate' would produce invalid signatures that would fail ;; signature verification. See . (let ((locale (setlocale LC_ALL))) (dynamic-wind (lambda () (setlocale LC_ALL "C")) (lambda () (hash-data->bytevector (string->canonical-sexp (canonical-sexp->string (bytevector->hash-data bv "sha256"))))) (lambda () (setlocale LC_ALL locale)))))) (gc) ;; XXX: The test below is typically too long as it needs to gather enough entropy. ;; (test-assert "generate-key" ;; (let ((key (generate-key (string->canonical-sexp ;; "(genkey (rsa (nbits 3:128)))")))) ;; (and (canonical-sexp? key) ;; (find-sexp-token key 'key-data) ;; (find-sexp-token key 'public-key) ;; (find-sexp-token key 'private-key)))) (test-assert "bytevector->hash-data->bytevector" (let* ((bv (sha256 (string->utf8 "Hello, world."))) (data (bytevector->hash-data bv "sha256"))) (and (canonical-sexp? data) (let-values (((value algo) (hash-data->bytevector data))) (and (string=? algo "sha256") (bytevector=? value bv)))))) (test-equal "key-type" '(rsa ecc) (map (compose key-type (cut find-sexp-token <> 'public-key) string->canonical-sexp) (list %key-pair %ecc-key-pair))) (test-equal "sign + verify, bogus signature" `(verify . ,(gcrypt-error error/invalid-object)) (catch 'gcry-error (lambda () (let* ((pair (string->canonical-sexp %key-pair)) (secret (find-sexp-token pair 'private-key)) (public (find-sexp-token pair 'public-key)) (data (bytevector->hash-data (sha256 (string->utf8 "Hello, world.")) #:key-type (key-type public))) (bogus (string->canonical-sexp "(bogus sig)"))) (verify bogus data public))) (lambda (key proc error) (cons proc error)))) (test-assert "sign + verify" (let* ((pair (string->canonical-sexp %key-pair)) (secret (find-sexp-token pair 'private-key)) (public (find-sexp-token pair 'public-key)) (data (bytevector->hash-data (sha256 (string->utf8 "Hello, world.")) #:key-type (key-type public))) (sig (sign data secret))) (and (verify sig data public) (not (verify sig (bytevector->hash-data (sha256 (string->utf8 "Hi!")) #:key-type (key-type public)) public))))) (test-assert "sign + verify, Ed25519" (let* ((pair (string->canonical-sexp %ecc-key-pair)) (secret (find-sexp-token pair 'private-key)) (public (find-sexp-token pair 'public-key)) (data (bytevector->hash-data (sha256 (string->utf8 "Hello, world.")))) (sig (sign data secret))) (and (verify sig data public) (not (verify sig (bytevector->hash-data (sha256 (string->utf8 "Hi!"))) public))))) (gc) (test-equal "canonical-sexp->sexp" `((data (flags pkcs1) (hash sha256 ,(base16-string->bytevector "2749f0ea9f26c6c7be746a9cff8fa4c2f2a02b000070dba78429e9a11f87c6eb"))) (public-key (rsa (n ,(base16-string->bytevector (string-downcase "00C1F764069F54FFE93A126B02328903E984E4AE3AF6DF402B5B6B3907911B88C385F1BA76A002EC9DEA109A5228EF0E62EE31A06D1A5861CAB474F6C857AC66EB65A1905F25BBA1869579E73A3B7FED13AF5A1667326F88CDFC2FF24B03C14FD1384AA7E73CA89572880B606E3A974E15347963FC7B6378574936A47580DBCB45"))) (e ,(base16-string->bytevector "010001"))))) (list (canonical-sexp->sexp (string->canonical-sexp "(data (flags pkcs1) (hash \"sha256\" #2749f0ea9f26c6c7be746a9cff8fa4c2f2a02b000070dba78429e9a11f87c6eb#))")) (canonical-sexp->sexp (find-sexp-token (string->canonical-sexp %key-pair) 'public-key)))) (let ((lst `((data (flags pkcs1) (hash sha256 ,(base16-string->bytevector "2749f0ea9f26c6c7be746a9cff8fa4c2f2a02b000070dba78429e9a11f87c6eb"))) (public-key (rsa (n ,(base16-string->bytevector (string-downcase "00C1F764069F54FFE93A126B02328903E984E4AE3AF6DF402B5B6B3907911B88C385F1BA76A002EC9DEA109A5228EF0E62EE31A06D1A5861CAB474F6C857AC66EB65A1905F25BBA1869579E73A3B7FED13AF5A1667326F88CDFC2FF24B03C14FD1384AA7E73CA89572880B606E3A974E15347963FC7B6378574936A47580DBCB45"))) (e ,(base16-string->bytevector "010001")))) ,(base16-string->bytevector "2749f0ea9f26c6c7be746a9cff8fa4c2f2a02b000070dba78429e9a11f87c6eb")))) (test-equal "sexp->canonical-sexp->sexp" lst (map (compose canonical-sexp->sexp sexp->canonical-sexp) lst))) (let ((sexp `(signature (public-key (rsa (n ,(make-bytevector 1024 1)) (e ,(base16-string->bytevector "010001"))))))) (test-equal "https://dev.gnupg.org/T1594" ;; The gcrypt bug above was primarily affecting our uses in ;; 'canonical-sexp->sexp', typically when applied to a signature sexp (in ;; 'guix authenticate -verify') with a "big" RSA key, such as 4096 bits. sexp (canonical-sexp->sexp (sexp->canonical-sexp sexp)))) ;; In Guile-Gcrypt <= 0.2.1, 'canonical-sexp->sexp' did not support integers. (test-equal "sexp->canonical-sexp, big integers" '(a (b #vu8(#x01 #x23 #x45 #x67 #x89)) (c #vu8(#x98 #x76 #x54 #x32 #x10))) (canonical-sexp->sexp (sexp->canonical-sexp '(a (b #x123456789) (c #x9876543210))))) (test-end)