[ { "path": ".eslintignore", "content": "doc/\ncore.js\ncore_closure.js\nsjcl.js\n" }, { "path": ".eslintrc", "content": "{\n \"rules\": {\n \"indent\": [\n 0,\n 2\n ],\n \"quotes\": [\n 0,\n \"double\"\n ],\n \"linebreak-style\": [\n 2,\n \"unix\"\n ],\n \"semi\": [\n 2,\n \"always\"\n ]\n },\n \"globals\": {\n \"sjcl\": true,\n \"browserUtil\": true\n },\n \"env\": {\n \"node\": true,\n \"browser\": true\n },\n \"extends\": \"eslint:recommended\"\n}\n" }, { "path": ".gitignore", "content": "core.js\ncore_closure.js\nnode_modules/\ndoc/\ndoc_private/\ncompress/compiler.jar\ncompress/compiler-latest.zip\n\n# Swap Files #\n# ########## #\n~*\n*.swp\n" }, { "path": ".npmignore", "content": "compress/*.jar\ncompress/*.zip\n\ncore.js\ncore_closure.js\nnode_modules/\ndoc/\ndoc_private/\n\n# Swap Files #\n# ########## #\n~*\n*.swp\n" }, { "path": ".travis.yml", "content": "sudo: false\nlanguage: node_js\ncache:\n directories:\n - node_modules\nnode_js:\n - \"10\"\n - \"0.12\"\nbefore_script: ./configure --with-all\n" }, { "path": "LICENSE.txt", "content": "SJCL is open. You can use, modify and redistribute it under a BSD\nlicense or under the GNU GPL, version 2.0.\n\n---------------------------------------------------------------------\n\nhttp://opensource.org/licenses/BSD-2-Clause\n\nCopyright (c) 2009-2015, Emily Stark, Mike Hamburg and Dan Boneh at\nStanford University. All rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are\nmet:\n\n1. Redistributions of source code must retain the above copyright\nnotice, this list of conditions and the following disclaimer.\n\n2. Redistributions in binary form must reproduce the above copyright\nnotice, this list of conditions and the following disclaimer in the\ndocumentation and/or other materials provided with the distribution.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\nIS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED\nTO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A\nPARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\nHOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\nSPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED\nTO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\nPROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\nLIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\nNEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n---------------------------------------------------------------------\n\nhttp://opensource.org/licenses/GPL-2.0\n\nThe Stanford Javascript Crypto Library (hosted here on GitHub) is a\nproject by the Stanford Computer Security Lab to build a secure,\npowerful, fast, small, easy-to-use, cross-browser library for\ncryptography in Javascript.\n\nCopyright (c) 2009-2015, Emily Stark, Mike Hamburg and Dan Boneh at\nStanford University.\n\nThis program is free software; you can redistribute it and/or modify it\nunder the terms of the GNU General Public License as published by the\nFree Software Foundation; either version 2 of the License, or (at your\noption) any later version.\n\nThis program is distributed in the hope that it will be useful, but\nWITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General\nPublic License for more details.\n\nYou should have received a copy of the GNU General Public License along\nwith this program; if not, write to the Free Software Foundation, Inc.,\n59 Temple Place, Suite 330, Boston, MA 02111-1307 USA" }, { "path": "Makefile", "content": "YUICOMPRESSOR= yuicompressor-2.4.2.jar\n\ninclude config.mk\n\n.PHONY: all test test_yui test_closure test_uncompressed lint compression_stats\n\nall: sjcl.js\n\nsjcl.js: $(COMPRESS)\n\tcp $^ $@\n\ncore.js: $(SOURCES) config.mk\n\tcat $(SOURCES) > $@\n\n# compressed targets\ncore_closure.js: core.js compress/compress_with_closure.sh compress/*.pl\n\tcompress/compress_with_closure.sh $< > $@\n\ncore_yui.js: core.js compress/compress_with_yui.sh compress/*.pl\n\tcompress/compress_with_yui.sh $< > $@\n\ncompression_stats: core.js core_closure.js core_yui.js\n\tgzip -c core.js > core.js.gz\n\tgzip -c core_yui.js > core_yui.js.gz\n\tgzip -c core_closure.js > core_closure.js.gz\n\n\t@echo\n\t@echo\n\t@echo Compression stats:\n\t@echo\n\t@wc -c core.js core_closure.js core_yui.js | head -n -1\n\t@echo\n\t@wc -c core*.js.gz | head -n -1\n\t@echo\n\t@echo\n\n\trm -f core*.js.gz\n\ndoc: $(SOURCES)\n\trm -fr $@\n\tnpm run jsdoc -- $(SOURCES) --destination $@\n\ndoc_private: $(SOURCES)\n\trm -fr $@\n\tnpm run jsdoc -- $(SOURCES) --destination $@ --private\n\nlint:\n\tnpm run lint\n\n\nTEST_COMMON= browserTest/nodeUtil.js test/test.js\n\nTEST_SCRIPTS= $(TEST_COMMON) \\\n test/ccm_vectors.js test/ccm_arraybuffer_test.js \\\n test/codec_arraybuffer_test.js \\\n test/aes_vectors.js test/aes_test.js \\\n test/bitArray_vectors.js test/bitArray_test.js \\\n test/bn_vectors.js test/bn_test.js \\\n test/cbc_vectors.js test/cbc_test.js \\\n test/ctr_vectors.js test/ctr_test.js \\\n test/ccm_vectors.js test/ccm_test.js \\\n test/ecc_vectors.js test/ecc_test.js \\\n test/ecc_conv.js \\\n test/ecdsa_test.js test/ecdsa_vectors.js test/ecdh_test.js \\\n test/gcm_vectors.js test/gcm_test.js \\\n test/hmac_vectors.js test/hmac_test.js \\\n test/json_test.js \\\n test/ocb2_vectors.js test/ocb2_test.js \\\n test/ocb2progressive_test.js \\\n test/pbkdf2_test.js test/scrypt_vectors.js test/scrypt_test.js \\\n test/ripemd160_vectors.js test/ripemd160_test.js \\\n test/sha1_vectors.js test/sha1_test.js \\\n test/sha1_vectors_long_messages.js test/sha1_test_long_messages.js \\\n test/sha1_huge_test_messages.js test/sha1_huge_test.js \\\n test/sha256_vectors.js test/sha256_test.js \\\n test/sha256_huge_test_messages.js test/sha256_huge_test.js \\\n test/sha256_vectors_long_messages.js test/sha256_test_long_messages.js \\\n test/sha256_test_brute_force.js \\\n test/sha512_vectors.js test/sha512_test.js \\\n test/sha512_vectors_long_messages.js test/sha512_test_long_messages.js \\\n test/sha512_huge_test_messages.js test/sha512_huge_test.js \\\n test/sha512_test_brute_force.js \\\n test/srp_vectors.js test/srp_test.js \\\n\t test/z85_vectors.js test/z85_test.js\n\n# Run all tests in node.js.\ntest: sjcl.js $(TEST_SCRIPTS) test/run_tests_node.js\n\tnode test/run_tests_node.js $< $(TEST_SCRIPTS)\n\ntidy:\n\tfind . -name '*~' -delete\n\trm -f core.js core_*.js\n\nclean: tidy\n\trm -fr sjcl.js doc doc_private\n\ndistclean: clean\n\t./configure\n\tmake sjcl.js tidy\n" }, { "path": "README/COPYRIGHT", "content": "SJCL used to be in the public domain. Now it's:\n\nCopyright 2009-2010 Emily Stark, Mike Hamburg, Dan Boneh, Stanford University.\n\nThis is for liability reasons. (Speaking of which, SJCL comes with NO\nWARRANTY WHATSOEVER, express or implied, to the limit of applicable\nlaw.)\n\nSJCL is dual-licensed under the GNU GPL version 2.0 or higher, and a\n2-clause BSD license. You may use SJCL under the terms of either of\nthese licenses. For your convenience, the GPL versions 2.0 and 3.0\nand the 2-clause BSD license are included here. Additionally, you may\nserve \"crunched\" copies of sjcl (i.e. those with comments removed,\nand other transformations to reduce code size) without any copyright\nnotice.\n\nSJCL includes JsDoc toolkit, YUI compressor, Closure compressor,\nJSLint and the CodeView template in its build system. These programs'\ncopyrights are owned by other people. They are distributed here under\nthe MPL, MIT, BSD, Apache and JSLint licenses. Codeview is \"free for\ndownload\" but has no license attached; it is Copyright 2010 Wouter Bos.\n\nThe BSD license is (almost?) strictly more permissive, but the\nadditionally licensing under the GPL allows us to use OCB 2.0 code\nroyalty-free (at least, if OCB 2.0's creator Phil Rogaway has anything\nto say about it). Note that if you redistribute SJCL under a license\nother than the GPL, you or your users may need to pay patent licensing\nfees for OCB 2.0.\n\nThere may be patents which apply to SJCL other than Phil Rogaway's OCB\npatents. We suggest that you consult legal counsel before using SJCL\nin a commercial project.\n\n-----\n\nPlease note, two Java JAR files, Google Closure Compiler and \nYUI Compressor, are provided in the \"compress\" folder as a convenience \nfor the compiling process of SJCL. These are not part of SJCL itself \nand provided under their own licenses.\n\nAs of October 2015, more information can be found at the following\nlocations:\n\nGoogle Closure Compiler\n - https://developers.google.com/closure/compiler/\n\nYUI Compressor\n - http://yui.github.io/yuicompressor/\n\n" }, { "path": "README/INSTALL", "content": "SJCL comes with a file sjcl.js pre-built. This default build includes\nall the modules except for sjcl.codec.bytes (because the demo site doesn't\nuse it). All you need to do to install is copy this file to your web\nserver and start using it.\n\nSJCL is divided into modules implementing various cryptographic and\nconvenience functions. If you don't need them all for your application,\nyou can reconfigure SJCL for a smaller code size. To do this, you can\nrun\n\n./configure --without-all --with-aes --with-sha256 ...\n\nThen type\n\nmake\n\nto rebuild sjcl.js. This will also create a few intermediate files\ncore*.js; you can delete these automatically by typing\n\nmake sjcl.js tidy\n\ninstead. You will need make, perl, bash and java to rebuild SJCL.\n\nSome of the modules depend on other modules; configure should handle this\nautomatically unless you tell it --without-FOO --with-BAR, where BAR\ndepends on FOO. If you do this, configure will yell at you.\n\nSJCL is compressed by stripping comments, shortening variable names, etc.\nYou can also pass a --compress argument to configure to change the\ncompressor. By default SJCL uses some perl/sh scripts and Google's\nClosure compressor.\n\nIf you reconfigure SJCL, it is recommended that you run the included test\nsuite by typing \"make test\". If this prints \"FAIL\" or segfaults, SJCL\ndoesn't work; please file a bug.\n\n" }, { "path": "README/bsd.txt", "content": "Copyright 2009-2010 Emily Stark, Mike Hamburg, Dan Boneh.\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are\nmet:\n\n 1. Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n\n 2. Redistributions in binary form must reproduce the above\n copyright notice, this list of conditions and the following\n disclaimer in the documentation and/or other materials provided\n with the distribution.\n\nTHIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR\nIMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\nWARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR\nBUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\nWHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE\nOR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN\nIF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\nThe views and conclusions contained in the software and documentation\nare those of the authors and should not be interpreted as representing\nofficial policies, either expressed or implied, of the authors.\n" }, { "path": "README/gpl-2.0.txt", "content": " GNU GENERAL PUBLIC LICENSE\n Version 2, June 1991\n\n Copyright (C) 1989, 1991 Free Software Foundation, Inc.,\n 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n Everyone is permitted to copy and distribute verbatim copies\n of this license document, but changing it is not allowed.\n\n Preamble\n\n The licenses for most software are designed to take away your\nfreedom to share and change it. By contrast, the GNU General Public\nLicense is intended to guarantee your freedom to share and change free\nsoftware--to make sure the software is free for all its users. This\nGeneral Public License applies to most of the Free Software\nFoundation's software and to any other program whose authors commit to\nusing it. (Some other Free Software Foundation software is covered by\nthe GNU Lesser General Public License instead.) You can apply it to\nyour programs, too.\n\n When we speak of free software, we are referring to freedom, not\nprice. Our General Public Licenses are designed to make sure that you\nhave the freedom to distribute copies of free software (and charge for\nthis service if you wish), that you receive source code or can get it\nif you want it, that you can change the software or use pieces of it\nin new free programs; and that you know you can do these things.\n\n To protect your rights, we need to make restrictions that forbid\nanyone to deny you these rights or to ask you to surrender the rights.\nThese restrictions translate to certain responsibilities for you if you\ndistribute copies of the software, or if you modify it.\n\n For example, if you distribute copies of such a program, whether\ngratis or for a fee, you must give the recipients all the rights that\nyou have. You must make sure that they, too, receive or can get the\nsource code. And you must show them these terms so they know their\nrights.\n\n We protect your rights with two steps: (1) copyright the software, and\n(2) offer you this license which gives you legal permission to copy,\ndistribute and/or modify the software.\n\n Also, for each author's protection and ours, we want to make certain\nthat everyone understands that there is no warranty for this free\nsoftware. If the software is modified by someone else and passed on, we\nwant its recipients to know that what they have is not the original, so\nthat any problems introduced by others will not reflect on the original\nauthors' reputations.\n\n Finally, any free program is threatened constantly by software\npatents. We wish to avoid the danger that redistributors of a free\nprogram will individually obtain patent licenses, in effect making the\nprogram proprietary. To prevent this, we have made it clear that any\npatent must be licensed for everyone's free use or not licensed at all.\n\n The precise terms and conditions for copying, distribution and\nmodification follow.\n\n GNU GENERAL PUBLIC LICENSE\n TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION\n\n 0. This License applies to any program or other work which contains\na notice placed by the copyright holder saying it may be distributed\nunder the terms of this General Public License. The \"Program\", below,\nrefers to any such program or work, and a \"work based on the Program\"\nmeans either the Program or any derivative work under copyright law:\nthat is to say, a work containing the Program or a portion of it,\neither verbatim or with modifications and/or translated into another\nlanguage. (Hereinafter, translation is included without limitation in\nthe term \"modification\".) Each licensee is addressed as \"you\".\n\nActivities other than copying, distribution and modification are not\ncovered by this License; they are outside its scope. The act of\nrunning the Program is not restricted, and the output from the Program\nis covered only if its contents constitute a work based on the\nProgram (independent of having been made by running the Program).\nWhether that is true depends on what the Program does.\n\n 1. You may copy and distribute verbatim copies of the Program's\nsource code as you receive it, in any medium, provided that you\nconspicuously and appropriately publish on each copy an appropriate\ncopyright notice and disclaimer of warranty; keep intact all the\nnotices that refer to this License and to the absence of any warranty;\nand give any other recipients of the Program a copy of this License\nalong with the Program.\n\nYou may charge a fee for the physical act of transferring a copy, and\nyou may at your option offer warranty protection in exchange for a fee.\n\n 2. You may modify your copy or copies of the Program or any portion\nof it, thus forming a work based on the Program, and copy and\ndistribute such modifications or work under the terms of Section 1\nabove, provided that you also meet all of these conditions:\n\n a) You must cause the modified files to carry prominent notices\n stating that you changed the files and the date of any change.\n\n b) You must cause any work that you distribute or publish, that in\n whole or in part contains or is derived from the Program or any\n part thereof, to be licensed as a whole at no charge to all third\n parties under the terms of this License.\n\n c) If the modified program normally reads commands interactively\n when run, you must cause it, when started running for such\n interactive use in the most ordinary way, to print or display an\n announcement including an appropriate copyright notice and a\n notice that there is no warranty (or else, saying that you provide\n a warranty) and that users may redistribute the program under\n these conditions, and telling the user how to view a copy of this\n License. (Exception: if the Program itself is interactive but\n does not normally print such an announcement, your work based on\n the Program is not required to print an announcement.)\n\nThese requirements apply to the modified work as a whole. If\nidentifiable sections of that work are not derived from the Program,\nand can be reasonably considered independent and separate works in\nthemselves, then this License, and its terms, do not apply to those\nsections when you distribute them as separate works. But when you\ndistribute the same sections as part of a whole which is a work based\non the Program, the distribution of the whole must be on the terms of\nthis License, whose permissions for other licensees extend to the\nentire whole, and thus to each and every part regardless of who wrote it.\n\nThus, it is not the intent of this section to claim rights or contest\nyour rights to work written entirely by you; rather, the intent is to\nexercise the right to control the distribution of derivative or\ncollective works based on the Program.\n\nIn addition, mere aggregation of another work not based on the Program\nwith the Program (or with a work based on the Program) on a volume of\na storage or distribution medium does not bring the other work under\nthe scope of this License.\n\n 3. You may copy and distribute the Program (or a work based on it,\nunder Section 2) in object code or executable form under the terms of\nSections 1 and 2 above provided that you also do one of the following:\n\n a) Accompany it with the complete corresponding machine-readable\n source code, which must be distributed under the terms of Sections\n 1 and 2 above on a medium customarily used for software interchange; or,\n\n b) Accompany it with a written offer, valid for at least three\n years, to give any third party, for a charge no more than your\n cost of physically performing source distribution, a complete\n machine-readable copy of the corresponding source code, to be\n distributed under the terms of Sections 1 and 2 above on a medium\n customarily used for software interchange; or,\n\n c) Accompany it with the information you received as to the offer\n to distribute corresponding source code. (This alternative is\n allowed only for noncommercial distribution and only if you\n received the program in object code or executable form with such\n an offer, in accord with Subsection b above.)\n\nThe source code for a work means the preferred form of the work for\nmaking modifications to it. For an executable work, complete source\ncode means all the source code for all modules it contains, plus any\nassociated interface definition files, plus the scripts used to\ncontrol compilation and installation of the executable. However, as a\nspecial exception, the source code distributed need not include\nanything that is normally distributed (in either source or binary\nform) with the major components (compiler, kernel, and so on) of the\noperating system on which the executable runs, unless that component\nitself accompanies the executable.\n\nIf distribution of executable or object code is made by offering\naccess to copy from a designated place, then offering equivalent\naccess to copy the source code from the same place counts as\ndistribution of the source code, even though third parties are not\ncompelled to copy the source along with the object code.\n\n 4. You may not copy, modify, sublicense, or distribute the Program\nexcept as expressly provided under this License. Any attempt\notherwise to copy, modify, sublicense or distribute the Program is\nvoid, and will automatically terminate your rights under this License.\nHowever, parties who have received copies, or rights, from you under\nthis License will not have their licenses terminated so long as such\nparties remain in full compliance.\n\n 5. You are not required to accept this License, since you have not\nsigned it. However, nothing else grants you permission to modify or\ndistribute the Program or its derivative works. These actions are\nprohibited by law if you do not accept this License. Therefore, by\nmodifying or distributing the Program (or any work based on the\nProgram), you indicate your acceptance of this License to do so, and\nall its terms and conditions for copying, distributing or modifying\nthe Program or works based on it.\n\n 6. Each time you redistribute the Program (or any work based on the\nProgram), the recipient automatically receives a license from the\noriginal licensor to copy, distribute or modify the Program subject to\nthese terms and conditions. You may not impose any further\nrestrictions on the recipients' exercise of the rights granted herein.\nYou are not responsible for enforcing compliance by third parties to\nthis License.\n\n 7. If, as a consequence of a court judgment or allegation of patent\ninfringement or for any other reason (not limited to patent issues),\nconditions are imposed on you (whether by court order, agreement or\notherwise) that contradict the conditions of this License, they do not\nexcuse you from the conditions of this License. If you cannot\ndistribute so as to satisfy simultaneously your obligations under this\nLicense and any other pertinent obligations, then as a consequence you\nmay not distribute the Program at all. For example, if a patent\nlicense would not permit royalty-free redistribution of the Program by\nall those who receive copies directly or indirectly through you, then\nthe only way you could satisfy both it and this License would be to\nrefrain entirely from distribution of the Program.\n\nIf any portion of this section is held invalid or unenforceable under\nany particular circumstance, the balance of the section is intended to\napply and the section as a whole is intended to apply in other\ncircumstances.\n\nIt is not the purpose of this section to induce you to infringe any\npatents or other property right claims or to contest validity of any\nsuch claims; this section has the sole purpose of protecting the\nintegrity of the free software distribution system, which is\nimplemented by public license practices. Many people have made\ngenerous contributions to the wide range of software distributed\nthrough that system in reliance on consistent application of that\nsystem; it is up to the author/donor to decide if he or she is willing\nto distribute software through any other system and a licensee cannot\nimpose that choice.\n\nThis section is intended to make thoroughly clear what is believed to\nbe a consequence of the rest of this License.\n\n 8. If the distribution and/or use of the Program is restricted in\ncertain countries either by patents or by copyrighted interfaces, the\noriginal copyright holder who places the Program under this License\nmay add an explicit geographical distribution limitation excluding\nthose countries, so that distribution is permitted only in or among\ncountries not thus excluded. In such case, this License incorporates\nthe limitation as if written in the body of this License.\n\n 9. The Free Software Foundation may publish revised and/or new versions\nof the General Public License from time to time. Such new versions will\nbe similar in spirit to the present version, but may differ in detail to\naddress new problems or concerns.\n\nEach version is given a distinguishing version number. If the Program\nspecifies a version number of this License which applies to it and \"any\nlater version\", you have the option of following the terms and conditions\neither of that version or of any later version published by the Free\nSoftware Foundation. If the Program does not specify a version number of\nthis License, you may choose any version ever published by the Free Software\nFoundation.\n\n 10. If you wish to incorporate parts of the Program into other free\nprograms whose distribution conditions are different, write to the author\nto ask for permission. For software which is copyrighted by the Free\nSoftware Foundation, write to the Free Software Foundation; we sometimes\nmake exceptions for this. Our decision will be guided by the two goals\nof preserving the free status of all derivatives of our free software and\nof promoting the sharing and reuse of software generally.\n\n NO WARRANTY\n\n 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY\nFOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN\nOTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES\nPROVIDE THE PROGRAM \"AS IS\" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED\nOR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF\nMERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS\nTO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE\nPROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,\nREPAIR OR CORRECTION.\n\n 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING\nWILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR\nREDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,\nINCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING\nOUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED\nTO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY\nYOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER\nPROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGES.\n\n END OF TERMS AND CONDITIONS\n\n How to Apply These Terms to Your New Programs\n\n If you develop a new program, and you want it to be of the greatest\npossible use to the public, the best way to achieve this is to make it\nfree software which everyone can redistribute and change under these terms.\n\n To do so, attach the following notices to the program. It is safest\nto attach them to the start of each source file to most effectively\nconvey the exclusion of warranty; and each file should have at least\nthe \"copyright\" line and a pointer to where the full notice is found.\n\n \n Copyright (C) \n\n This program is free software; you can redistribute it and/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation; either version 2 of the License, or\n (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License along\n with this program; if not, write to the Free Software Foundation, Inc.,\n 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.\n\nAlso add information on how to contact you by electronic and paper mail.\n\nIf the program is interactive, make it output a short notice like this\nwhen it starts in an interactive mode:\n\n Gnomovision version 69, Copyright (C) year name of author\n Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.\n This is free software, and you are welcome to redistribute it\n under certain conditions; type `show c' for details.\n\nThe hypothetical commands `show w' and `show c' should show the appropriate\nparts of the General Public License. Of course, the commands you use may\nbe called something other than `show w' and `show c'; they could even be\nmouse-clicks or menu items--whatever suits your program.\n\nYou should also get your employer (if you work as a programmer) or your\nschool, if any, to sign a \"copyright disclaimer\" for the program, if\nnecessary. Here is a sample; alter the names:\n\n Yoyodyne, Inc., hereby disclaims all copyright interest in the program\n `Gnomovision' (which makes passes at compilers) written by James Hacker.\n\n , 1 April 1989\n Ty Coon, President of Vice\n\nThis General Public License does not permit incorporating your program into\nproprietary programs. If your program is a subroutine library, you may\nconsider it more useful to permit linking proprietary applications with the\nlibrary. If this is what you want to do, use the GNU Lesser General\nPublic License instead of this License.\n" }, { "path": "README/gpl-3.0.txt", "content": " GNU GENERAL PUBLIC LICENSE\n Version 3, 29 June 2007\n\n Copyright (C) 2007 Free Software Foundation, Inc. \n Everyone is permitted to copy and distribute verbatim copies\n of this license document, but changing it is not allowed.\n\n Preamble\n\n The GNU General Public License is a free, copyleft license for\nsoftware and other kinds of works.\n\n The licenses for most software and other practical works are designed\nto take away your freedom to share and change the works. By contrast,\nthe GNU General Public License is intended to guarantee your freedom to\nshare and change all versions of a program--to make sure it remains free\nsoftware for all its users. We, the Free Software Foundation, use the\nGNU General Public License for most of our software; it applies also to\nany other work released this way by its authors. You can apply it to\nyour programs, too.\n\n When we speak of free software, we are referring to freedom, not\nprice. Our General Public Licenses are designed to make sure that you\nhave the freedom to distribute copies of free software (and charge for\nthem if you wish), that you receive source code or can get it if you\nwant it, that you can change the software or use pieces of it in new\nfree programs, and that you know you can do these things.\n\n To protect your rights, we need to prevent others from denying you\nthese rights or asking you to surrender the rights. Therefore, you have\ncertain responsibilities if you distribute copies of the software, or if\nyou modify it: responsibilities to respect the freedom of others.\n\n For example, if you distribute copies of such a program, whether\ngratis or for a fee, you must pass on to the recipients the same\nfreedoms that you received. You must make sure that they, too, receive\nor can get the source code. And you must show them these terms so they\nknow their rights.\n\n Developers that use the GNU GPL protect your rights with two steps:\n(1) assert copyright on the software, and (2) offer you this License\ngiving you legal permission to copy, distribute and/or modify it.\n\n For the developers' and authors' protection, the GPL clearly explains\nthat there is no warranty for this free software. For both users' and\nauthors' sake, the GPL requires that modified versions be marked as\nchanged, so that their problems will not be attributed erroneously to\nauthors of previous versions.\n\n Some devices are designed to deny users access to install or run\nmodified versions of the software inside them, although the manufacturer\ncan do so. This is fundamentally incompatible with the aim of\nprotecting users' freedom to change the software. The systematic\npattern of such abuse occurs in the area of products for individuals to\nuse, which is precisely where it is most unacceptable. Therefore, we\nhave designed this version of the GPL to prohibit the practice for those\nproducts. If such problems arise substantially in other domains, we\nstand ready to extend this provision to those domains in future versions\nof the GPL, as needed to protect the freedom of users.\n\n Finally, every program is threatened constantly by software patents.\nStates should not allow patents to restrict development and use of\nsoftware on general-purpose computers, but in those that do, we wish to\navoid the special danger that patents applied to a free program could\nmake it effectively proprietary. To prevent this, the GPL assures that\npatents cannot be used to render the program non-free.\n\n The precise terms and conditions for copying, distribution and\nmodification follow.\n\n TERMS AND CONDITIONS\n\n 0. Definitions.\n\n \"This License\" refers to version 3 of the GNU General Public License.\n\n \"Copyright\" also means copyright-like laws that apply to other kinds of\nworks, such as semiconductor masks.\n\n \"The Program\" refers to any copyrightable work licensed under this\nLicense. Each licensee is addressed as \"you\". \"Licensees\" and\n\"recipients\" may be individuals or organizations.\n\n To \"modify\" a work means to copy from or adapt all or part of the work\nin a fashion requiring copyright permission, other than the making of an\nexact copy. The resulting work is called a \"modified version\" of the\nearlier work or a work \"based on\" the earlier work.\n\n A \"covered work\" means either the unmodified Program or a work based\non the Program.\n\n To \"propagate\" a work means to do anything with it that, without\npermission, would make you directly or secondarily liable for\ninfringement under applicable copyright law, except executing it on a\ncomputer or modifying a private copy. Propagation includes copying,\ndistribution (with or without modification), making available to the\npublic, and in some countries other activities as well.\n\n To \"convey\" a work means any kind of propagation that enables other\nparties to make or receive copies. Mere interaction with a user through\na computer network, with no transfer of a copy, is not conveying.\n\n An interactive user interface displays \"Appropriate Legal Notices\"\nto the extent that it includes a convenient and prominently visible\nfeature that (1) displays an appropriate copyright notice, and (2)\ntells the user that there is no warranty for the work (except to the\nextent that warranties are provided), that licensees may convey the\nwork under this License, and how to view a copy of this License. If\nthe interface presents a list of user commands or options, such as a\nmenu, a prominent item in the list meets this criterion.\n\n 1. Source Code.\n\n The \"source code\" for a work means the preferred form of the work\nfor making modifications to it. \"Object code\" means any non-source\nform of a work.\n\n A \"Standard Interface\" means an interface that either is an official\nstandard defined by a recognized standards body, or, in the case of\ninterfaces specified for a particular programming language, one that\nis widely used among developers working in that language.\n\n The \"System Libraries\" of an executable work include anything, other\nthan the work as a whole, that (a) is included in the normal form of\npackaging a Major Component, but which is not part of that Major\nComponent, and (b) serves only to enable use of the work with that\nMajor Component, or to implement a Standard Interface for which an\nimplementation is available to the public in source code form. A\n\"Major Component\", in this context, means a major essential component\n(kernel, window system, and so on) of the specific operating system\n(if any) on which the executable work runs, or a compiler used to\nproduce the work, or an object code interpreter used to run it.\n\n The \"Corresponding Source\" for a work in object code form means all\nthe source code needed to generate, install, and (for an executable\nwork) run the object code and to modify the work, including scripts to\ncontrol those activities. However, it does not include the work's\nSystem Libraries, or general-purpose tools or generally available free\nprograms which are used unmodified in performing those activities but\nwhich are not part of the work. For example, Corresponding Source\nincludes interface definition files associated with source files for\nthe work, and the source code for shared libraries and dynamically\nlinked subprograms that the work is specifically designed to require,\nsuch as by intimate data communication or control flow between those\nsubprograms and other parts of the work.\n\n The Corresponding Source need not include anything that users\ncan regenerate automatically from other parts of the Corresponding\nSource.\n\n The Corresponding Source for a work in source code form is that\nsame work.\n\n 2. Basic Permissions.\n\n All rights granted under this License are granted for the term of\ncopyright on the Program, and are irrevocable provided the stated\nconditions are met. This License explicitly affirms your unlimited\npermission to run the unmodified Program. The output from running a\ncovered work is covered by this License only if the output, given its\ncontent, constitutes a covered work. This License acknowledges your\nrights of fair use or other equivalent, as provided by copyright law.\n\n You may make, run and propagate covered works that you do not\nconvey, without conditions so long as your license otherwise remains\nin force. You may convey covered works to others for the sole purpose\nof having them make modifications exclusively for you, or provide you\nwith facilities for running those works, provided that you comply with\nthe terms of this License in conveying all material for which you do\nnot control copyright. Those thus making or running the covered works\nfor you must do so exclusively on your behalf, under your direction\nand control, on terms that prohibit them from making any copies of\nyour copyrighted material outside their relationship with you.\n\n Conveying under any other circumstances is permitted solely under\nthe conditions stated below. Sublicensing is not allowed; section 10\nmakes it unnecessary.\n\n 3. Protecting Users' Legal Rights From Anti-Circumvention Law.\n\n No covered work shall be deemed part of an effective technological\nmeasure under any applicable law fulfilling obligations under article\n11 of the WIPO copyright treaty adopted on 20 December 1996, or\nsimilar laws prohibiting or restricting circumvention of such\nmeasures.\n\n When you convey a covered work, you waive any legal power to forbid\ncircumvention of technological measures to the extent such circumvention\nis effected by exercising rights under this License with respect to\nthe covered work, and you disclaim any intention to limit operation or\nmodification of the work as a means of enforcing, against the work's\nusers, your or third parties' legal rights to forbid circumvention of\ntechnological measures.\n\n 4. Conveying Verbatim Copies.\n\n You may convey verbatim copies of the Program's source code as you\nreceive it, in any medium, provided that you conspicuously and\nappropriately publish on each copy an appropriate copyright notice;\nkeep intact all notices stating that this License and any\nnon-permissive terms added in accord with section 7 apply to the code;\nkeep intact all notices of the absence of any warranty; and give all\nrecipients a copy of this License along with the Program.\n\n You may charge any price or no price for each copy that you convey,\nand you may offer support or warranty protection for a fee.\n\n 5. Conveying Modified Source Versions.\n\n You may convey a work based on the Program, or the modifications to\nproduce it from the Program, in the form of source code under the\nterms of section 4, provided that you also meet all of these conditions:\n\n a) The work must carry prominent notices stating that you modified\n it, and giving a relevant date.\n\n b) The work must carry prominent notices stating that it is\n released under this License and any conditions added under section\n 7. This requirement modifies the requirement in section 4 to\n \"keep intact all notices\".\n\n c) You must license the entire work, as a whole, under this\n License to anyone who comes into possession of a copy. This\n License will therefore apply, along with any applicable section 7\n additional terms, to the whole of the work, and all its parts,\n regardless of how they are packaged. This License gives no\n permission to license the work in any other way, but it does not\n invalidate such permission if you have separately received it.\n\n d) If the work has interactive user interfaces, each must display\n Appropriate Legal Notices; however, if the Program has interactive\n interfaces that do not display Appropriate Legal Notices, your\n work need not make them do so.\n\n A compilation of a covered work with other separate and independent\nworks, which are not by their nature extensions of the covered work,\nand which are not combined with it such as to form a larger program,\nin or on a volume of a storage or distribution medium, is called an\n\"aggregate\" if the compilation and its resulting copyright are not\nused to limit the access or legal rights of the compilation's users\nbeyond what the individual works permit. Inclusion of a covered work\nin an aggregate does not cause this License to apply to the other\nparts of the aggregate.\n\n 6. Conveying Non-Source Forms.\n\n You may convey a covered work in object code form under the terms\nof sections 4 and 5, provided that you also convey the\nmachine-readable Corresponding Source under the terms of this License,\nin one of these ways:\n\n a) Convey the object code in, or embodied in, a physical product\n (including a physical distribution medium), accompanied by the\n Corresponding Source fixed on a durable physical medium\n customarily used for software interchange.\n\n b) Convey the object code in, or embodied in, a physical product\n (including a physical distribution medium), accompanied by a\n written offer, valid for at least three years and valid for as\n long as you offer spare parts or customer support for that product\n model, to give anyone who possesses the object code either (1) a\n copy of the Corresponding Source for all the software in the\n product that is covered by this License, on a durable physical\n medium customarily used for software interchange, for a price no\n more than your reasonable cost of physically performing this\n conveying of source, or (2) access to copy the\n Corresponding Source from a network server at no charge.\n\n c) Convey individual copies of the object code with a copy of the\n written offer to provide the Corresponding Source. This\n alternative is allowed only occasionally and noncommercially, and\n only if you received the object code with such an offer, in accord\n with subsection 6b.\n\n d) Convey the object code by offering access from a designated\n place (gratis or for a charge), and offer equivalent access to the\n Corresponding Source in the same way through the same place at no\n further charge. You need not require recipients to copy the\n Corresponding Source along with the object code. If the place to\n copy the object code is a network server, the Corresponding Source\n may be on a different server (operated by you or a third party)\n that supports equivalent copying facilities, provided you maintain\n clear directions next to the object code saying where to find the\n Corresponding Source. Regardless of what server hosts the\n Corresponding Source, you remain obligated to ensure that it is\n available for as long as needed to satisfy these requirements.\n\n e) Convey the object code using peer-to-peer transmission, provided\n you inform other peers where the object code and Corresponding\n Source of the work are being offered to the general public at no\n charge under subsection 6d.\n\n A separable portion of the object code, whose source code is excluded\nfrom the Corresponding Source as a System Library, need not be\nincluded in conveying the object code work.\n\n A \"User Product\" is either (1) a \"consumer product\", which means any\ntangible personal property which is normally used for personal, family,\nor household purposes, or (2) anything designed or sold for incorporation\ninto a dwelling. In determining whether a product is a consumer product,\ndoubtful cases shall be resolved in favor of coverage. For a particular\nproduct received by a particular user, \"normally used\" refers to a\ntypical or common use of that class of product, regardless of the status\nof the particular user or of the way in which the particular user\nactually uses, or expects or is expected to use, the product. A product\nis a consumer product regardless of whether the product has substantial\ncommercial, industrial or non-consumer uses, unless such uses represent\nthe only significant mode of use of the product.\n\n \"Installation Information\" for a User Product means any methods,\nprocedures, authorization keys, or other information required to install\nand execute modified versions of a covered work in that User Product from\na modified version of its Corresponding Source. The information must\nsuffice to ensure that the continued functioning of the modified object\ncode is in no case prevented or interfered with solely because\nmodification has been made.\n\n If you convey an object code work under this section in, or with, or\nspecifically for use in, a User Product, and the conveying occurs as\npart of a transaction in which the right of possession and use of the\nUser Product is transferred to the recipient in perpetuity or for a\nfixed term (regardless of how the transaction is characterized), the\nCorresponding Source conveyed under this section must be accompanied\nby the Installation Information. But this requirement does not apply\nif neither you nor any third party retains the ability to install\nmodified object code on the User Product (for example, the work has\nbeen installed in ROM).\n\n The requirement to provide Installation Information does not include a\nrequirement to continue to provide support service, warranty, or updates\nfor a work that has been modified or installed by the recipient, or for\nthe User Product in which it has been modified or installed. Access to a\nnetwork may be denied when the modification itself materially and\nadversely affects the operation of the network or violates the rules and\nprotocols for communication across the network.\n\n Corresponding Source conveyed, and Installation Information provided,\nin accord with this section must be in a format that is publicly\ndocumented (and with an implementation available to the public in\nsource code form), and must require no special password or key for\nunpacking, reading or copying.\n\n 7. Additional Terms.\n\n \"Additional permissions\" are terms that supplement the terms of this\nLicense by making exceptions from one or more of its conditions.\nAdditional permissions that are applicable to the entire Program shall\nbe treated as though they were included in this License, to the extent\nthat they are valid under applicable law. If additional permissions\napply only to part of the Program, that part may be used separately\nunder those permissions, but the entire Program remains governed by\nthis License without regard to the additional permissions.\n\n When you convey a copy of a covered work, you may at your option\nremove any additional permissions from that copy, or from any part of\nit. (Additional permissions may be written to require their own\nremoval in certain cases when you modify the work.) You may place\nadditional permissions on material, added by you to a covered work,\nfor which you have or can give appropriate copyright permission.\n\n Notwithstanding any other provision of this License, for material you\nadd to a covered work, you may (if authorized by the copyright holders of\nthat material) supplement the terms of this License with terms:\n\n a) Disclaiming warranty or limiting liability differently from the\n terms of sections 15 and 16 of this License; or\n\n b) Requiring preservation of specified reasonable legal notices or\n author attributions in that material or in the Appropriate Legal\n Notices displayed by works containing it; or\n\n c) Prohibiting misrepresentation of the origin of that material, or\n requiring that modified versions of such material be marked in\n reasonable ways as different from the original version; or\n\n d) Limiting the use for publicity purposes of names of licensors or\n authors of the material; or\n\n e) Declining to grant rights under trademark law for use of some\n trade names, trademarks, or service marks; or\n\n f) Requiring indemnification of licensors and authors of that\n material by anyone who conveys the material (or modified versions of\n it) with contractual assumptions of liability to the recipient, for\n any liability that these contractual assumptions directly impose on\n those licensors and authors.\n\n All other non-permissive additional terms are considered \"further\nrestrictions\" within the meaning of section 10. If the Program as you\nreceived it, or any part of it, contains a notice stating that it is\ngoverned by this License along with a term that is a further\nrestriction, you may remove that term. If a license document contains\na further restriction but permits relicensing or conveying under this\nLicense, you may add to a covered work material governed by the terms\nof that license document, provided that the further restriction does\nnot survive such relicensing or conveying.\n\n If you add terms to a covered work in accord with this section, you\nmust place, in the relevant source files, a statement of the\nadditional terms that apply to those files, or a notice indicating\nwhere to find the applicable terms.\n\n Additional terms, permissive or non-permissive, may be stated in the\nform of a separately written license, or stated as exceptions;\nthe above requirements apply either way.\n\n 8. Termination.\n\n You may not propagate or modify a covered work except as expressly\nprovided under this License. Any attempt otherwise to propagate or\nmodify it is void, and will automatically terminate your rights under\nthis License (including any patent licenses granted under the third\nparagraph of section 11).\n\n However, if you cease all violation of this License, then your\nlicense from a particular copyright holder is reinstated (a)\nprovisionally, unless and until the copyright holder explicitly and\nfinally terminates your license, and (b) permanently, if the copyright\nholder fails to notify you of the violation by some reasonable means\nprior to 60 days after the cessation.\n\n Moreover, your license from a particular copyright holder is\nreinstated permanently if the copyright holder notifies you of the\nviolation by some reasonable means, this is the first time you have\nreceived notice of violation of this License (for any work) from that\ncopyright holder, and you cure the violation prior to 30 days after\nyour receipt of the notice.\n\n Termination of your rights under this section does not terminate the\nlicenses of parties who have received copies or rights from you under\nthis License. If your rights have been terminated and not permanently\nreinstated, you do not qualify to receive new licenses for the same\nmaterial under section 10.\n\n 9. Acceptance Not Required for Having Copies.\n\n You are not required to accept this License in order to receive or\nrun a copy of the Program. Ancillary propagation of a covered work\noccurring solely as a consequence of using peer-to-peer transmission\nto receive a copy likewise does not require acceptance. However,\nnothing other than this License grants you permission to propagate or\nmodify any covered work. These actions infringe copyright if you do\nnot accept this License. Therefore, by modifying or propagating a\ncovered work, you indicate your acceptance of this License to do so.\n\n 10. Automatic Licensing of Downstream Recipients.\n\n Each time you convey a covered work, the recipient automatically\nreceives a license from the original licensors, to run, modify and\npropagate that work, subject to this License. You are not responsible\nfor enforcing compliance by third parties with this License.\n\n An \"entity transaction\" is a transaction transferring control of an\norganization, or substantially all assets of one, or subdividing an\norganization, or merging organizations. If propagation of a covered\nwork results from an entity transaction, each party to that\ntransaction who receives a copy of the work also receives whatever\nlicenses to the work the party's predecessor in interest had or could\ngive under the previous paragraph, plus a right to possession of the\nCorresponding Source of the work from the predecessor in interest, if\nthe predecessor has it or can get it with reasonable efforts.\n\n You may not impose any further restrictions on the exercise of the\nrights granted or affirmed under this License. For example, you may\nnot impose a license fee, royalty, or other charge for exercise of\nrights granted under this License, and you may not initiate litigation\n(including a cross-claim or counterclaim in a lawsuit) alleging that\nany patent claim is infringed by making, using, selling, offering for\nsale, or importing the Program or any portion of it.\n\n 11. Patents.\n\n A \"contributor\" is a copyright holder who authorizes use under this\nLicense of the Program or a work on which the Program is based. The\nwork thus licensed is called the contributor's \"contributor version\".\n\n A contributor's \"essential patent claims\" are all patent claims\nowned or controlled by the contributor, whether already acquired or\nhereafter acquired, that would be infringed by some manner, permitted\nby this License, of making, using, or selling its contributor version,\nbut do not include claims that would be infringed only as a\nconsequence of further modification of the contributor version. For\npurposes of this definition, \"control\" includes the right to grant\npatent sublicenses in a manner consistent with the requirements of\nthis License.\n\n Each contributor grants you a non-exclusive, worldwide, royalty-free\npatent license under the contributor's essential patent claims, to\nmake, use, sell, offer for sale, import and otherwise run, modify and\npropagate the contents of its contributor version.\n\n In the following three paragraphs, a \"patent license\" is any express\nagreement or commitment, however denominated, not to enforce a patent\n(such as an express permission to practice a patent or covenant not to\nsue for patent infringement). To \"grant\" such a patent license to a\nparty means to make such an agreement or commitment not to enforce a\npatent against the party.\n\n If you convey a covered work, knowingly relying on a patent license,\nand the Corresponding Source of the work is not available for anyone\nto copy, free of charge and under the terms of this License, through a\npublicly available network server or other readily accessible means,\nthen you must either (1) cause the Corresponding Source to be so\navailable, or (2) arrange to deprive yourself of the benefit of the\npatent license for this particular work, or (3) arrange, in a manner\nconsistent with the requirements of this License, to extend the patent\nlicense to downstream recipients. \"Knowingly relying\" means you have\nactual knowledge that, but for the patent license, your conveying the\ncovered work in a country, or your recipient's use of the covered work\nin a country, would infringe one or more identifiable patents in that\ncountry that you have reason to believe are valid.\n\n If, pursuant to or in connection with a single transaction or\narrangement, you convey, or propagate by procuring conveyance of, a\ncovered work, and grant a patent license to some of the parties\nreceiving the covered work authorizing them to use, propagate, modify\nor convey a specific copy of the covered work, then the patent license\nyou grant is automatically extended to all recipients of the covered\nwork and works based on it.\n\n A patent license is \"discriminatory\" if it does not include within\nthe scope of its coverage, prohibits the exercise of, or is\nconditioned on the non-exercise of one or more of the rights that are\nspecifically granted under this License. You may not convey a covered\nwork if you are a party to an arrangement with a third party that is\nin the business of distributing software, under which you make payment\nto the third party based on the extent of your activity of conveying\nthe work, and under which the third party grants, to any of the\nparties who would receive the covered work from you, a discriminatory\npatent license (a) in connection with copies of the covered work\nconveyed by you (or copies made from those copies), or (b) primarily\nfor and in connection with specific products or compilations that\ncontain the covered work, unless you entered into that arrangement,\nor that patent license was granted, prior to 28 March 2007.\n\n Nothing in this License shall be construed as excluding or limiting\nany implied license or other defenses to infringement that may\notherwise be available to you under applicable patent law.\n\n 12. No Surrender of Others' Freedom.\n\n If conditions are imposed on you (whether by court order, agreement or\notherwise) that contradict the conditions of this License, they do not\nexcuse you from the conditions of this License. If you cannot convey a\ncovered work so as to satisfy simultaneously your obligations under this\nLicense and any other pertinent obligations, then as a consequence you may\nnot convey it at all. For example, if you agree to terms that obligate you\nto collect a royalty for further conveying from those to whom you convey\nthe Program, the only way you could satisfy both those terms and this\nLicense would be to refrain entirely from conveying the Program.\n\n 13. Use with the GNU Affero General Public License.\n\n Notwithstanding any other provision of this License, you have\npermission to link or combine any covered work with a work licensed\nunder version 3 of the GNU Affero General Public License into a single\ncombined work, and to convey the resulting work. The terms of this\nLicense will continue to apply to the part which is the covered work,\nbut the special requirements of the GNU Affero General Public License,\nsection 13, concerning interaction through a network will apply to the\ncombination as such.\n\n 14. Revised Versions of this License.\n\n The Free Software Foundation may publish revised and/or new versions of\nthe GNU General Public License from time to time. Such new versions will\nbe similar in spirit to the present version, but may differ in detail to\naddress new problems or concerns.\n\n Each version is given a distinguishing version number. If the\nProgram specifies that a certain numbered version of the GNU General\nPublic License \"or any later version\" applies to it, you have the\noption of following the terms and conditions either of that numbered\nversion or of any later version published by the Free Software\nFoundation. If the Program does not specify a version number of the\nGNU General Public License, you may choose any version ever published\nby the Free Software Foundation.\n\n If the Program specifies that a proxy can decide which future\nversions of the GNU General Public License can be used, that proxy's\npublic statement of acceptance of a version permanently authorizes you\nto choose that version for the Program.\n\n Later license versions may give you additional or different\npermissions. However, no additional obligations are imposed on any\nauthor or copyright holder as a result of your choosing to follow a\nlater version.\n\n 15. Disclaimer of Warranty.\n\n THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY\nAPPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT\nHOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM \"AS IS\" WITHOUT WARRANTY\nOF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,\nTHE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\nPURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM\nIS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF\nALL NECESSARY SERVICING, REPAIR OR CORRECTION.\n\n 16. Limitation of Liability.\n\n IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING\nWILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS\nTHE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY\nGENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE\nUSE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF\nDATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD\nPARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),\nEVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF\nSUCH DAMAGES.\n\n 17. Interpretation of Sections 15 and 16.\n\n If the disclaimer of warranty and limitation of liability provided\nabove cannot be given local legal effect according to their terms,\nreviewing courts shall apply local law that most closely approximates\nan absolute waiver of all civil liability in connection with the\nProgram, unless a warranty or assumption of liability accompanies a\ncopy of the Program in return for a fee.\n\n END OF TERMS AND CONDITIONS\n\n How to Apply These Terms to Your New Programs\n\n If you develop a new program, and you want it to be of the greatest\npossible use to the public, the best way to achieve this is to make it\nfree software which everyone can redistribute and change under these terms.\n\n To do so, attach the following notices to the program. It is safest\nto attach them to the start of each source file to most effectively\nstate the exclusion of warranty; and each file should have at least\nthe \"copyright\" line and a pointer to where the full notice is found.\n\n \n Copyright (C) \n\n This program is free software: you can redistribute it and/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation, either version 3 of the License, or\n (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with this program. If not, see .\n\nAlso add information on how to contact you by electronic and paper mail.\n\n If the program does terminal interaction, make it output a short\nnotice like this when it starts in an interactive mode:\n\n Copyright (C) \n This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.\n This is free software, and you are welcome to redistribute it\n under certain conditions; type `show c' for details.\n\nThe hypothetical commands `show w' and `show c' should show the appropriate\nparts of the General Public License. Of course, your program's commands\nmight be different; for a GUI interface, you would use an \"about box\".\n\n You should also get your employer (if you work as a programmer) or school,\nif any, to sign a \"copyright disclaimer\" for the program, if necessary.\nFor more information on this, and how to apply and follow the GNU GPL, see\n.\n\n The GNU General Public License does not permit incorporating your program\ninto proprietary programs. If your program is a subroutine library, you\nmay consider it more useful to permit linking proprietary applications with\nthe library. If this is what you want to do, use the GNU Lesser General\nPublic License instead of this License. But first, please read\n.\n" }, { "path": "README.md", "content": "[DEPRECATED] sjcl\n====\n\nDeprecation status\n====\nHaving not been updated in many years (except to fix one serious vulnerability, described below), sjcl is deprecated. Please do not use it in new projects, and consider instead a more modern alternative.\n\n[![Build Status](https://travis-ci.org/bitwiseshiftleft/sjcl.png)](https://travis-ci.org/bitwiseshiftleft/sjcl)\n\n[![Join the chat at https://gitter.im/bitwiseshiftleft/sjcl](https://badges.gitter.im/Join%20Chat.svg)](https://gitter.im/bitwiseshiftleft/sjcl?utm_source=badge&utm_medium=badge&utm_campaign=pr-badge&utm_content=badge)\n\nStanford Javascript Crypto Library\n\nSecurity Advisories\n===\n\n* 12.02.2014: the current development version has a paranoia bug in the ecc module. The bug was introduced in commit [ac0b3fe0](https://github.com/bitwiseshiftleft/sjcl/commit/ac0b3fe0) and might affect ecc key generation on platforms without a platform random number generator.\n\n* 03.08.2026: According to https://gist.github.com/Kr0emer/2560f98edb10b0b34f2438cd63913c47, sjcl is vulnerable due to missing point-on-curve validation in `sjcl.ecc.basicKey.publicKey()`. An attacker can recover a victim's ECDH private key by sending crafted off-curve public keys and observing ECDH outputs. The `dhJavaEc()` function directly returns the raw x-coordinate of the scalar multiplication result (no hashing), providing a plaintext oracle without requiring any decryption feedback. This bug is fixed in SJCL 1.0.9. Thanks to Kr0emer for reporting it, and to the the Snyk security team for relaying this information.\n\nSecurity Contact\n====\nSecurity Mail: sjcl@ovt.me \nOpenPGP-Key Fingerprint: 0D54 3E52 87B4 EC06 3FA9 0115 72ED A6C7 7AAF 48ED \nKeyserver: pool.sks-keyservers.net \n\nUpgrade Guide\n====\n\n## 1.0.3 -> 1.0.4\n\n`codecBase32` has been re-enabled with changes to conform to [RFC 4648](http://tools.ietf.org/html/rfc4648#section-6):\n\n* Padding with `=` is now applied to the output of `fromBits`. If you don't want that padding, you can disable it by calling `fromBits` with a second parameter of `true` or anything that evaluates as \"truthy\" in JS\n* The encoding alphabet for `sjcl.codec.base32` now matches that specified by the RFC, rather than the extended hex alphabet.\n* The former extended hex alphabet is now available through `sjcl.codec.base32hex` (also matching the RFC). So if you encoded something with `base32` before, you'll want to decode it with `base32hex` now.\n\nDocumentation\n====\nThe documentation is available [here](http://bitwiseshiftleft.github.io/sjcl/doc/)\n" }, { "path": "bower.json", "content": "{\n \"name\": \"sjcl\",\n \"version\": \"1.0.8\",\n \"main\": [\"./sjcl.js\"]\n}\n" }, { "path": "browserTest/browserTest.html", "content": "\n \n\n\n SJCL browser test\n \n \n \n\n\n

SJCL browser test

\n
Waiting for tests to begin...
\n
\n\n\n" }, { "path": "browserTest/browserUtil.js", "content": "browserUtil = {};\n\nbrowserUtil.isNodeJS = (typeof(window) === 'undefined');\n\n/**\n * Pause (for the graphics to update and the script timer to clear), then run the\n * specified action.\n */\nbrowserUtil.pauseAndThen = function (cb) {\n cb && window.setTimeout(cb, 1);\n};\n\n/**\n * Iterate using continuation-passing style.\n */\nbrowserUtil.cpsIterate = function (f, start, end, pause, callback) {\n var pat = pause ? browserUtil.pauseAndThen : function (cb) { cb && cb(); };\n function go() {\n var called = false;\n if (start >= end) {\n pat(callback);\n } else {\n pat(function () { f(start, function () {\n if (!called) { called = true; start++; go(); }\n }); });\n }\n }\n go (start);\n};\n\n/**\n * Map a function over an array using continuation-passing style.\n */\nbrowserUtil.cpsMap = function (map, list, pause, callback) {\n browserUtil.cpsIterate(function (i, cb) { map(list[i], i, list.length, cb); },\n 0, list.length, pause, callback);\n};\n\n/** Cache for remotely loaded scripts. */\nbrowserUtil.scriptCache = {};\n\n/** Load several scripts, then call back */\nbrowserUtil.loadScripts = function(scriptNames, cbSuccess, cbError) {\n var head = document.getElementsByTagName('head')[0];\n browserUtil.cpsMap(function (script, i, n, cb) {\n var scriptE = document.createElement('script'), xhr, loaded = false;\n \n browserUtil.status(\"Loading script \" + script);\n \n if (window.location.protocol === \"file:\") {\n /* Can't make an AJAX request for files.\n * But, we know the load time will be short, so timeout-based error\n * detection is fine.\n */\n scriptE.onload = function () {\n loaded = true;\n cb();\n };\n scriptE.onerror = function(err) {\n cbError && cbError(script, err, cb);\n };\n script.onreadystatechange = function() {\n if (this.readyState == 'complete' || this.readyState == 'loaded') {\n loaded = true;\n cb();\n }\n };\n scriptE.type = 'text/javascript';\n scriptE.src = script+\"?\"+(new Date().valueOf());\n window.setTimeout(function () {\n loaded || cbError && cbError(script, \"timeout expired\", cb);\n }, 100);\n head.appendChild(scriptE);\n } else if (browserUtil.scriptCache[script] !== undefined) {\n try {\n scriptE.appendChild(document.createTextNode(browserUtil.scriptCache[script]));\n } catch (e) {\n scriptE.text = browserUtil.scriptCache[script];\n }\n head.appendChild(scriptE);\n cb();\n } else {\n var xhr;\n if (window.XMLHttpRequest) {\n xhr = new XMLHttpRequest;\n } else if (window.ActiveXObject) {\n xhr = new ActiveXObject(\"Microsoft.XMLHTTP\");\n }\n xhr.onreadystatechange = function() {\n if (xhr.readyState == 4) {\n if (xhr.status == 200) {\n browserUtil.scriptCache[script] = xhr.responseText;\n try {\n scriptE.appendChild(document.createTextNode(xhr.responseText));\n } catch (e) {\n scriptE.text = xhr.responseText;\n }\n head.appendChild(scriptE);\n cb();\n } else {\n cbError && cbError(script, xhr.status, cb);\n }\n }\n };\n xhr.open(\"GET\", script+\"?\"+(new Date().valueOf()), true);\n xhr.send();\n }\n }, scriptNames, false, cbSuccess);\n};\n\n/** Write a message to the console */\nbrowserUtil.write = function(type, message) {\n var d1 = document.getElementById(\"print\"), d2 = document.createElement(\"div\"), d3 = document.createElement(\"div\");\n d3.className = type;\n d3.appendChild(document.createTextNode(message));\n d2.appendChild(d3);\n d1.appendChild(d2);\n return { update: function (type2, message2) {\n var d4 = document.createElement(\"div\");\n d4.className = type2 + \" also\";\n d4.appendChild(document.createTextNode(message2));\n d2.insertBefore(d4, d3);\n }};\n};\n\nbrowserUtil.writeTable = function (headers) {\n var d1 = document.getElementById(\"print\"), d2 = document.createElement(\"table\"), d3 = document.createElement(\"tr\");\n d2.className = 'table';\n\n // write the headers\n for (var i = 0; i < headers.length; i++) {\n var header = document.createElement(\"th\");\n header.appendChild(document.createTextNode(headers[i]));\n d3.appendChild(header);\n }\n\n d2.appendChild(d3);\n d1.appendChild(d2);\n\n return { update: function (row) {\n var d4 = document.createElement(\"tr\");\n\n // write the rows\n for (var i = 0; i < row.length; i++) {\n var cell = document.createElement(\"td\");\n\n cell.appendChild(document.createTextNode(row[i]));\n d4.appendChild(cell);\n }\n\n d2.appendChild(d4);\n }};\n};\n\n/** Write a newline. Does nothing in the browser. */\nbrowserUtil.writeNewline = function () { };\n\n/** Write a message to the status line */\nbrowserUtil.status = function(message) {\n var d1 = document.getElementById(\"status\");\n d1.replaceChild(document.createTextNode(message), d1.firstChild);\n};\n" }, { "path": "browserTest/entropy.html", "content": "\n\n\nEntropy Generator Progress\n\n\n\n\n\n\n\n\n\n\n

Entropy Generator Progress

\n\n

Target: 192 bits, available at paranoia level 5.

\n\n

Corresponding paranoia level from [0,1..10]: (the idea being that you can see the progress bar advance gently from empty/black to full/yellow after you press this)

\n\n

(also consumes 192 bits with every keypress in the text field; use key repeat to consume swiftly)

\n\n
\n
\n
\n\n

Please move your mouse, play around and generally introduce entropy into your environment.

\n\n\n" }, { "path": "browserTest/nodeUtil.js", "content": "browserUtil = {\n isNodeJS: true,\n \n pauseAndThen: function (cb) { cb(); },\n \n cpsIterate: function (f, start, end, pause, callback) {\n function go() {\n var called = false;\n if (start >= end) {\n callback && callback();\n } else {\n f(start, function () {\n if (!called) { called = true; start++; go(); }\n });\n }\n }\n go (start);\n },\n \n cpsMap: function (map, list, pause, callback) {\n browserUtil.cpsIterate(function (i, cb) { map(list[i], i, list.length, cb); },\n 0, list.length, pause, callback);\n },\n\n loadScripts: function(scriptNames, callback) {\n for (i=0; i\n\n\n SJCL browser performance\n \n\n\n

SJCL browser performance

\n
Waiting for tests to begin...
\n
\n \n \n \n\n\n" }, { "path": "browserTest/performance.js", "content": "sjcl.perf = { all: {} };\n\nsjcl.perf.PerfCase = function PerfCase (name, cases, runCase) {\n this.name = name;\n this.cases = cases;\n this.runCase = runCase;\n sjcl.perf.all[name] = this;\n};\n\nsjcl.perf.PerfCase.prototype.run = function (callback) {\n var thiz = this;\n\n var repo = browserUtil.write(\"info\", \"Running \" + this.name + \"...\");\n var table = browserUtil.writeTable([\"iter\", \"time\"]);\n\n thiz.runCase(this.cases[0]); // cold start\n\n browserUtil.cpsMap(function (t, i, n, cb) {\n var runs = [];\n\n // do 3 runs and average them\n for (var k = 0; k < 3; k++) {\n var t0 = performance.now();\n thiz.runCase(t);\n var t1 = performance.now();\n runs.push(t1 - t0);\n }\n\n var avg = runs.reduce(function(a, b) { return a + b; }) / runs.length;\n table.update([t, avg.toFixed(3) + ' ms']);\n\n cb && cb();\n }, this.cases, true, function() {\n\n repo.update(\"pass\", \"done.\");\n callback();\n\n });\n};\n\nsjcl.perf.run = function (perfs, callback) {\n browserUtil.status(\"Profiling...\");\n\n var t;\n if (perfs === undefined || perfs.length == 0) {\n perfs = [];\n for (t in sjcl.perf.all) {\n if (sjcl.perf.all.hasOwnProperty(t)) {\n perfs.push(t);\n }\n }\n }\n\n browserUtil.cpsMap(function (t, i, n, cb) {\n sjcl.perf.all[perfs[i]].run(cb);\n }, perfs, true, callback);\n};\n\n\n// performance case for pbkdf2\nvar cases = [1000, 2000, 4000, 8000, 16000, 32000, 48000, 64000];\nnew sjcl.perf.PerfCase(\"pbkdf2\", cases,\n function (iter) {\n sjcl.misc.pbkdf2(\"mypassword\", \"01234567890123456789\", iter);\n }\n);\n\nsjcl.perf.run([], function() {\n browserUtil.status(\"\");\n});\n" }, { "path": "browserTest/test.css", "content": "* {\n margin: 0px;\n padding: 0px;\n font-family: Arial, Helvetica, FreeSans, sans;\n}\n\n#print {\n position: relative;\n width: 40em;\n margin: 0px auto;\n padding: 5px;\n}\n\n#print div {\n position: relative;\n}\n\n.pass { color: #0A0; }\n.fail { color: #A00; }\n.unimplemented { color: #F80; }\n\n.begin {\n text-align: center;\n padding-bottom: 2px;\n border-bottom: 1px solid #aaa;\n margin: 0px auto 2px auto;\n}\n\n.all {\n text-align: center;\n font-weight: bold;\n}\n\n*+* > .begin, *+* > .all {\n margin-top: 1em;\n}\n\n.also {\n float: right;\n width: 17em;\n text-align: right;\n}\n\nh1 {\n text-align: center;\n background: #8A0000;\n padding: 5px;\n color: white;\n}\n\n#status {\n padding: 3px 10px 3px 5px;\n background: #d5c490;\n color: #444;\n font-size: 0.8em;\n margin-bottom: 1em;\n height: 1.3em;\n vertical-align: middle;\n}\n\n.table {\n width: 100%;\n border-spacing: 0;\n border-collapse: collapse;\n margin: 5px 0;\n}\n\n.table td, .table th {\n padding: 3px;\n border: 1px solid #ddd;\n}\n\n.table td {\n text-align: right;\n}\n\n.table tr:nth-of-type(odd) {\n background: #f9f9f9;\n}\n" }, { "path": "compress/compress_with_closure.sh", "content": "#!/bin/bash\n\nDIR=`dirname $0`\n\nURL=\"https://dl.google.com/closure-compiler/compiler-latest.zip\"\nFILE=`echo $URL | sed 's#.*/##'`\nunzip > /dev/null 2> /dev/null\nif [ $? -eq 0 ] ; then\n wget -V > /dev/null 2> /dev/null\n if [ $? -eq 0 ] ; then\n pushd . > /dev/null\n cd $DIR\n wget -q -N $URL\n popd > /dev/null\n else\n curl -V > /dev/null 2> /dev/null\n if [ $? -eq 0 ] ; then\n curl -s -z $DIR/$FILE -o $DIR/$FILE $URL > /dev/null 2> /dev/null\n fi\n fi\n if [ -s $DIR/$FILE ] ; then\n pushd . > /dev/null\n cd $DIR\n unzip -o $FILE compiler.jar > /dev/null 2> /dev/null\n popd > /dev/null\n fi\nfi\n\n$DIR/remove_constants.pl $1 | $DIR/opacify.pl > ._tmpRC.js\n\necho -n '\"use strict\";'\njava -jar $DIR/compiler.jar --compilation_level ADVANCED_OPTIMIZATIONS \\\n --js ._tmpRC.js \\\n | $DIR/digitize.pl \\\n | $DIR/dewindowize.pl\n \n\nrm -f ._tmpRC.js\n\n" }, { "path": "compress/compress_with_yui.sh", "content": "#!/bin/bash\n\n# Compress $1 with YUI Compressor 2.4.2, returning the compressed script on stdout\n\nDIR=`dirname $0`\n\n$DIR/remove_constants.pl $1 > ._tmpRC.js\n\njava -jar $DIR/yuicompressor-2.4.2.jar ._tmpRC.js \\\n | $DIR/digitize.pl\n\nrm -f ._tmpRC.js\n\n" }, { "path": "compress/dewindowize.pl", "content": "#!/usr/bin/env perl\n\nwhile (<>) {\n s/window\\.sjcl\\s*=/var sjcl=/g;\n s/window\\.sjcl/sjcl/g;\n print;\n}\n\n" }, { "path": "compress/digitize.pl", "content": "#!/usr/bin/env perl\n\n# Convert numbers to hex, when doing so is likely to increase compressibility.\n# This actually makes the script slightly longer, but generally makes it compress\n# to something shorter.\n#\n# Here we're targeting constants like 0xFF, 0xFFFF0000, 0x10101, 0x100000000, etc.\n\nsub digitize {\n my $number = shift;\n if ($number >= 256) {\n\tmy $nn = `printf \"%x\" $number`;\n\tif ($nn =~ /^[01f]+$/i) { return \"0x$nn\"; }\n }\n return $number;\n}\n\nwhile (<>) {\n s/([^a-zA-Z0-9_\"])(\\d+)/$1 . digitize $2/eg;\n print;\n}\n\n" }, { "path": "compress/opacify.pl", "content": "#!/usr/bin/env perl\n\n# This script is a hack.\n#\n# Opacify all non-private names by turning them into strings.\n# That way, the Google compressor won't rename them.\n#\n# The script ignores properties whose names begin with _, because they\n# are believed to be private.\n#\n# XXX TODO FIXME: this messes with strings, so it screws up exceptions.\n\nmy $script = join '', <>;\n\n# remove comments\n#$script =~ s=/\\*([^\\*]|\\*+[^\\/])*\\*/==g;\n#$script =~ s=//.*==g;\n\n# stringify property names\n$script =~ s=\\.([a-zA-Z][_a-zA-Z0-9]*)=['$1']=g;\n\n# destringify 'prototype'\n$script =~ s=\\['prototype'\\]=.prototype=g;\n\n# stringify sjcl\n$script =~ s=(?:var\\s+)?sjcl(\\.|\\s*\\=)=window['sjcl']$1=g;\n\n# stringify object notation\n$script =~ s=([\\{,]\n \\s*\n (?:/\\*(?:[^\\*]|\\*+[^\\/])*\\*/\\s* # preserve C-style comments\n |//[^\\n]*\\n\\s*)*) \n ([a-zA-Z0-9][_a-zA-Z0-9]*):=$1'$2':=xg;\n\n# Export sjcl. This is a bit of a hack, and might get replaced later.\nprint $script;\n\n# not necessary with windowization.\n# print \"window\\['sjcl'\\] = sjcl;\\n\";\n" }, { "path": "compress/remove_constants.pl", "content": "#!/usr/bin/env perl\n\n# This script is a hack. It identifies things which it believes to be\n# constant, then replaces them throughout the code.\n#\n# Constants are identified as properties declared in object notation\n# with values consisting only of capital letters and underscores. If\n# the first character is an underscore, the constant is private, and\n# can be removed entirely.\n#\n# The script dies if any two constants have the same property name but\n# different values.\nmy $script = join '', <>;\n\n# remove comments\n#$script =~ s=/\\*([^\\*]|\\*+[^\\/])*\\*/==g;\n#$script =~ s=//.*==g;\n\nsub preserve {\n my $stuff = shift;\n $stuff =~ s/,//;\n return $stuff;\n}\n\nmy %constants = ();\n\nsub add_constant {\n my ($name, $value) = @_;\n if (defined $constants{$name} && $constants{$name} ne $value) {\n print STDERR \"variant constant $name = $value\";\n die;\n } else {\n $constants{$name} = $value;\n #print STDERR \"constant: $name = $value\\n\";\n }\n}\n\n# find private constants\nwhile ($script =~\n s/([,\\{]) \\s* # indicator that this is part of an object\n (_[A-Z0-9_]+) \\s* : \\s* # all-caps variable name beginning with _\n (\\d+|0x[0-9A-Fa-f]+) \\s* # numeric value\n ([,\\}]) # next part of object\n /preserve \"$1$4\"/ex) {\n add_constant $2, $3;\n}\n\nmy $script2 = '';\n\n# find public constants\nwhile ($script =~\n s/^(.*?) # beginning of script\n ([,\\{]) \\s* # indicator that this is part of an object\n ([A-Z0-9_]+) \\s* : \\s* # all-caps variable name\n (\\d+|0x[0-9A-Fa-f]+) \\s* # numeric value\n ([,\\}]) # next part of object([,\\{]) \\s*\n /$5/esx) {\n $script2 .= \"$1$2$3:$4\";\n add_constant $3, $4;\n}\n\n$script = \"$script2$script\";\n\nforeach (keys %constants) {\n my $value = $constants{$_};\n $script =~ s/(?:[a-zA-Z0-9_]+\\.)+$_(?=[^a-zA-Z0-9_])/$value/g;\n}\n\nprint $script;\n" }, { "path": "config.mk", "content": "SOURCES= core/sjcl.js core/aes.js core/bitArray.js core/codecString.js core/codecHex.js core/codecBase32.js core/codecBase64.js core/sha256.js core/ccm.js core/ocb2.js core/gcm.js core/hmac.js core/pbkdf2.js core/random.js core/convenience.js core/exports.js \nCOMPRESS= core_closure.js\n" }, { "path": "configure", "content": "#!/usr/bin/env perl\n\nuse strict;\n\nmy ($arg, $i, $j, $targ);\n\nmy @targets = qw/sjcl aes bitArray codecString codecHex codecBase32 codecBase64 codecBytes codecZ85 sha256 sha512 sha1 ccm ctr cbc ocb2 ocb2progressive gcm hmac pbkdf2 scrypt random convenience bn ecc srp ccmArrayBuffer codecArrayBuffer ripemd160/;\nmy %deps = ('aes'=>'sjcl',\n 'bitArray'=>'sjcl',\n 'codecString'=>'bitArray',\n 'codecHex'=>'bitArray',\n 'codecBase64'=>'bitArray',\n 'codecBase32'=>'bitArray',\n 'codecBytes'=>'bitArray',\n 'codecZ85'=>'bitArray',\n 'sha256'=>'codecString',\n 'sha512'=>'codecString',\n 'sha1'=>'codecString',\n 'ripemd160' => 'codecString',\n 'ccm'=>'bitArray,aes',\n 'ctr'=>'bitArray,aes',\n 'ocb2'=>'bitArray,aes',\n 'ocb2progressive'=>'ocb2',\n 'gcm'=>'bitArray,aes',\n 'hmac'=>'sha256',\n 'pbkdf2'=>'hmac',\n 'scrypt'=>'pbkdf2,codecBytes',\n 'srp'=>'sha1,bn,bitArray',\n 'bn'=>'bitArray,random',\n 'ecc'=>'bn',\n 'cbc'=>'bitArray,aes',\n 'random'=>'sha256,aes',\n 'convenience'=>'ccm,pbkdf2,random,codecBase64',\n 'ccmArrayBuffer'=>'bitArray,codecArrayBuffer',\n 'codecArrayBuffer'=>'bitArray');\n\nmy $compress = \"closure\";\nmy $exported = 1;\n\nmy %enabled = ();\n$enabled{$_} = 0 foreach (@targets);\n\n# by default, all but codecBytes, codecZ85, srp, bn\n$enabled{$_} = 1 foreach (qw/aes bitArray codecString codecHex codecBase32 codecBase64 sha256 ccm ocb2 gcm hmac pbkdf2 random convenience/);\n\n# argument parsing\nwhile (my $arg = shift @ARGV) {\n if ($arg =~ /^--?with-all$/) {\n foreach (@targets) {\n if ($enabled{$_} == 0) {\n $enabled{$_} = 1;\n }\n }\n } elsif ($arg =~ /^--?without-all$/) {\n foreach (@targets) {\n if ($enabled{$_} == 1) {\n $enabled{$_} = 0;\n }\n }\n } elsif ($arg =~ /^--?with-(.*)$/) {\n $targ = $1;\n $targ =~ s/-(.)/uc $1/ge;\n if (!defined $deps{$targ}) {\n print STDERR \"No such target $targ\\n\";\n exit 1;\n }\n $enabled{$targ} = 2;\n } elsif ($arg =~ /^--?without-(.*)$/) {\n $targ = $1;\n $targ =~ s/-(.)/uc $1/ge;\n if (!defined $deps{$targ}) {\n print STDERR \"No such target $targ\\n\";\n exit 1;\n }\n $enabled{$targ} = -1;\n } elsif ($arg =~ /^--?compress(?:or|ion)?=(none|closure|yui)$/) {\n $compress = $1;\n } elsif ($arg =~ /^--?no-export$/) {\n $exported = 0;\n } else {\n my $targets = join \" \", @targets;\n $targets =~ s/sjcl //;\n $targets =~ s/(.{50})\\s+/$1\\n /g;\n print STDERR < 0) {\n foreach $j (split /,/, $deps{$i}) {\n if ($enabled{$j} == -1) {\n if ($enabled{$i} == 2) {\n print STDERR \"Conflicting options: $i depends on $j\\n\";\n exit 1;\n } else {\n $enabled{$i} = -1;\n last;\n }\n }\n }\n }\n}\n\n$config = \"exports $config\" if $exported;\n\n# reverse\nforeach my $i (reverse @targets) {\n if ($enabled{$i} > 0) {\n foreach $j (split /,/, $deps{$i}) {\n if ($enabled{$j} < $enabled{$i}) {\n $enabled{$j} = $enabled{$i};\n }\n }\n $config = \"$i $config\";\n }\n}\n\nopen CONFIG, \"> config.mk\" or die \"$!\";\n\n\n($pconfig = $config) =~ s/^sjcl //;\n$pconfig =~ s/ /\\n /g;\nprint \"Enabled components:\\n $pconfig\\n\";\nprint \"Compression: $compress\\n\";\n\n$config =~ s=\\S+=core/$&.js=g;\nprint CONFIG \"SOURCES= $config\\n\";\n\n$compress = \"core_$compress.js\";\n$compress = 'core.js' if ($compress eq 'core_none.js');\n\nprint CONFIG \"COMPRESS= $compress\\n\";\n" }, { "path": "core/aes.js", "content": "/** @fileOverview Low-level AES implementation.\n *\n * This file contains a low-level implementation of AES, optimized for\n * size and for efficiency on several browsers. It is based on\n * OpenSSL's aes_core.c, a public-domain implementation by Vincent\n * Rijmen, Antoon Bosselaers and Paulo Barreto.\n *\n * An older version of this implementation is available in the public\n * domain, but this one is (c) Emily Stark, Mike Hamburg, Dan Boneh,\n * Stanford University 2008-2010 and BSD-licensed for liability\n * reasons.\n *\n * @author Emily Stark\n * @author Mike Hamburg\n * @author Dan Boneh\n */\n\n/**\n * Schedule out an AES key for both encryption and decryption. This\n * is a low-level class. Use a cipher mode to do bulk encryption.\n *\n * @constructor\n * @param {Array} key The key as an array of 4, 6 or 8 words.\n */\nsjcl.cipher.aes = function (key) {\n if (!this._tables[0][0][0]) {\n this._precompute();\n }\n \n var i, j, tmp,\n encKey, decKey,\n sbox = this._tables[0][4], decTable = this._tables[1],\n keyLen = key.length, rcon = 1;\n \n if (keyLen !== 4 && keyLen !== 6 && keyLen !== 8) {\n throw new sjcl.exception.invalid(\"invalid aes key size\");\n }\n \n this._key = [encKey = key.slice(0), decKey = []];\n \n // schedule encryption keys\n for (i = keyLen; i < 4 * keyLen + 28; i++) {\n tmp = encKey[i-1];\n \n // apply sbox\n if (i%keyLen === 0 || (keyLen === 8 && i%keyLen === 4)) {\n tmp = sbox[tmp>>>24]<<24 ^ sbox[tmp>>16&255]<<16 ^ sbox[tmp>>8&255]<<8 ^ sbox[tmp&255];\n \n // shift rows and add rcon\n if (i%keyLen === 0) {\n tmp = tmp<<8 ^ tmp>>>24 ^ rcon<<24;\n rcon = rcon<<1 ^ (rcon>>7)*283;\n }\n }\n \n encKey[i] = encKey[i-keyLen] ^ tmp;\n }\n \n // schedule decryption keys\n for (j = 0; i; j++, i--) {\n tmp = encKey[j&3 ? i : i - 4];\n if (i<=4 || j<4) {\n decKey[j] = tmp;\n } else {\n decKey[j] = decTable[0][sbox[tmp>>>24 ]] ^\n decTable[1][sbox[tmp>>16 & 255]] ^\n decTable[2][sbox[tmp>>8 & 255]] ^\n decTable[3][sbox[tmp & 255]];\n }\n }\n};\n\nsjcl.cipher.aes.prototype = {\n // public\n /* Something like this might appear here eventually\n name: \"AES\",\n blockSize: 4,\n keySizes: [4,6,8],\n */\n \n /**\n * Encrypt an array of 4 big-endian words.\n * @param {Array} data The plaintext.\n * @return {Array} The ciphertext.\n */\n encrypt:function (data) { return this._crypt(data,0); },\n \n /**\n * Decrypt an array of 4 big-endian words.\n * @param {Array} data The ciphertext.\n * @return {Array} The plaintext.\n */\n decrypt:function (data) { return this._crypt(data,1); },\n \n /**\n * The expanded S-box and inverse S-box tables. These will be computed\n * on the client so that we don't have to send them down the wire.\n *\n * There are two tables, _tables[0] is for encryption and\n * _tables[1] is for decryption.\n *\n * The first 4 sub-tables are the expanded S-box with MixColumns. The\n * last (_tables[01][4]) is the S-box itself.\n *\n * @private\n */\n _tables: [[[],[],[],[],[]],[[],[],[],[],[]]],\n\n /**\n * Expand the S-box tables.\n *\n * @private\n */\n _precompute: function () {\n var encTable = this._tables[0], decTable = this._tables[1],\n sbox = encTable[4], sboxInv = decTable[4],\n i, x, xInv, d=[], th=[], x2, x4, x8, s, tEnc, tDec;\n\n // Compute double and third tables\n for (i = 0; i < 256; i++) {\n th[( d[i] = i<<1 ^ (i>>7)*283 )^i]=i;\n }\n \n for (x = xInv = 0; !sbox[x]; x ^= x2 || 1, xInv = th[xInv] || 1) {\n // Compute sbox\n s = xInv ^ xInv<<1 ^ xInv<<2 ^ xInv<<3 ^ xInv<<4;\n s = s>>8 ^ s&255 ^ 99;\n sbox[x] = s;\n sboxInv[s] = x;\n \n // Compute MixColumns\n x8 = d[x4 = d[x2 = d[x]]];\n tDec = x8*0x1010101 ^ x4*0x10001 ^ x2*0x101 ^ x*0x1010100;\n tEnc = d[s]*0x101 ^ s*0x1010100;\n \n for (i = 0; i < 4; i++) {\n encTable[i][x] = tEnc = tEnc<<24 ^ tEnc>>>8;\n decTable[i][s] = tDec = tDec<<24 ^ tDec>>>8;\n }\n }\n \n // Compactify. Considerable speedup on Firefox.\n for (i = 0; i < 5; i++) {\n encTable[i] = encTable[i].slice(0);\n decTable[i] = decTable[i].slice(0);\n }\n },\n \n /**\n * Encryption and decryption core.\n * @param {Array} input Four words to be encrypted or decrypted.\n * @param dir The direction, 0 for encrypt and 1 for decrypt.\n * @return {Array} The four encrypted or decrypted words.\n * @private\n */\n _crypt:function (input, dir) {\n if (input.length !== 4) {\n throw new sjcl.exception.invalid(\"invalid aes block size\");\n }\n \n var key = this._key[dir],\n // state variables a,b,c,d are loaded with pre-whitened data\n a = input[0] ^ key[0],\n b = input[dir ? 3 : 1] ^ key[1],\n c = input[2] ^ key[2],\n d = input[dir ? 1 : 3] ^ key[3],\n a2, b2, c2,\n \n nInnerRounds = key.length/4 - 2,\n i,\n kIndex = 4,\n out = [0,0,0,0],\n table = this._tables[dir],\n \n // load up the tables\n t0 = table[0],\n t1 = table[1],\n t2 = table[2],\n t3 = table[3],\n sbox = table[4];\n \n // Inner rounds. Cribbed from OpenSSL.\n for (i = 0; i < nInnerRounds; i++) {\n a2 = t0[a>>>24] ^ t1[b>>16 & 255] ^ t2[c>>8 & 255] ^ t3[d & 255] ^ key[kIndex];\n b2 = t0[b>>>24] ^ t1[c>>16 & 255] ^ t2[d>>8 & 255] ^ t3[a & 255] ^ key[kIndex + 1];\n c2 = t0[c>>>24] ^ t1[d>>16 & 255] ^ t2[a>>8 & 255] ^ t3[b & 255] ^ key[kIndex + 2];\n d = t0[d>>>24] ^ t1[a>>16 & 255] ^ t2[b>>8 & 255] ^ t3[c & 255] ^ key[kIndex + 3];\n kIndex += 4;\n a=a2; b=b2; c=c2;\n }\n \n // Last round.\n for (i = 0; i < 4; i++) {\n out[dir ? 3&-i : i] =\n sbox[a>>>24 ]<<24 ^ \n sbox[b>>16 & 255]<<16 ^\n sbox[c>>8 & 255]<<8 ^\n sbox[d & 255] ^\n key[kIndex++];\n a2=a; a=b; b=c; c=d; d=a2;\n }\n \n return out;\n }\n};\n\n" }, { "path": "core/bitArray.js", "content": "/** @fileOverview Arrays of bits, encoded as arrays of Numbers.\n *\n * @author Emily Stark\n * @author Mike Hamburg\n * @author Dan Boneh\n */\n\n/**\n * Arrays of bits, encoded as arrays of Numbers.\n * @namespace\n * @description\n *

\n * These objects are the currency accepted by SJCL's crypto functions.\n *

\n *\n *

\n * Most of our crypto primitives operate on arrays of 4-byte words internally,\n * but many of them can take arguments that are not a multiple of 4 bytes.\n * This library encodes arrays of bits (whose size need not be a multiple of 8\n * bits) as arrays of 32-bit words. The bits are packed, big-endian, into an\n * array of words, 32 bits at a time. Since the words are double-precision\n * floating point numbers, they fit some extra data. We use this (in a private,\n * possibly-changing manner) to encode the number of bits actually present\n * in the last word of the array.\n *

\n *\n *

\n * Because bitwise ops clear this out-of-band data, these arrays can be passed\n * to ciphers like AES which want arrays of words.\n *

\n */\nsjcl.bitArray = {\n /**\n * Array slices in units of bits.\n * @param {bitArray} a The array to slice.\n * @param {Number} bstart The offset to the start of the slice, in bits.\n * @param {Number} bend The offset to the end of the slice, in bits. If this is undefined,\n * slice until the end of the array.\n * @return {bitArray} The requested slice.\n */\n bitSlice: function (a, bstart, bend) {\n a = sjcl.bitArray._shiftRight(a.slice(bstart/32), 32 - (bstart & 31)).slice(1);\n return (bend === undefined) ? a : sjcl.bitArray.clamp(a, bend-bstart);\n },\n\n /**\n * Extract a number packed into a bit array.\n * @param {bitArray} a The array to slice.\n * @param {Number} bstart The offset to the start of the slice, in bits.\n * @param {Number} blength The length of the number to extract.\n * @return {Number} The requested slice.\n */\n extract: function(a, bstart, blength) {\n // FIXME: this Math.floor is not necessary at all, but for some reason\n // seems to suppress a bug in the Chromium JIT.\n var x, sh = Math.floor((-bstart-blength) & 31);\n if ((bstart + blength - 1 ^ bstart) & -32) {\n // it crosses a boundary\n x = (a[bstart/32|0] << (32 - sh)) ^ (a[bstart/32+1|0] >>> sh);\n } else {\n // within a single word\n x = a[bstart/32|0] >>> sh;\n }\n return x & ((1< 0 && len) {\n a[l-1] = sjcl.bitArray.partial(len, a[l-1] & 0x80000000 >> (len-1), 1);\n }\n return a;\n },\n\n /**\n * Make a partial word for a bit array.\n * @param {Number} len The number of bits in the word.\n * @param {Number} x The bits.\n * @param {Number} [_end=0] Pass 1 if x has already been shifted to the high side.\n * @return {Number} The partial word.\n */\n partial: function (len, x, _end) {\n if (len === 32) { return x; }\n return (_end ? x|0 : x << (32-len)) + len * 0x10000000000;\n },\n\n /**\n * Get the number of bits used by a partial word.\n * @param {Number} x The partial word.\n * @return {Number} The number of bits used by the partial word.\n */\n getPartial: function (x) {\n return Math.round(x/0x10000000000) || 32;\n },\n\n /**\n * Compare two arrays for equality in a predictable amount of time.\n * @param {bitArray} a The first array.\n * @param {bitArray} b The second array.\n * @return {boolean} true if a == b; false otherwise.\n */\n equal: function (a, b) {\n if (sjcl.bitArray.bitLength(a) !== sjcl.bitArray.bitLength(b)) {\n return false;\n }\n var x = 0, i;\n for (i=0; i= 32; shift -= 32) {\n out.push(carry);\n carry = 0;\n }\n if (shift === 0) {\n return out.concat(a);\n }\n \n for (i=0; i>>shift);\n carry = a[i] << (32-shift);\n }\n last2 = a.length ? a[a.length-1] : 0;\n shift2 = sjcl.bitArray.getPartial(last2);\n out.push(sjcl.bitArray.partial(shift+shift2 & 31, (shift + shift2 > 32) ? carry : out.pop(),1));\n return out;\n },\n \n /** xor a block of 4 words together.\n * @private\n */\n _xor4: function(x,y) {\n return [x[0]^y[0],x[1]^y[1],x[2]^y[2],x[3]^y[3]];\n },\n\n /** byteswap a word array inplace.\n * (does not handle partial words)\n * @param {sjcl.bitArray} a word array\n * @return {sjcl.bitArray} byteswapped array\n */\n byteswapM: function(a) {\n var i, v, m = 0xff00;\n for (i = 0; i < a.length; ++i) {\n v = a[i];\n a[i] = (v >>> 24) | ((v >>> 8) & m) | ((v & m) << 8) | (v << 24);\n }\n return a;\n }\n};\n" }, { "path": "core/bn.js", "content": "// Thanks to Colin McRae and Jonathan Burns of ionic security\n// for reporting and fixing two bugs in this file!\n\n/**\n * Constructs a new bignum from another bignum, a number or a hex string.\n * @constructor\n */\nsjcl.bn = function(it) {\n this.initWith(it);\n};\n\nsjcl.bn.prototype = {\n radix: 24,\n maxMul: 8,\n _class: sjcl.bn,\n\n copy: function() {\n return new this._class(this);\n },\n\n /**\n * Initializes this with it, either as a bn, a number, or a hex string.\n */\n initWith: function(it) {\n var i=0, k;\n switch(typeof it) {\n case \"object\":\n this.limbs = it.limbs.slice(0);\n break;\n\n case \"number\":\n this.limbs = [it];\n this.normalize();\n break;\n\n case \"string\":\n it = it.replace(/^0x/, '');\n this.limbs = [];\n // hack\n k = this.radix / 4;\n for (i=0; i < it.length; i+=k) {\n this.limbs.push(parseInt(it.substring(Math.max(it.length - i - k, 0), it.length - i),16));\n }\n break;\n\n default:\n this.limbs = [0];\n }\n return this;\n },\n\n /**\n * Returns true if \"this\" and \"that\" are equal. Calls fullReduce().\n * Equality test is in constant time.\n */\n equals: function(that) {\n if (typeof that === \"number\") { that = new this._class(that); }\n var difference = 0, i;\n this.fullReduce();\n that.fullReduce();\n for (i = 0; i < this.limbs.length || i < that.limbs.length; i++) {\n difference |= this.getLimb(i) ^ that.getLimb(i);\n }\n return (difference === 0);\n },\n\n /**\n * Get the i'th limb of this, zero if i is too large.\n */\n getLimb: function(i) {\n return (i >= this.limbs.length) ? 0 : this.limbs[i];\n },\n\n /**\n * Constant time comparison function.\n * Returns 1 if this >= that, or zero otherwise.\n */\n greaterEquals: function(that) {\n if (typeof that === \"number\") { that = new this._class(that); }\n var less = 0, greater = 0, i, a, b;\n i = Math.max(this.limbs.length, that.limbs.length) - 1;\n for (; i>= 0; i--) {\n a = this.getLimb(i);\n b = that.getLimb(i);\n greater |= (b - a) & ~less;\n less |= (a - b) & ~greater;\n }\n return (greater | ~less) >>> 31;\n },\n\n /**\n * Convert to a hex string.\n */\n toString: function() {\n this.fullReduce();\n var out=\"\", i, s, l = this.limbs;\n for (i=0; i < this.limbs.length; i++) {\n s = l[i].toString(16);\n while (i < this.limbs.length - 1 && s.length < 6) {\n s = \"0\" + s;\n }\n out = s + out;\n }\n return \"0x\"+out;\n },\n\n /** this += that. Does not normalize. */\n addM: function(that) {\n if (typeof(that) !== \"object\") { that = new this._class(that); }\n var i, l=this.limbs, ll=that.limbs;\n for (i=l.length; i> r;\n }\n if (carry) {\n l.push(carry);\n }\n return this;\n },\n\n /** this /= 2, rounded down. Requires normalized; ends up normalized. */\n halveM: function() {\n var i, carry=0, tmp, r=this.radix, l=this.limbs;\n for (i=l.length-1; i>=0; i--) {\n tmp = l[i];\n l[i] = (tmp+carry)>>1;\n carry = (tmp&1) << r;\n }\n if (!l[l.length-1]) {\n l.pop();\n }\n return this;\n },\n\n /** this -= that. Does not normalize. */\n subM: function(that) {\n if (typeof(that) !== \"object\") { that = new this._class(that); }\n var i, l=this.limbs, ll=that.limbs;\n for (i=l.length; i 0; ci--) {\n that.halveM();\n if (out.greaterEquals(that)) {\n out.subM(that).normalize();\n }\n }\n return out.trim();\n },\n\n /** return inverse mod prime p. p must be odd. Binary extended Euclidean algorithm mod p. */\n inverseMod: function(p) {\n var a = new sjcl.bn(1), b = new sjcl.bn(0), x = new sjcl.bn(this), y = new sjcl.bn(p), tmp, i, nz=1;\n\n if (!(p.limbs[0] & 1)) {\n throw (new sjcl.exception.invalid(\"inverseMod: p must be odd\"));\n }\n\n // invariant: y is odd\n do {\n if (x.limbs[0] & 1) {\n if (!x.greaterEquals(y)) {\n // x < y; swap everything\n tmp = x; x = y; y = tmp;\n tmp = a; a = b; b = tmp;\n }\n x.subM(y);\n x.normalize();\n\n if (!a.greaterEquals(b)) {\n a.addM(p);\n }\n a.subM(b);\n }\n\n // cut everything in half\n x.halveM();\n if (a.limbs[0] & 1) {\n a.addM(p);\n }\n a.normalize();\n a.halveM();\n\n // check for termination: x ?= 0\n for (i=nz=0; i>(j + 1) == 0) { break; }\n\n pow = pow.square();\n }\n }\n\n return out;\n },\n\n /** this * that mod N */\n mulmod: function(that, N) {\n return this.mod(N).mul(that.mod(N)).mod(N);\n },\n\n /** this ^ x mod N */\n powermod: function(x, N) {\n x = new sjcl.bn(x);\n N = new sjcl.bn(N);\n\n // Jump to montpowermod if possible.\n if ((N.limbs[0] & 1) == 1) {\n var montOut = this.montpowermod(x, N);\n\n if (montOut != false) { return montOut; } // else go to slow powermod\n }\n\n var i, j, l = x.normalize().trim().limbs, out = new this._class(1), pow = this;\n\n for (i=0; i>(j + 1) == 0) { break; }\n\n pow = pow.mulmod(pow, N);\n }\n }\n\n return out;\n },\n\n /** this ^ x mod N with Montomery reduction */\n montpowermod: function(x, N) {\n x = new sjcl.bn(x).normalize().trim();\n N = new sjcl.bn(N);\n\n var i, j,\n radix = this.radix,\n out = new this._class(1),\n pow = this.copy();\n\n // Generate R as a cap of N.\n var R, s, wind, bitsize = x.bitLength();\n\n R = new sjcl.bn({\n limbs: N.copy().normalize().trim().limbs.map(function() { return 0; })\n });\n\n for (s = this.radix; s > 0; s--) {\n if (((N.limbs[N.limbs.length - 1] >> s) & 1) == 1) {\n R.limbs[R.limbs.length - 1] = 1 << s;\n break;\n }\n }\n\n // Calculate window size as a function of the exponent's size.\n if (bitsize == 0) {\n return this;\n } else if (bitsize < 18) {\n wind = 1;\n } else if (bitsize < 48) {\n wind = 3;\n } else if (bitsize < 144) {\n wind = 4;\n } else if (bitsize < 768) {\n wind = 5;\n } else {\n wind = 6;\n }\n\n // Find R' and N' such that R * R' - N * N' = 1.\n var RR = R.copy(), NN = N.copy(), RP = new sjcl.bn(1), NP = new sjcl.bn(0), RT = R.copy();\n\n while (RT.greaterEquals(1)) {\n RT.halveM();\n\n if ((RP.limbs[0] & 1) == 0) {\n RP.halveM();\n NP.halveM();\n } else {\n RP.addM(NN);\n RP.halveM();\n\n NP.halveM();\n NP.addM(RR);\n }\n }\n\n RP = RP.normalize();\n NP = NP.normalize();\n\n RR.doubleM();\n var R2 = RR.mulmod(RR, N);\n\n // Check whether the invariant holds.\n // If it doesn't, we can't use Montgomery reduction on this modulus.\n if (!RR.mul(RP).sub(N.mul(NP)).equals(1)) {\n return false;\n }\n\n var montIn = function(c) { return montMul(c, R2); },\n montMul = function(a, b) {\n // Standard Montgomery reduction\n var k, ab, right, abBar, mask = (1 << (s + 1)) - 1;\n\n ab = a.mul(b);\n\n right = ab.mul(NP);\n right.limbs = right.limbs.slice(0, R.limbs.length);\n\n if (right.limbs.length == R.limbs.length) {\n right.limbs[R.limbs.length - 1] &= mask;\n }\n\n right = right.mul(N);\n\n abBar = ab.add(right).normalize().trim();\n abBar.limbs = abBar.limbs.slice(R.limbs.length - 1);\n\n // Division. Equivelent to calling *.halveM() s times.\n for (k=0; k < abBar.limbs.length; k++) {\n if (k > 0) {\n abBar.limbs[k - 1] |= (abBar.limbs[k] & mask) << (radix - s - 1);\n }\n\n abBar.limbs[k] = abBar.limbs[k] >> (s + 1);\n }\n\n if (abBar.greaterEquals(N)) {\n abBar.subM(N);\n }\n\n return abBar;\n },\n montOut = function(c) { return montMul(c, 1); };\n\n pow = montIn(pow);\n out = montIn(out);\n\n // Sliding-Window Exponentiation (HAC 14.85)\n var h, precomp = {}, cap = (1 << (wind - 1)) - 1;\n\n precomp[1] = pow.copy();\n precomp[2] = montMul(pow, pow);\n\n for (h=1; h<=cap; h++) {\n precomp[(2 * h) + 1] = montMul(precomp[(2 * h) - 1], precomp[2]);\n }\n\n var getBit = function(exp, i) { // Gets ith bit of exp.\n var off = i % exp.radix;\n\n return (exp.limbs[Math.floor(i / exp.radix)] & (1 << off)) >> off;\n };\n\n for (i = x.bitLength() - 1; i >= 0; ) {\n if (getBit(x, i) == 0) {\n // If the next bit is zero:\n // Square, move forward one bit.\n out = montMul(out, out);\n i = i - 1;\n } else {\n // If the next bit is one:\n // Find the longest sequence of bits after this one, less than `wind`\n // bits long, that ends with a 1. Convert the sequence into an\n // integer and look up the pre-computed value to add.\n var l = i - wind + 1;\n\n while (getBit(x, l) == 0) {\n l++;\n }\n\n var indx = 0;\n for (j = l; j <= i; j++) {\n indx += getBit(x, j) << (j - l);\n out = montMul(out, out);\n }\n\n out = montMul(out, precomp[indx]);\n\n i = l - 1;\n }\n }\n\n return montOut(out);\n },\n\n trim: function() {\n var l = this.limbs, p;\n do {\n p = l.pop();\n } while (l.length && p === 0);\n l.push(p);\n return this;\n },\n\n /** Reduce mod a modulus. Stubbed for subclassing. */\n reduce: function() {\n return this;\n },\n\n /** Reduce and normalize. */\n fullReduce: function() {\n return this.normalize();\n },\n\n /** Propagate carries. */\n normalize: function() {\n var carry=0, i, pv = this.placeVal, ipv = this.ipv, l, m, limbs = this.limbs, ll = limbs.length, mask = this.radixMask;\n for (i=0; i < ll || (carry !== 0 && carry !== -1); i++) {\n l = (limbs[i]||0) + carry;\n m = limbs[i] = l & mask;\n carry = (l-m)*ipv;\n }\n if (carry === -1) {\n limbs[i-1] -= pv;\n }\n this.trim();\n return this;\n },\n\n /** Constant-time normalize. Does not allocate additional space. */\n cnormalize: function() {\n var carry=0, i, ipv = this.ipv, l, m, limbs = this.limbs, ll = limbs.length, mask = this.radixMask;\n for (i=0; i < ll-1; i++) {\n l = limbs[i] + carry;\n m = limbs[i] = l & mask;\n carry = (l-m)*ipv;\n }\n limbs[i] += carry;\n return this;\n },\n\n /** Serialize to a bit array */\n toBits: function(len) {\n this.fullReduce();\n len = len || this.exponent || this.bitLength();\n var i = Math.floor((len-1)/24), w=sjcl.bitArray, e = (len + 7 & -8) % this.radix || this.radix,\n out = [w.partial(e, this.getLimb(i))];\n for (i--; i >= 0; i--) {\n out = w.concat(out, [w.partial(Math.min(this.radix,len), this.getLimb(i))]);\n len -= this.radix;\n }\n return out;\n },\n\n /** Return the length in bits, rounded up to the nearest byte. */\n bitLength: function() {\n this.fullReduce();\n var out = this.radix * (this.limbs.length - 1),\n b = this.limbs[this.limbs.length - 1];\n for (; b; b >>>= 1) {\n out ++;\n }\n return out+7 & -8;\n }\n};\n\n/** @memberOf sjcl.bn\n* @this { sjcl.bn }\n*/\nsjcl.bn.fromBits = function(bits) {\n var Class = this, out = new Class(), words=[], w=sjcl.bitArray, t = this.prototype,\n l = Math.min(this.bitLength || 0x100000000, w.bitLength(bits)), e = l % t.radix || t.radix;\n\n words[0] = w.extract(bits, 0, e);\n for (; e < l; e += t.radix) {\n words.unshift(w.extract(bits, e, t.radix));\n }\n\n out.limbs = words;\n return out;\n};\n\n\n\nsjcl.bn.prototype.ipv = 1 / (sjcl.bn.prototype.placeVal = Math.pow(2,sjcl.bn.prototype.radix));\nsjcl.bn.prototype.radixMask = (1 << sjcl.bn.prototype.radix) - 1;\n\n/**\n * Creates a new subclass of bn, based on reduction modulo a pseudo-Mersenne prime,\n * i.e. a prime of the form 2^e + sum(a * 2^b),where the sum is negative and sparse.\n */\nsjcl.bn.pseudoMersennePrime = function(exponent, coeff) {\n /** @constructor\n * @private\n */\n function p(it) {\n this.initWith(it);\n /*if (this.limbs[this.modOffset]) {\n this.reduce();\n }*/\n }\n\n var ppr = p.prototype = new sjcl.bn(), i, tmp, mo;\n mo = ppr.modOffset = Math.ceil(tmp = exponent / ppr.radix);\n ppr.exponent = exponent;\n ppr.offset = [];\n ppr.factor = [];\n ppr.minOffset = mo;\n ppr.fullMask = 0;\n ppr.fullOffset = [];\n ppr.fullFactor = [];\n ppr.modulus = p.modulus = new sjcl.bn(Math.pow(2,exponent));\n\n ppr.fullMask = 0|-Math.pow(2, exponent % ppr.radix);\n\n for (i=0; i mo) {\n l = limbs.pop();\n ll = limbs.length;\n for (k=0; k> 3) & 15)) * 0x1010101;\n\n /* Pad and encrypt. */\n iv = prp.encrypt(xor(iv,w.concat(plaintext,[bl,bl,bl,bl]).slice(i,i+4)));\n output.splice(i,0,iv[0],iv[1],iv[2],iv[3]);\n return output;\n },\n \n /** Decrypt in CBC mode.\n * @param {Object} prp The block cipher. It must have a block size of 16 bytes.\n * @param {bitArray} ciphertext The ciphertext data.\n * @param {bitArray} iv The initialization value.\n * @param {bitArray} [adata=[]] The authenticated data. It must be empty.\n * @return The decrypted data, an array of bytes.\n * @throws {sjcl.exception.invalid} if the IV isn't exactly 128 bits, or if any adata is specified.\n * @throws {sjcl.exception.corrupt} if if the message is corrupt.\n */\n decrypt: function(prp, ciphertext, iv, adata) {\n if (adata && adata.length) {\n throw new sjcl.exception.invalid(\"cbc can't authenticate data\");\n }\n if (sjcl.bitArray.bitLength(iv) !== 128) {\n throw new sjcl.exception.invalid(\"cbc iv must be 128 bits\");\n }\n if ((sjcl.bitArray.bitLength(ciphertext) & 127) || !ciphertext.length) {\n throw new sjcl.exception.corrupt(\"cbc ciphertext must be a positive multiple of the block size\");\n }\n var i,\n w = sjcl.bitArray,\n xor = w._xor4,\n bi, bo,\n output = [];\n \n adata = adata || [];\n \n for (i=0; i 16) {\n throw new sjcl.exception.corrupt(\"pkcs#5 padding corrupt\");\n }\n bo = bi * 0x1010101;\n if (!w.equal(w.bitSlice([bo,bo,bo,bo], 0, bi*8),\n w.bitSlice(output, output.length*32 - bi*8, output.length*32))) {\n throw new sjcl.exception.corrupt(\"pkcs#5 padding corrupt\");\n }\n\n return w.bitSlice(output, 0, output.length*32 - bi*8);\n }\n };\n};\n" }, { "path": "core/ccm.js", "content": "/** @fileOverview CCM mode implementation.\n *\n * Special thanks to Roy Nicholson for pointing out a bug in our\n * implementation.\n *\n * @author Emily Stark\n * @author Mike Hamburg\n * @author Dan Boneh\n */\n\n/**\n * CTR mode with CBC MAC.\n * @namespace\n */\nsjcl.mode.ccm = {\n /** The name of the mode.\n * @constant\n */\n name: \"ccm\",\n \n _progressListeners: [],\n\n listenProgress: function (cb) {\n sjcl.mode.ccm._progressListeners.push(cb);\n },\n\n unListenProgress: function (cb) {\n var index = sjcl.mode.ccm._progressListeners.indexOf(cb);\n if (index > -1) {\n sjcl.mode.ccm._progressListeners.splice(index, 1);\n }\n },\n\n _callProgressListener: function (val) {\n var p = sjcl.mode.ccm._progressListeners.slice(), i;\n\n for (i = 0; i < p.length; i += 1) {\n p[i](val);\n }\n },\n\n /** Encrypt in CCM mode.\n * @static\n * @param {Object} prf The pseudorandom function. It must have a block size of 16 bytes.\n * @param {bitArray} plaintext The plaintext data.\n * @param {bitArray} iv The initialization value.\n * @param {bitArray} [adata=[]] The authenticated data.\n * @param {Number} [tlen=64] the desired tag length, in bits.\n * @return {bitArray} The encrypted data, an array of bytes.\n */\n encrypt: function(prf, plaintext, iv, adata, tlen) {\n var L, out = plaintext.slice(0), tag, w=sjcl.bitArray, ivl = w.bitLength(iv) / 8, ol = w.bitLength(out) / 8;\n tlen = tlen || 64;\n adata = adata || [];\n \n if (ivl < 7) {\n throw new sjcl.exception.invalid(\"ccm: iv must be at least 7 bytes\");\n }\n \n // compute the length of the length\n for (L=2; L<4 && ol >>> 8*L; L++) {}\n if (L < 15 - ivl) { L = 15-ivl; }\n iv = w.clamp(iv,8*(15-L));\n \n // compute the tag\n tag = sjcl.mode.ccm._computeTag(prf, plaintext, iv, adata, tlen, L);\n \n // encrypt\n out = sjcl.mode.ccm._ctrMode(prf, out, iv, tag, tlen, L);\n \n return w.concat(out.data, out.tag);\n },\n \n /** Decrypt in CCM mode.\n * @static\n * @param {Object} prf The pseudorandom function. It must have a block size of 16 bytes.\n * @param {bitArray} ciphertext The ciphertext data.\n * @param {bitArray} iv The initialization value.\n * @param {bitArray} [adata=[]] adata The authenticated data.\n * @param {Number} [tlen=64] tlen the desired tag length, in bits.\n * @return {bitArray} The decrypted data.\n */\n decrypt: function(prf, ciphertext, iv, adata, tlen) {\n tlen = tlen || 64;\n adata = adata || [];\n var L,\n w=sjcl.bitArray,\n ivl = w.bitLength(iv) / 8,\n ol = w.bitLength(ciphertext), \n out = w.clamp(ciphertext, ol - tlen),\n tag = w.bitSlice(ciphertext, ol - tlen), tag2;\n \n\n ol = (ol - tlen) / 8;\n \n if (ivl < 7) {\n throw new sjcl.exception.invalid(\"ccm: iv must be at least 7 bytes\");\n }\n \n // compute the length of the length\n for (L=2; L<4 && ol >>> 8*L; L++) {}\n if (L < 15 - ivl) { L = 15-ivl; }\n iv = w.clamp(iv,8*(15-L));\n \n // decrypt\n out = sjcl.mode.ccm._ctrMode(prf, out, iv, tag, tlen, L);\n \n // check the tag\n tag2 = sjcl.mode.ccm._computeTag(prf, out.data, iv, adata, tlen, L);\n if (!w.equal(out.tag, tag2)) {\n throw new sjcl.exception.corrupt(\"ccm: tag doesn't match\");\n }\n \n return out.data;\n },\n\n _macAdditionalData: function (prf, adata, iv, tlen, ol, L) {\n var mac, tmp, i, macData = [], w=sjcl.bitArray, xor = w._xor4;\n\n // mac the flags\n mac = [w.partial(8, (adata.length ? 1<<6 : 0) | (tlen-2) << 2 | L-1)];\n\n // mac the iv and length\n mac = w.concat(mac, iv);\n mac[3] |= ol;\n mac = prf.encrypt(mac);\n \n if (adata.length) {\n // mac the associated data. start with its length...\n tmp = w.bitLength(adata)/8;\n if (tmp <= 0xFEFF) {\n macData = [w.partial(16, tmp)];\n } else if (tmp <= 0xFFFFFFFF) {\n macData = w.concat([w.partial(16,0xFFFE)], [tmp]);\n } // else ...\n \n // mac the data itself\n macData = w.concat(macData, adata);\n for (i=0; i 16) {\n throw new sjcl.exception.invalid(\"ccm: invalid tag length\");\n }\n \n if (adata.length > 0xFFFFFFFF || plaintext.length > 0xFFFFFFFF) {\n // I don't want to deal with extracting high words from doubles.\n throw new sjcl.exception.bug(\"ccm: can't deal with 4GiB or more data\");\n }\n\n mac = sjcl.mode.ccm._macAdditionalData(prf, adata, iv, tlen, w.bitLength(plaintext)/8, L);\n\n // mac the plaintext\n for (i=0; i n) {\n sjcl.mode.ccm._callProgressListener(i/l);\n n += p;\n }\n ctr[3]++;\n enc = prf.encrypt(ctr);\n data[i] ^= enc[0];\n data[i+1] ^= enc[1];\n data[i+2] ^= enc[2];\n data[i+3] ^= enc[3];\n }\n return { tag:tag, data:w.clamp(data,bl) };\n }\n};\n" }, { "path": "core/ccmArrayBuffer.js", "content": "/** @fileOverview Really fast & small implementation of CCM using JS' array buffers\n *\n * @author Marco Munizaga\n */\n\n/**\n * CTR mode with CBC MAC.\n * @namespace\n */\nsjcl.arrayBuffer = sjcl.arrayBuffer || {};\n\n//patch arraybuffers if they don't exist\nif (typeof(ArrayBuffer) === 'undefined') {\n (function(globals){\n \"use strict\";\n globals.ArrayBuffer = function(){};\n globals.DataView = function(){};\n }(this));\n}\n\n\nsjcl.arrayBuffer.ccm = {\n mode: \"ccm\",\n\n defaults: {\n tlen:128 //this is M in the NIST paper\n },\n\n /** Encrypt in CCM mode. Meant to return the same exact thing as the bitArray ccm to work as a drop in replacement\n * @static\n * @param {Object} prf The pseudorandom function. It must have a block size of 16 bytes.\n * @param {bitArray} plaintext The plaintext data.\n * @param {bitArray} iv The initialization value.\n * @param {bitArray} [adata=[]] The authenticated data.\n * @param {Number} [tlen=64] the desired tag length, in bits.\n * @return {bitArray} The encrypted data, an array of bytes.\n */\n compat_encrypt: function(prf, plaintext, iv, adata, tlen){\n var plaintext_buffer = sjcl.codec.arrayBuffer.fromBits(plaintext, true, 16),\n ol = sjcl.bitArray.bitLength(plaintext)/8,\n encrypted_obj,\n ct,\n tag;\n\n tlen = tlen || 64;\n adata = adata || [];\n\n encrypted_obj = sjcl.arrayBuffer.ccm.encrypt(prf, plaintext_buffer, iv, adata, tlen, ol);\n ct = sjcl.codec.arrayBuffer.toBits(encrypted_obj.ciphertext_buffer);\n\n ct = sjcl.bitArray.clamp(ct, ol*8);\n\n\n return sjcl.bitArray.concat(ct, encrypted_obj.tag);\n },\n\n /** Decrypt in CCM mode. Meant to imitate the bitArray ccm \n * @static\n * @param {Object} prf The pseudorandom function. It must have a block size of 16 bytes.\n * @param {bitArray} ciphertext The ciphertext data.\n * @param {bitArray} iv The initialization value.\n * @param {bitArray} [adata=[]] adata The authenticated data.\n * @param {Number} [tlen=64] tlen the desired tag length, in bits.\n * @return {bitArray} The decrypted data.\n */\n compat_decrypt: function(prf, ciphertext, iv, adata, tlen){\n tlen = tlen || 64;\n adata = adata || [];\n var L, i, \n w=sjcl.bitArray,\n ol = w.bitLength(ciphertext), \n out = w.clamp(ciphertext, ol - tlen),\n tag = w.bitSlice(ciphertext, ol - tlen), tag2,\n ciphertext_buffer = sjcl.codec.arrayBuffer.fromBits(out, true, 16);\n\n var plaintext_buffer = sjcl.arrayBuffer.ccm.decrypt(prf, ciphertext_buffer, iv, tag, adata, tlen, (ol-tlen)/8);\n return sjcl.bitArray.clamp(sjcl.codec.arrayBuffer.toBits(plaintext_buffer), ol-tlen);\n\n },\n\n /** Really fast ccm encryption, uses arraybufer and mutates the plaintext buffer\n * @static\n * @param {Object} prf The pseudorandom function. It must have a block size of 16 bytes. \n * @param {ArrayBuffer} plaintext_buffer The plaintext data.\n * @param {bitArray} iv The initialization value.\n * @param {ArrayBuffer} [adata=[]] The authenticated data.\n * @param {Number} [tlen=128] the desired tag length, in bits.\n * @return {ArrayBuffer} The encrypted data, in the same array buffer as the given plaintext, but given back anyways\n */\n encrypt: function(prf, plaintext_buffer, iv, adata, tlen, ol){\n var auth_blocks, mac, L, w = sjcl.bitArray,\n ivl = w.bitLength(iv) / 8;\n\n //set up defaults\n adata = adata || [];\n tlen = tlen || sjcl.arrayBuffer.ccm.defaults.tlen;\n ol = ol || plaintext_buffer.byteLength;\n tlen = Math.ceil(tlen/8);\n \n for (L=2; L<4 && ol >>> 8*L; L++) {}\n if (L < 15 - ivl) { L = 15-ivl; }\n iv = w.clamp(iv,8*(15-L));\n\n //prf should use a 256 bit key to make precomputation attacks infeasible\n\n mac = sjcl.arrayBuffer.ccm._computeTag(prf, plaintext_buffer, iv, adata, tlen, ol, L);\n\n //encrypt the plaintext and the mac \n //returns the mac since the plaintext will be left encrypted inside the buffer\n mac = sjcl.arrayBuffer.ccm._ctrMode(prf, plaintext_buffer, iv, mac, tlen, L);\n\n\n //the plaintext_buffer has been modified so it is now the ciphertext_buffer\n return {'ciphertext_buffer':plaintext_buffer, 'tag':mac};\n },\n\n /** Really fast ccm decryption, uses arraybufer and mutates the given buffer\n * @static\n * @param {Object} prf The pseudorandom function. It must have a block size of 16 bytes. \n * @param {ArrayBuffer} ciphertext_buffer The Ciphertext data.\n * @param {bitArray} iv The initialization value.\n * @param {bitArray} The authentication tag for the ciphertext\n * @param {ArrayBuffer} [adata=[]] The authenticated data.\n * @param {Number} [tlen=128] the desired tag length, in bits.\n * @return {ArrayBuffer} The decrypted data, in the same array buffer as the given buffer, but given back anyways\n */\n decrypt: function(prf, ciphertext_buffer, iv, tag, adata, tlen, ol){\n var mac, mac2, i, L, w = sjcl.bitArray, \n ivl = w.bitLength(iv) / 8;\n\n //set up defaults\n adata = adata || [];\n tlen = tlen || sjcl.arrayBuffer.ccm.defaults.tlen;\n ol = ol || ciphertext_buffer.byteLength;\n tlen = Math.ceil(tlen/8) ;\n\n for (L=2; L<4 && ol >>> 8*L; L++) {}\n if (L < 15 - ivl) { L = 15-ivl; }\n iv = w.clamp(iv,8*(15-L));\n \n //prf should use a 256 bit key to make precomputation attacks infeasible\n\n //decrypt the buffer\n mac = sjcl.arrayBuffer.ccm._ctrMode(prf, ciphertext_buffer, iv, tag, tlen, L);\n\n mac2 = sjcl.arrayBuffer.ccm._computeTag(prf, ciphertext_buffer, iv, adata, tlen, ol, L);\n\n //check the tag\n if (!sjcl.bitArray.equal(mac, mac2)){\n throw new sjcl.exception.corrupt(\"ccm: tag doesn't match\");\n }\n\n return ciphertext_buffer;\n\n },\n\n /* Compute the (unencrypted) authentication tag, according to the CCM specification\n * @param {Object} prf The pseudorandom function.\n * @param {ArrayBuffer} data_buffer The plaintext data in an arraybuffer.\n * @param {bitArray} iv The initialization value.\n * @param {bitArray} adata The authenticated data.\n * @param {Number} tlen the desired tag length, in bits.\n * @return {bitArray} The tag, but not yet encrypted.\n * @private\n */\n _computeTag: function(prf, data_buffer, iv, adata, tlen, ol, L){\n var i, plaintext, mac, data, data_blocks_size, data_blocks,\n w = sjcl.bitArray, tmp, macData;\n\n mac = sjcl.mode.ccm._macAdditionalData(prf, adata, iv, tlen, ol, L);\n\n if (data_buffer.byteLength !== 0) {\n data = new DataView(data_buffer);\n //set padding bytes to 0\n for (i=ol; i< data_buffer.byteLength; i++){\n data.setUint8(i,0);\n }\n\n //now to mac the plaintext blocks\n for (i=0; i < data.byteLength; i+=16){\n mac[0] ^= data.getUint32(i);\n mac[1] ^= data.getUint32(i+4);\n mac[2] ^= data.getUint32(i+8);\n mac[3] ^= data.getUint32(i+12);\n\n mac = prf.encrypt(mac);\n }\n }\n\n return sjcl.bitArray.clamp(mac,tlen*8);\n },\n\n /** CCM CTR mode.\n * Encrypt or decrypt data and tag with the prf in CCM-style CTR mode.\n * Mutates given array buffer\n * @param {Object} prf The PRF.\n * @param {ArrayBuffer} data_buffer The data to be encrypted or decrypted.\n * @param {bitArray} iv The initialization vector.\n * @param {bitArray} tag The authentication tag.\n * @param {Number} tlen The length of th etag, in bits.\n * @return {Object} An object with data and tag, the en/decryption of data and tag values.\n * @private\n */\n _ctrMode: function(prf, data_buffer, iv, mac, tlen, L){\n var data, ctr, word0, word1, word2, word3, keyblock, i, w = sjcl.bitArray, xor = w._xor4, n = data_buffer.byteLength/50, p = n;\n\n ctr = new DataView(new ArrayBuffer(16)); //create the first block for the counter\n\n //prf should use a 256 bit key to make precomputation attacks infeasible\n\n // start the ctr\n ctr = w.concat([w.partial(8,L-1)],iv).concat([0,0,0]).slice(0,4);\n\n // en/decrypt the tag\n mac = w.bitSlice(xor(mac,prf.encrypt(ctr)), 0, tlen*8);\n\n ctr[3]++;\n if (ctr[3]===0) ctr[2]++; //increment higher bytes if the lowest 4 bytes are 0\n\n if (data_buffer.byteLength !== 0) {\n data = new DataView(data_buffer);\n //now lets encrypt the message\n for (i=0; i n) {\n sjcl.mode.ccm._callProgressListener(i/data_buffer.byteLength);\n n += p;\n }\n keyblock = prf.encrypt(ctr);\n\n word0 = data.getUint32(i);\n word1 = data.getUint32(i+4);\n word2 = data.getUint32(i+8);\n word3 = data.getUint32(i+12);\n\n data.setUint32(i,word0 ^ keyblock[0]);\n data.setUint32(i+4, word1 ^ keyblock[1]);\n data.setUint32(i+8, word2 ^ keyblock[2]);\n data.setUint32(i+12, word3 ^ keyblock[3]);\n\n ctr[3]++;\n if (ctr[3]===0) ctr[2]++; //increment higher bytes if the lowest 4 bytes are 0\n }\n }\n\n //return the mac, the ciphered data is available through the same data_buffer that was given\n return mac;\n }\n\n};\n" }, { "path": "core/codecArrayBuffer.js", "content": "/** @fileOverview Bit array codec implementations.\n *\n * @author Marco Munizaga\n */\n\n//patch arraybuffers if they don't exist\nif (typeof(ArrayBuffer) === 'undefined') {\n (function(globals){\n \"use strict\";\n globals.ArrayBuffer = function(){};\n globals.DataView = function(){};\n }(this));\n}\n\n/**\n * ArrayBuffer\n * @namespace\n */\nsjcl.codec.arrayBuffer = {\n /** Convert from a bitArray to an ArrayBuffer. \n * Will default to 8byte padding if padding is undefined*/\n fromBits: function (arr, padding, padding_count) {\n var out, i, ol, tmp, smallest;\n padding = padding==undefined ? true : padding;\n padding_count = padding_count || 8;\n\n if (arr.length === 0) {\n return new ArrayBuffer(0);\n }\n\n ol = sjcl.bitArray.bitLength(arr)/8;\n\n //check to make sure the bitLength is divisible by 8, if it isn't \n //we can't do anything since arraybuffers work with bytes, not bits\n if ( sjcl.bitArray.bitLength(arr)%8 !== 0 ) {\n throw new sjcl.exception.invalid(\"Invalid bit size, must be divisble by 8 to fit in an arraybuffer correctly\");\n }\n\n if (padding && ol%padding_count !== 0){\n ol += padding_count - (ol%padding_count);\n }\n\n\n //padded temp for easy copying\n tmp = new DataView(new ArrayBuffer(arr.length*4));\n for (i=0; i= width ? n : new Array(width - n.length + 1).join('0') + n;\n };\n\n for (var i = 0; i < stringBufferView.byteLength; i+=2) {\n if (i%16 == 0) string += ('\\n'+(i).toString(16)+'\\t');\n string += ( pad(stringBufferView.getUint16(i).toString(16),4) + ' ');\n }\n\n if ( typeof console === undefined ){\n console = console || {log:function(){}}; //fix for IE\n }\n console.log(string.toUpperCase());\n }\n};\n\n" }, { "path": "core/codecBase32.js", "content": "/** @fileOverview Bit array codec implementations.\n *\n * @author Nils Kenneweg\n */\n\n/**\n * Base32 encoding/decoding\n * @namespace\n */\nsjcl.codec.base32 = {\n /** The base32 alphabet.\n * @private\n */\n _chars: \"ABCDEFGHIJKLMNOPQRSTUVWXYZ234567\",\n _hexChars: \"0123456789ABCDEFGHIJKLMNOPQRSTUV\",\n\n /* bits in an array */\n BITS: 32,\n /* base to encode at (2^x) */\n BASE: 5,\n /* bits - base */\n REMAINING: 27,\n\n /** Convert from a bitArray to a base32 string. */\n fromBits: function (arr, _noEquals, _hex) {\n var BITS = sjcl.codec.base32.BITS, BASE = sjcl.codec.base32.BASE, REMAINING = sjcl.codec.base32.REMAINING;\n var out = \"\", i, bits=0, c = sjcl.codec.base32._chars, ta=0, bl = sjcl.bitArray.bitLength(arr);\n\n if (_hex) {\n c = sjcl.codec.base32._hexChars;\n }\n\n for (i=0; out.length * BASE < bl; ) {\n out += c.charAt((ta ^ arr[i]>>>bits) >>> REMAINING);\n if (bits < BASE) {\n ta = arr[i] << (BASE-bits);\n bits += REMAINING;\n i++;\n } else {\n ta <<= BASE;\n bits -= BASE;\n }\n }\n while ((out.length & 7) && !_noEquals) { out += \"=\"; }\n\n return out;\n },\n\n /** Convert from a base32 string to a bitArray */\n toBits: function(str, _hex) {\n str = str.replace(/\\s|=/g,'').toUpperCase();\n var BITS = sjcl.codec.base32.BITS, BASE = sjcl.codec.base32.BASE, REMAINING = sjcl.codec.base32.REMAINING;\n var out = [], i, bits=0, c = sjcl.codec.base32._chars, ta=0, x, format=\"base32\";\n\n if (_hex) {\n c = sjcl.codec.base32._hexChars;\n format = \"base32hex\";\n }\n\n for (i=0; i REMAINING) {\n bits -= REMAINING;\n out.push(ta ^ x>>>bits);\n ta = x << (BITS-bits);\n } else {\n bits += BASE;\n ta ^= x << (BITS-bits);\n }\n }\n if (bits&56) {\n out.push(sjcl.bitArray.partial(bits&56, ta, 1));\n }\n return out;\n }\n};\n\nsjcl.codec.base32hex = {\n fromBits: function (arr, _noEquals) { return sjcl.codec.base32.fromBits(arr,_noEquals,1); },\n toBits: function (str) { return sjcl.codec.base32.toBits(str,1); }\n};\n" }, { "path": "core/codecBase64.js", "content": "/** @fileOverview Bit array codec implementations.\n *\n * @author Emily Stark\n * @author Mike Hamburg\n * @author Dan Boneh\n */\n\n/**\n * Base64 encoding/decoding \n * @namespace\n */\nsjcl.codec.base64 = {\n /** The base64 alphabet.\n * @private\n */\n _chars: \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\",\n \n /** Convert from a bitArray to a base64 string. */\n fromBits: function (arr, _noEquals, _url) {\n var out = \"\", i, bits=0, c = sjcl.codec.base64._chars, ta=0, bl = sjcl.bitArray.bitLength(arr);\n if (_url) {\n c = c.substr(0,62) + '-_';\n }\n for (i=0; out.length * 6 < bl; ) {\n out += c.charAt((ta ^ arr[i]>>>bits) >>> 26);\n if (bits < 6) {\n ta = arr[i] << (6-bits);\n bits += 26;\n i++;\n } else {\n ta <<= 6;\n bits -= 6;\n }\n }\n while ((out.length & 3) && !_noEquals) { out += \"=\"; }\n return out;\n },\n \n /** Convert from a base64 string to a bitArray */\n toBits: function(str, _url) {\n str = str.replace(/\\s|=/g,'');\n var out = [], i, bits=0, c = sjcl.codec.base64._chars, ta=0, x;\n if (_url) {\n c = c.substr(0,62) + '-_';\n }\n for (i=0; i 26) {\n bits -= 26;\n out.push(ta ^ x>>>bits);\n ta = x << (32-bits);\n } else {\n bits += 6;\n ta ^= x << (32-bits);\n }\n }\n if (bits&56) {\n out.push(sjcl.bitArray.partial(bits&56, ta, 1));\n }\n return out;\n }\n};\n\nsjcl.codec.base64url = {\n fromBits: function (arr) { return sjcl.codec.base64.fromBits(arr,1,1); },\n toBits: function (str) { return sjcl.codec.base64.toBits(str,1); }\n};\n" }, { "path": "core/codecBytes.js", "content": "/** @fileOverview Bit array codec implementations.\n *\n * @author Emily Stark\n * @author Mike Hamburg\n * @author Dan Boneh\n */\n\n/**\n * Arrays of bytes\n * @namespace\n */\nsjcl.codec.bytes = {\n /** Convert from a bitArray to an array of bytes. */\n fromBits: function (arr) {\n var out = [], bl = sjcl.bitArray.bitLength(arr), i, tmp;\n for (i=0; i>> 24);\n tmp <<= 8;\n }\n return out;\n },\n /** Convert from an array of bytes to a bitArray. */\n toBits: function (bytes) {\n var out = [], i, tmp=0;\n for (i=0; i>> 8 >>> 8 >>> 8);\n tmp <<= 8;\n }\n return decodeURIComponent(escape(out));\n },\n\n /** Convert from a UTF-8 string to a bitArray. */\n toBits: function (str) {\n str = unescape(encodeURIComponent(str));\n var out = [], i, tmp=0;\n for (i=0; i()[]{}@%$#\",\n\n /** The decoder map (maps base 85 to base 256).\n * @private\n */\n _byteMap: [\n 0x00, 0x44, 0x00, 0x54, 0x53, 0x52, 0x48, 0x00, \n 0x4B, 0x4C, 0x46, 0x41, 0x00, 0x3F, 0x3E, 0x45, \n 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, \n 0x08, 0x09, 0x40, 0x00, 0x49, 0x42, 0x4A, 0x47, \n 0x51, 0x24, 0x25, 0x26, 0x27, 0x28, 0x29, 0x2A, \n 0x2B, 0x2C, 0x2D, 0x2E, 0x2F, 0x30, 0x31, 0x32, \n 0x33, 0x34, 0x35, 0x36, 0x37, 0x38, 0x39, 0x3A, \n 0x3B, 0x3C, 0x3D, 0x4D, 0x00, 0x4E, 0x43, 0x00, \n 0x00, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E, 0x0F, 0x10, \n 0x11, 0x12, 0x13, 0x14, 0x15, 0x16, 0x17, 0x18, \n 0x19, 0x1A, 0x1B, 0x1C, 0x1D, 0x1E, 0x1F, 0x20, \n 0x21, 0x22, 0x23, 0x4F, 0x00, 0x50, 0x00, 0x00\n ],\n\n /**\n * @summary Method to convert a bitArray to a Z85-encoded string.\n * The bits represented by the array MUST be multiples of 4 bytes.\n * @param {bitArray} arr - The input bitArray.\n * @return {string} The Z85-encoded string.\n */\n fromBits: function (arr) {\n // Sanity checks\n if (!arr) {\n return null;\n }\n // Check we have multiples of 4 bytes (32 bits)\n if (0 !== sjcl.bitArray.bitLength(arr) % 32) {\n throw new sjcl.exception.invalid(\"Invalid bitArray length!\");\n }\n\n var out = \"\", c = sjcl.codec.z85._chars;\n\n // Convert sequences of 4 bytes (each word) to 5 characters.\n for (var i = 0; i < arr.length; ++i) {\n // Each element in the bitArray is a 32-bit (4-byte) word.\n var word = arr[i];\n var value = 0;\n for (var j = 0; j < 4; ++j) {\n // Extract each successive byte from the word from the left.\n var byteChunk = (word >>> 8*(4 - j - 1)) & 0xFF;\n // Accumulate in base-256\n value = value*256 + byteChunk;\n }\n var divisor = 85*85*85*85;\n while (divisor) {\n out += c.charAt(Math.floor(value/divisor) % 85);\n divisor = Math.floor(divisor/85);\n }\n }\n\n // Sanity check - each 4-bytes (1 word) should yield 5 characters.\n var encodedSize = arr.length*5;\n if (out.length !== encodedSize) {\n throw new sjcl.exception.invalid(\"Bad Z85 conversion!\");\n }\n return out;\n },\n\n /**\n * @summary Method to convert a Z85-encoded string to a bitArray.\n * The length of the string MUST be a multiple of 5\n * (else it is not a valid Z85 string).\n * @param {string} str - A valid Z85-encoded string.\n * @return {bitArray} The decoded data represented as a bitArray.\n */\n toBits: function(str) {\n // Sanity check\n if (!str) {\n return [];\n }\n // Accept only strings bounded to 5 bytes\n if (0 !== str.length % 5) {\n throw new sjcl.exception.invalid(\"Invalid Z85 string!\");\n }\n\n var out = [], value = 0, byteMap = sjcl.codec.z85._byteMap;\n var word = 0, wordSize = 0;\n for (var i = 0; i < str.length;) {\n // Accumulate value in base 85.\n value = value * 85 + byteMap[str[i++].charCodeAt(0) - 32]; \n if (0 === i % 5) {\n // Output value in base-256\n var divisor = 256*256*256;\n while (divisor) {\n // The following is equivalent to a left shift by 8 bits\n // followed by OR-ing; however, left shift may cause sign problems\n // due to 2's complement interpretation,\n // and we're operating on unsigned values.\n word = (word * Math.pow(2, 8)) + (Math.floor(value/divisor) % 256);\n ++wordSize;\n // If 4 bytes have been acumulated, push the word into the bitArray.\n if (4 === wordSize) {\n out.push(word);\n word = 0, wordSize = 0;\n }\n divisor = Math.floor(divisor/256);\n }\n value = 0;\n }\n }\n\n return out;\n }\n}\n" }, { "path": "core/convenience.js", "content": "/** @fileOverview Convenience functions centered around JSON encapsulation.\n *\n * @author Emily Stark\n * @author Mike Hamburg\n * @author Dan Boneh\n */\n\n /**\n * JSON encapsulation\n * @namespace\n */\n sjcl.json = {\n /** Default values for encryption */\n defaults: { v:1, iter:10000, ks:128, ts:64, mode:\"ccm\", adata:\"\", cipher:\"aes\" },\n\n /** Simple encryption function.\n * @param {String|bitArray} password The password or key.\n * @param {String} plaintext The data to encrypt.\n * @param {Object} [params] The parameters including tag, iv and salt.\n * @param {Object} [rp] A returned version with filled-in parameters.\n * @return {Object} The cipher raw data.\n * @throws {sjcl.exception.invalid} if a parameter is invalid.\n */\n _encrypt: function (password, plaintext, params, rp) {\n params = params || {};\n rp = rp || {};\n\n var j = sjcl.json, p = j._add({ iv: sjcl.random.randomWords(4,0) },\n j.defaults), tmp, prp, adata;\n j._add(p, params);\n adata = p.adata;\n if (typeof p.salt === \"string\") {\n p.salt = sjcl.codec.base64.toBits(p.salt);\n }\n if (typeof p.iv === \"string\") {\n p.iv = sjcl.codec.base64.toBits(p.iv);\n }\n\n if (!sjcl.mode[p.mode] ||\n !sjcl.cipher[p.cipher] ||\n (typeof password === \"string\" && p.iter <= 100) ||\n (p.ts !== 64 && p.ts !== 96 && p.ts !== 128) ||\n (p.ks !== 128 && p.ks !== 192 && p.ks !== 256) ||\n (p.iv.length < 2 || p.iv.length > 4)) {\n throw new sjcl.exception.invalid(\"json encrypt: invalid parameters\");\n }\n\n if (typeof password === \"string\") {\n tmp = sjcl.misc.cachedPbkdf2(password, p);\n password = tmp.key.slice(0,p.ks/32);\n p.salt = tmp.salt;\n } else if (sjcl.ecc && password instanceof sjcl.ecc.elGamal.publicKey) {\n tmp = password.kem();\n p.kemtag = tmp.tag;\n password = tmp.key.slice(0,p.ks/32);\n }\n if (typeof plaintext === \"string\") {\n plaintext = sjcl.codec.utf8String.toBits(plaintext);\n }\n if (typeof adata === \"string\") {\n p.adata = adata = sjcl.codec.utf8String.toBits(adata);\n }\n prp = new sjcl.cipher[p.cipher](password);\n\n /* return the json data */\n j._add(rp, p);\n rp.key = password;\n\n /* do the encryption */\n if (p.mode === \"ccm\" && sjcl.arrayBuffer && sjcl.arrayBuffer.ccm && plaintext instanceof ArrayBuffer) {\n p.ct = sjcl.arrayBuffer.ccm.encrypt(prp, plaintext, p.iv, adata, p.ts);\n } else {\n p.ct = sjcl.mode[p.mode].encrypt(prp, plaintext, p.iv, adata, p.ts);\n }\n\n //return j.encode(j._subtract(p, j.defaults));\n return p;\n },\n\n /** Simple encryption function.\n * @param {String|bitArray} password The password or key.\n * @param {String} plaintext The data to encrypt.\n * @param {Object} [params] The parameters including tag, iv and salt.\n * @param {Object} [rp] A returned version with filled-in parameters.\n * @return {String} The ciphertext serialized data.\n * @throws {sjcl.exception.invalid} if a parameter is invalid.\n */\n encrypt: function (password, plaintext, params, rp) {\n var j = sjcl.json, p = j._encrypt.apply(j, arguments);\n return j.encode(p);\n },\n\n /** Simple decryption function.\n * @param {String|bitArray} password The password or key.\n * @param {Object} ciphertext The cipher raw data to decrypt.\n * @param {Object} [params] Additional non-default parameters.\n * @param {Object} [rp] A returned object with filled parameters.\n * @return {String} The plaintext.\n * @throws {sjcl.exception.invalid} if a parameter is invalid.\n * @throws {sjcl.exception.corrupt} if the ciphertext is corrupt.\n */\n _decrypt: function (password, ciphertext, params, rp) {\n params = params || {};\n rp = rp || {};\n\n var j = sjcl.json, p = j._add(j._add(j._add({},j.defaults),ciphertext), params, true), ct, tmp, prp, adata=p.adata;\n if (typeof p.salt === \"string\") {\n p.salt = sjcl.codec.base64.toBits(p.salt);\n }\n if (typeof p.iv === \"string\") {\n p.iv = sjcl.codec.base64.toBits(p.iv);\n }\n\n if (!sjcl.mode[p.mode] ||\n !sjcl.cipher[p.cipher] ||\n (typeof password === \"string\" && p.iter <= 100) ||\n (p.ts !== 64 && p.ts !== 96 && p.ts !== 128) ||\n (p.ks !== 128 && p.ks !== 192 && p.ks !== 256) ||\n (!p.iv) ||\n (p.iv.length < 2 || p.iv.length > 4)) {\n throw new sjcl.exception.invalid(\"json decrypt: invalid parameters\");\n }\n\n if (typeof password === \"string\") {\n tmp = sjcl.misc.cachedPbkdf2(password, p);\n password = tmp.key.slice(0,p.ks/32);\n p.salt = tmp.salt;\n } else if (sjcl.ecc && password instanceof sjcl.ecc.elGamal.secretKey) {\n password = password.unkem(sjcl.codec.base64.toBits(p.kemtag)).slice(0,p.ks/32);\n }\n if (typeof adata === \"string\") {\n adata = sjcl.codec.utf8String.toBits(adata);\n }\n prp = new sjcl.cipher[p.cipher](password);\n\n /* do the decryption */\n if (p.mode === \"ccm\" && sjcl.arrayBuffer && sjcl.arrayBuffer.ccm && p.ct instanceof ArrayBuffer) {\n ct = sjcl.arrayBuffer.ccm.decrypt(prp, p.ct, p.iv, p.tag, adata, p.ts);\n } else {\n ct = sjcl.mode[p.mode].decrypt(prp, p.ct, p.iv, adata, p.ts);\n }\n\n /* return the json data */\n j._add(rp, p);\n rp.key = password;\n\n if (params.raw === 1) {\n return ct;\n } else {\n return sjcl.codec.utf8String.fromBits(ct);\n }\n },\n\n /** Simple decryption function.\n * @param {String|bitArray} password The password or key.\n * @param {String} ciphertext The ciphertext to decrypt.\n * @param {Object} [params] Additional non-default parameters.\n * @param {Object} [rp] A returned object with filled parameters.\n * @return {String} The plaintext.\n * @throws {sjcl.exception.invalid} if a parameter is invalid.\n * @throws {sjcl.exception.corrupt} if the ciphertext is corrupt.\n */\n decrypt: function (password, ciphertext, params, rp) {\n var j = sjcl.json;\n return j._decrypt(password, j.decode(ciphertext), params, rp);\n },\n\n /** Encode a flat structure into a JSON string.\n * @param {Object} obj The structure to encode.\n * @return {String} A JSON string.\n * @throws {sjcl.exception.invalid} if obj has a non-alphanumeric property.\n * @throws {sjcl.exception.bug} if a parameter has an unsupported type.\n */\n encode: function (obj) {\n var i, out='{', comma='';\n for (i in obj) {\n if (obj.hasOwnProperty(i)) {\n if (!i.match(/^[a-z0-9]+$/i)) {\n throw new sjcl.exception.invalid(\"json encode: invalid property name\");\n }\n out += comma + '\"' + i + '\":';\n comma = ',';\n\n switch (typeof obj[i]) {\n case 'number':\n case 'boolean':\n out += obj[i];\n break;\n\n case 'string':\n out += '\"' + escape(obj[i]) + '\"';\n break;\n\n case 'object':\n out += '\"' + sjcl.codec.base64.fromBits(obj[i],0) + '\"';\n break;\n\n default:\n throw new sjcl.exception.bug(\"json encode: unsupported type\");\n }\n }\n }\n return out+'}';\n },\n\n /** Decode a simple (flat) JSON string into a structure. The ciphertext,\n * adata, salt and iv will be base64-decoded.\n * @param {String} str The string.\n * @return {Object} The decoded structure.\n * @throws {sjcl.exception.invalid} if str isn't (simple) JSON.\n */\n decode: function (str) {\n str = str.replace(/\\s/g,'');\n if (!str.match(/^\\{.*\\}$/)) {\n throw new sjcl.exception.invalid(\"json decode: this isn't json!\");\n }\n var a = str.replace(/^\\{|\\}$/g, '').split(/,/), out={}, i, m;\n for (i=0; i= 0; carry--) {\n if (++c[carry]) break; // If overflowing, it'll be 0 and we'll have to continue propagating the carry\n }\n }\n return sjcl.bitArray.clamp(d, bl);\n }\n };\n};\n" }, { "path": "core/ecc.js", "content": "/**\n * base class for all ecc operations.\n * @namespace\n */\nsjcl.ecc = {};\n\n/**\n * Represents a point on a curve in affine coordinates.\n * @constructor\n * @param {sjcl.ecc.curve} curve The curve that this point lies on.\n * @param {bigInt} x The x coordinate.\n * @param {bigInt} y The y coordinate.\n */\nsjcl.ecc.point = function(curve,x,y) {\n if (x === undefined) {\n this.isIdentity = true;\n } else {\n if (x instanceof sjcl.bn) {\n x = new curve.field(x);\n }\n if (y instanceof sjcl.bn) {\n y = new curve.field(y);\n }\n\n this.x = x;\n this.y = y;\n\n this.isIdentity = false;\n }\n this.curve = curve;\n};\n\n\n\nsjcl.ecc.point.prototype = {\n toJac: function() {\n return new sjcl.ecc.pointJac(this.curve, this.x, this.y, new this.curve.field(1));\n },\n\n mult: function(k) {\n return this.toJac().mult(k, this).toAffine();\n },\n\n /**\n * Multiply this point by k, added to affine2*k2, and return the answer in Jacobian coordinates.\n * @param {bigInt} k The coefficient to multiply this by.\n * @param {bigInt} k2 The coefficient to multiply affine2 this by.\n * @param {sjcl.ecc.point} affine The other point in affine coordinates.\n * @return {sjcl.ecc.pointJac} The result of the multiplication and addition, in Jacobian coordinates.\n */\n mult2: function(k, k2, affine2) {\n return this.toJac().mult2(k, this, k2, affine2).toAffine();\n },\n\n multiples: function() {\n var m, i, j;\n if (this._multiples === undefined) {\n j = this.toJac().doubl();\n m = [j];\n for (i=3; i<16; i++) {\n j = j.add(this);\n m.push(j);\n }\n this._multiples = [new sjcl.ecc.point(this.curve), this].concat(sjcl.ecc.pointJac.toAffineMultiple(m));\n }\n return this._multiples;\n },\n\n negate: function() {\n var newY = new this.curve.field(0).sub(this.y).normalize().reduce();\n return new sjcl.ecc.point(this.curve, this.x, newY);\n },\n\n isValid: function() {\n return this.y.square().equals(this.curve.b.add(this.x.mul(this.curve.a.add(this.x.square()))));\n },\n\n toBits: function() {\n return sjcl.bitArray.concat(this.x.toBits(), this.y.toBits());\n }\n};\n\n/**\n * Represents a point on a curve in Jacobian coordinates. Coordinates can be specified as bigInts or strings (which\n * will be converted to bigInts).\n *\n * @constructor\n * @param {bigInt/string} x The x coordinate.\n * @param {bigInt/string} y The y coordinate.\n * @param {bigInt/string} z The z coordinate.\n * @param {sjcl.ecc.curve} curve The curve that this point lies on.\n */\nsjcl.ecc.pointJac = function(curve, x, y, z) {\n if (x === undefined) {\n this.isIdentity = true;\n } else {\n this.x = x;\n this.y = y;\n this.z = z;\n this.isIdentity = false;\n }\n this.curve = curve;\n};\n\n/**\n * Returns points converted to affine coordinates.\n * @param {Array} points An array of {sjcl.ecc.pointJac} to convert.\n * @return {Array} An array of {sjcl.ecc.point} that were converted.\n */\nsjcl.ecc.pointJac.toAffineMultiple = function (points) {\n var i=0, j, ret = new Array(points.length), p, tmp, z, zi, zi2, curve;\n for (; i=0; i--) {\n p = points[i];\n if (p.isIdentity || p.z.equals(0)) {\n ret[i] = new sjcl.ecc.point(p.curve);\n } else {\n // if not last\n if (j >= 0) {\n // remove all other inverted z coordinates from product of inverses\n // zi is now inverse of p.z\n zi = z.mul(tmp[j]);\n // remove the inverse of p.z from product of inverses\n z = z.mul(p.z);\n j--;\n } else {\n zi = z;\n }\n zi2 = zi.square();\n ret[i] = new sjcl.ecc.point(p.curve, p.x.mul(zi2).fullReduce(), p.y.mul(zi2.mul(zi)).fullReduce());\n }\n }\n return ret;\n};\n\nsjcl.ecc.pointJac.prototype = {\n /**\n * Adds S and T and returns the result in Jacobian coordinates. Note that S must be in Jacobian coordinates and T must be in affine coordinates.\n * @param {sjcl.ecc.pointJac} S One of the points to add, in Jacobian coordinates.\n * @param {sjcl.ecc.point} T The other point to add, in affine coordinates.\n * @return {sjcl.ecc.pointJac} The sum of the two points, in Jacobian coordinates.\n */\n add: function(T) {\n var S = this, sz2, c, d, c2, x1, x2, x, y1, y2, y, z;\n if (S.curve !== T.curve) {\n throw new sjcl.exception.invalid(\"sjcl.ecc.add(): Points must be on the same curve to add them!\");\n }\n\n if (S.isIdentity) {\n return T.toJac();\n } else if (T.isIdentity) {\n return S;\n }\n\n sz2 = S.z.square();\n c = T.x.mul(sz2).subM(S.x);\n\n if (c.equals(0)) {\n if (S.y.equals(T.y.mul(sz2.mul(S.z)))) {\n // same point\n return S.doubl();\n } else {\n // inverses\n return new sjcl.ecc.pointJac(S.curve);\n }\n }\n\n d = T.y.mul(sz2.mul(S.z)).subM(S.y);\n c2 = c.square();\n\n x1 = d.square();\n x2 = c.square().mul(c).addM( S.x.add(S.x).mul(c2) );\n x = x1.subM(x2);\n\n y1 = S.x.mul(c2).subM(x).mul(d);\n y2 = S.y.mul(c.square().mul(c));\n y = y1.subM(y2);\n\n z = S.z.mul(c);\n\n return new sjcl.ecc.pointJac(this.curve,x,y,z);\n },\n\n /**\n * doubles this point.\n * @return {sjcl.ecc.pointJac} The doubled point.\n */\n doubl: function() {\n if (this.isIdentity) { return this; }\n\n var\n y2 = this.y.square(),\n a = y2.mul(this.x.mul(4)),\n b = y2.square().mul(8),\n z2 = this.z.square(),\n c = this.curve.a.toString() == (new sjcl.bn(-3)).toString() ?\n this.x.sub(z2).mul(3).mul(this.x.add(z2)) :\n this.x.square().mul(3).add(z2.square().mul(this.curve.a)),\n x = c.square().subM(a).subM(a),\n y = a.sub(x).mul(c).subM(b),\n z = this.y.add(this.y).mul(this.z);\n return new sjcl.ecc.pointJac(this.curve, x, y, z);\n },\n\n /**\n * Returns a copy of this point converted to affine coordinates.\n * @return {sjcl.ecc.point} The converted point.\n */\n toAffine: function() {\n if (this.isIdentity || this.z.equals(0)) {\n return new sjcl.ecc.point(this.curve);\n }\n var zi = this.z.inverse(), zi2 = zi.square();\n return new sjcl.ecc.point(this.curve, this.x.mul(zi2).fullReduce(), this.y.mul(zi2.mul(zi)).fullReduce());\n },\n\n /**\n * Multiply this point by k and return the answer in Jacobian coordinates.\n * @param {bigInt} k The coefficient to multiply by.\n * @param {sjcl.ecc.point} affine This point in affine coordinates.\n * @return {sjcl.ecc.pointJac} The result of the multiplication, in Jacobian coordinates.\n */\n mult: function(k, affine) {\n if (typeof(k) === \"number\") {\n k = [k];\n } else if (k.limbs !== undefined) {\n k = k.normalize().limbs;\n }\n\n var i, j, out = new sjcl.ecc.point(this.curve).toJac(), multiples = affine.multiples();\n\n for (i=k.length-1; i>=0; i--) {\n for (j=sjcl.bn.prototype.radix-4; j>=0; j-=4) {\n out = out.doubl().doubl().doubl().doubl().add(multiples[k[i]>>j & 0xF]);\n }\n }\n\n return out;\n },\n\n /**\n * Multiply this point by k, added to affine2*k2, and return the answer in Jacobian coordinates.\n * @param {bigInt} k The coefficient to multiply this by.\n * @param {sjcl.ecc.point} affine This point in affine coordinates.\n * @param {bigInt} k2 The coefficient to multiply affine2 this by.\n * @param {sjcl.ecc.point} affine The other point in affine coordinates.\n * @return {sjcl.ecc.pointJac} The result of the multiplication and addition, in Jacobian coordinates.\n */\n mult2: function(k1, affine, k2, affine2) {\n if (typeof(k1) === \"number\") {\n k1 = [k1];\n } else if (k1.limbs !== undefined) {\n k1 = k1.normalize().limbs;\n }\n\n if (typeof(k2) === \"number\") {\n k2 = [k2];\n } else if (k2.limbs !== undefined) {\n k2 = k2.normalize().limbs;\n }\n\n var i, j, out = new sjcl.ecc.point(this.curve).toJac(), m1 = affine.multiples(),\n m2 = affine2.multiples(), l1, l2;\n\n for (i=Math.max(k1.length,k2.length)-1; i>=0; i--) {\n l1 = k1[i] | 0;\n l2 = k2[i] | 0;\n for (j=sjcl.bn.prototype.radix-4; j>=0; j-=4) {\n out = out.doubl().doubl().doubl().doubl().add(m1[l1>>j & 0xF]).add(m2[l2>>j & 0xF]);\n }\n }\n\n return out;\n },\n\n negate: function() {\n return this.toAffine().negate().toJac();\n },\n\n isValid: function() {\n var z2 = this.z.square(), z4 = z2.square(), z6 = z4.mul(z2);\n return this.y.square().equals(\n this.curve.b.mul(z6).add(this.x.mul(\n this.curve.a.mul(z4).add(this.x.square()))));\n }\n};\n\n/**\n * Construct an elliptic curve. Most users will not use this and instead start with one of the NIST curves defined below.\n *\n * @constructor\n * @param {bigInt} p The prime modulus.\n * @param {bigInt} r The prime order of the curve.\n * @param {bigInt} a The constant a in the equation of the curve y^2 = x^3 + ax + b (for NIST curves, a is always -3).\n * @param {bigInt} x The x coordinate of a base point of the curve.\n * @param {bigInt} y The y coordinate of a base point of the curve.\n */\nsjcl.ecc.curve = function(Field, r, a, b, x, y) {\n this.field = Field;\n this.r = new sjcl.bn(r);\n this.a = new Field(a);\n this.b = new Field(b);\n this.G = new sjcl.ecc.point(this, new Field(x), new Field(y));\n};\n\nsjcl.ecc.curve.prototype.fromBits = function (bits) {\n var w = sjcl.bitArray, l = this.field.prototype.exponent + 7 & -8,\n p = new sjcl.ecc.point(this, this.field.fromBits(w.bitSlice(bits, 0, l)),\n this.field.fromBits(w.bitSlice(bits, l, 2*l)));\n if (!p.isValid()) {\n throw new sjcl.exception.corrupt(\"not on the curve!\");\n }\n return p;\n};\n\nsjcl.ecc.curves = {\n c192: new sjcl.ecc.curve(\n sjcl.bn.prime.p192,\n \"0xffffffffffffffffffffffff99def836146bc9b1b4d22831\",\n -3,\n \"0x64210519e59c80e70fa7e9ab72243049feb8deecc146b9b1\",\n \"0x188da80eb03090f67cbf20eb43a18800f4ff0afd82ff1012\",\n \"0x07192b95ffc8da78631011ed6b24cdd573f977a11e794811\"),\n\n c224: new sjcl.ecc.curve(\n sjcl.bn.prime.p224,\n \"0xffffffffffffffffffffffffffff16a2e0b8f03e13dd29455c5c2a3d\",\n -3,\n \"0xb4050a850c04b3abf54132565044b0b7d7bfd8ba270b39432355ffb4\",\n \"0xb70e0cbd6bb4bf7f321390b94a03c1d356c21122343280d6115c1d21\",\n \"0xbd376388b5f723fb4c22dfe6cd4375a05a07476444d5819985007e34\"),\n\n c256: new sjcl.ecc.curve(\n sjcl.bn.prime.p256,\n \"0xffffffff00000000ffffffffffffffffbce6faada7179e84f3b9cac2fc632551\",\n -3,\n \"0x5ac635d8aa3a93e7b3ebbd55769886bc651d06b0cc53b0f63bce3c3e27d2604b\",\n \"0x6b17d1f2e12c4247f8bce6e563a440f277037d812deb33a0f4a13945d898c296\",\n \"0x4fe342e2fe1a7f9b8ee7eb4a7c0f9e162bce33576b315ececbb6406837bf51f5\"),\n\n c384: new sjcl.ecc.curve(\n sjcl.bn.prime.p384,\n \"0xffffffffffffffffffffffffffffffffffffffffffffffffc7634d81f4372ddf581a0db248b0a77aecec196accc52973\",\n -3,\n \"0xb3312fa7e23ee7e4988e056be3f82d19181d9c6efe8141120314088f5013875ac656398d8a2ed19d2a85c8edd3ec2aef\",\n \"0xaa87ca22be8b05378eb1c71ef320ad746e1d3b628ba79b9859f741e082542a385502f25dbf55296c3a545e3872760ab7\",\n \"0x3617de4a96262c6f5d9e98bf9292dc29f8f41dbd289a147ce9da3113b5f0b8c00a60b1ce1d7e819d7a431d7c90ea0e5f\"),\n \n c521: new sjcl.ecc.curve(\n sjcl.bn.prime.p521,\n \"0x1FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFA51868783BF2F966B7FCC0148F709A5D03BB5C9B8899C47AEBB6FB71E91386409\",\n -3,\n \"0x051953EB9618E1C9A1F929A21A0B68540EEA2DA725B99B315F3B8B489918EF109E156193951EC7E937B1652C0BD3BB1BF073573DF883D2C34F1EF451FD46B503F00\",\n \"0xC6858E06B70404E9CD9E3ECB662395B4429C648139053FB521F828AF606B4D3DBAA14B5E77EFE75928FE1DC127A2FFA8DE3348B3C1856A429BF97E7E31C2E5BD66\",\n \"0x11839296A789A3BC0045C8A5FB42C7D1BD998F54449579B446817AFBD17273E662C97EE72995EF42640C550B9013FAD0761353C7086A272C24088BE94769FD16650\"),\n\n k192: new sjcl.ecc.curve(\n sjcl.bn.prime.p192k,\n \"0xfffffffffffffffffffffffe26f2fc170f69466a74defd8d\",\n 0,\n 3,\n \"0xdb4ff10ec057e9ae26b07d0280b7f4341da5d1b1eae06c7d\",\n \"0x9b2f2f6d9c5628a7844163d015be86344082aa88d95e2f9d\"),\n\n k224: new sjcl.ecc.curve(\n sjcl.bn.prime.p224k,\n \"0x010000000000000000000000000001dce8d2ec6184caf0a971769fb1f7\",\n 0,\n 5,\n \"0xa1455b334df099df30fc28a169a467e9e47075a90f7e650eb6b7a45c\",\n \"0x7e089fed7fba344282cafbd6f7e319f7c0b0bd59e2ca4bdb556d61a5\"),\n\n k256: new sjcl.ecc.curve(\n sjcl.bn.prime.p256k,\n \"0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141\",\n 0,\n 7,\n \"0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798\",\n \"0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8\")\n\n};\n\nsjcl.ecc.curveName = function (curve) {\n var curcurve;\n for (curcurve in sjcl.ecc.curves) {\n if (sjcl.ecc.curves.hasOwnProperty(curcurve)) {\n if (sjcl.ecc.curves[curcurve] === curve) {\n return curcurve;\n }\n }\n }\n\n throw new sjcl.exception.invalid(\"no such curve\");\n};\n\nsjcl.ecc.deserialize = function (key) {\n var types = [\"elGamal\", \"ecdsa\"];\n\n if (!key || !key.curve || !sjcl.ecc.curves[key.curve]) { throw new sjcl.exception.invalid(\"invalid serialization\"); }\n if (types.indexOf(key.type) === -1) { throw new sjcl.exception.invalid(\"invalid type\"); }\n\n var curve = sjcl.ecc.curves[key.curve];\n\n if (key.secretKey) {\n if (!key.exponent) { throw new sjcl.exception.invalid(\"invalid exponent\"); }\n var exponent = new sjcl.bn(key.exponent);\n return new sjcl.ecc[key.type].secretKey(curve, exponent);\n } else {\n if (!key.point) { throw new sjcl.exception.invalid(\"invalid point\"); }\n \n var point = curve.fromBits(sjcl.codec.hex.toBits(key.point));\n return new sjcl.ecc[key.type].publicKey(curve, point);\n }\n};\n\n/** our basicKey classes\n*/\nsjcl.ecc.basicKey = {\n /** ecc publicKey.\n * @constructor\n * @param {curve} curve the elliptic curve\n * @param {point} point the point on the curve\n */\n publicKey: function(curve, point) {\n this._curve = curve;\n this._curveBitLength = curve.r.bitLength();\n if (point instanceof Array) {\n this._point = curve.fromBits(point);\n } else {\n this._point = point;\n }\n\n if (!this._point.isValid()) {\n throw new sjcl.exception.corrupt(\"not on the curve!\");\n }\n\n this.serialize = function () {\n var curveName = sjcl.ecc.curveName(curve);\n return {\n type: this.getType(),\n secretKey: false,\n point: sjcl.codec.hex.fromBits(this._point.toBits()),\n curve: curveName\n };\n };\n\n /** get this keys point data\n * @return x and y as bitArrays\n */\n this.get = function() {\n var pointbits = this._point.toBits();\n var len = sjcl.bitArray.bitLength(pointbits);\n var x = sjcl.bitArray.bitSlice(pointbits, 0, len/2);\n var y = sjcl.bitArray.bitSlice(pointbits, len/2);\n return { x: x, y: y };\n };\n },\n\n /** ecc secretKey\n * @constructor\n * @param {curve} curve the elliptic curve\n * @param exponent\n */\n secretKey: function(curve, exponent) {\n this._curve = curve;\n this._curveBitLength = curve.r.bitLength();\n this._exponent = exponent;\n\n this.serialize = function () {\n var exponent = this.get();\n var curveName = sjcl.ecc.curveName(curve);\n return {\n type: this.getType(),\n secretKey: true,\n exponent: sjcl.codec.hex.fromBits(exponent),\n curve: curveName\n };\n };\n\n /** get this keys exponent data\n * @return {bitArray} exponent\n */\n this.get = function () {\n return this._exponent.toBits();\n };\n }\n};\n\n/** @private */\nsjcl.ecc.basicKey.generateKeys = function(cn) {\n return function generateKeys(curve, paranoia, sec) {\n curve = curve || 256;\n\n if (typeof curve === \"number\") {\n curve = sjcl.ecc.curves['c'+curve];\n if (curve === undefined) {\n throw new sjcl.exception.invalid(\"no such curve\");\n }\n }\n sec = sec || sjcl.bn.random(curve.r, paranoia);\n\n var pub = curve.G.mult(sec);\n return { pub: new sjcl.ecc[cn].publicKey(curve, pub),\n sec: new sjcl.ecc[cn].secretKey(curve, sec) };\n };\n};\n\n/** elGamal keys */\nsjcl.ecc.elGamal = {\n /** generate keys\n * @function\n * @param curve\n * @param {int} paranoia Paranoia for generation (default 6)\n * @param {secretKey} sec secret Key to use. used to get the publicKey for ones secretKey\n */\n generateKeys: sjcl.ecc.basicKey.generateKeys(\"elGamal\"),\n /** elGamal publicKey.\n * @constructor\n * @augments sjcl.ecc.basicKey.publicKey\n */\n publicKey: function (curve, point) {\n sjcl.ecc.basicKey.publicKey.apply(this, arguments);\n },\n /** elGamal secretKey\n * @constructor\n * @augments sjcl.ecc.basicKey.secretKey\n */\n secretKey: function (curve, exponent) {\n sjcl.ecc.basicKey.secretKey.apply(this, arguments);\n }\n};\n\nsjcl.ecc.elGamal.publicKey.prototype = {\n /** Kem function of elGamal Public Key\n * @param paranoia paranoia to use for randomization.\n * @return {object} key and tag. unkem(tag) with the corresponding secret key results in the key returned.\n */\n kem: function(paranoia) {\n var sec = sjcl.bn.random(this._curve.r, paranoia),\n tag = this._curve.G.mult(sec).toBits(),\n key = sjcl.hash.sha256.hash(this._point.mult(sec).toBits());\n return { key: key, tag: tag };\n },\n \n getType: function() {\n return \"elGamal\";\n }\n};\n\nsjcl.ecc.elGamal.secretKey.prototype = {\n /** UnKem function of elGamal Secret Key\n * @param {bitArray} tag The Tag to decrypt.\n * @return {bitArray} decrypted key.\n */\n unkem: function(tag) {\n return sjcl.hash.sha256.hash(this._curve.fromBits(tag).mult(this._exponent).toBits());\n },\n\n /** Diffie-Hellmann function\n * @param {elGamal.publicKey} pk The Public Key to do Diffie-Hellmann with\n * @return {bitArray} diffie-hellmann result for this key combination.\n */\n dh: function(pk) {\n return sjcl.hash.sha256.hash(pk._point.mult(this._exponent).toBits());\n },\n\n /** Diffie-Hellmann function, compatible with Java generateSecret\n * @param {elGamal.publicKey} pk The Public Key to do Diffie-Hellmann with\n * @return {bitArray} undigested X value, diffie-hellmann result for this key combination,\n * compatible with Java generateSecret().\n */\n dhJavaEc: function(pk) {\n return pk._point.mult(this._exponent).x.toBits();\n }, \n\n getType: function() {\n return \"elGamal\";\n }\n};\n\n/** ecdsa keys */\nsjcl.ecc.ecdsa = {\n /** generate keys\n * @function\n * @param curve\n * @param {int} paranoia Paranoia for generation (default 6)\n * @param {secretKey} sec secret Key to use. used to get the publicKey for ones secretKey\n */\n generateKeys: sjcl.ecc.basicKey.generateKeys(\"ecdsa\")\n};\n\n/** ecdsa publicKey.\n* @constructor\n* @augments sjcl.ecc.basicKey.publicKey\n*/\nsjcl.ecc.ecdsa.publicKey = function (curve, point) {\n sjcl.ecc.basicKey.publicKey.apply(this, arguments);\n};\n\n/** specific functions for ecdsa publicKey. */\nsjcl.ecc.ecdsa.publicKey.prototype = {\n /** Diffie-Hellmann function\n * @param {bitArray} hash hash to verify.\n * @param {bitArray} rs signature bitArray.\n * @param {boolean} fakeLegacyVersion use old legacy version\n */\n verify: function(hash, rs, fakeLegacyVersion) {\n if (sjcl.bitArray.bitLength(hash) > this._curveBitLength) {\n hash = sjcl.bitArray.clamp(hash, this._curveBitLength);\n }\n var w = sjcl.bitArray,\n R = this._curve.r,\n l = this._curveBitLength,\n r = sjcl.bn.fromBits(w.bitSlice(rs,0,l)),\n ss = sjcl.bn.fromBits(w.bitSlice(rs,l,2*l)),\n s = fakeLegacyVersion ? ss : ss.inverseMod(R),\n hG = sjcl.bn.fromBits(hash).mul(s).mod(R),\n hA = r.mul(s).mod(R),\n r2 = this._curve.G.mult2(hG, hA, this._point).x;\n if (r.equals(0) || ss.equals(0) || r.greaterEquals(R) || ss.greaterEquals(R) || !r2.equals(r)) {\n if (fakeLegacyVersion === undefined) {\n return this.verify(hash, rs, true);\n } else {\n throw (new sjcl.exception.corrupt(\"signature didn't check out\"));\n }\n }\n return true;\n },\n\n getType: function() {\n return \"ecdsa\";\n }\n};\n\n/** ecdsa secretKey\n* @constructor\n* @augments sjcl.ecc.basicKey.publicKey\n*/\nsjcl.ecc.ecdsa.secretKey = function (curve, exponent) {\n sjcl.ecc.basicKey.secretKey.apply(this, arguments);\n};\n\n/** specific functions for ecdsa secretKey. */\nsjcl.ecc.ecdsa.secretKey.prototype = {\n /** Diffie-Hellmann function\n * @param {bitArray} hash hash to sign.\n * @param {int} paranoia paranoia for random number generation\n * @param {boolean} fakeLegacyVersion use old legacy version\n */\n sign: function(hash, paranoia, fakeLegacyVersion, fixedKForTesting) {\n if (sjcl.bitArray.bitLength(hash) > this._curveBitLength) {\n hash = sjcl.bitArray.clamp(hash, this._curveBitLength);\n }\n var R = this._curve.r,\n l = R.bitLength(),\n k = fixedKForTesting || sjcl.bn.random(R.sub(1), paranoia).add(1),\n r = this._curve.G.mult(k).x.mod(R),\n ss = sjcl.bn.fromBits(hash).add(r.mul(this._exponent)),\n s = fakeLegacyVersion ? ss.inverseMod(R).mul(k).mod(R)\n : ss.mul(k.inverseMod(R)).mod(R);\n return sjcl.bitArray.concat(r.toBits(l), s.toBits(l));\n },\n\n getType: function() {\n return \"ecdsa\";\n }\n};\n" }, { "path": "core/exports.js", "content": "if(typeof module !== 'undefined' && module.exports){\n module.exports = sjcl;\n}\nif (typeof define === \"function\") {\n define([], function () {\n return sjcl;\n });\n}\n" }, { "path": "core/gcm.js", "content": "/** @fileOverview GCM mode implementation.\n *\n * @author Juho Vähä-Herttua\n */\n\n/**\n * Galois/Counter mode.\n * @namespace\n */ \nsjcl.mode.gcm = {\n /**\n * The name of the mode.\n * @constant\n */\n name: \"gcm\",\n \n /** Encrypt in GCM mode.\n * @static\n * @param {Object} prf The pseudorandom function. It must have a block size of 16 bytes.\n * @param {bitArray} plaintext The plaintext data.\n * @param {bitArray} iv The initialization value.\n * @param {bitArray} [adata=[]] The authenticated data.\n * @param {Number} [tlen=128] The desired tag length, in bits.\n * @return {bitArray} The encrypted data, an array of bytes.\n */\n encrypt: function (prf, plaintext, iv, adata, tlen) {\n var out, data = plaintext.slice(0), w=sjcl.bitArray;\n tlen = tlen || 128;\n adata = adata || [];\n\n // encrypt and tag\n out = sjcl.mode.gcm._ctrMode(true, prf, data, adata, iv, tlen);\n\n return w.concat(out.data, out.tag);\n },\n \n /** Decrypt in GCM mode.\n * @static\n * @param {Object} prf The pseudorandom function. It must have a block size of 16 bytes.\n * @param {bitArray} ciphertext The ciphertext data.\n * @param {bitArray} iv The initialization value.\n * @param {bitArray} [adata=[]] The authenticated data.\n * @param {Number} [tlen=128] The desired tag length, in bits.\n * @return {bitArray} The decrypted data.\n */\n decrypt: function (prf, ciphertext, iv, adata, tlen) {\n var out, data = ciphertext.slice(0), tag, w=sjcl.bitArray, l=w.bitLength(data);\n tlen = tlen || 128;\n adata = adata || [];\n\n // Slice tag out of data\n if (tlen <= l) {\n tag = w.bitSlice(data, l-tlen);\n data = w.bitSlice(data, 0, l-tlen);\n } else {\n tag = data;\n data = [];\n }\n\n // decrypt and tag\n out = sjcl.mode.gcm._ctrMode(false, prf, data, adata, iv, tlen);\n\n if (!w.equal(out.tag, tag)) {\n throw new sjcl.exception.corrupt(\"gcm: tag doesn't match\");\n }\n return out.data;\n },\n\n /* Compute the galois multiplication of X and Y\n * @private\n */\n _galoisMultiply: function (x, y) {\n var i, j, xi, Zi, Vi, lsb_Vi, w=sjcl.bitArray, xor=w._xor4;\n\n Zi = [0,0,0,0];\n Vi = y.slice(0);\n\n // Block size is 128 bits, run 128 times to get Z_128\n for (i=0; i<128; i++) {\n xi = (x[Math.floor(i/32)] & (1 << (31-i%32))) !== 0;\n if (xi) {\n // Z_i+1 = Z_i ^ V_i\n Zi = xor(Zi, Vi);\n }\n\n // Store the value of LSB(V_i)\n lsb_Vi = (Vi[3] & 1) !== 0;\n\n // V_i+1 = V_i >> 1\n for (j=3; j>0; j--) {\n Vi[j] = (Vi[j] >>> 1) | ((Vi[j-1]&1) << 31);\n }\n Vi[0] = Vi[0] >>> 1;\n\n // If LSB(V_i) is 1, V_i+1 = (V_i >> 1) ^ R\n if (lsb_Vi) {\n Vi[0] = Vi[0] ^ (0xe1 << 24);\n }\n }\n return Zi;\n },\n\n _ghash: function(H, Y0, data) {\n var Yi, i, l = data.length;\n\n Yi = Y0.slice(0);\n for (i=0; i 255) {\n throw new sjcl.exception.invalid(\"key bit length is too large for hkdf\");\n }\n\n hmac = new sjcl.misc.hmac(key, Hash);\n curOut = [];\n for (i = 1; i <= loops; i++) {\n hmac.update(curOut);\n hmac.update(info);\n hmac.update([sjcl.bitArray.partial(8, i)]);\n curOut = hmac.digest();\n ret = sjcl.bitArray.concat(ret, curOut);\n }\n return sjcl.bitArray.clamp(ret, keyBitLength);\n};\n" }, { "path": "core/hmac.js", "content": "/** @fileOverview HMAC implementation.\n *\n * @author Emily Stark\n * @author Mike Hamburg\n * @author Dan Boneh\n */\n\n/** HMAC with the specified hash function.\n * @constructor\n * @param {bitArray} key the key for HMAC.\n * @param {Object} [Hash=sjcl.hash.sha256] The hash function to use.\n */\nsjcl.misc.hmac = function (key, Hash) {\n this._hash = Hash = Hash || sjcl.hash.sha256;\n var exKey = [[],[]], i,\n bs = Hash.prototype.blockSize / 32;\n this._baseHash = [new Hash(), new Hash()];\n\n if (key.length > bs) {\n key = Hash.hash(key);\n }\n \n for (i=0; i>>31,\n x[1]<<1 ^ x[2]>>>31,\n x[2]<<1 ^ x[3]>>>31,\n x[3]<<1 ^ (x[0]>>>31)*0x87];\n }\n};\n" }, { "path": "core/ocb2progressive.js", "content": "/**\n * OCB2.0 implementation slightly modified by Yifan Gu\n * to support progressive encryption\n * @author Yifan Gu\n */\n\n/** @fileOverview OCB 2.0 implementation\n *\n * @author Emily Stark\n * @author Mike Hamburg\n * @author Dan Boneh\n */\n\n/** \n * Phil Rogaway's Offset CodeBook mode, version 2.0.\n * May be covered by US and international patents.\n *\n * @namespace\n * @author Emily Stark\n * @author Mike Hamburg\n * @author Dan Boneh\n */\n\nsjcl.mode.ocb2progressive = {\n createEncryptor: function(prp, iv, adata, tlen, premac) {\n if (sjcl.bitArray.bitLength(iv) !== 128) {\n throw new sjcl.exception.invalid(\"ocb iv must be 128 bits\");\n }\n var i,\n times2 = sjcl.mode.ocb2._times2,\n w = sjcl.bitArray,\n xor = w._xor4,\n checksum = [0,0,0,0],\n delta = times2(prp.encrypt(iv)),\n bi, bl,\n datacache = [],\n pad;\n\n adata = adata || [];\n tlen = tlen || 64;\n\n return {\n process: function(data){\n var datalen = sjcl.bitArray.bitLength(data);\n if (datalen == 0){ // empty input natrually gives empty output\n return [];\n }\n var output = [];\n datacache = datacache.concat(data);\n for (i=0; i+4 < datacache.length; i+=4) {\n /* Encrypt a non-final block */\n bi = datacache.slice(i,i+4);\n checksum = xor(checksum, bi);\n output = output.concat(xor(delta,prp.encrypt(xor(delta, bi))));\n delta = times2(delta);\n }\n datacache = datacache.slice(i); // at end of each process we ensure size of datacache is smaller than 4\n return output; //spits out the result.\n },\n finalize: function(){\n // the final block\n bi = datacache;\n bl = w.bitLength(bi);\n pad = prp.encrypt(xor(delta,[0,0,0,bl]));\n bi = w.clamp(xor(bi.concat([0,0,0]),pad), bl);\n\n /* Checksum the final block, and finalize the checksum */\n checksum = xor(checksum,xor(bi.concat([0,0,0]),pad));\n checksum = prp.encrypt(xor(checksum,xor(delta,times2(delta))));\n\n /* MAC the header */\n if (adata.length) {\n checksum = xor(checksum, premac ? adata : sjcl.mode.ocb2.pmac(prp, adata));\n }\n\n return w.concat(bi, w.clamp(checksum, tlen)); // spits out the last block\n }\n };\n },\n createDecryptor: function(prp, iv, adata, tlen, premac){\n if (sjcl.bitArray.bitLength(iv) !== 128) {\n throw new sjcl.exception.invalid(\"ocb iv must be 128 bits\");\n }\n tlen = tlen || 64;\n var i,\n times2 = sjcl.mode.ocb2._times2,\n w = sjcl.bitArray,\n xor = w._xor4,\n checksum = [0,0,0,0],\n delta = times2(prp.encrypt(iv)),\n bi, bl,\n datacache = [],\n pad;\n\n adata = adata || [];\n\n return {\n process: function(data){\n if (data.length == 0){ // empty input natrually gives empty output\n return [];\n }\n var output = [];\n datacache = datacache.concat(data);\n var cachelen = sjcl.bitArray.bitLength(datacache);\n for (i=0; i+4 < (cachelen-tlen)/32; i+=4) {\n /* Decrypt a non-final block */\n bi = xor(delta, prp.decrypt(xor(delta, datacache.slice(i,i+4))));\n checksum = xor(checksum, bi);\n output = output.concat(bi);\n delta = times2(delta);\n }\n datacache = datacache.slice(i);\n return output;\n },\n finalize: function(){\n /* Chop out and decrypt the final block */\n bl = sjcl.bitArray.bitLength(datacache) - tlen;\n pad = prp.encrypt(xor(delta,[0,0,0,bl]));\n bi = xor(pad, w.clamp(datacache,bl).concat([0,0,0]));\n\n /* Checksum the final block, and finalize the checksum */\n checksum = xor(checksum, bi);\n checksum = prp.encrypt(xor(checksum, xor(delta, times2(delta))));\n\n /* MAC the header */\n if (adata.length) {\n checksum = xor(checksum, premac ? adata : sjcl.mode.ocb2.pmac(prp, adata));\n }\n\n if (!w.equal(w.clamp(checksum, tlen), w.bitSlice(datacache, bl))) {\n throw new sjcl.exception.corrupt(\"ocb: tag doesn't match\");\n }\n\n return w.clamp(bi,bl);\n }\n };\n }\n};\n" }, { "path": "core/pbkdf2.js", "content": "/** @fileOverview Password-based key-derivation function, version 2.0.\n *\n * @author Emily Stark\n * @author Mike Hamburg\n * @author Dan Boneh\n */\n\n/** Password-Based Key-Derivation Function, version 2.0.\n *\n * Generate keys from passwords using PBKDF2-HMAC-SHA256.\n *\n * This is the method specified by RSA's PKCS #5 standard.\n *\n * @param {bitArray|String} password The password.\n * @param {bitArray|String} salt The salt. Should have lots of entropy.\n * @param {Number} [count=1000] The number of iterations. Higher numbers make the function slower but more secure.\n * @param {Number} [length] The length of the derived key. Defaults to the\n output size of the hash function.\n * @param {Object} [Prff=sjcl.misc.hmac] The pseudorandom function family.\n * @return {bitArray} the derived key.\n */\nsjcl.misc.pbkdf2 = function (password, salt, count, length, Prff) {\n count = count || 10000;\n \n if (length < 0 || count < 0) {\n throw new sjcl.exception.invalid(\"invalid params to pbkdf2\");\n }\n \n if (typeof password === \"string\") {\n password = sjcl.codec.utf8String.toBits(password);\n }\n \n if (typeof salt === \"string\") {\n salt = sjcl.codec.utf8String.toBits(salt);\n }\n \n Prff = Prff || sjcl.misc.hmac;\n \n var prf = new Prff(password),\n u, ui, i, j, k, out = [], b = sjcl.bitArray;\n\n for (k = 1; 32 * out.length < (length || 1); k++) {\n u = ui = prf.encrypt(b.concat(salt,[k]));\n \n for (i=1; iUse sjcl.random as a singleton for this class!\n *

\n * This random number generator is a derivative of Ferguson and Schneier's\n * generator Fortuna. It collects entropy from various events into several\n * pools, implemented by streaming SHA-256 instances. It differs from\n * ordinary Fortuna in a few ways, though.\n *

\n *\n *

\n * Most importantly, it has an entropy estimator. This is present because\n * there is a strong conflict here between making the generator available\n * as soon as possible, and making sure that it doesn't \"run on empty\".\n * In Fortuna, there is a saved state file, and the system is likely to have\n * time to warm up.\n *

\n *\n *

\n * Second, because users are unlikely to stay on the page for very long,\n * and to speed startup time, the number of pools increases logarithmically:\n * a new pool is created when the previous one is actually used for a reseed.\n * This gives the same asymptotic guarantees as Fortuna, but gives more\n * entropy to early reseeds.\n *

\n *\n *

\n * The entire mechanism here feels pretty klunky. Furthermore, there are\n * several improvements that should be made, including support for\n * dedicated cryptographic functions that may be present in some browsers;\n * state files in local storage; cookies containing randomness; etc. So\n * look for improvements in future versions.\n *

\n * @constructor\n */\nsjcl.prng = function(defaultParanoia) {\n \n /* private */\n this._pools = [new sjcl.hash.sha256()];\n this._poolEntropy = [0];\n this._reseedCount = 0;\n this._robins = {};\n this._eventId = 0;\n \n this._collectorIds = {};\n this._collectorIdNext = 0;\n \n this._strength = 0;\n this._poolStrength = 0;\n this._nextReseed = 0;\n this._key = [0,0,0,0,0,0,0,0];\n this._counter = [0,0,0,0];\n this._cipher = undefined;\n this._defaultParanoia = defaultParanoia;\n \n /* event listener stuff */\n this._collectorsStarted = false;\n this._callbacks = {progress: {}, seeded: {}};\n this._callbackI = 0;\n \n /* constants */\n this._NOT_READY = 0;\n this._READY = 1;\n this._REQUIRES_RESEED = 2;\n\n this._MAX_WORDS_PER_BURST = 65536;\n this._PARANOIA_LEVELS = [0,48,64,96,128,192,256,384,512,768,1024];\n this._MILLISECONDS_PER_RESEED = 30000;\n this._BITS_PER_RESEED = 80;\n};\n \nsjcl.prng.prototype = {\n /** Generate several random words, and return them in an array.\n * A word consists of 32 bits (4 bytes)\n * @param {Number} nwords The number of words to generate.\n */\n randomWords: function (nwords, paranoia) {\n var out = [], i, readiness = this.isReady(paranoia), g;\n \n if (readiness === this._NOT_READY) {\n throw new sjcl.exception.notReady(\"generator isn't seeded\");\n } else if (readiness & this._REQUIRES_RESEED) {\n this._reseedFromPools(!(readiness & this._READY));\n }\n \n for (i=0; i0) {\n estimatedEntropy++;\n tmp = tmp >>> 1;\n }\n }\n }\n this._pools[robin].update([id,this._eventId++,2,estimatedEntropy,t,data.length].concat(data));\n }\n break;\n \n case \"string\":\n if (estimatedEntropy === undefined) {\n /* English text has just over 1 bit per character of entropy.\n * But this might be HTML or something, and have far less\n * entropy than English... Oh well, let's just say one bit.\n */\n estimatedEntropy = data.length;\n }\n this._pools[robin].update([id,this._eventId++,3,estimatedEntropy,t,data.length]);\n this._pools[robin].update(data);\n break;\n \n default:\n err=1;\n }\n if (err) {\n throw new sjcl.exception.bug(\"random: addEntropy only supports number, array of numbers or string\");\n }\n \n /* record the new strength */\n this._poolEntropy[robin] += estimatedEntropy;\n this._poolStrength += estimatedEntropy;\n \n /* fire off events */\n if (oldReady === this._NOT_READY) {\n if (this.isReady() !== this._NOT_READY) {\n this._fireEvent(\"seeded\", Math.max(this._strength, this._poolStrength));\n }\n this._fireEvent(\"progress\", this.getProgress());\n }\n },\n \n /** Is the generator ready? */\n isReady: function (paranoia) {\n var entropyRequired = this._PARANOIA_LEVELS[ (paranoia !== undefined) ? paranoia : this._defaultParanoia ];\n \n if (this._strength && this._strength >= entropyRequired) {\n return (this._poolEntropy[0] > this._BITS_PER_RESEED && (new Date()).valueOf() > this._nextReseed) ?\n this._REQUIRES_RESEED | this._READY :\n this._READY;\n } else {\n return (this._poolStrength >= entropyRequired) ?\n this._REQUIRES_RESEED | this._NOT_READY :\n this._NOT_READY;\n }\n },\n \n /** Get the generator's progress toward readiness, as a fraction */\n getProgress: function (paranoia) {\n var entropyRequired = this._PARANOIA_LEVELS[ paranoia ? paranoia : this._defaultParanoia ];\n \n if (this._strength >= entropyRequired) {\n return 1.0;\n } else {\n return (this._poolStrength > entropyRequired) ?\n 1.0 :\n this._poolStrength / entropyRequired;\n }\n },\n \n /** start the built-in entropy collectors */\n startCollectors: function () {\n if (this._collectorsStarted) { return; }\n \n this._eventListener = {\n loadTimeCollector: this._bind(this._loadTimeCollector),\n mouseCollector: this._bind(this._mouseCollector),\n keyboardCollector: this._bind(this._keyboardCollector),\n accelerometerCollector: this._bind(this._accelerometerCollector),\n touchCollector: this._bind(this._touchCollector)\n };\n\n if (window.addEventListener) {\n window.addEventListener(\"load\", this._eventListener.loadTimeCollector, false);\n window.addEventListener(\"mousemove\", this._eventListener.mouseCollector, false);\n window.addEventListener(\"keypress\", this._eventListener.keyboardCollector, false);\n window.addEventListener(\"devicemotion\", this._eventListener.accelerometerCollector, false);\n window.addEventListener(\"touchmove\", this._eventListener.touchCollector, false);\n } else if (document.attachEvent) {\n document.attachEvent(\"onload\", this._eventListener.loadTimeCollector);\n document.attachEvent(\"onmousemove\", this._eventListener.mouseCollector);\n document.attachEvent(\"keypress\", this._eventListener.keyboardCollector);\n } else {\n throw new sjcl.exception.bug(\"can't attach event\");\n }\n \n this._collectorsStarted = true;\n },\n \n /** stop the built-in entropy collectors */\n stopCollectors: function () {\n if (!this._collectorsStarted) { return; }\n \n if (window.removeEventListener) {\n window.removeEventListener(\"load\", this._eventListener.loadTimeCollector, false);\n window.removeEventListener(\"mousemove\", this._eventListener.mouseCollector, false);\n window.removeEventListener(\"keypress\", this._eventListener.keyboardCollector, false);\n window.removeEventListener(\"devicemotion\", this._eventListener.accelerometerCollector, false);\n window.removeEventListener(\"touchmove\", this._eventListener.touchCollector, false);\n } else if (document.detachEvent) {\n document.detachEvent(\"onload\", this._eventListener.loadTimeCollector);\n document.detachEvent(\"onmousemove\", this._eventListener.mouseCollector);\n document.detachEvent(\"keypress\", this._eventListener.keyboardCollector);\n }\n\n this._collectorsStarted = false;\n },\n \n /* use a cookie to store entropy.\n useCookie: function (all_cookies) {\n throw new sjcl.exception.bug(\"random: useCookie is unimplemented\");\n },*/\n \n /** add an event listener for progress or seeded-ness. */\n addEventListener: function (name, callback) {\n this._callbacks[name][this._callbackI++] = callback;\n },\n \n /** remove an event listener for progress or seeded-ness */\n removeEventListener: function (name, cb) {\n var i, j, cbs=this._callbacks[name], jsTemp=[];\n\n /* I'm not sure if this is necessary; in C++, iterating over a\n * collection and modifying it at the same time is a no-no.\n */\n\n for (j in cbs) {\n if (cbs.hasOwnProperty(j) && cbs[j] === cb) {\n jsTemp.push(j);\n }\n }\n\n for (i=0; i= 1 << this._pools.length) {\n this._pools.push(new sjcl.hash.sha256());\n this._poolEntropy.push(0);\n }\n \n /* how strong was this reseed? */\n this._poolStrength -= strength;\n if (strength > this._strength) {\n this._strength = strength;\n }\n \n this._reseedCount ++;\n this._reseed(reseedData);\n },\n \n _keyboardCollector: function () {\n this._addCurrentTimeToEntropy(1);\n },\n \n _mouseCollector: function (ev) {\n var x, y;\n\n try {\n x = ev.x || ev.clientX || ev.offsetX || 0;\n y = ev.y || ev.clientY || ev.offsetY || 0;\n } catch (err) {\n // Event originated from a secure element. No mouse position available.\n x = 0;\n y = 0;\n }\n\n if (x != 0 && y!= 0) {\n this.addEntropy([x,y], 2, \"mouse\");\n }\n\n this._addCurrentTimeToEntropy(0);\n },\n\n _touchCollector: function(ev) {\n var touch = ev.touches[0] || ev.changedTouches[0];\n var x = touch.pageX || touch.clientX,\n y = touch.pageY || touch.clientY;\n\n this.addEntropy([x,y],1,\"touch\");\n\n this._addCurrentTimeToEntropy(0);\n },\n \n _loadTimeCollector: function () {\n this._addCurrentTimeToEntropy(2);\n },\n\n _addCurrentTimeToEntropy: function (estimatedEntropy) {\n if (typeof window !== 'undefined' && window.performance && typeof window.performance.now === \"function\") {\n //how much entropy do we want to add here?\n this.addEntropy(window.performance.now(), estimatedEntropy, \"loadtime\");\n } else {\n this.addEntropy((new Date()).valueOf(), estimatedEntropy, \"loadtime\");\n }\n },\n _accelerometerCollector: function (ev) {\n var ac = ev.accelerationIncludingGravity.x||ev.accelerationIncludingGravity.y||ev.accelerationIncludingGravity.z;\n if(window.orientation){\n var or = window.orientation;\n if (typeof or === \"number\") {\n this.addEntropy(or, 1, \"accelerometer\");\n }\n }\n if (ac) {\n this.addEntropy(ac, 2, \"accelerometer\");\n }\n this._addCurrentTimeToEntropy(0);\n },\n\n _fireEvent: function (name, arg) {\n var j, cbs=sjcl.random._callbacks[name], cbsTemp=[];\n /* TODO: there is a race condition between removing collectors and firing them */\n\n /* I'm not sure if this is necessary; in C++, iterating over a\n * collection and modifying it at the same time is a no-no.\n */\n\n for (j in cbs) {\n if (cbs.hasOwnProperty(j)) {\n cbsTemp.push(cbs[j]);\n }\n }\n\n for (j=0; j\n */\n(function() {\n\n/**\n * Context for a RIPEMD-160 operation in progress.\n * @constructor\n */\nsjcl.hash.ripemd160 = function (hash) {\n if (hash) {\n this._h = hash._h.slice(0);\n this._buffer = hash._buffer.slice(0);\n this._length = hash._length;\n } else {\n this.reset();\n }\n};\n\n/**\n * Hash a string or an array of words.\n * @static\n * @param {bitArray|String} data the data to hash.\n * @return {bitArray} The hash value, an array of 5 big-endian words.\n */\nsjcl.hash.ripemd160.hash = function (data) {\n return (new sjcl.hash.ripemd160()).update(data).finalize();\n};\n\nsjcl.hash.ripemd160.prototype = {\n /**\n * Reset the hash state.\n * @return this\n */\n reset: function () {\n this._h = _h0.slice(0);\n this._buffer = [];\n this._length = 0;\n return this;\n },\n\n /**\n * Reset the hash state.\n * @param {bitArray|String} data the data to hash.\n * @return this\n */\n update: function (data) {\n if ( typeof data === \"string\" )\n data = sjcl.codec.utf8String.toBits(data);\n\n var i, b = this._buffer = sjcl.bitArray.concat(this._buffer, data),\n ol = this._length,\n nl = this._length = ol + sjcl.bitArray.bitLength(data);\n if (nl > 9007199254740991){\n throw new sjcl.exception.invalid(\"Cannot hash more than 2^53 - 1 bits\");\n }\n for (i = 512+ol - ((512+ol) & 511); i <= nl; i+= 512) {\n var words = b.splice(0,16);\n for ( var w = 0; w < 16; ++w )\n words[w] = _cvt(words[w]);\n\n _block.call( this, words );\n }\n\n return this;\n },\n\n /**\n * Complete hashing and output the hash value.\n * @return {bitArray} The hash value, an array of 5 big-endian words.\n */\n finalize: function () {\n var b = sjcl.bitArray.concat( this._buffer, [ sjcl.bitArray.partial(1,1) ] ),\n l = ( this._length + 1 ) % 512,\n z = ( l > 448 ? 512 : 448 ) - l % 448,\n zp = z % 32;\n\n if ( zp > 0 )\n b = sjcl.bitArray.concat( b, [ sjcl.bitArray.partial(zp,0) ] );\n for ( ; z >= 32; z -= 32 )\n b.push(0);\n\n b.push( _cvt( this._length | 0 ) );\n b.push( _cvt( Math.floor(this._length / 0x100000000) ) );\n\n while ( b.length ) {\n var words = b.splice(0,16);\n for ( var w = 0; w < 16; ++w )\n words[w] = _cvt(words[w]);\n\n _block.call( this, words );\n }\n\n var h = this._h;\n this.reset();\n\n for ( var w = 0; w < 5; ++w )\n h[w] = _cvt(h[w]);\n\n return h;\n }\n};\n\nvar _h0 = [ 0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0 ];\n\nvar _k1 = [ 0x00000000, 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xa953fd4e ];\nvar _k2 = [ 0x50a28be6, 0x5c4dd124, 0x6d703ef3, 0x7a6d76e9, 0x00000000 ];\nfor ( var i = 4; i >= 0; --i ) {\n for ( var j = 1; j < 16; ++j ) {\n _k1.splice(i,0,_k1[i]);\n _k2.splice(i,0,_k2[i]);\n }\n}\n\nvar _r1 = [ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8,\n 3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12,\n 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2,\n 4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13 ];\nvar _r2 = [ 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12,\n 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2,\n 15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13,\n 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14,\n 12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11 ];\n\nvar _s1 = [ 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8,\n 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,\n 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5,\n 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,\n 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6 ];\nvar _s2 = [ 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6,\n 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,\n 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5,\n 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,\n 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11 ];\n\nfunction _f0(x,y,z) {\n return x ^ y ^ z;\n}\n\nfunction _f1(x,y,z) {\n return (x & y) | (~x & z);\n}\n\nfunction _f2(x,y,z) {\n return (x | ~y) ^ z;\n}\n\nfunction _f3(x,y,z) {\n return (x & z) | (y & ~z);\n}\n\nfunction _f4(x,y,z) {\n return x ^ (y | ~z);\n}\n\nfunction _rol(n,l) {\n return (n << l) | (n >>> (32-l));\n}\n\nfunction _cvt(n) {\n return ( (n & 0xff << 0) << 24 )\n | ( (n & 0xff << 8) << 8 )\n | ( (n & 0xff << 16) >>> 8 )\n | ( (n & 0xff << 24) >>> 24 );\n}\n\nfunction _block(X) {\n var A1 = this._h[0], B1 = this._h[1], C1 = this._h[2], D1 = this._h[3], E1 = this._h[4],\n A2 = this._h[0], B2 = this._h[1], C2 = this._h[2], D2 = this._h[3], E2 = this._h[4];\n\n var j = 0, T;\n\n for ( ; j < 16; ++j ) {\n T = _rol( A1 + _f0(B1,C1,D1) + X[_r1[j]] + _k1[j], _s1[j] ) + E1;\n A1 = E1; E1 = D1; D1 = _rol(C1,10); C1 = B1; B1 = T;\n T = _rol( A2 + _f4(B2,C2,D2) + X[_r2[j]] + _k2[j], _s2[j] ) + E2;\n A2 = E2; E2 = D2; D2 = _rol(C2,10); C2 = B2; B2 = T; }\n for ( ; j < 32; ++j ) {\n T = _rol( A1 + _f1(B1,C1,D1) + X[_r1[j]] + _k1[j], _s1[j] ) + E1;\n A1 = E1; E1 = D1; D1 = _rol(C1,10); C1 = B1; B1 = T;\n T = _rol( A2 + _f3(B2,C2,D2) + X[_r2[j]] + _k2[j], _s2[j] ) + E2;\n A2 = E2; E2 = D2; D2 = _rol(C2,10); C2 = B2; B2 = T; }\n for ( ; j < 48; ++j ) {\n T = _rol( A1 + _f2(B1,C1,D1) + X[_r1[j]] + _k1[j], _s1[j] ) + E1;\n A1 = E1; E1 = D1; D1 = _rol(C1,10); C1 = B1; B1 = T;\n T = _rol( A2 + _f2(B2,C2,D2) + X[_r2[j]] + _k2[j], _s2[j] ) + E2;\n A2 = E2; E2 = D2; D2 = _rol(C2,10); C2 = B2; B2 = T; }\n for ( ; j < 64; ++j ) {\n T = _rol( A1 + _f3(B1,C1,D1) + X[_r1[j]] + _k1[j], _s1[j] ) + E1;\n A1 = E1; E1 = D1; D1 = _rol(C1,10); C1 = B1; B1 = T;\n T = _rol( A2 + _f1(B2,C2,D2) + X[_r2[j]] + _k2[j], _s2[j] ) + E2;\n A2 = E2; E2 = D2; D2 = _rol(C2,10); C2 = B2; B2 = T; }\n for ( ; j < 80; ++j ) {\n T = _rol( A1 + _f4(B1,C1,D1) + X[_r1[j]] + _k1[j], _s1[j] ) + E1;\n A1 = E1; E1 = D1; D1 = _rol(C1,10); C1 = B1; B1 = T;\n T = _rol( A2 + _f0(B2,C2,D2) + X[_r2[j]] + _k2[j], _s2[j] ) + E2;\n A2 = E2; E2 = D2; D2 = _rol(C2,10); C2 = B2; B2 = T; }\n\n T = this._h[1] + C1 + D2;\n this._h[1] = this._h[2] + D1 + E2;\n this._h[2] = this._h[3] + E1 + A2;\n this._h[3] = this._h[4] + A1 + B2;\n this._h[4] = this._h[0] + B1 + C2;\n this._h[0] = T;\n}\n\n})();\n" }, { "path": "core/scrypt.js", "content": "/** scrypt Password-Based Key-Derivation Function.\n *\n * @param {bitArray|String} password The password.\n * @param {bitArray|String} salt The salt. Should have lots of entropy.\n *\n * @param {Number} [N=16384] CPU/Memory cost parameter.\n * @param {Number} [r=8] Block size parameter.\n * @param {Number} [p=1] Parallelization parameter.\n *\n * @param {Number} [length] The length of the derived key. Defaults to the\n * output size of the hash function.\n * @param {Object} [Prff=sjcl.misc.hmac] The pseudorandom function family.\n *\n * @return {bitArray} The derived key.\n */\nsjcl.misc.scrypt = function (password, salt, N, r, p, length, Prff) {\n var SIZE_MAX = Math.pow(2, 32) - 1,\n self = sjcl.misc.scrypt;\n\n N = N || 16384;\n r = r || 8;\n p = p || 1;\n\n if (r * p >= Math.pow(2, 30)) {\n throw sjcl.exception.invalid(\"The parameters r, p must satisfy r * p < 2^30\");\n }\n\n if ((N < 2) || (N & (N - 1) != 0)) {\n throw sjcl.exception.invalid(\"The parameter N must be a power of 2.\");\n }\n\n if (N > SIZE_MAX / 128 / r) {\n throw sjcl.exception.invalid(\"N too big.\");\n }\n\n if (r > SIZE_MAX / 128 / p) {\n throw sjcl.exception.invalid(\"r too big.\");\n }\n\n var blocks = sjcl.misc.pbkdf2(password, salt, 1, p * 128 * r * 8, Prff),\n len = blocks.length / p;\n\n self.reverse(blocks);\n\n for (var i = 0; i < p; i++) {\n var block = blocks.slice(i * len, (i + 1) * len);\n self.blockcopy(self.ROMix(block, N), 0, blocks, i * len);\n }\n\n self.reverse(blocks);\n\n return sjcl.misc.pbkdf2(password, blocks, 1, length, Prff);\n};\n\nsjcl.misc.scrypt.salsa20Core = function (word, rounds) {\n var R = function(a, b) { return (a << b) | (a >>> (32 - b)); };\n var x = word.slice(0);\n\n for (var i = rounds; i > 0; i -= 2) {\n x[ 4] ^= R(x[ 0]+x[12], 7); x[ 8] ^= R(x[ 4]+x[ 0], 9);\n x[12] ^= R(x[ 8]+x[ 4],13); x[ 0] ^= R(x[12]+x[ 8],18);\n x[ 9] ^= R(x[ 5]+x[ 1], 7); x[13] ^= R(x[ 9]+x[ 5], 9);\n x[ 1] ^= R(x[13]+x[ 9],13); x[ 5] ^= R(x[ 1]+x[13],18);\n x[14] ^= R(x[10]+x[ 6], 7); x[ 2] ^= R(x[14]+x[10], 9);\n x[ 6] ^= R(x[ 2]+x[14],13); x[10] ^= R(x[ 6]+x[ 2],18);\n x[ 3] ^= R(x[15]+x[11], 7); x[ 7] ^= R(x[ 3]+x[15], 9);\n x[11] ^= R(x[ 7]+x[ 3],13); x[15] ^= R(x[11]+x[ 7],18);\n x[ 1] ^= R(x[ 0]+x[ 3], 7); x[ 2] ^= R(x[ 1]+x[ 0], 9);\n x[ 3] ^= R(x[ 2]+x[ 1],13); x[ 0] ^= R(x[ 3]+x[ 2],18);\n x[ 6] ^= R(x[ 5]+x[ 4], 7); x[ 7] ^= R(x[ 6]+x[ 5], 9);\n x[ 4] ^= R(x[ 7]+x[ 6],13); x[ 5] ^= R(x[ 4]+x[ 7],18);\n x[11] ^= R(x[10]+x[ 9], 7); x[ 8] ^= R(x[11]+x[10], 9);\n x[ 9] ^= R(x[ 8]+x[11],13); x[10] ^= R(x[ 9]+x[ 8],18);\n x[12] ^= R(x[15]+x[14], 7); x[13] ^= R(x[12]+x[15], 9);\n x[14] ^= R(x[13]+x[12],13); x[15] ^= R(x[14]+x[13],18);\n }\n\n for (i = 0; i < 16; i++) word[i] = x[i]+word[i];\n};\n\nsjcl.misc.scrypt.blockMix = function(blocks) {\n var X = blocks.slice(-16),\n out = [],\n len = blocks.length / 16,\n self = sjcl.misc.scrypt;\n\n for (var i = 0; i < len; i++) {\n self.blockxor(blocks, 16 * i, X, 0, 16);\n self.salsa20Core(X, 8);\n\n if ((i & 1) == 0) {\n self.blockcopy(X, 0, out, 8 * i);\n } else {\n self.blockcopy(X, 0, out, 8 * (i^1 + len));\n }\n }\n\n return out;\n};\n\nsjcl.misc.scrypt.ROMix = function(block, N) {\n var X = block.slice(0),\n V = [],\n self = sjcl.misc.scrypt;\n\n for (var i = 0; i < N; i++) {\n V.push(X.slice(0));\n X = self.blockMix(X);\n }\n\n for (i = 0; i < N; i++) {\n var j = X[X.length - 16] & (N - 1);\n\n self.blockxor(V[j], 0, X, 0);\n X = self.blockMix(X);\n }\n\n return X;\n};\n\nsjcl.misc.scrypt.reverse = function (words) { // Converts Big <-> Little Endian words\n for (var i in words) {\n var out = words[i] & 0xFF;\n out = (out << 8) | (words[i] >>> 8) & 0xFF;\n out = (out << 8) | (words[i] >>> 16) & 0xFF;\n out = (out << 8) | (words[i] >>> 24) & 0xFF;\n\n words[i] = out;\n }\n};\n\nsjcl.misc.scrypt.blockcopy = function (S, Si, D, Di, len) {\n var i;\n\n len = len || (S.length - Si);\n\n for (i = 0; i < len; i++) D[Di + i] = S[Si + i] | 0;\n};\n\nsjcl.misc.scrypt.blockxor = function(S, Si, D, Di, len) {\n var i;\n\n len = len || (S.length - Si);\n\n for (i = 0; i < len; i++) D[Di + i] = (D[Di + i] ^ S[Si + i]) | 0;\n};\n" }, { "path": "core/sha1.js", "content": "/** @fileOverview Javascript SHA-1 implementation.\n *\n * Based on the implementation in RFC 3174, method 1, and on the SJCL\n * SHA-256 implementation.\n *\n * @author Quinn Slack\n */\n\n/**\n * Context for a SHA-1 operation in progress.\n * @constructor\n */\nsjcl.hash.sha1 = function (hash) {\n if (hash) {\n this._h = hash._h.slice(0);\n this._buffer = hash._buffer.slice(0);\n this._length = hash._length;\n } else {\n this.reset();\n }\n};\n\n/**\n * Hash a string or an array of words.\n * @static\n * @param {bitArray|String} data the data to hash.\n * @return {bitArray} The hash value, an array of 5 big-endian words.\n */\nsjcl.hash.sha1.hash = function (data) {\n return (new sjcl.hash.sha1()).update(data).finalize();\n};\n\nsjcl.hash.sha1.prototype = {\n /**\n * The hash's block size, in bits.\n * @constant\n */\n blockSize: 512,\n \n /**\n * Reset the hash state.\n * @return this\n */\n reset:function () {\n this._h = this._init.slice(0);\n this._buffer = [];\n this._length = 0;\n return this;\n },\n \n /**\n * Input several words to the hash.\n * @param {bitArray|String} data the data to hash.\n * @return this\n */\n update: function (data) {\n if (typeof data === \"string\") {\n data = sjcl.codec.utf8String.toBits(data);\n }\n var i, b = this._buffer = sjcl.bitArray.concat(this._buffer, data),\n ol = this._length,\n nl = this._length = ol + sjcl.bitArray.bitLength(data);\n if (nl > 9007199254740991){\n throw new sjcl.exception.invalid(\"Cannot hash more than 2^53 - 1 bits\");\n }\n\n if (typeof Uint32Array !== 'undefined') {\n\tvar c = new Uint32Array(b);\n \tvar j = 0;\n \tfor (i = this.blockSize+ol - ((this.blockSize+ol) & (this.blockSize-1)); i <= nl;\n\t\ti+= this.blockSize) {\n \t this._block(c.subarray(16 * j, 16 * (j+1)));\n \t j += 1;\n \t}\n \tb.splice(0, 16 * j);\n } else {\n \tfor (i = this.blockSize+ol - ((this.blockSize+ol) & (this.blockSize-1)); i <= nl;\n i+= this.blockSize) {\n \t this._block(b.splice(0,16));\n \t}\n }\n return this;\n },\n \n /**\n * Complete hashing and output the hash value.\n * @return {bitArray} The hash value, an array of 5 big-endian words. TODO\n */\n finalize:function () {\n var i, b = this._buffer, h = this._h;\n\n // Round out and push the buffer\n b = sjcl.bitArray.concat(b, [sjcl.bitArray.partial(1,1)]);\n // Round out the buffer to a multiple of 16 words, less the 2 length words.\n for (i = b.length + 2; i & 15; i++) {\n b.push(0);\n }\n\n // append the length\n b.push(Math.floor(this._length / 0x100000000));\n b.push(this._length | 0);\n\n while (b.length) {\n this._block(b.splice(0,16));\n }\n\n this.reset();\n return h;\n },\n\n /**\n * The SHA-1 initialization vector.\n * @private\n */\n _init:[0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0],\n\n /**\n * The SHA-1 hash key.\n * @private\n */\n _key:[0x5A827999, 0x6ED9EBA1, 0x8F1BBCDC, 0xCA62C1D6],\n\n /**\n * The SHA-1 logical functions f(0), f(1), ..., f(79).\n * @private\n */\n _f:function(t, b, c, d) {\n if (t <= 19) {\n return (b & c) | (~b & d);\n } else if (t <= 39) {\n return b ^ c ^ d;\n } else if (t <= 59) {\n return (b & c) | (b & d) | (c & d);\n } else if (t <= 79) {\n return b ^ c ^ d;\n }\n },\n\n /**\n * Circular left-shift operator.\n * @private\n */\n _S:function(n, x) {\n return (x << n) | (x >>> 32-n);\n },\n \n /**\n * Perform one cycle of SHA-1.\n * @param {Uint32Array|bitArray} words one block of words.\n * @private\n */\n _block:function (words) {\n var t, tmp, a, b, c, d, e,\n h = this._h;\n var w;\n if (typeof Uint32Array !== 'undefined') {\n // When words is passed to _block, it has 16 elements. SHA1 _block\n // function extends words with new elements (at the end there are 80 elements). \n // The problem is that if we use Uint32Array instead of Array, \n // the length of Uint32Array cannot be changed. Thus, we replace words with a \n // normal Array here.\n w = Array(80); // do not use Uint32Array here as the instantiation is slower\n for (var j=0; j<16; j++){\n w[j] = words[j];\n }\n } else {\n w = words;\n }\n\n a = h[0]; b = h[1]; c = h[2]; d = h[3]; e = h[4]; \n\n for (t=0; t<=79; t++) {\n if (t >= 16) {\n w[t] = this._S(1, w[t-3] ^ w[t-8] ^ w[t-14] ^ w[t-16]);\n }\n tmp = (this._S(5, a) + this._f(t, b, c, d) + e + w[t] +\n this._key[Math.floor(t/20)]) | 0;\n e = d;\n d = c;\n c = this._S(30, b);\n b = a;\n a = tmp;\n }\n\n h[0] = (h[0]+a) |0;\n h[1] = (h[1]+b) |0;\n h[2] = (h[2]+c) |0;\n h[3] = (h[3]+d) |0;\n h[4] = (h[4]+e) |0;\n }\n};\n" }, { "path": "core/sha256.js", "content": "/** @fileOverview Javascript SHA-256 implementation.\n *\n * An older version of this implementation is available in the public\n * domain, but this one is (c) Emily Stark, Mike Hamburg, Dan Boneh,\n * Stanford University 2008-2010 and BSD-licensed for liability\n * reasons.\n *\n * Special thanks to Aldo Cortesi for pointing out several bugs in\n * this code.\n *\n * @author Emily Stark\n * @author Mike Hamburg\n * @author Dan Boneh\n */\n\n/**\n * Context for a SHA-256 operation in progress.\n * @constructor\n */\nsjcl.hash.sha256 = function (hash) {\n if (!this._key[0]) { this._precompute(); }\n if (hash) {\n this._h = hash._h.slice(0);\n this._buffer = hash._buffer.slice(0);\n this._length = hash._length;\n } else {\n this.reset();\n }\n};\n\n/**\n * Hash a string or an array of words.\n * @static\n * @param {bitArray|String} data the data to hash.\n * @return {bitArray} The hash value, an array of 16 big-endian words.\n */\nsjcl.hash.sha256.hash = function (data) {\n return (new sjcl.hash.sha256()).update(data).finalize();\n};\n\nsjcl.hash.sha256.prototype = {\n /**\n * The hash's block size, in bits.\n * @constant\n */\n blockSize: 512,\n \n /**\n * Reset the hash state.\n * @return this\n */\n reset:function () {\n this._h = this._init.slice(0);\n this._buffer = [];\n this._length = 0;\n return this;\n },\n \n /**\n * Input several words to the hash.\n * @param {bitArray|String} data the data to hash.\n * @return this\n */\n update: function (data) {\n if (typeof data === \"string\") {\n data = sjcl.codec.utf8String.toBits(data);\n }\n var i, b = this._buffer = sjcl.bitArray.concat(this._buffer, data),\n ol = this._length,\n nl = this._length = ol + sjcl.bitArray.bitLength(data);\n if (nl > 9007199254740991){\n throw new sjcl.exception.invalid(\"Cannot hash more than 2^53 - 1 bits\");\n }\n\n if (typeof Uint32Array !== 'undefined') {\n\tvar c = new Uint32Array(b);\n \tvar j = 0;\n \tfor (i = 512+ol - ((512+ol) & 511); i <= nl; i+= 512) {\n \t this._block(c.subarray(16 * j, 16 * (j+1)));\n \t j += 1;\n \t}\n \tb.splice(0, 16 * j);\n } else {\n\tfor (i = 512+ol - ((512+ol) & 511); i <= nl; i+= 512) {\n \t this._block(b.splice(0,16));\n \t}\n }\n return this;\n },\n \n /**\n * Complete hashing and output the hash value.\n * @return {bitArray} The hash value, an array of 8 big-endian words.\n */\n finalize:function () {\n var i, b = this._buffer, h = this._h;\n\n // Round out and push the buffer\n b = sjcl.bitArray.concat(b, [sjcl.bitArray.partial(1,1)]);\n \n // Round out the buffer to a multiple of 16 words, less the 2 length words.\n for (i = b.length + 2; i & 15; i++) {\n b.push(0);\n }\n \n // append the length\n b.push(Math.floor(this._length / 0x100000000));\n b.push(this._length | 0);\n\n while (b.length) {\n this._block(b.splice(0,16));\n }\n\n this.reset();\n return h;\n },\n\n /**\n * The SHA-256 initialization vector, to be precomputed.\n * @private\n */\n _init:[],\n /*\n _init:[0x6a09e667,0xbb67ae85,0x3c6ef372,0xa54ff53a,0x510e527f,0x9b05688c,0x1f83d9ab,0x5be0cd19],\n */\n \n /**\n * The SHA-256 hash key, to be precomputed.\n * @private\n */\n _key:[],\n /*\n _key:\n [0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2],\n */\n\n\n /**\n * Function to precompute _init and _key.\n * @private\n */\n _precompute: function () {\n var i = 0, prime = 2, factor, isPrime;\n\n function frac(x) { return (x-Math.floor(x)) * 0x100000000 | 0; }\n\n for (; i<64; prime++) {\n isPrime = true;\n for (factor=2; factor*factor <= prime; factor++) {\n if (prime % factor === 0) {\n isPrime = false;\n break;\n }\n }\n if (isPrime) {\n if (i<8) {\n this._init[i] = frac(Math.pow(prime, 1/2));\n }\n this._key[i] = frac(Math.pow(prime, 1/3));\n i++;\n }\n }\n },\n \n /**\n * Perform one cycle of SHA-256.\n * @param {Uint32Array|bitArray} w one block of words.\n * @private\n */\n _block:function (w) { \n var i, tmp, a, b,\n h = this._h,\n k = this._key,\n h0 = h[0], h1 = h[1], h2 = h[2], h3 = h[3],\n h4 = h[4], h5 = h[5], h6 = h[6], h7 = h[7];\n\n /* Rationale for placement of |0 :\n * If a value can overflow is original 32 bits by a factor of more than a few\n * million (2^23 ish), there is a possibility that it might overflow the\n * 53-bit mantissa and lose precision.\n *\n * To avoid this, we clamp back to 32 bits by |'ing with 0 on any value that\n * propagates around the loop, and on the hash state h[]. I don't believe\n * that the clamps on h4 and on h0 are strictly necessary, but it's close\n * (for h4 anyway), and better safe than sorry.\n *\n * The clamps on h[] are necessary for the output to be correct even in the\n * common case and for short inputs.\n */\n for (i=0; i<64; i++) {\n // load up the input word for this round\n if (i<16) {\n tmp = w[i];\n } else {\n a = w[(i+1 ) & 15];\n b = w[(i+14) & 15];\n tmp = w[i&15] = ((a>>>7 ^ a>>>18 ^ a>>>3 ^ a<<25 ^ a<<14) + \n (b>>>17 ^ b>>>19 ^ b>>>10 ^ b<<15 ^ b<<13) +\n w[i&15] + w[(i+9) & 15]) | 0;\n }\n \n tmp = (tmp + h7 + (h4>>>6 ^ h4>>>11 ^ h4>>>25 ^ h4<<26 ^ h4<<21 ^ h4<<7) + (h6 ^ h4&(h5^h6)) + k[i]); // | 0;\n \n // shift register\n h7 = h6; h6 = h5; h5 = h4;\n h4 = h3 + tmp | 0;\n h3 = h2; h2 = h1; h1 = h0;\n\n h0 = (tmp + ((h1&h2) ^ (h3&(h1^h2))) + (h1>>>2 ^ h1>>>13 ^ h1>>>22 ^ h1<<30 ^ h1<<19 ^ h1<<10)) | 0;\n }\n\n h[0] = h[0]+h0 | 0;\n h[1] = h[1]+h1 | 0;\n h[2] = h[2]+h2 | 0;\n h[3] = h[3]+h3 | 0;\n h[4] = h[4]+h4 | 0;\n h[5] = h[5]+h5 | 0;\n h[6] = h[6]+h6 | 0;\n h[7] = h[7]+h7 | 0;\n }\n};\n\n\n" }, { "path": "core/sha512.js", "content": "/** @fileOverview Javascript SHA-512 implementation.\n *\n * This implementation was written for CryptoJS by Jeff Mott and adapted for\n * SJCL by Stefan Thomas.\n *\n * CryptoJS (c) 2009–2012 by Jeff Mott. All rights reserved.\n * Released with New BSD License\n *\n * @author Emily Stark\n * @author Mike Hamburg\n * @author Dan Boneh\n * @author Jeff Mott\n * @author Stefan Thomas\n */\n\n/**\n * Context for a SHA-512 operation in progress.\n * @constructor\n */\nsjcl.hash.sha512 = function (hash) {\n if (!this._key[0]) { this._precompute(); }\n if (hash) {\n this._h = hash._h.slice(0);\n this._buffer = hash._buffer.slice(0);\n this._length = hash._length;\n } else {\n this.reset();\n }\n};\n\n/**\n * Hash a string or an array of words.\n * @static\n * @param {bitArray|String} data the data to hash.\n * @return {bitArray} The hash value, an array of 16 big-endian words.\n */\nsjcl.hash.sha512.hash = function (data) {\n return (new sjcl.hash.sha512()).update(data).finalize();\n};\n\nsjcl.hash.sha512.prototype = {\n /**\n * The hash's block size, in bits.\n * @constant\n */\n blockSize: 1024,\n \n /**\n * Reset the hash state.\n * @return this\n */\n reset:function () {\n this._h = this._init.slice(0);\n this._buffer = [];\n this._length = 0;\n return this;\n },\n \n /**\n * Input several words to the hash.\n * @param {bitArray|String} data the data to hash.\n * @return this\n */\n update: function (data) {\n if (typeof data === \"string\") {\n data = sjcl.codec.utf8String.toBits(data);\n }\n var i, b = this._buffer = sjcl.bitArray.concat(this._buffer, data),\n ol = this._length,\n nl = this._length = ol + sjcl.bitArray.bitLength(data);\n if (nl > 9007199254740991){\n throw new sjcl.exception.invalid(\"Cannot hash more than 2^53 - 1 bits\");\n }\n\n if (typeof Uint32Array !== 'undefined') {\n var c = new Uint32Array(b);\n var j = 0;\n for (i = 1024+ol - ((1024+ol) & 1023); i <= nl; i+= 1024) {\n this._block(c.subarray(32 * j, 32 * (j+1)));\n j += 1;\n }\n b.splice(0, 32 * j);\n } else {\n for (i = 1024+ol - ((1024+ol) & 1023); i <= nl; i+= 1024) {\n this._block(b.splice(0,32));\n }\n }\n return this;\n },\n \n /**\n * Complete hashing and output the hash value.\n * @return {bitArray} The hash value, an array of 16 big-endian words.\n */\n finalize:function () {\n var i, b = this._buffer, h = this._h;\n\n // Round out and push the buffer\n b = sjcl.bitArray.concat(b, [sjcl.bitArray.partial(1,1)]);\n\n // Round out the buffer to a multiple of 32 words, less the 4 length words.\n for (i = b.length + 4; i & 31; i++) {\n b.push(0);\n }\n\n // append the length\n b.push(0);\n b.push(0);\n b.push(Math.floor(this._length / 0x100000000));\n b.push(this._length | 0);\n\n while (b.length) {\n this._block(b.splice(0,32));\n }\n\n this.reset();\n return h;\n },\n\n /**\n * The SHA-512 initialization vector, to be precomputed.\n * @private\n */\n _init:[],\n\n /**\n * Least significant 24 bits of SHA512 initialization values.\n *\n * Javascript only has 53 bits of precision, so we compute the 40 most\n * significant bits and add the remaining 24 bits as constants.\n *\n * @private\n */\n _initr: [ 0xbcc908, 0xcaa73b, 0x94f82b, 0x1d36f1, 0xe682d1, 0x3e6c1f, 0x41bd6b, 0x7e2179 ],\n\n /*\n _init:\n [0x6a09e667, 0xf3bcc908, 0xbb67ae85, 0x84caa73b, 0x3c6ef372, 0xfe94f82b, 0xa54ff53a, 0x5f1d36f1,\n 0x510e527f, 0xade682d1, 0x9b05688c, 0x2b3e6c1f, 0x1f83d9ab, 0xfb41bd6b, 0x5be0cd19, 0x137e2179],\n */\n\n /**\n * The SHA-512 hash key, to be precomputed.\n * @private\n */\n _key:[],\n\n /**\n * Least significant 24 bits of SHA512 key values.\n * @private\n */\n _keyr:\n [0x28ae22, 0xef65cd, 0x4d3b2f, 0x89dbbc, 0x48b538, 0x05d019, 0x194f9b, 0x6d8118,\n 0x030242, 0x706fbe, 0xe4b28c, 0xffb4e2, 0x7b896f, 0x1696b1, 0xc71235, 0x692694,\n 0xf14ad2, 0x4f25e3, 0x8cd5b5, 0xac9c65, 0x2b0275, 0xa6e483, 0x41fbd4, 0x1153b5,\n 0x66dfab, 0xb43210, 0xfb213f, 0xef0ee4, 0xa88fc2, 0x0aa725, 0x03826f, 0x0e6e70,\n 0xd22ffc, 0x26c926, 0xc42aed, 0x95b3df, 0xaf63de, 0x77b2a8, 0xedaee6, 0x82353b,\n 0xf10364, 0x423001, 0xf89791, 0x54be30, 0xef5218, 0x65a910, 0x71202a, 0xbbd1b8,\n 0xd2d0c8, 0x41ab53, 0x8eeb99, 0x9b48a8, 0xc95a63, 0x418acb, 0x63e373, 0xb2b8a3,\n 0xefb2fc, 0x172f60, 0xf0ab72, 0x6439ec, 0x631e28, 0x82bde9, 0xc67915, 0x72532b,\n 0x26619c, 0xc0c207, 0xe0eb1e, 0x6ed178, 0x176fba, 0xc898a6, 0xf90dae, 0x1c471b,\n 0x047d84, 0xc72493, 0xc9bebc, 0x100d4c, 0x3e42b6, 0x657e2a, 0xd6faec, 0x475817],\n\n /*\n _key:\n [0x428a2f98, 0xd728ae22, 0x71374491, 0x23ef65cd, 0xb5c0fbcf, 0xec4d3b2f, 0xe9b5dba5, 0x8189dbbc,\n 0x3956c25b, 0xf348b538, 0x59f111f1, 0xb605d019, 0x923f82a4, 0xaf194f9b, 0xab1c5ed5, 0xda6d8118,\n 0xd807aa98, 0xa3030242, 0x12835b01, 0x45706fbe, 0x243185be, 0x4ee4b28c, 0x550c7dc3, 0xd5ffb4e2,\n 0x72be5d74, 0xf27b896f, 0x80deb1fe, 0x3b1696b1, 0x9bdc06a7, 0x25c71235, 0xc19bf174, 0xcf692694,\n 0xe49b69c1, 0x9ef14ad2, 0xefbe4786, 0x384f25e3, 0x0fc19dc6, 0x8b8cd5b5, 0x240ca1cc, 0x77ac9c65,\n 0x2de92c6f, 0x592b0275, 0x4a7484aa, 0x6ea6e483, 0x5cb0a9dc, 0xbd41fbd4, 0x76f988da, 0x831153b5,\n 0x983e5152, 0xee66dfab, 0xa831c66d, 0x2db43210, 0xb00327c8, 0x98fb213f, 0xbf597fc7, 0xbeef0ee4,\n 0xc6e00bf3, 0x3da88fc2, 0xd5a79147, 0x930aa725, 0x06ca6351, 0xe003826f, 0x14292967, 0x0a0e6e70,\n 0x27b70a85, 0x46d22ffc, 0x2e1b2138, 0x5c26c926, 0x4d2c6dfc, 0x5ac42aed, 0x53380d13, 0x9d95b3df,\n 0x650a7354, 0x8baf63de, 0x766a0abb, 0x3c77b2a8, 0x81c2c92e, 0x47edaee6, 0x92722c85, 0x1482353b,\n 0xa2bfe8a1, 0x4cf10364, 0xa81a664b, 0xbc423001, 0xc24b8b70, 0xd0f89791, 0xc76c51a3, 0x0654be30,\n 0xd192e819, 0xd6ef5218, 0xd6990624, 0x5565a910, 0xf40e3585, 0x5771202a, 0x106aa070, 0x32bbd1b8,\n 0x19a4c116, 0xb8d2d0c8, 0x1e376c08, 0x5141ab53, 0x2748774c, 0xdf8eeb99, 0x34b0bcb5, 0xe19b48a8,\n 0x391c0cb3, 0xc5c95a63, 0x4ed8aa4a, 0xe3418acb, 0x5b9cca4f, 0x7763e373, 0x682e6ff3, 0xd6b2b8a3,\n 0x748f82ee, 0x5defb2fc, 0x78a5636f, 0x43172f60, 0x84c87814, 0xa1f0ab72, 0x8cc70208, 0x1a6439ec,\n 0x90befffa, 0x23631e28, 0xa4506ceb, 0xde82bde9, 0xbef9a3f7, 0xb2c67915, 0xc67178f2, 0xe372532b,\n 0xca273ece, 0xea26619c, 0xd186b8c7, 0x21c0c207, 0xeada7dd6, 0xcde0eb1e, 0xf57d4f7f, 0xee6ed178,\n 0x06f067aa, 0x72176fba, 0x0a637dc5, 0xa2c898a6, 0x113f9804, 0xbef90dae, 0x1b710b35, 0x131c471b,\n 0x28db77f5, 0x23047d84, 0x32caab7b, 0x40c72493, 0x3c9ebe0a, 0x15c9bebc, 0x431d67c4, 0x9c100d4c,\n 0x4cc5d4be, 0xcb3e42b6, 0x597f299c, 0xfc657e2a, 0x5fcb6fab, 0x3ad6faec, 0x6c44198c, 0x4a475817],\n */\n\n /**\n * Function to precompute _init and _key.\n * @private\n */\n _precompute: function () {\n // XXX: This code is for precomputing the SHA256 constants, change for\n // SHA512 and re-enable.\n var i = 0, prime = 2, factor , isPrime;\n\n function frac(x) { return (x-Math.floor(x)) * 0x100000000 | 0; }\n function frac2(x) { return (x-Math.floor(x)) * 0x10000000000 & 0xff; }\n\n for (; i<80; prime++) {\n isPrime = true;\n for (factor=2; factor*factor <= prime; factor++) {\n if (prime % factor === 0) {\n isPrime = false;\n break;\n }\n }\n if (isPrime) {\n if (i<8) {\n this._init[i*2] = frac(Math.pow(prime, 1/2));\n this._init[i*2+1] = (frac2(Math.pow(prime, 1/2)) << 24) | this._initr[i];\n }\n this._key[i*2] = frac(Math.pow(prime, 1/3));\n this._key[i*2+1] = (frac2(Math.pow(prime, 1/3)) << 24) | this._keyr[i];\n i++;\n }\n }\n },\n\n /**\n * Perform one cycle of SHA-512.\n * @param {Uint32Array|bitArray} words one block of words.\n * @private\n */\n _block:function (words) {\n var i, wrh, wrl,\n h = this._h,\n k = this._key,\n h0h = h[ 0], h0l = h[ 1], h1h = h[ 2], h1l = h[ 3],\n h2h = h[ 4], h2l = h[ 5], h3h = h[ 6], h3l = h[ 7],\n h4h = h[ 8], h4l = h[ 9], h5h = h[10], h5l = h[11],\n h6h = h[12], h6l = h[13], h7h = h[14], h7l = h[15];\n var w;\n if (typeof Uint32Array !== 'undefined') {\n\t// When words is passed to _block, it has 32 elements. SHA512 _block\n\t// function extends words with new elements (at the end there are 160 elements). \n\t// The problem is that if we use Uint32Array instead of Array, \n\t// the length of Uint32Array cannot be changed. Thus, we replace words with a \n\t// normal Array here.\n w = Array(160); // do not use Uint32Array here as the instantiation is slower\n for (var j=0; j<32; j++){\n \t w[j] = words[j]; \n }\n } else {\n\tw = words;\n } \n\n // Working variables\n var ah = h0h, al = h0l, bh = h1h, bl = h1l,\n ch = h2h, cl = h2l, dh = h3h, dl = h3l,\n eh = h4h, el = h4l, fh = h5h, fl = h5l,\n gh = h6h, gl = h6l, hh = h7h, hl = h7l;\n\n for (i=0; i<80; i++) {\n // load up the input word for this round\n if (i<16) {\n wrh = w[i * 2];\n wrl = w[i * 2 + 1];\n } else {\n // Gamma0\n var gamma0xh = w[(i-15) * 2];\n var gamma0xl = w[(i-15) * 2 + 1];\n var gamma0h =\n ((gamma0xl << 31) | (gamma0xh >>> 1)) ^\n ((gamma0xl << 24) | (gamma0xh >>> 8)) ^\n (gamma0xh >>> 7);\n var gamma0l =\n ((gamma0xh << 31) | (gamma0xl >>> 1)) ^\n ((gamma0xh << 24) | (gamma0xl >>> 8)) ^\n ((gamma0xh << 25) | (gamma0xl >>> 7));\n\n // Gamma1\n var gamma1xh = w[(i-2) * 2];\n var gamma1xl = w[(i-2) * 2 + 1];\n var gamma1h =\n ((gamma1xl << 13) | (gamma1xh >>> 19)) ^\n ((gamma1xh << 3) | (gamma1xl >>> 29)) ^\n (gamma1xh >>> 6);\n var gamma1l =\n ((gamma1xh << 13) | (gamma1xl >>> 19)) ^\n ((gamma1xl << 3) | (gamma1xh >>> 29)) ^\n ((gamma1xh << 26) | (gamma1xl >>> 6));\n\n // Shortcuts\n var wr7h = w[(i-7) * 2];\n var wr7l = w[(i-7) * 2 + 1];\n\n var wr16h = w[(i-16) * 2];\n var wr16l = w[(i-16) * 2 + 1];\n\n // W(round) = gamma0 + W(round - 7) + gamma1 + W(round - 16)\n wrl = gamma0l + wr7l;\n wrh = gamma0h + wr7h + ((wrl >>> 0) < (gamma0l >>> 0) ? 1 : 0);\n wrl += gamma1l;\n wrh += gamma1h + ((wrl >>> 0) < (gamma1l >>> 0) ? 1 : 0);\n wrl += wr16l;\n wrh += wr16h + ((wrl >>> 0) < (wr16l >>> 0) ? 1 : 0);\n }\n\n w[i*2] = wrh |= 0;\n w[i*2 + 1] = wrl |= 0;\n\n // Ch\n var chh = (eh & fh) ^ (~eh & gh);\n var chl = (el & fl) ^ (~el & gl);\n\n // Maj\n var majh = (ah & bh) ^ (ah & ch) ^ (bh & ch);\n var majl = (al & bl) ^ (al & cl) ^ (bl & cl);\n\n // Sigma0\n var sigma0h = ((al << 4) | (ah >>> 28)) ^ ((ah << 30) | (al >>> 2)) ^ ((ah << 25) | (al >>> 7));\n var sigma0l = ((ah << 4) | (al >>> 28)) ^ ((al << 30) | (ah >>> 2)) ^ ((al << 25) | (ah >>> 7));\n\n // Sigma1\n var sigma1h = ((el << 18) | (eh >>> 14)) ^ ((el << 14) | (eh >>> 18)) ^ ((eh << 23) | (el >>> 9));\n var sigma1l = ((eh << 18) | (el >>> 14)) ^ ((eh << 14) | (el >>> 18)) ^ ((el << 23) | (eh >>> 9));\n\n // K(round)\n var krh = k[i*2];\n var krl = k[i*2+1];\n\n // t1 = h + sigma1 + ch + K(round) + W(round)\n var t1l = hl + sigma1l;\n var t1h = hh + sigma1h + ((t1l >>> 0) < (hl >>> 0) ? 1 : 0);\n t1l += chl;\n t1h += chh + ((t1l >>> 0) < (chl >>> 0) ? 1 : 0);\n t1l += krl;\n t1h += krh + ((t1l >>> 0) < (krl >>> 0) ? 1 : 0);\n t1l = t1l + wrl|0; // FF32..FF34 perf issue https://bugzilla.mozilla.org/show_bug.cgi?id=1054972\n t1h += wrh + ((t1l >>> 0) < (wrl >>> 0) ? 1 : 0);\n\n // t2 = sigma0 + maj\n var t2l = sigma0l + majl;\n var t2h = sigma0h + majh + ((t2l >>> 0) < (sigma0l >>> 0) ? 1 : 0);\n\n // Update working variables\n hh = gh;\n hl = gl;\n gh = fh;\n gl = fl;\n fh = eh;\n fl = el;\n el = (dl + t1l) | 0;\n eh = (dh + t1h + ((el >>> 0) < (dl >>> 0) ? 1 : 0)) | 0;\n dh = ch;\n dl = cl;\n ch = bh;\n cl = bl;\n bh = ah;\n bl = al;\n al = (t1l + t2l) | 0;\n ah = (t1h + t2h + ((al >>> 0) < (t1l >>> 0) ? 1 : 0)) | 0;\n }\n\n // Intermediate hash\n h0l = h[1] = (h0l + al) | 0;\n h[0] = (h0h + ah + ((h0l >>> 0) < (al >>> 0) ? 1 : 0)) | 0;\n h1l = h[3] = (h1l + bl) | 0;\n h[2] = (h1h + bh + ((h1l >>> 0) < (bl >>> 0) ? 1 : 0)) | 0;\n h2l = h[5] = (h2l + cl) | 0;\n h[4] = (h2h + ch + ((h2l >>> 0) < (cl >>> 0) ? 1 : 0)) | 0;\n h3l = h[7] = (h3l + dl) | 0;\n h[6] = (h3h + dh + ((h3l >>> 0) < (dl >>> 0) ? 1 : 0)) | 0;\n h4l = h[9] = (h4l + el) | 0;\n h[8] = (h4h + eh + ((h4l >>> 0) < (el >>> 0) ? 1 : 0)) | 0;\n h5l = h[11] = (h5l + fl) | 0;\n h[10] = (h5h + fh + ((h5l >>> 0) < (fl >>> 0) ? 1 : 0)) | 0;\n h6l = h[13] = (h6l + gl) | 0;\n h[12] = (h6h + gh + ((h6l >>> 0) < (gl >>> 0) ? 1 : 0)) | 0;\n h7l = h[15] = (h7l + hl) | 0;\n h[14] = (h7h + hh + ((h7l >>> 0) < (hl >>> 0) ? 1 : 0)) | 0;\n }\n};\n\n\n" }, { "path": "core/sjcl.js", "content": "/** @fileOverview Javascript cryptography implementation.\n *\n * Crush to remove comments, shorten variable names and\n * generally reduce transmission size.\n *\n * @author Emily Stark\n * @author Mike Hamburg\n * @author Dan Boneh\n */\n\n\"use strict\";\n/*jslint indent: 2, bitwise: false, nomen: false, plusplus: false, white: false, regexp: false */\n/*global document, window, escape, unescape, module, require, Uint32Array */\n\n/**\n * The Stanford Javascript Crypto Library, top-level namespace.\n * @namespace\n */\nvar sjcl = {\n /**\n * Symmetric ciphers.\n * @namespace\n */\n cipher: {},\n\n /**\n * Hash functions. Right now only SHA256 is implemented.\n * @namespace\n */\n hash: {},\n\n /**\n * Key exchange functions. Right now only SRP is implemented.\n * @namespace\n */\n keyexchange: {},\n \n /**\n * Cipher modes of operation.\n * @namespace\n */\n mode: {},\n\n /**\n * Miscellaneous. HMAC and PBKDF2.\n * @namespace\n */\n misc: {},\n \n /**\n * Bit array encoders and decoders.\n * @namespace\n *\n * @description\n * The members of this namespace are functions which translate between\n * SJCL's bitArrays and other objects (usually strings). Because it\n * isn't always clear which direction is encoding and which is decoding,\n * the method names are \"fromBits\" and \"toBits\".\n */\n codec: {},\n \n /**\n * Exceptions.\n * @namespace\n */\n exception: {\n /**\n * Ciphertext is corrupt.\n * @constructor\n */\n corrupt: function(message) {\n this.toString = function() { return \"CORRUPT: \"+this.message; };\n this.message = message;\n },\n \n /**\n * Invalid parameter.\n * @constructor\n */\n invalid: function(message) {\n this.toString = function() { return \"INVALID: \"+this.message; };\n this.message = message;\n },\n \n /**\n * Bug or missing feature in SJCL.\n * @constructor\n */\n bug: function(message) {\n this.toString = function() { return \"BUG: \"+this.message; };\n this.message = message;\n },\n\n /**\n * Something isn't ready.\n * @constructor\n */\n notReady: function(message) {\n this.toString = function() { return \"NOT READY: \"+this.message; };\n this.message = message;\n }\n }\n};\n" }, { "path": "core/srp.js", "content": "/** @fileOverview Javascript SRP implementation.\n *\n * This file contains a partial implementation of the SRP (Secure Remote\n * Password) password-authenticated key exchange protocol. Given a user\n * identity, salt, and SRP group, it generates the SRP verifier that may\n * be sent to a remote server to establish and SRP account.\n *\n * For more information, see http://srp.stanford.edu/.\n *\n * @author Quinn Slack\n */\n\n/**\n * Compute the SRP verifier from the username, password, salt, and group.\n * @namespace\n */\nsjcl.keyexchange.srp = {\n /**\n * Calculates SRP v, the verifier.\n * v = g^x mod N [RFC 5054]\n * @param {String} I The username.\n * @param {String} P The password.\n * @param {Object} s A bitArray of the salt.\n * @param {Object} group The SRP group. Use sjcl.keyexchange.srp.knownGroup\n to obtain this object.\n * @return {Object} A bitArray of SRP v.\n */\n makeVerifier: function(I, P, s, group) {\n var x;\n x = sjcl.keyexchange.srp.makeX(I, P, s);\n x = sjcl.bn.fromBits(x);\n return group.g.powermod(x, group.N);\n },\n\n /**\n * Calculates SRP x.\n * x = SHA1( | SHA( | \":\" | )) [RFC 2945]\n * @param {String} I The username.\n * @param {String} P The password.\n * @param {Object} s A bitArray of the salt.\n * @return {Object} A bitArray of SRP x.\n */\n makeX: function(I, P, s) {\n var inner = sjcl.hash.sha1.hash(I + ':' + P);\n return sjcl.hash.sha1.hash(sjcl.bitArray.concat(s, inner));\n },\n\n /**\n * Returns the known SRP group with the given size (in bits).\n * @param {String} i The size of the known SRP group.\n * @return {Object} An object with \"N\" and \"g\" properties.\n */\n knownGroup:function(i) {\n if (typeof i !== \"string\") { i = i.toString(); }\n if (!sjcl.keyexchange.srp._didInitKnownGroups) { sjcl.keyexchange.srp._initKnownGroups(); }\n return sjcl.keyexchange.srp._knownGroups[i];\n },\n\n /**\n * Initializes bignum objects for known group parameters.\n * @private\n */\n _didInitKnownGroups: false,\n _initKnownGroups:function() {\n var i, size, group;\n for (i=0; i < sjcl.keyexchange.srp._knownGroupSizes.length; i++) {\n size = sjcl.keyexchange.srp._knownGroupSizes[i].toString();\n group = sjcl.keyexchange.srp._knownGroups[size];\n group.N = new sjcl.bn(group.N);\n group.g = new sjcl.bn(group.g);\n }\n sjcl.keyexchange.srp._didInitKnownGroups = true;\n },\n\n _knownGroupSizes: [1024, 1536, 2048, 3072, 4096, 6144, 8192],\n _knownGroups: {\n 1024: {\n N: \"EEAF0AB9ADB38DD69C33F80AFA8FC5E86072618775FF3C0B9EA2314C\" +\n \"9C256576D674DF7496EA81D3383B4813D692C6E0E0D5D8E250B98BE4\" +\n \"8E495C1D6089DAD15DC7D7B46154D6B6CE8EF4AD69B15D4982559B29\" +\n \"7BCF1885C529F566660E57EC68EDBC3C05726CC02FD4CBF4976EAA9A\" +\n \"FD5138FE8376435B9FC61D2FC0EB06E3\",\n g:2\n },\n\n 1536: {\n N: \"9DEF3CAFB939277AB1F12A8617A47BBBDBA51DF499AC4C80BEEEA961\" +\n \"4B19CC4D5F4F5F556E27CBDE51C6A94BE4607A291558903BA0D0F843\" +\n \"80B655BB9A22E8DCDF028A7CEC67F0D08134B1C8B97989149B609E0B\" +\n \"E3BAB63D47548381DBC5B1FC764E3F4B53DD9DA1158BFD3E2B9C8CF5\" +\n \"6EDF019539349627DB2FD53D24B7C48665772E437D6C7F8CE442734A\" +\n \"F7CCB7AE837C264AE3A9BEB87F8A2FE9B8B5292E5A021FFF5E91479E\" +\n \"8CE7A28C2442C6F315180F93499A234DCF76E3FED135F9BB\",\n g: 2\n },\n\n 2048: {\n N: \"AC6BDB41324A9A9BF166DE5E1389582FAF72B6651987EE07FC319294\" +\n \"3DB56050A37329CBB4A099ED8193E0757767A13DD52312AB4B03310D\" +\n \"CD7F48A9DA04FD50E8083969EDB767B0CF6095179A163AB3661A05FB\" +\n \"D5FAAAE82918A9962F0B93B855F97993EC975EEAA80D740ADBF4FF74\" +\n \"7359D041D5C33EA71D281E446B14773BCA97B43A23FB801676BD207A\" +\n \"436C6481F1D2B9078717461A5B9D32E688F87748544523B524B0D57D\" +\n \"5EA77A2775D2ECFA032CFBDBF52FB3786160279004E57AE6AF874E73\" +\n \"03CE53299CCC041C7BC308D82A5698F3A8D0C38271AE35F8E9DBFBB6\" +\n \"94B5C803D89F7AE435DE236D525F54759B65E372FCD68EF20FA7111F\" +\n \"9E4AFF73\",\n g: 2\n },\n\n 3072: {\n N: \"FFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD129024E08\" +\n \"8A67CC74020BBEA63B139B22514A08798E3404DDEF9519B3CD3A431B\" +\n \"302B0A6DF25F14374FE1356D6D51C245E485B576625E7EC6F44C42E9\" +\n \"A637ED6B0BFF5CB6F406B7EDEE386BFB5A899FA5AE9F24117C4B1FE6\" +\n \"49286651ECE45B3DC2007CB8A163BF0598DA48361C55D39A69163FA8\" +\n \"FD24CF5F83655D23DCA3AD961C62F356208552BB9ED529077096966D\" +\n \"670C354E4ABC9804F1746C08CA18217C32905E462E36CE3BE39E772C\" +\n \"180E86039B2783A2EC07A28FB5C55DF06F4C52C9DE2BCBF695581718\" +\n \"3995497CEA956AE515D2261898FA051015728E5A8AAAC42DAD33170D\" +\n \"04507A33A85521ABDF1CBA64ECFB850458DBEF0A8AEA71575D060C7D\" +\n \"B3970F85A6E1E4C7ABF5AE8CDB0933D71E8C94E04A25619DCEE3D226\" +\n \"1AD2EE6BF12FFA06D98A0864D87602733EC86A64521F2B18177B200C\" +\n \"BBE117577A615D6C770988C0BAD946E208E24FA074E5AB3143DB5BFC\" +\n \"E0FD108E4B82D120A93AD2CAFFFFFFFFFFFFFFFF\",\n g: 5\n },\n\n 4096: {\n N: \"FFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD129024E08\" +\n \"8A67CC74020BBEA63B139B22514A08798E3404DDEF9519B3CD3A431B\" +\n \"302B0A6DF25F14374FE1356D6D51C245E485B576625E7EC6F44C42E9\" +\n \"A637ED6B0BFF5CB6F406B7EDEE386BFB5A899FA5AE9F24117C4B1FE6\" +\n \"49286651ECE45B3DC2007CB8A163BF0598DA48361C55D39A69163FA8\" +\n \"FD24CF5F83655D23DCA3AD961C62F356208552BB9ED529077096966D\" +\n \"670C354E4ABC9804F1746C08CA18217C32905E462E36CE3BE39E772C\" +\n \"180E86039B2783A2EC07A28FB5C55DF06F4C52C9DE2BCBF695581718\" +\n \"3995497CEA956AE515D2261898FA051015728E5A8AAAC42DAD33170D\" +\n \"04507A33A85521ABDF1CBA64ECFB850458DBEF0A8AEA71575D060C7D\" +\n \"B3970F85A6E1E4C7ABF5AE8CDB0933D71E8C94E04A25619DCEE3D226\" +\n \"1AD2EE6BF12FFA06D98A0864D87602733EC86A64521F2B18177B200C\" +\n \"BBE117577A615D6C770988C0BAD946E208E24FA074E5AB3143DB5BFC\" +\n \"E0FD108E4B82D120A92108011A723C12A787E6D788719A10BDBA5B26\" +\n \"99C327186AF4E23C1A946834B6150BDA2583E9CA2AD44CE8DBBBC2DB\" +\n \"04DE8EF92E8EFC141FBECAA6287C59474E6BC05D99B2964FA090C3A2\" +\n \"233BA186515BE7ED1F612970CEE2D7AFB81BDD762170481CD0069127\" +\n \"D5B05AA993B4EA988D8FDDC186FFB7DC90A6C08F4DF435C934063199\" +\n \"FFFFFFFFFFFFFFFF\",\n g: 5\n },\n\n 6144: {\n N: \"FFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD129024E08\" +\n \"8A67CC74020BBEA63B139B22514A08798E3404DDEF9519B3CD3A431B\" +\n \"302B0A6DF25F14374FE1356D6D51C245E485B576625E7EC6F44C42E9\" +\n \"A637ED6B0BFF5CB6F406B7EDEE386BFB5A899FA5AE9F24117C4B1FE6\" +\n \"49286651ECE45B3DC2007CB8A163BF0598DA48361C55D39A69163FA8\" +\n \"FD24CF5F83655D23DCA3AD961C62F356208552BB9ED529077096966D\" +\n \"670C354E4ABC9804F1746C08CA18217C32905E462E36CE3BE39E772C\" +\n \"180E86039B2783A2EC07A28FB5C55DF06F4C52C9DE2BCBF695581718\" +\n \"3995497CEA956AE515D2261898FA051015728E5A8AAAC42DAD33170D\" +\n \"04507A33A85521ABDF1CBA64ECFB850458DBEF0A8AEA71575D060C7D\" +\n \"B3970F85A6E1E4C7ABF5AE8CDB0933D71E8C94E04A25619DCEE3D226\" +\n \"1AD2EE6BF12FFA06D98A0864D87602733EC86A64521F2B18177B200C\" +\n \"BBE117577A615D6C770988C0BAD946E208E24FA074E5AB3143DB5BFC\" +\n \"E0FD108E4B82D120A92108011A723C12A787E6D788719A10BDBA5B26\" +\n \"99C327186AF4E23C1A946834B6150BDA2583E9CA2AD44CE8DBBBC2DB\" +\n \"04DE8EF92E8EFC141FBECAA6287C59474E6BC05D99B2964FA090C3A2\" +\n \"233BA186515BE7ED1F612970CEE2D7AFB81BDD762170481CD0069127\" +\n \"D5B05AA993B4EA988D8FDDC186FFB7DC90A6C08F4DF435C934028492\" +\n \"36C3FAB4D27C7026C1D4DCB2602646DEC9751E763DBA37BDF8FF9406\" +\n \"AD9E530EE5DB382F413001AEB06A53ED9027D831179727B0865A8918\" +\n \"DA3EDBEBCF9B14ED44CE6CBACED4BB1BDB7F1447E6CC254B33205151\" +\n \"2BD7AF426FB8F401378CD2BF5983CA01C64B92ECF032EA15D1721D03\" +\n \"F482D7CE6E74FEF6D55E702F46980C82B5A84031900B1C9E59E7C97F\" +\n \"BEC7E8F323A97A7E36CC88BE0F1D45B7FF585AC54BD407B22B4154AA\" +\n \"CC8F6D7EBF48E1D814CC5ED20F8037E0A79715EEF29BE32806A1D58B\" +\n \"B7C5DA76F550AA3D8A1FBFF0EB19CCB1A313D55CDA56C9EC2EF29632\" +\n \"387FE8D76E3C0468043E8F663F4860EE12BF2D5B0B7474D6E694F91E\" +\n \"6DCC4024FFFFFFFFFFFFFFFF\",\n g: 5\n },\n\n 8192: {\n N:\"FFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD129024E08\" +\n \"8A67CC74020BBEA63B139B22514A08798E3404DDEF9519B3CD3A431B\" +\n \"302B0A6DF25F14374FE1356D6D51C245E485B576625E7EC6F44C42E9\" +\n \"A637ED6B0BFF5CB6F406B7EDEE386BFB5A899FA5AE9F24117C4B1FE6\" +\n \"49286651ECE45B3DC2007CB8A163BF0598DA48361C55D39A69163FA8\" +\n \"FD24CF5F83655D23DCA3AD961C62F356208552BB9ED529077096966D\" +\n \"670C354E4ABC9804F1746C08CA18217C32905E462E36CE3BE39E772C\" +\n \"180E86039B2783A2EC07A28FB5C55DF06F4C52C9DE2BCBF695581718\" +\n \"3995497CEA956AE515D2261898FA051015728E5A8AAAC42DAD33170D\" +\n \"04507A33A85521ABDF1CBA64ECFB850458DBEF0A8AEA71575D060C7D\" +\n \"B3970F85A6E1E4C7ABF5AE8CDB0933D71E8C94E04A25619DCEE3D226\" +\n \"1AD2EE6BF12FFA06D98A0864D87602733EC86A64521F2B18177B200C\" +\n \"BBE117577A615D6C770988C0BAD946E208E24FA074E5AB3143DB5BFC\" +\n \"E0FD108E4B82D120A92108011A723C12A787E6D788719A10BDBA5B26\" +\n \"99C327186AF4E23C1A946834B6150BDA2583E9CA2AD44CE8DBBBC2DB\" +\n \"04DE8EF92E8EFC141FBECAA6287C59474E6BC05D99B2964FA090C3A2\" +\n \"233BA186515BE7ED1F612970CEE2D7AFB81BDD762170481CD0069127\" +\n \"D5B05AA993B4EA988D8FDDC186FFB7DC90A6C08F4DF435C934028492\" +\n \"36C3FAB4D27C7026C1D4DCB2602646DEC9751E763DBA37BDF8FF9406\" +\n \"AD9E530EE5DB382F413001AEB06A53ED9027D831179727B0865A8918\" +\n \"DA3EDBEBCF9B14ED44CE6CBACED4BB1BDB7F1447E6CC254B33205151\" +\n \"2BD7AF426FB8F401378CD2BF5983CA01C64B92ECF032EA15D1721D03\" +\n \"F482D7CE6E74FEF6D55E702F46980C82B5A84031900B1C9E59E7C97F\" +\n \"BEC7E8F323A97A7E36CC88BE0F1D45B7FF585AC54BD407B22B4154AA\" +\n \"CC8F6D7EBF48E1D814CC5ED20F8037E0A79715EEF29BE32806A1D58B\" +\n \"B7C5DA76F550AA3D8A1FBFF0EB19CCB1A313D55CDA56C9EC2EF29632\" +\n \"387FE8D76E3C0468043E8F663F4860EE12BF2D5B0B7474D6E694F91E\" +\n \"6DBE115974A3926F12FEE5E438777CB6A932DF8CD8BEC4D073B931BA\" +\n \"3BC832B68D9DD300741FA7BF8AFC47ED2576F6936BA424663AAB639C\" +\n \"5AE4F5683423B4742BF1C978238F16CBE39D652DE3FDB8BEFC848AD9\" +\n \"22222E04A4037C0713EB57A81A23F0C73473FC646CEA306B4BCBC886\" +\n \"2F8385DDFA9D4B7FA2C087E879683303ED5BDD3A062B3CF5B3A278A6\" +\n \"6D2A13F83F44F82DDF310EE074AB6A364597E899A0255DC164F31CC5\" +\n \"0846851DF9AB48195DED7EA1B1D510BD7EE74D73FAF36BC31ECFA268\" +\n \"359046F4EB879F924009438B481C6CD7889A002ED5EE382BC9190DA6\" +\n \"FC026E479558E4475677E9AA9E3050E2765694DFC81F56E880B96E71\" +\n \"60C980DD98EDD3DFFFFFFFFFFFFFFFFF\",\n g: 19\n }\n }\n\n};\n" }, { "path": "demo/example.css", "content": "* {\n margin: 0px;\n padding: 0px;\n font-family: Arial, Helvetica, FreeSans, sans;\n}\n\nh1 {\n text-align: center;\n background: #eee;\n padding: 5px;\n margin-bottom: 0.6em;\n font-size: 1.5em;\n}\n\n.header {\n width: 650px;\n margin: 0px auto 1em;\n}\n\np+p {\n margin-top: 1em;\n}\n\n.explanation {\n color: #555;\n margin-top: 0.3em;\n}\n\n.section+.section, .explanation+.section {\n margin-top: 1.5em;\n}\n\n.hex {\n text-transform: uppercase;\n}\n\n.hex, .base64, #ciphertext {\n font-family: 'Courier', mono;\n}\n\n.wide, textarea {\n width: 100%;\n margin: 0px -4px;\n font-size: inherit;\n text-align: left;\n}\n\ntextarea+*, .wide+* {\n margin-top: 0.3em;\n}\n\n/* bulk object placement */\n#theForm {\n position: relative;\n width: 940px;\n margin: 0px auto;\n font-size: 0.8em;\n}\n\n.column {\n top: 0px;\n width: 300px;\n}\n\n.box {\n border: 2px solid #999;\n padding: 7px;\n margin-bottom: 20px;\n -moz-border-radius: 7px;\n -webkit-border-radius: 7px;\n}\n\n#cmode { position: absolute; left: 640px; }\n#ctexts { position: absolute; left: 320px; }\n\n.floatright {\n float: right;\n text-align: right;\n}\n\na {\n cursor: pointer;\n color: #282;\n}\n\na.random, #buttons a { text-decoration: none; }\na.random:hover, a.random:focus { text-decoration: underline; }\n\nh2 {\n margin: -7px -7px 3px -7px;\n text-align: center;\n font-size: 1.2em;\n color: white;\n background: #999;\n}\n\n#pplaintext { border-color: #f65; }\n#pplaintext h2 { background: #f65; }\n\n#ppassword { border-color: #4a4; }\n#ppassword h2 { background: #4a4; }\n\n#pciphertext { border-color: #78f; }\n#pciphertext h2 { background: #78f; }\n\n#buttons { text-align: center; margin-top: -20px; }\n\na#doPbkdf2, a#encrypt, a#decrypt {\n display: inline-block;\n text-align: center;\n height: 43px;\n padding-top: 20px;\n width: 50px;\n background: url('alpha-arrow.png') no-repeat bottom center;\n vertical-align: middle;\n border: none;\n color: white;\n overflow: hidden;\n}\n\n.turnDown {\n display: inline-block;\n padding-bottom: 3px;\n -moz-transform: rotate(90deg);\t\n -webkit-transform: rotate(90deg);\t\n transform: rotate(90deg);\n background-color: inherit;\n}\n\n.turnUp {\n display: inline-block;\n padding-bottom: 3px;\n -moz-transform: rotate(-90deg);\t\n -webkit-transform: rotate(-90deg);\t\n transform: rotate(-90deg);\n background-color: inherit;\t\n}\n\n.buttons a.disabled {\n background-color: #ccc ! important;\n cursor: inherit ! important;\n}\n\na#encrypt { background-color: #f65; margin-bottom: 2px; }\na#encrypt:hover, a#encrypt:focus { background-color: #f76; }\na#encrypt:active { background-color: #f87; }\n\na#decrypt {\n height: 36px;\n padding-top: 27px;\n background: url('alpha-arrow.png') no-repeat top center;\n background-color: #78f;\n margin-top: 2px;\n}\na#decrypt:hover { background-color: #89f; }\na#decrypt:focus { background-color: #89f; }\na#decrypt:active { background-color: #9af; }\n\n#ppassword, #pkey, #pmode, #pplaintext, #pciphertext {\n -moz-border-radius: 7px;\n -webkit-border-radius: 7px;\n}\ninput[type='text'], input[type='password'], textarea {\n -moz-border-radius: 3px;\n -webkit-border-radius: 3px;\n font-size: inherit;\n border: 1px solid #444;\n padding: 3px;\n}\n\ninput[type='text']:focus, input[type='password']:focus, textarea:focus {\n border-color: red;\n}\n\ninput[type=\"radio\"], input[type=\"checkbox\"] {\n position: relative;\n top: 0.15em;\n margin-right: -0.15em;\n}\n" }, { "path": "demo/example.js", "content": "/* keep track of which salts have been used. */\nvar form, usedIvs = {'':1}, usedSalts = {'':1};\n\n/* enter actions */\nvar enterActions = {\n password: doPbkdf2,\n salt: doPbkdf2,\n iter: doPbkdf2\n};\n\nfunction loaded() {\n form = new formHandler('theForm', enterActions);\n form._extendedKey = [];\n sjcl.random.startCollectors();\n document.getElementById(\"password\").focus();\n}\n\n/* there's probaby a better way to tell the user something, but oh well */\nfunction error(x) {\n alert(x);\n}\n\n/* compute PBKDF2 on the password. */\nfunction doPbkdf2(decrypting) {\n var v = form.get(), salt=v.salt, key, hex = sjcl.codec.hex.fromBits, p={},\n password = v.password;\n \n p.iter = v.iter;\n \n if (password.length == 0) {\n if (decrypting) { error(\"Can't decrypt: need a password!\"); }\n return;\n }\n \n if (salt.length === 0 && decrypting) {\n error(\"Can't decrypt: need a salt for PBKDF2!\");\n return;\n }\n \n if (decrypting || !v.freshsalt || !usedSalts[v.salt]) {\n p.salt = v.salt;\n }\n \n p = sjcl.misc.cachedPbkdf2(password, p);\n form._extendedKey = p.key;\n v.key = p.key.slice(0, v.keysize/32);\n v.salt = p.salt;\n \n form.set(v);\n form.plaintext.el.select();\n}\n/* Encrypt a message */\nfunction doEncrypt() {\n var v = form.get(), iv = v.iv, password = v.password, key = v.key, adata = v.adata, aes, plaintext=v.plaintext, rp = {}, ct, p;\n \n if (plaintext === '' && v.ciphertext.length) { return; }\n if (key.length == 0 && password.length == 0) {\n error(\"need a password or key!\");\n return;\n }\n \n p = { adata:v.adata,\n iter:v.iter,\n mode:v.mode,\n ts:parseInt(v.tag),\n ks:parseInt(v.keysize) };\n if (!v.freshiv || !usedIvs[v.iv]) { p.iv = v.iv; }\n if (!v.freshsalt || !usedSalts[v.salt]) { p.salt = v.salt; }\n ct = sjcl.encrypt(password || key, plaintext, p, rp).replace(/,/g,\",\\n\");\n\n v.iv = rp.iv;\n usedIvs[rp.iv] = 1;\n if (rp.salt) {\n v.salt = rp.salt;\n usedSalts[rp.salt] = 1;\n }\n v.key = rp.key;\n \n if (v.json) {\n v.ciphertext = ct;\n v.adata = '';\n } else {\n v.ciphertext = ct.match(/\"ct\":\"([^\"]*)\"/)[1]; //\"\n }\n \n v.plaintext = '';\n \n form.set(v);\n form.ciphertext.el.select();\n}\n\n/* Decrypt a message */\nfunction doDecrypt() {\n var v = form.get(), iv = v.iv, key = v.key, adata = v.adata, aes, ciphertext=v.ciphertext, rp = {};\n \n if (ciphertext.length === 0) { return; }\n if (!v.password && !v.key.length) {\n error(\"Can't decrypt: need a password or key!\"); return;\n }\n \n if (ciphertext.match(\"{\")) {\n /* it's jsonized */\n try {\n v.plaintext = sjcl.decrypt(v.password || v.key, ciphertext, {}, rp);\n } catch(e) {\n error(\"Can't decrypt: \"+e);\n return;\n }\n v.mode = rp.mode;\n v.iv = rp.iv;\n v.adata = sjcl.codec.utf8String.fromBits(rp.adata);\n if (v.password) {\n v.salt = rp.salt;\n v.iter = rp.iter;\n v.keysize = rp.ks;\n v.tag = rp.ts;\n }\n v.key = rp.key;\n v.ciphertext = \"\";\n document.getElementById('plaintext').select();\n } else {\n /* it's raw */\n ciphertext = sjcl.codec.base64.toBits(ciphertext);\n if (iv.length === 0) {\n error(\"Can't decrypt: need an IV!\"); return;\n }\n if (key.length === 0) {\n if (v.password.length) {\n doPbkdf2(true);\n key = v.key;\n }\n }\n aes = new sjcl.cipher.aes(key);\n \n try {\n v.plaintext = sjcl.codec.utf8String.fromBits(sjcl.mode[v.mode].decrypt(aes, ciphertext, iv, v.adata, v.tag));\n v.ciphertext = \"\";\n document.getElementById('plaintext').select();\n } catch (e) {\n error(\"Can't decrypt: \" + e);\n }\n }\n form.set(v);\n}\n\nfunction extendKey(size) {\n form.key.set(form._extendedKey.slice(0,size));\n}\n\nfunction randomize(field, words, paranoia) {\n form[field].set(sjcl.random.randomWords(words, paranoia));\n if (field == 'salt') { form.key.set([]); }\n}\n" }, { "path": "demo/form.js", "content": "/* Hackish form handling system. */\nfunction hasClass(e, cl) {\n return (\" \"+e.className+\" \").match(\" \"+cl+\" \");\n}\n\nfunction stopPropagation(e) {\n e.preventDefault && e.preventDefault();\n e.cancelBubble = true;\n}\n\n/* proxy for a form object, with appropriate encoder/decoder */\nfunction formElement(el) {\n this.el = el;\n}\nformElement.prototype = {\n get: function() {\n var el = this.el;\n if (el.type == \"checkbox\") {\n return el.checked;\n } else if (hasClass(el, \"numeric\")) {\n return parseInt(el.value);\n } else if (hasClass(el, \"hex\")) {\n return sjcl.codec.hex.toBits(el.value);\n } else if (hasClass(el, \"base64\")) {\n return sjcl.codec.base64.toBits(el.value);\n } else {\n return el.value;\n }\n },\n \n set: function(x) {\n var el = this.el;\n if (el.type == \"checkbox\") {\n el.checked = x; return;\n } else if (hasClass(el, \"hex\")) {\n if (typeof x !== 'string') {\n x = sjcl.codec.hex.fromBits(x);\n }\n x = x.toUpperCase().replace(/ /g,'').replace(/(.{8})/g, \"$1 \").replace(/ $/, '');\n } else if (hasClass(el, \"base64\")) {\n if (typeof x !== 'string') {\n x = sjcl.codec.base64.fromBits(x);\n }\n x = x.replace(/\\s/g,'').replace(/(.{32})/g, \"$1\\n\").replace(/\\n$/, '');\n }\n el.value = x;\n }\n};\n\nfunction radioGroup(name) {\n this.name = name;\n}\nradioGroup.prototype = {\n get: function() {\n var els = document.getElementsByName(this.name), i;\n for (i=0; i\n \n\n\n SJCL demo\n \n \n \n \n\n\n

SJCL demo

\n\n
\n

This page is a demo of the Stanford Javascript Crypto Library. To get started, just type in a password in the left pane and a secret message in the middle pane, then click \"encrypt\". Encryption takes place in your browser and we never see the plaintext.

\n \n

SJCL has lots of other options, many of which are shown in the grey boxes.

\n
\n\n
\n
\n \n
\n

Password

\n
\n \n \n

\n Choose a strong, random password.\n

\n
\n
\n \n
\n

Key Derivation

\n
\n
\n \n random\n
\n \n \n \n

\n Salt adds more variability to your key, and prevents attackers\n from using rainbow tables to attack it.\n

\n
\n\n
\n \n \n

\n Strengthening makes it slower to compute the key corresponding to your\n password. This makes it take much longer for an attacker to guess it.\n

\n
\n\n
\n Key size:\n \n \n \n \n \n \n

\n 128 bits should be secure enough, but you can generate a longer\n key if you wish.\n

\n
\n\n \n
\n
\n \n \n
\n \n

\n This key is computed from your password, salt and strengthening factor. It\n will be used internally by the cipher. Instead of using a password, you can\n enter a key here directly. If you do, it should be 32, 48 or 64 hexadecimal\n digits (128, 192 or 256 bits).\n

\n
\n \n
\n
\n \n \n
\n
\n

Cipher Parameters

\n

\n SJCL encrypts your data with the AES block cipher.\n

\n
\n Cipher mode:\n \n \n \n \n \n \n

\n The cipher mode is a standard for how to use AES and other\n algorithms to encrypt and authenticate your message.\n OCB2 mode (patented) and\n GCM mode (unencumbered)\n are slightly faster and have more features than\n CCM mode.\n

\n
\n \n
\n
\n \n random\n
\n \n \n \n

\n The IV needs to be different for every message you send. It adds\n randomness to your message, so that the same message will look\n different each time you send it.\n

\n

\n Be careful: CCM mode and GCM mode don't use\n the whole IV, so changing just part of it isn't enough.\n

\n
\n \n
\n Authentication strength:\n \n \n \n \n \n \n

\n SJCL adds a an authentication tag to your message to make sure\n nobody changes it. The longer the authentication tag, the harder it is\n for somebody to change your encrypted message without you noticing. 64\n bits is probably enough.\n

\n
\n \n
\n \n \n

\n These parameters are required to decrypt your message later. If the\n person you're sending the message to knows them, you don't need to send\n them so your message will be shorter.\n

\n

\n Default parameters won't be sent. Your password won't be sent, either.\n The salt and iv will be encoded in base64 instead of hex, so they'll\n look different from what's in the box.\n

\n
\n
\n
\n \n
\n
\n

Plaintext

\n
\n \n \n
\n This message will be encrypted, so that nobody can read it or change it\n without your password.\n
\n
\n \n
\n \n \n
\n This auxilliary message isn't secret, but its integrity will be checked\n along with the integrity of the message.\n
\n
\n
\n \n \n \n
\n

Ciphertext

\n \n \n
\n Your message, encrypted and authenticated so that nobody can read it\n or change it without your password.\n
\n
\n \n\n\n" }, { "path": "jsdoc.conf.json", "content": "{\n \"templates\": {\n \"default\": {\n \"useLongnameInNav\": true\n }\n }\n}\n" }, { "path": "package.json", "content": "{\n \"name\": \"sjcl\",\n \"version\": \"1.0.9\",\n \"description\": \"Stanford Javascript Crypto Library\",\n \"main\": \"sjcl.js\",\n \"author\": \"bitwiseshiftleft\",\n \"license\": \"(BSD-2-Clause OR GPL-2.0-only)\",\n \"homepage\": \"https://github.com/bitwiseshiftleft/sjcl\",\n \"keywords\": [\n \"encryption\",\n \"high-level\",\n \"crypto\"\n ],\n \"repository\": {\n \"type\": \"git\",\n \"url\": \"https://github.com/bitwiseshiftleft/sjcl.git\"\n },\n \"scripts\": {\n \"test\": \"make test\",\n \"jsdoc\": \"jsdoc -c jsdoc.conf.json\",\n \"lint\": \"eslint . || true\"\n },\n \"browser\": {\n \"crypto\": false\n },\n \"engines\": {\n \"node\": \"*\"\n },\n \"devDependencies\": {\n \"eslint\": \"^2.11.1\",\n \"jsdoc\": \"3.4.0\"\n }\n}\n" }, { "path": "sjcl.js", "content": "\"use strict\";var sjcl={cipher:{},hash:{},keyexchange:{},mode:{},misc:{},codec:{},exception:{corrupt:function(a){this.toString=function(){return\"CORRUPT: \"+this.message};this.message=a},invalid:function(a){this.toString=function(){return\"INVALID: \"+this.message};this.message=a},bug:function(a){this.toString=function(){return\"BUG: \"+this.message};this.message=a},notReady:function(a){this.toString=function(){return\"NOT READY: \"+this.message};this.message=a}}};\nsjcl.cipher.aes=function(a){this.s[0][0][0]||this.O();var b,c,d,e,f=this.s[0][4],g=this.s[1];b=a.length;var h=1;if(4!==b&&6!==b&&8!==b)throw new sjcl.exception.invalid(\"invalid aes key size\");this.b=[d=a.slice(0),e=[]];for(a=b;a<4*b+28;a++){c=d[a-1];if(0===a%b||8===b&&4===a%b)c=f[c>>>24]<<24^f[c>>16&255]<<16^f[c>>8&255]<<8^f[c&255],0===a%b&&(c=c<<8^c>>>24^h<<24,h=h<<1^283*(h>>7));d[a]=d[a-b]^c}for(b=0;a;b++,a--)c=d[b&3?a:a-4],e[b]=4>=a||4>b?c:g[0][f[c>>>24]]^g[1][f[c>>16&255]]^g[2][f[c>>8&255]]^g[3][f[c&\n255]]};\nsjcl.cipher.aes.prototype={encrypt:function(a){return t(this,a,0)},decrypt:function(a){return t(this,a,1)},s:[[[],[],[],[],[]],[[],[],[],[],[]]],O:function(){var a=this.s[0],b=this.s[1],c=a[4],d=b[4],e,f,g,h=[],k=[],l,n,m,p;for(e=0;0x100>e;e++)k[(h[e]=e<<1^283*(e>>7))^e]=e;for(f=g=0;!c[f];f^=l||1,g=k[g]||1)for(m=g^g<<1^g<<2^g<<3^g<<4,m=m>>8^m&255^99,c[f]=m,d[m]=f,n=h[e=h[l=h[f]]],p=0x1010101*n^0x10001*e^0x101*l^0x1010100*f,n=0x101*h[m]^0x1010100*m,e=0;4>e;e++)a[e][f]=n=n<<24^n>>>8,b[e][m]=p=p<<24^p>>>8;for(e=\n0;5>e;e++)a[e]=a[e].slice(0),b[e]=b[e].slice(0)}};\nfunction t(a,b,c){if(4!==b.length)throw new sjcl.exception.invalid(\"invalid aes block size\");var d=a.b[c],e=b[0]^d[0],f=b[c?3:1]^d[1],g=b[2]^d[2];b=b[c?1:3]^d[3];var h,k,l,n=d.length/4-2,m,p=4,r=[0,0,0,0];h=a.s[c];a=h[0];var q=h[1],v=h[2],w=h[3],x=h[4];for(m=0;m>>24]^q[f>>16&255]^v[g>>8&255]^w[b&255]^d[p],k=a[f>>>24]^q[g>>16&255]^v[b>>8&255]^w[e&255]^d[p+1],l=a[g>>>24]^q[b>>16&255]^v[e>>8&255]^w[f&255]^d[p+2],b=a[b>>>24]^q[e>>16&255]^v[f>>8&255]^w[g&255]^d[p+3],p+=4,e=h,f=k,g=l;for(m=\n0;4>m;m++)r[c?3&-m:m]=x[e>>>24]<<24^x[f>>16&255]<<16^x[g>>8&255]<<8^x[b&255]^d[p++],h=e,e=f,f=g,g=b,b=h;return r}\nsjcl.bitArray={bitSlice:function(a,b,c){a=sjcl.bitArray.$(a.slice(b/32),32-(b&31)).slice(1);return void 0===c?a:sjcl.bitArray.clamp(a,c-b)},extract:function(a,b,c){var d=Math.floor(-b-c&31);return((b+c-1^b)&-32?a[b/32|0]<<32-d^a[b/32+1|0]>>>d:a[b/32|0]>>>d)&(1<>b-1,1));return a},partial:function(a,b,c){return 32===a?b:(c?b|0:b<<32-a)+0x10000000000*a},getPartial:function(a){return Math.round(a/0x10000000000)||32},equal:function(a,b){if(sjcl.bitArray.bitLength(a)!==sjcl.bitArray.bitLength(b))return!1;var c=0,d;for(d=0;d>>b),c=a[e]<<32-b;e=a.length?a[a.length-1]:0;a=sjcl.bitArray.getPartial(e);d.push(sjcl.bitArray.partial(b+a&31,32>>24|c>>>8&0xff00|(c&0xff00)<<8|c<<24;return a}};\nsjcl.codec.utf8String={fromBits:function(a){var b=\"\",c=sjcl.bitArray.bitLength(a),d,e;for(d=0;d>>8>>>8>>>8),e<<=8;return decodeURIComponent(escape(b))},toBits:function(a){a=unescape(encodeURIComponent(a));var b=[],c,d=0;for(c=0;c>>g)>>>e),gn){if(!b)try{return sjcl.codec.base32hex.toBits(a)}catch(p){}throw new sjcl.exception.invalid(\"this isn't \"+m+\"!\");}h>e?(h-=e,f.push(l^n>>>h),l=n<>>e)>>>26),6>e?(g=a[c]<<6-e,e+=26,c++):(g<<=6,e-=6);for(;d.length&3&&!b;)d+=\"=\";return d},toBits:function(a,b){a=a.replace(/\\s|=/g,\"\");var c=[],d,e=0,f=sjcl.codec.base64.B,g=0,h;b&&(f=f.substr(0,62)+\"-_\");for(d=0;dh)throw new sjcl.exception.invalid(\"this isn't base64!\");26>>e),g=h<<32-e):(e+=6,g^=h<<32-e)}e&56&&c.push(sjcl.bitArray.partial(e&56,g,1));return c}};sjcl.codec.base64url={fromBits:function(a){return sjcl.codec.base64.fromBits(a,1,1)},toBits:function(a){return sjcl.codec.base64.toBits(a,1)}};sjcl.hash.sha256=function(a){this.b[0]||this.O();a?(this.F=a.F.slice(0),this.A=a.A.slice(0),this.l=a.l):this.reset()};sjcl.hash.sha256.hash=function(a){return(new sjcl.hash.sha256).update(a).finalize()};\nsjcl.hash.sha256.prototype={blockSize:512,reset:function(){this.F=this.Y.slice(0);this.A=[];this.l=0;return this},update:function(a){\"string\"===typeof a&&(a=sjcl.codec.utf8String.toBits(a));var b,c=this.A=sjcl.bitArray.concat(this.A,a);b=this.l;a=this.l=b+sjcl.bitArray.bitLength(a);if(0x1fffffffffffffb;c++){e=!0;for(d=2;d*d<=c;d++)if(0===c%d){e=\n!1;break}e&&(8>b&&(this.Y[b]=a(Math.pow(c,.5))),this.b[b]=a(Math.pow(c,1/3)),b++)}}};\nfunction u(a,b){var c,d,e,f=a.F,g=a.b,h=f[0],k=f[1],l=f[2],n=f[3],m=f[4],p=f[5],r=f[6],q=f[7];for(c=0;64>c;c++)16>c?d=b[c]:(d=b[c+1&15],e=b[c+14&15],d=b[c&15]=(d>>>7^d>>>18^d>>>3^d<<25^d<<14)+(e>>>17^e>>>19^e>>>10^e<<15^e<<13)+b[c&15]+b[c+9&15]|0),d=d+q+(m>>>6^m>>>11^m>>>25^m<<26^m<<21^m<<7)+(r^m&(p^r))+g[c],q=r,r=p,p=m,m=n+d|0,n=l,l=k,k=h,h=d+(k&l^n&(k^l))+(k>>>2^k>>>13^k>>>22^k<<30^k<<19^k<<10)|0;f[0]=f[0]+h|0;f[1]=f[1]+k|0;f[2]=f[2]+l|0;f[3]=f[3]+n|0;f[4]=f[4]+m|0;f[5]=f[5]+p|0;f[6]=f[6]+r|0;f[7]=\nf[7]+q|0}\nsjcl.mode.ccm={name:\"ccm\",G:[],listenProgress:function(a){sjcl.mode.ccm.G.push(a)},unListenProgress:function(a){a=sjcl.mode.ccm.G.indexOf(a);-1k)throw new sjcl.exception.invalid(\"ccm: iv must be at least 7 bytes\");for(f=2;4>f&&l>>>8*f;f++);f<15-k&&(f=15-k);c=h.clamp(c,\n8*(15-f));b=sjcl.mode.ccm.V(a,b,c,d,e,f);g=sjcl.mode.ccm.C(a,g,c,b,e,f);return h.concat(g.data,g.tag)},decrypt:function(a,b,c,d,e){e=e||64;d=d||[];var f=sjcl.bitArray,g=f.bitLength(c)/8,h=f.bitLength(b),k=f.clamp(b,h-e),l=f.bitSlice(b,h-e),h=(h-e)/8;if(7>g)throw new sjcl.exception.invalid(\"ccm: iv must be at least 7 bytes\");for(b=2;4>b&&h>>>8*b;b++);b<15-g&&(b=15-g);c=f.clamp(c,8*(15-b));k=sjcl.mode.ccm.C(a,k,c,l,e,b);a=sjcl.mode.ccm.V(a,k.data,c,d,e,b);if(!f.equal(k.tag,a))throw new sjcl.exception.corrupt(\"ccm: tag doesn't match\");\nreturn k.data},na:function(a,b,c,d,e,f){var g=[],h=sjcl.bitArray,k=h.i;d=[h.partial(8,(b.length?64:0)|d-2<<2|f-1)];d=h.concat(d,c);d[3]|=e;d=a.encrypt(d);if(b.length)for(c=h.bitLength(b)/8,65279>=c?g=[h.partial(16,c)]:0xffffffff>=c&&(g=h.concat([h.partial(16,65534)],[c])),g=h.concat(g,b),b=0;be||16n&&(sjcl.mode.ccm.fa(g/\nk),n+=m),c[3]++,e=a.encrypt(c),b[g]^=e[0],b[g+1]^=e[1],b[g+2]^=e[2],b[g+3]^=e[3];return{tag:d,data:h.clamp(b,l)}}};\nsjcl.mode.ocb2={name:\"ocb2\",encrypt:function(a,b,c,d,e,f){if(128!==sjcl.bitArray.bitLength(c))throw new sjcl.exception.invalid(\"ocb iv must be 128 bits\");var g,h=sjcl.mode.ocb2.S,k=sjcl.bitArray,l=k.i,n=[0,0,0,0];c=h(a.encrypt(c));var m,p=[];d=d||[];e=e||64;for(g=0;g+4e.bitLength(c)&&(h=f(h,d(h)),c=e.concat(c,[-2147483648,0,0,0]));g=f(g,c);\nreturn a.encrypt(f(d(f(h,d(h))),g))},S:function(a){return[a[0]<<1^a[1]>>>31,a[1]<<1^a[2]>>>31,a[2]<<1^a[3]>>>31,a[3]<<1^135*(a[0]>>>31)]}};\nsjcl.mode.gcm={name:\"gcm\",encrypt:function(a,b,c,d,e){var f=b.slice(0);b=sjcl.bitArray;d=d||[];a=sjcl.mode.gcm.C(!0,a,f,d,c,e||128);return b.concat(a.data,a.tag)},decrypt:function(a,b,c,d,e){var f=b.slice(0),g=sjcl.bitArray,h=g.bitLength(f);e=e||128;d=d||[];e<=h?(b=g.bitSlice(f,h-e),f=g.bitSlice(f,0,h-e)):(b=f,f=[]);a=sjcl.mode.gcm.C(!1,a,f,d,c,e);if(!g.equal(a.tag,b))throw new sjcl.exception.corrupt(\"gcm: tag doesn't match\");return a.data},ka:function(a,b){var c,d,e,f,g,h=sjcl.bitArray.i;e=[0,0,\n0,0];f=b.slice(0);for(c=0;128>c;c++){(d=0!==(a[Math.floor(c/32)]&1<<31-c%32))&&(e=h(e,f));g=0!==(f[3]&1);for(d=3;0>>1|(f[d-1]&1)<<31;f[0]>>>=1;g&&(f[0]^=-0x1f000000)}return e},j:function(a,b,c){var d,e=c.length;b=b.slice(0);for(d=0;de&&(a=b.hash(a));for(d=0;dd||0>c)throw new sjcl.exception.invalid(\"invalid params to pbkdf2\");\"string\"===typeof a&&(a=sjcl.codec.utf8String.toBits(a));\"string\"===typeof b&&(b=sjcl.codec.utf8String.toBits(b));e=e||sjcl.misc.hmac;a=new e(a);var f,g,h,k,l=[],n=sjcl.bitArray;for(k=1;32*l.length<(d||1);k++){e=f=a.encrypt(n.concat(b,[k]));for(g=1;gg;g++)e.push(0x100000000*Math.random()|0);for(g=0;g=1<this.o&&(this.o=\nf);this.P++;this.b=sjcl.hash.sha256.hash(this.b.concat(e));this.L=new sjcl.cipher.aes(this.b);for(d=0;4>d&&(this.h[d]=this.h[d]+1|0,!this.h[d]);d++);}for(d=0;d>>1;this.c[g].update([d,this.N++,2,b,f,a.length].concat(a))}break;case \"string\":void 0===b&&(b=a.length);this.c[g].update([d,this.N++,3,b,f,a.length]);this.c[g].update(a);break;default:k=1}if(k)throw new sjcl.exception.bug(\"random: addEntropy only supports number, array of numbers or string\");this.m[g]+=b;this.f+=b;h===this.u&&(this.isReady()!==this.u&&A(\"seeded\",Math.max(this.o,this.f)),A(\"progress\",this.getProgress()))},\nisReady:function(a){a=this.T[void 0!==a?a:this.M];return this.o&&this.o>=a?this.m[0]>this.ba&&(new Date).valueOf()>this.Z?this.J|this.I:this.I:this.f>=a?this.J|this.u:this.u},getProgress:function(a){a=this.T[a?a:this.M];return this.o>=a?1:this.f>a?1:this.f/a},startCollectors:function(){if(!this.D){this.a={loadTimeCollector:B(this,this.ma),mouseCollector:B(this,this.oa),keyboardCollector:B(this,this.la),accelerometerCollector:B(this,this.ea),touchCollector:B(this,this.qa)};if(window.addEventListener)window.addEventListener(\"load\",\nthis.a.loadTimeCollector,!1),window.addEventListener(\"mousemove\",this.a.mouseCollector,!1),window.addEventListener(\"keypress\",this.a.keyboardCollector,!1),window.addEventListener(\"devicemotion\",this.a.accelerometerCollector,!1),window.addEventListener(\"touchmove\",this.a.touchCollector,!1);else if(document.attachEvent)document.attachEvent(\"onload\",this.a.loadTimeCollector),document.attachEvent(\"onmousemove\",this.a.mouseCollector),document.attachEvent(\"keypress\",this.a.keyboardCollector);else throw new sjcl.exception.bug(\"can't attach event\");\nthis.D=!0}},stopCollectors:function(){this.D&&(window.removeEventListener?(window.removeEventListener(\"load\",this.a.loadTimeCollector,!1),window.removeEventListener(\"mousemove\",this.a.mouseCollector,!1),window.removeEventListener(\"keypress\",this.a.keyboardCollector,!1),window.removeEventListener(\"devicemotion\",this.a.accelerometerCollector,!1),window.removeEventListener(\"touchmove\",this.a.touchCollector,!1)):document.detachEvent&&(document.detachEvent(\"onload\",this.a.loadTimeCollector),document.detachEvent(\"onmousemove\",\nthis.a.mouseCollector),document.detachEvent(\"keypress\",this.a.keyboardCollector)),this.D=!1)},addEventListener:function(a,b){this.K[a][this.ga++]=b},removeEventListener:function(a,b){var c,d,e=this.K[a],f=[];for(d in e)e.hasOwnProperty(d)&&e[d]===b&&f.push(d);for(c=0;cb&&(a.h[b]=a.h[b]+1|0,!a.h[b]);b++);return a.L.encrypt(a.h)}\nfunction B(a,b){return function(){b.apply(a,arguments)}}sjcl.random=new sjcl.prng(6);\na:try{var D,E,F,G;if(G=\"undefined\"!==typeof module&&module.exports){var H;try{H=require(\"crypto\")}catch(a){H=null}G=E=H}if(G&&E.randomBytes)D=E.randomBytes(128),D=new Uint32Array((new Uint8Array(D)).buffer),sjcl.random.addEntropy(D,1024,\"crypto['randomBytes']\");else if(\"undefined\"!==typeof window&&\"undefined\"!==typeof Uint32Array){F=new Uint32Array(32);if(window.crypto&&window.crypto.getRandomValues)window.crypto.getRandomValues(F);else if(window.msCrypto&&window.msCrypto.getRandomValues)window.msCrypto.getRandomValues(F);\nelse break a;sjcl.random.addEntropy(F,1024,\"crypto['getRandomValues']\")}}catch(a){\"undefined\"!==typeof window&&window.console&&(console.log(\"There was an error collecting entropy from the browser:\"),console.log(a))}\nsjcl.json={defaults:{v:1,iter:1E4,ks:128,ts:64,mode:\"ccm\",adata:\"\",cipher:\"aes\"},ja:function(a,b,c,d){c=c||{};d=d||{};var e=sjcl.json,f=e.g({iv:sjcl.random.randomWords(4,0)},e.defaults),g;e.g(f,c);c=f.adata;\"string\"===typeof f.salt&&(f.salt=sjcl.codec.base64.toBits(f.salt));\"string\"===typeof f.iv&&(f.iv=sjcl.codec.base64.toBits(f.iv));if(!sjcl.mode[f.mode]||!sjcl.cipher[f.cipher]||\"string\"===typeof a&&100>=f.iter||64!==f.ts&&96!==f.ts&&128!==f.ts||128!==f.ks&&192!==f.ks&&0x100!==f.ks||2>f.iv.length||\n4=b.iter||64!==b.ts&&96!==b.ts&&128!==b.ts||128!==b.ks&&192!==b.ks&&0x100!==b.ks||!b.iv||2>b.iv.length||4>> (32 - tv[0].length)); // unsigned shift, convert to signed word\n this.require(b === (tv[1]|0), t + \"array entry shifted is number: \" + word2hex(b) + \" == \" + word2hex(tv[1]));\n }\n\n cb && cb();\n });\n\n\n new sjcl.test.TestCase(\"bitArray concat, slicing, shifting and clamping\", function (cb) {\n if (!sjcl.bitArray) {\n this.unimplemented();\n cb && cb();\n return;\n }\n\n var i, j, kat = sjcl.test.vector.bitArray.slices, tv, a, a1, b, bitlen, t;\n for (i=0; i}U?@Lns47E1%kR.o@n%FcmmsL/@{H8]yf7\"],\n[\"8e0bdd697628b91d8f245587ee95c5b04d48963f79259877b49cd9063aead3b7\",\n \"JTKVSB%%)wK0E.X)V>+}o?pNmC{O&4W4b!Ni{Lh6\"],\n/**\n * Thomas Hobbes' \"Leviathan\", Part I, Chapter VI:\n * (The \"classic\" Base85 example, also the second Wikipedia logo):\n *\n * \"Man is distinguished, not only by his reason, but by this singular passion from other animals, which is a lust of the mind, that by a perseverance of delight in the continued and indefatigable generation of knowledge, exceeds the short vehemence of any carnal pleasure\"\n *\n * The period at the end of the sentence has been omitted,\n * since keeping it requires padding the Hex string to align to 4-bytes.\n */\n [\"4d616e2069732064697374696e677569736865642c206e6f74206f6e6c792062792068697320726561736f6e2c2062757420627920746869732073696e67756c61722070617373696f6e2066726f6d206f7468657220616e696d616c732c2077686963682069732061206c757374206f6620746865206d696e642c20746861742062792061207065727365766572616e6365206f662064656c6967687420696e2074686520636f6e74696e75656420616e6420696e6465666174696761626c652067656e65726174696f6e206f66206b6e6f776c656467652c2065786365656473207468652073686f727420766568656d656e6365206f6620616e79206361726e616c20706c656173757265\",\n \"o<}]Zx(+zcx(!xgzFa9aB7/b}efF?GBrCHty