From: Matthew Vernon Date: Tue, 22 Jul 2014 13:36:52 +0000 (+0100) Subject: commit code to git X-Git-Url: https://git.uis.cam.ac.uk/x/uis/raven/abandoned/asp.git/commitdiff_plain/f560b0404562a567488ec85c06049dfdc8f613dc commit code to git --- f560b0404562a567488ec85c06049dfdc8f613dc diff --git a/Default.asp b/Default.asp new file mode 100644 index 0000000..6185f9a --- /dev/null +++ b/Default.asp @@ -0,0 +1,145 @@ + + + + + + +<% + +Sub Main + + ' Create 'Scripting.Dictionary' object + ' to hold the arguments we will supply + ' to the 'Ucam_Webauth' object. + + Set args = CreateObject("Scripting.Dictionary") + + ' Add the different arguments to the 'args' + ' associative array as name/value pairs. + ' Both name and value must be strings + ' so integers must be added as "x", eg. "60". + + ' 'auth_service' is the WLS authentication server. + ' The following line gives the the demo Raven testing server: + + ' args.Add "auth_service", "https://demo.raven.cam.ac.uk/auth/authenticate.html" + + ' We're testing with our Dummy Raven WLS server so use that: + ' args.Add "auth_service", "http://www2.careers.cam.ac.uk:11812" + + ' 'hostname' must be a domain name and perhaps a + ' port but nothing more. + + args.Add "hostname", "localhost:81" + + ' 'log_file' is the location of the logfile + ' which must be read/writable by the webserver. + + args.Add "log_file", "C:/wamp/www/raven_asp/logs/vbscriptlog.txt" + + ' 'key_dir' is the directory holding the + ' public key certificate. + + args.Add "key_dir", "C:/wamp/www/raven_asp/certificates" + + ' 'cookie_key' is the key used to generate + ' hash values of the authentication cookie. + ' Ideally it should be changed on a regular basis + ' but not during sessions. + + args.Add "cookie_key", "Random string" + + ' Create new instance of 'Ucam_Webauth' + ' and supply arguments. + ' We do not need to include 'Request' and 'Response' + ' variables (as in C# version), in order to get/set + ' cookies and server variables and perform redirects + ' as these variables are globally accessible to ASP class. + + Set oUcam_Webauth = New Ucam_Webauth + Call oUcam_Webauth(args) + + + ' For the purposes of testing, we provide + ' a 'Logout' link that removes the local + ' authentication cookie and then displays + ' a link to easily logout the Raven WLS. + ' So we check to see if this 'Action=Logout' + ' link has been called and logout/display + ' link accordingly. + + If (Request.ServerVariables("QUERY_STRING") = "Action=Logout") Then + oUcam_Webauth.ResetState() + Response.Write("Logged out of Raven (local)
") + Response.Write("Logout Raven (remote)
" & _ + "Access Raven authenticated page") + Exit Sub + End If + + ' When you first access this page + ' the 'Authenticate' function will be called. + ' This will typically be called three times + ' in total to successfully authenticate the + ' user. In the first two iterations of + ' 'Authenticate', it will return + ' 'AUTHENTICATE_INCOMPLETE' while it + ' redirects the user's browser first to + ' the Raven WLS and then back to this page. + ' On the third iteration of 'Authenticate', it + ' will return 'AUTHENTICATE_COMPLETE_AUTHENTICATED' + ' or 'AUTHENTICATE_COMPLETE_NOT_AUTHENTICATED' + ' if the authentication process has fully + ' completed without error. + + Select Case oUcam_Webauth.Authenticate() + + Case oUcam_Webauth.AUTHENTICATE_INCOMPLETE + + ' 'Authenticate' still redirecting pages + ' so don't do anything else. + + Exit Sub + + Case oUcam_Webauth.AUTHENTICATE_COMPLETE_AUTHENTICATED + + ' Success so display the 'principal', ie. the user id. + + Response.Write("SUCCESS. You are " & oUcam_Webauth.principal() & "
") + + ' Also display the 'ptags' parameter indicating + ' whether the user is 'current' or not. + + Response.Write("Ptags = " & oUcam_Webauth.ptags() & "
") + + ' Display any 'GET variables' to check they + ' have carried through from the original + ' page request. + + For Each item In Request.QueryString() + Response.Write item & "=" & Request.QueryString()(item) & "
" + Next + + ' Display a 'Logout' link to make it easy to + ' test authentication repeatedly. + + Response.Write("Logout Raven (local)") + + Case Else + + ' Either there was an error or a failed + ' authentication so print out the result either way. + + Response.Write("FAIL - " & oUcam_Webauth.status() & ": " & oUcam_Webauth.msg()) + + ' Also log the error for debugging purposes. + + oUcam_Webauth.write_log("FAIL - " & oUcam_Webauth.status() & ": " & oUcam_Webauth.msg()) + + End Select + +End Sub + +Call Main + +%> + diff --git a/LICENSE.txt b/LICENSE.txt new file mode 100644 index 0000000..20c2c4f --- /dev/null +++ b/LICENSE.txt @@ -0,0 +1,24 @@ +' This VBScript class implements a Raven v3 agent for the University of Cambridge +' Web Authentication System. +' +' See http://raven.cam.ac.uk/project/ for more details +' +' Loosely based on the PHP module for Raven +' https://wiki.cam.ac.uk/raven/PHP_library +' +' Copyright (c) 2004, 2005, 2008, 2014 University of Cambridge +' +' This module is free software; you can redistribute it and/or modify +' it under the terms of the GNU Lesser General Public License as +' published by the Free Software Foundation; either version 2.1 of the +' License, or (at your option) any later version. +' +' The module is distributed in the hope that it will be useful, but +' WITHOUT ANY WARRANTY; without even the implied warranty of +' MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +' Lesser General Public License for more details. +' +' You should have received a copy of the GNU Lesser General Public +' License along with this toolkit; if not, write to the Free Software +' Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 +' USA \ No newline at end of file diff --git a/README.md b/README.md new file mode 100644 index 0000000..f4b1ba3 --- /dev/null +++ b/README.md @@ -0,0 +1,395 @@ +University of Cambridge Classic ASP/VBScript Raven Authentication Module - v.1.0 (29/04/2014) +========================================================================== + +Description +----------- +The software comprises a VBScript class 'Ucam_Webauth' and sample files that +provide a Classic ASP/VBScript implementation of a 'Raven' authentication +module; Raven is the web authentication protocol used by the University of +Cambridge, UK. The logic and code of the 'Ucam_Webauth' class are loosely +based on the PHP Raven authentication class provided at +http://raven.cam.ac.uk/project/. +- For a full description of the latest Raven specification and an explanation +of how Raven works, go to http://raven.cam.ac.uk/project/. +- This software was originally created for the Careers Service, University +of Cambridge by sh801@cam.ac.uk + +Files and folders +----------------- +- [certificates]: Temporary location for Raven public key certificates. +- [js]: Folder containing Javascript cryptography libraries. +- [docs]: Supporting documentation. +- [logs]: Possible location for log files created by the module. +- Default.asp: A sample file showing how the 'Ucam_Webauth' class is used +to provide Raven authentication. +- Test.asp: A test file for unit testing the 'Ucam_Webauth' module using the +'Ucam_RavenWLS' dummy Raven server (separate project, not included). +- Ucam_Webauth.vbs: The main 'Ucam_Webauth' VBScript class. + +Platform requirements +--------------------- +This module has been tested on IIS7 with .NET Framework set to +'No managed code', ie. classic ASP. + +Installation +------------ +### Cryptographic functions +Cryptographic functions are provided by the Javascript libraries within the +'js' folder. These libraries are versions of the client-side Javascript +libraries provided at http://kjur.github.io/jsrsasign/index.html +but modified to run server-side. There is no need to install any +additional cryptography libraries. + +### Install Raven certificates +The authentication module uses the Raven public key certificate at +https://raven.cam.ac.uk/project/keys/ to verify authentication responses. +Download the certificate from https://raven.cam.ac.uk/project/keys/ and copy +to the 'certificates' folder provided with this authentication module +download - the 'certificates' folder is a temporary location for the +certificate while you get the module up and running. You will need to supply +the full path to the 'certificates' folder as either a 'key_dir' argument +to the 'Ucam_Webauth' constructor or by modifying the 'Ucam_Webauth' +variable 'DEFAULT_KEY_DIR' directly. + +Once you have everything working, move the 'certificates' folder +to a new location on your webserver that is not web- or publicly-accessible +and modify the 'key_dir' string accordingly. + +- NOTE: you may have to change the name of the key file from 'pubkey2.crt' +to '2.crt'. + +If you're using the Raven test server +(http://raven.cam.ac.uk/project/test-demo/) for testing purposes, make sure +you install the test server keys instead, but ensure you remove these keys +before using the authentication module in a production environment, as +recommended by the demo Raven server: +>> It is vital to keep these demo keys seperate from keys +>> used with a production service - failure to do so could +>> allow an attacker to successfully replay a response +>> from the demonstration server, which anyone can easily +>> obtain, against a production service. + + +Getting started +--------------- + +The 'Ucam_Webauth' VBScript class must be used within an ASP server-side page +as it interacts directly with a user's browser session. To use the +'Ucam_Webauth' VBScript class: + +- 1. Ensure the 'Ucam_Webauth.vbs' class file and the folder 'js' are in the +same directory as your ASP script. The folders 'certificates' and 'logs' may +also be located here temporarily. +- 2. Include the 'Ucam_Webauth.vbs' class file in the 'head' of your ASP file: + +``` + + + + + +``` + +- 3. Set up the initial arguments for the 'Ucam_Webauth' class: + +``` +Set args = CreateObject("Scripting.Dictionary") +args.Add "hostname", "localhost" +args.Add "auth_service", "https://demo.raven.cam.ac.uk/auth/authenticate.html" +args.Add "key_dir", "C:/Ucam_Webauth/certificates" +``` + +'args' is an associative array of *text* strings so parameter values must +be converted into strings, ie. numbers and booleans must be supplied within +quotes as in "23", "TRUE", "FALSE". +A full list of allowed parameters is provided at the end of this README. + +- 4. Create an instance of the 'Ucam_Webauth' class from within your ASP +server page and initialize with setup variables: + +``` +Set oUcam_Webauth = New Ucam_Webauth +Call oUcam_Webauth(args) +``` + +- 5. Call 'Authenticate()' on the Ucam_Webauth object and act according to +the value returned: + +``` + Select Case oUcam_Webauth.Authenticate() + + Case oUcam_Webauth.AUTHENTICATE_INCOMPLETE + + ... + Exit Sub + + Case oUcam_Webauth.AUTHENTICATE_COMPLETE_AUTHENTICATED + + ... + + Case oUcam_Webauth.AUTHENTICATE_COMPLETE_NOT_AUTHENTICATED + + ... + + Case oUcam_Webauth.AUTHENTICATE_COMPLETE_ERROR + + ... + + End Select +``` + +The four possible return values of 'Authenticate()' are: + +- AUTHENTICATE_INCOMPLETE : The authentication process has yet to complete. +The user may have been redirected to the Raven server and has yet to enter +their login details. +- AUTHENTICATE_COMPLETE_AUTHENTICATED : The authentication process completed +and the user has been successfully authenticated. +- AUTHENTICATE_COMPLETE_NOT_AUTHENTICATED : The authentication process +completed and the user was not successfully authenticated. +The user may have clicked 'Cancel' at the Raven server. +- AUTHENTICATE_COMPLETE_ERROR : There was an error during the authentication +process forcing the authentication cycle to terminate early. + +As the 'Authenticate()' function may need to send HTTP headers, it must be +called before any output (e.g. HTML, HTTP headers) is sent to the browser. + +The 'Default.asp' file provided is a sample of a simple server page using +the 'Ucam_Webauth' VBScript class. + +Overview of Raven process +------------------------- +A diagram of the Raven authentication process is located within the 'docs' +folder as [I - Overview of Raven Authentication Process.pdf]. + +The authentication cycle consists of the following key stages: + +#### User first tries to access authenticated page +User tries to load an authenticated page on a particular website. +The 'Ucam_Webauth' class is loaded and the 'Authenticate()' function is called. +If no authentication cookie is found to indicate the user is authenticated, +the user's browser is redirected to a separate Raven server using a special +'Authentication Request'. The authentication request consists of a series of +authentication parameters encoded into the URL redirect as name/value pairs. + +#### User is prompted for login information +The Raven server interprets the authentication request sent by the main +website and prompts the user for their username and password. The user may +then be successfully authenticated or may decide to click 'Cancel'. They are +redirected back to the main website with a series of 'Authentication Response' +parameters encoded into a 'WLS-Response' GET variable. + +#### User redirected back to main webserver +The user's original page is loaded again and 'Authenticate()' is called a +second time. 'Ucam_Webauth' processes the new 'WLS-Response' GET value and, +if it's valid, sets an authentication cookie on the user's browser. The +user's original page is then loaded again. + +#### User redirected back to main webserver again +With an authentication cookie now set, 'Authenticate()' checks the status +code contained in the value of the authentication cookie and returns either +'AUTHENTICATE_COMPLETE_AUTHENTICATED' or +'AUTHENTICATE_COMPLETE_NOT_AUTHENTICATED'. If +'AUTHENTICATE_COMPLETE_AUTHENTICATED' is returned , the original page can +go on to display authenticated content to the user. + +Specifics of module +------------------- +The 'Authenticate()' function is the overarching authentication function of +'Ucam_Webauth'. It performs some basic sanity checks using 'CheckSetup()' +then uses 'GetCurrentState()' to establish the current state of the +authentication process before branching accordingly. The possible return +values of 'GetCurrentState()' are: + +#### STATE_NEW_AUTHENTICATION +A completely fresh authentication. 'SendAuthenticationRequest()' [*1*] is +then triggered which performs some basic data checks, sets the authentication +cookie to 'AUTHENTICATIONCOOKIE_REDIRECT_WLS' (to record where we are in the +authentication process) and redirects the user's browser to the Raven +authentication server with a series of authentication parameters +encoded as name/value pairs. + +#### STATE_WLS_RESPONSE_RECEIVED +The Raven authentication server has processed the user and has returned the +user's browser back to the original website with a series of authentication +response parameters encoded into the 'WLS-Response' GET variable. +'ProcessAuthenticationResponse()' [*2*] is then called which checks the +validity of the 'WLS-Response' value, sets an authentication cookie and +redirects the user back to the original page. + +#### STATE_WAA_AUTHENTICATIONCOOKIE_SET +A valid authentication cookie has been set +(<> AUTHENTICATIONCOOKIE_REDIRECT_WLS). +'ProcessAuthenticationCookie()' [*3*] is then called which checks the +validity of the cookie. If the cookie has expired, +'SendAuthenticationRequest()' is called again in case the user needs to +reauthenticate themselves. If the cookie is still valid, an +'AUTHENTICATE_COMPLETE_XXX' value is returned, indicating that the +authentication cycle has completed successfully. +NOTE: this may be true if the user has cancelled the authentication process, +in which case 'AUTHENTICATE_COMPLETE_NOT_AUTHENTICATED' will be returned. + +#### STATE_ERROR +An error occurred, breaking the authentication cycle and returning +AUTHENTICATE_COMPLETE_ERROR to 'Authenticate()'. This return value will +also be generated by the other functions above if they generate an error. + +## Accompanying diagrams +Detailed diagrams of the Raven process flow for (i) a successful +authentication (ii) a cancelled authentication, are located in the 'docs' +folder as [II - Ucam_Webauth - Flowchart for Valid Authentication.pdf] and +[III - Ucam_Webauth - Flowchart for Cancelled Authentication.pdf], respectively. + +The numbers on these diagrams correspond to the three key secondary functions +described above: +- *1*. SendAuthenticationRequest() +- *2*. ProcessAuthenticationResponse() +- *3*. ProcessAuthenticationCookie() + +Other important functions include: + +### ResetState() +Attempts to reset state as if a new user has just loaded a fresh browser +window. This is typically used when a user has experienced an error and we +want to give them a fresh opportunity to try again. + +### check_signature(...) +Checks the signature provided by the Raven server, when it signed the +'WLS-Response' variable, is a valid signature for the data. This ensures the +data has not been tampered with. + +### hmac_sha1(...) +Creates a hash value for signing the local authentication cookie. + +### wls_encode/decode(...) +Encoding/decoding functions to allow base64 signatures to be sent within URLs. + +Possible arguments to 'Ucam_Webauth' +------------------------------------ +(Based on documentation for PHP Raven authentication module) + +- log_file : +The location for a log file that will record progress and track possible +errors. The folder containing the file must be read/writable by the webserver. +Default: log.txt + +- response_timeout : +Responses from the central authentication server are time-stamped. +This parameter sets the period of time in seconds during which these +responses are considered valid. +Default: 30 seconds. + +- key_dir : +The name of the directory containing the public key certificate(s) required +to validate the authentication responses sent by the server. +Default: '/etc/httpd/conf/webauth_keys'. + +- max_session_life : +The maximum period of time in seconds for which an established session will +be valid. This may be overriden if the authentication reply contains a +shorter 'life' parameter. Note that this does NOT define an expiry time for +the session cookie. Session cookies are always set without an expiry time, +causing them to expire when the browser session finishes. +Default: 7200 (2 hours). + +- timeout_message : +A re-authentication by the authentication service will be triggered when an +established session expires. This option sets a text string which is sent to +the authentication server to explain to the user why they are being asked to +authenticate again. HTML markup is suppressed as for the description +parameter described below. +Default: 'your login to the site has expired'. + +- hostname (required) : +The fully-qualified TCP/IP hostname that should be used in request URLs +referencing the Ucam_Webauth-enabled application. This *must* be set, as it +is needed for multiple reasons - primarily security but also to avoid varying +hostnames in URLs leading to failed or inconsistent authentication. +No default. + +- cookie_key (required): +A random key used to protect session cookies from tampering. Any reasonably +unpredictable string (for example the MD5 checksum of a rapidly changing +logfile) will be satisfactory. This key must be the same for all uses of the +web authentication system that will receive the same session cookies (see the +cookie_name, cookie_path and cookie_domain parameters below). +No default. + +- cookie_name : +The name used for the session cookie. +When used for access to resources over HTTPS the string '-S' is appended to +this name. +Default: 'Ucam-Webauth-Session'. + +- cookie_path : +The 'Path' attribute for the session cookie. The default is the directory +component of the path to the script currently being executed. This should +result in the cookie being returned for future requests for this script and +for the other resources in the same 'directory'; see the important +information about the cookie_key parameter above. +Default: '/'. + +- cookie_domain : +The 'Domain' attribute for the session cookie. By default the 'Domain' +attribute is omitted when setting the cookie. This should result in the +cookie being returned only to the server running the script. Be aware that +some people may treat with suspicion cookies with domain attributes that are +wider than the host setting the cookie. +No default. + +- auth_service : The full URL for the web login service to be used. +Default: 'https://raven.cam.ac.uk/auth/authenticate.html' + +#### Authentication request properties +The following setup parameters prefixed with 'authrequest_' relate to +properties that will be sent to the authentication server as part of an +authentication request: + +- authrequest_desc : A text description of the resource that is requesting +authentication. This may be displayed to the user by the authentication +service. It is restricted to printable ASCII characters (0x20 - 0x7e) though +it may contain HTML entities representing other characters. The characters +'<' and '>' will be converted into HTML entities before being sent to the +browser and so this text cannot usefully contain HTML markup. +No default. + +- authrequest_params : Data that will be returned unaltered to the WAA in +any 'authentication response message' issued as a result of this request. +This could be used to carry the identity of the resource originally requested +or other WAA state, or to associate authentication requests with their +eventual replies. When returned, this data will be protected by the digital +signature applied to the authentication response message but nothing else is +done to ensure the integrity or confidentiality of this data - the WAA MUST +take responsibility for this if necessary. +No default. + +- authrequest_skew : Interpretation of response_timeout is difficult if the +clocks on the server running the PHP agent and on the authentication server +are out of step. Both servers should use NTP to synchronize their clocks, +but if they don't then this parameter should be set to an estimate of the +maximum expected difference between them (in seconds). +Default: 0. + +- authrequest_fail : +If TRUE, sets the fail parameter in any authentication request sent to the +authentication server to 'yes'. This has the effect of requiring the +authentication server itself to report any errors that it encounters, rather +than returning an error indication. Note however that even with this parameter +set errors may be detected by this module that will result in authentication +failing here. +Default: FALSE. + +- authrequest_iact : +If TRUE, then the 'iact' parameter provided to the authentication server is +set to 'yes'. If FALSE, then the 'iact' parameter is set to 'no'. If no value +is provided for 'authrequest_iact', the 'iact' parameter is left blank. +The value 'yes' for 'iact' requires that a re-authentication exchange takes +place with the user. This could be used prior to a sensitive transaction in +an attempt to ensure that a previously authenticated user is still present +at the browser. The value 'no' requires that the authentication request will +only succeed if the user's identity can be returned without interacting with +the user. This could be used as an optimisation to take advantage of any +existing authentication but without actively soliciting one. If omitted or +empty, then a previously established identity may be returned if the WLS +supports doing so, and if not then the user will be prompted as necessary. +Default: omitted. \ No newline at end of file diff --git a/Test.asp b/Test.asp new file mode 100644 index 0000000..cfb68e9 --- /dev/null +++ b/Test.asp @@ -0,0 +1,219 @@ + + + + + + +<% + +Sub Main + + ' Examine the 'UcamWebAuthTestingClient' cookie. + ' This cookie is used to store the index number of + ' the LAST test and the outcome of that test. This + ' cookie is only updated when an authentication + ' cycle is complete (which could be due to an + ' error) so we use the cookie to determine the + ' index of the CURRENT test. + ' + ' NOTE: This cookie is completely separate + ' from the 'Authentication cookie' and is + ' purely used for testing. + ' + ' The actual value of the cookie consists of + ' three elements delimited by '!': + ' + ' 'index!status_code!status_message' + + testing_client_cookie_name = "UcamWebAuthTestingClient" + testing_client_cookie_index = 1 + + If (Request.Cookies(testing_client_cookie_name) <> "") Then + testing_client_cookie_value = Request.Cookies(testing_client_cookie_name) + testing_client_cookie_array = Split(testing_client_cookie_value, "!") + testing_client_cookie_index = CInt(testing_client_cookie_array(0)) + testing_client_cookie_index = testing_client_cookie_index + 1 + End If + + ' Create 'Scripting.Dictionary' object + ' to hold the arguments we will supply + ' to the 'Ucam_Webauth' object. + + Set args = CreateObject("Scripting.Dictionary") + + ' Add the different arguments to the 'args' + ' associative array as name/value pairs. + ' Both name and value must be strings + ' so integers must be added as "x", eg. "60". + + ' 'auth_service' is the WLS authentication server. + ' The following line gives the the demo Raven testing server: + + ' args.Add "auth_service", "https://demo.raven.cam.ac.uk/auth/authenticate.html" + + ' We're testing with our Dummy Raven WLS server so use that: + args.Add "auth_service", "http://www2.careers.cam.ac.uk:11812" + + ' 'hostname' must be a domain name and perhaps a + ' port but nothing more. + + args.Add "hostname", "localhost:81" + + ' 'log_file' is the location of the logfile + ' which must be read/writable by the webserver. + + args.Add "log_file", "C:/wamp/www/raven/vbscriptlog.txt" + + ' 'key_dir' is the directory holding the + ' public key certificate. + + args.Add "key_dir", "C:/wamp/www/raven" + + ' 'cookie_key' is the key used to generate + ' hash values of the authentication cookie. + ' Ideally it should be changed on a regular basis + ' but not during sessions. + + args.Add "cookie_key", "Random string" + + ' We add the current iteration of testing in + ' 'testing_client_cookie_index' as a parameter + ' to Ucam_Webauth which should then be + ' included as a parameter in the authentication + ' request to the WLS and the subsequent + ' authentication response back from the WLS. + + args.Add "authrequest_params", CStr(testing_client_cookie_index) + + + ' Create new instance of 'Ucam_Webauth' + ' and supply arguments. + ' We do not need to include 'Request' and 'Response' + ' variables (as in C# version), in order to get/set + ' cookies and server variables and perform redirects + ' as these variables are globally accessible to ASP class. + + Set oUcam_Webauth = New Ucam_Webauth + Call oUcam_Webauth(args) + + ' For the purposes of testing, we provide + ' a 'Logout' link that removes the local + ' authentication cookie and then displays + ' a link to easily logout the Raven WLS. + ' So we check to see if this 'Action=Logout' + ' link has been called and logout/display + ' link accordingly. + + If (Request.ServerVariables("QUERY_STRING") = "Action=Logout") Then + oUcam_Webauth.ResetState() + Response.Write("Logged out of Raven (local)
") + Response.Write("Logout Raven (remote)
" & _ + "Access Raven authenticated page") + Exit Sub + End If + + ' When you first access this page + ' the 'Authenticate' function will be called. + ' This will typically be called three times + ' in total to successfully authenticate the + ' user. In the first two iterations of + ' 'Authenticate', it will return + ' 'AUTHENTICATE_INCOMPLETE' while it + ' redirects the user's browser first to + ' the Raven WLS and then back to this page. + ' On the third iteration of 'Authenticate', it + ' will return 'AUTHENTICATE_COMPLETE_AUTHENTICATED' + ' or 'AUTHENTICATE_COMPLETE_NOT_AUTHENTICATED' + ' if the authentication process has fully + ' completed without error. + + Select Case oUcam_Webauth.Authenticate() + + Case oUcam_Webauth.AUTHENTICATE_INCOMPLETE + + ' 'Authenticate' still redirecting pages + ' so don't do anything else. + + Exit Sub + + Case oUcam_Webauth.AUTHENTICATE_COMPLETE_AUTHENTICATED + + ' Success so display the 'principal', ie. the user id. + + Response.Write("SUCCESS. You are " & oUcam_Webauth.principal() & "
") + + ' Also display the 'ptags' parameter indicating + ' whether the user is 'current' or not. + + Response.Write("Ptags = " & oUcam_Webauth.ptags() & "
") + + ' Display any 'GET variables' to check they + ' have carried through from the original + ' page request. + + For Each item In Request.QueryString() + Response.Write item & "=" & Request.QueryString()(item) & "
" + Next + + ' Display a 'Logout' link to make it easy to + ' test authentication repeatedly. + + Response.Write("Logout Raven (local)") + + Case Else + + ' Either there was an error or a failed + ' authentication so print out the result either way. + + Response.Write("FAIL - " & oUcam_Webauth.status() & ": " & oUcam_Webauth.msg()) + + ' Also log the error for debugging purposes. + + oUcam_Webauth.write_log("FAIL - " & oUcam_Webauth.status() & ": " & oUcam_Webauth.msg()) + + End Select + + ' We use a 'UcamWebAuthTestingClient' cookie + ' to store the return 'status' of the most recent + ' authentication attempt. The Dummy WLS server + ' looks at the value of this cookie, compares + ' it with its most recent attempt to generate a + ' particular status and logs the results. + ' Ideally the status/error the Dummy WLS server + ' tried to generate should match the status/error + ' recorded here. + ' + ' NOTE: The Dummy WLS server only performs the + ' comparison of 'actual' and 'expected' when + ' it receives a subsequent authentication request. + ' ie. when testing is terminated, the final + ' authentication attempt comparison may be lost. + + ' Store number of testing iteration, return status and status msg. + ' To make it a session cookie, we don't specify 'Expires'. + + Response.Cookies("UcamWebAuthTestingClient") = CStr(testing_client_cookie_index) & "!" & oUcam_Webauth.status() & "!" & oUcam_Webauth.msg() + + ' We intend to perform another authentication attempt + ' so reset the state of Ucam_Webauth, ie. remove + ' the authentication cookie. + + oUcam_Webauth.ResetState() + + +End Sub + +Call Main + +%> + + + + diff --git a/Ucam_Webauth.vbs b/Ucam_Webauth.vbs new file mode 100644 index 0000000..d80fbe8 --- /dev/null +++ b/Ucam_Webauth.vbs @@ -0,0 +1,1930 @@ +<% + +' This VBScript class implements a Raven v3 agent for the University of Cambridge +' Web Authentication System. +' +' See http://raven.cam.ac.uk/project/ for more details +' +' Loosely based on the PHP module for Raven +' https://wiki.cam.ac.uk/raven/PHP_library +' +' Copyright (c) 2004, 2005, 2008, 2014 University of Cambridge +' +' This module is free software; you can redistribute it and/or modify +' it under the terms of the GNU Lesser General Public License as +' published by the Free Software Foundation; either version 2.1 of the +' License, or (at your option) any later version. +' +' The module is distributed in the hope that it will be useful, but +' WITHOUT ANY WARRANTY; without even the implied warranty of +' MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +' Lesser General Public License for more details. +' +' You should have received a copy of the GNU Lesser General Public +' License along with this toolkit; if not, write to the Free Software +' Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 +' USA +' +' $Id: ucam_webauth.vbs, v1.0 2014/04/05 08:13:00 sh801 +' +' Version 1.0 + + +Class Ucam_Webauth + + ' **************************************** + ' + ' ---------------------------------------- + ' ---------- class Ucam_Webauth ---------- + ' ---------------------------------------- + ' + ' **************************************** + ' + ' Methods are listed in order of importance + ' with MAIN functions at top and lower- + ' level functions towards the end. + ' + ' **************************************** + + + ' 'status_codes' is associative array of status codes of the form {"CODE" => "Description", ..} + + Private status_codes + + ' **************************************** + ' Default values for key parameters + ' **************************************** + + Private PROTOCOL_VERSION + Private AUTHENTICATION_RESPONSE_VERSION + Private DEFAULT_AUTH_SERVICE + Private DEFAULT_KEY_DIR + Private DEFAULT_COOKIE_NAME + Private DEFAULT_TIMEOUT_MESSAGE + Private DEFAULT_HOSTNAME + Private WLS_LOGOUT + Private DEFAULT_LOG_FILE + Private AUTHENTICATIONCOOKIE_REDIRECT_WLS + + ' **************************************** + ' Constants for tracking state + ' **************************************** + ' + ' The 'Authenticate' function is called multiple + ' times for a successful authentication so we + ' need to track where we are in the authentication + ' process with some constants. + + Private STATE_ERROR + Private STATE_NEW_AUTHENTICATION + Private STATE_WLS_RESPONSE_RECEIVED + private STATE_WAA_AUTHENTICATIONCOOKIE_SET + + ' **************************************** + ' Constants for returning state + ' **************************************** + ' + ' The 'Authenticate' function needs to + ' return relevant information as to where + ' it currently is in the authentication process. + + Public AUTHENTICATE_INCOMPLETE + Public AUTHENTICATE_COMPLETE_ERROR + Public AUTHENTICATE_COMPLETE_AUTHENTICATED + Public AUTHENTICATE_COMPLETE_NOT_AUTHENTICATED + + ' **************************************** + ' Index numbers for the 'Authentication response' fields + ' **************************************** + ' + ' See Raven specification documentation for descriptions of each parameter + + Private AUTHENTICATION_RESPONSE_VER + Private AUTHENTICATION_RESPONSE_STATUS + Private AUTHENTICATION_RESPONSE_MSG + Private AUTHENTICATION_RESPONSE_ISSUE + Private AUTHENTICATION_RESPONSE_EXPIRE + Private AUTHENTICATION_RESPONSE_ID + Private AUTHENTICATION_RESPONSE_PRINCIPAL + Private AUTHENTICATION_RESPONSE_PTAGS + Private AUTHENTICATION_RESPONSE_AUTH + Private AUTHENTICATION_RESPONSE_SSO + Private AUTHENTICATION_RESPONSE_PARAMS + Private AUTHENTICATION_RESPONSE_SIG + Private AUTHENTICATION_RESPONSE_SIZE ' Size of required array + + Private WLS_RESPONSE_VER + Private WLS_RESPONSE_STATUS + Private WLS_RESPONSE_MSG + Private WLS_RESPONSE_ISSUE + Private WLS_RESPONSE_ID + Private WLS_RESPONSE_URL + Private WLS_RESPONSE_PRINCIPAL + Private WLS_RESPONSE_PTAGS + Private WLS_RESPONSE_AUTH + Private WLS_RESPONSE_SSO + Private WLS_RESPONSE_LIFE + Private WLS_RESPONSE_PARAMS + Private WLS_RESPONSE_KID + Private WLS_RESPONSE_SIG + Private WLS_RESPONSE_SIZE ' Size of required array + + ' **************************************** + ' General private member variables + ' **************************************** + + Private m_response_timeout + Private m_authrequest_skew + Private m_max_session_life + Private m_redirected + Private m_use_authrequest_iact + Private m_authrequest_iact + Private m_authrequest_fail + Private m_authrequest_desc + Private m_authrequest_aauth + Private m_authrequest_params + Private m_authentication_response_string + Private m_authentication_cookie + Private m_auth_service + Private m_hostname + Private m_key_dir + Private m_timeout_message + Private m_cookie_key + Private m_cookie_path + Private m_cookie_name + Private m_cookie_domain + Private m_log_file + Private m_authentication_response + + ' **************************************** + ' + ' ---------------------------------------- + ' ----------- MAIN FUNCTIONS ------------- + ' ---------------------------------------- + ' + ' **************************************** + + Private Sub Class_Initialize + + ' Initialize all constants as it's not possible + ' to declare initial values in class definition, above. + + PROTOCOL_VERSION = "3" + AUTHENTICATION_RESPONSE_VERSION = "3" + DEFAULT_AUTH_SERVICE = "https://raven.cam.ac.uk/auth/authenticate.html" + DEFAULT_KEY_DIR = "/etc/httpd/conf/webauth_keys" + DEFAULT_COOKIE_NAME = "Ucam-WebAuth-Session" + DEFAULT_TIMEOUT_MESSAGE = "your logon to the site has expired" + DEFAULT_HOSTNAME = "" ' must be supplied explicitly + WLS_LOGOUT = "Not-authenticated" + DEFAULT_LOG_FILE = "log.txt" + AUTHENTICATIONCOOKIE_REDIRECT_WLS = "REDIRECT_WLS" + + STATE_ERROR = -1 + STATE_NEW_AUTHENTICATION = 0 + STATE_WLS_RESPONSE_RECEIVED = 1 + STATE_WAA_AUTHENTICATIONCOOKIE_SET = 2 + + AUTHENTICATE_INCOMPLETE = 0 + AUTHENTICATE_COMPLETE_ERROR = -1 + AUTHENTICATE_COMPLETE_AUTHENTICATED = 1 + AUTHENTICATE_COMPLETE_NOT_AUTHENTICATED = 2 + + AUTHENTICATION_RESPONSE_VER = 0 + AUTHENTICATION_RESPONSE_STATUS = 1 + AUTHENTICATION_RESPONSE_MSG = 2 + AUTHENTICATION_RESPONSE_ISSUE = 3 + AUTHENTICATION_RESPONSE_EXPIRE = 4 + AUTHENTICATION_RESPONSE_ID = 5 + AUTHENTICATION_RESPONSE_PRINCIPAL = 6 + AUTHENTICATION_RESPONSE_PTAGS = 7 + AUTHENTICATION_RESPONSE_AUTH = 8 + AUTHENTICATION_RESPONSE_SSO = 9 + AUTHENTICATION_RESPONSE_PARAMS = 10 + AUTHENTICATION_RESPONSE_SIG = 11 + AUTHENTICATION_RESPONSE_SIZE = 12 ' Size of required array + + WLS_RESPONSE_VER = 0 + WLS_RESPONSE_STATUS = 1 + WLS_RESPONSE_MSG = 2 + WLS_RESPONSE_ISSUE = 3 + WLS_RESPONSE_ID = 4 + WLS_RESPONSE_URL = 5 + WLS_RESPONSE_PRINCIPAL = 6 + WLS_RESPONSE_PTAGS = 7 + WLS_RESPONSE_AUTH = 8 + WLS_RESPONSE_SSO = 9 + WLS_RESPONSE_LIFE = 10 + WLS_RESPONSE_PARAMS = 11 + WLS_RESPONSE_KID = 12 + WLS_RESPONSE_SIG = 13 + WLS_RESPONSE_SIZE = 14 ' Size of required array + + ' Set up 'status_codes' associative array + ' See Raven specification documentation for descriptions of each parameter + + Set status_codes = CreateObject("Scripting.Dictionary") + + status_codes.Add "200", "Successful authentication" + status_codes.Add "410", "The user cancelled the authentication request" + status_codes.Add "510", "No mutually acceptable authentication types available" + status_codes.Add "520", "Unsupported protocol version" + status_codes.Add "530", "General request parameter error" + status_codes.Add "540", "Interaction would be required" + status_codes.Add "560", "WAA not authorised" + status_codes.Add "570", "Authentication declined" + + ' Set up array for holding authentication response parameters + + ReDim m_authentication_response(AUTHENTICATION_RESPONSE_SIZE) + + End Sub + + + Public Default Function Construct(ByVal args) + + ' **************************************** + ' Constructor for Ucam_Webauth + ' + ' We split the constructor that takes + ' parameters from the initializer as + ' VBScript doesn't allow initializers + ' to take parameters. + ' + ' Arguments + ' ================ + ' args: An associative array of arguments as name,value pairs, eg. {"auth_service" => "http://..", "hostname" => "www...", "log_file" => }. + ' + ' To supply arguments: + ' Set args = CreateObject("Scripting.Dictionary") + ' args.Add auth_service", "https://..." + ' args.Add hostname", "www..." + ' args.Add log_file", "C:/logfile.txt" + ' args.Add key_dir", "C:/raven" + ' args.Add cookie_key", "Random string" + ' + ' **************************************** + + + ' Set up default values + + log_file = DEFAULT_LOG_FILE + response_timeout = 30 + key_dir = DEFAULT_KEY_DIR + max_session_life = 2 * 60 * 60 + timeout_message = DEFAULT_TIMEOUT_MESSAGE + hostname = DEFAULT_HOSTNAME + cookie_name = DEFAULT_COOKIE_NAME + cookie_path = "" ' *** SHOULD BE PATH RELATIVE PATH TO SCRIPT BY DEFAULT *** + cookie_domain = "" + auth_service = DEFAULT_AUTH_SERVICE + authrequest_skew = 5 + authrequest_fail = False + authrequest_iact = False + use_authrequest_iact = False + + ' If specific arguments are provided, then override default values + + If (args.Exists("log_file")) Then log_file = args("log_file") + If (args.Exists("response_timeout")) Then response_timeout = Int(args("response_timeout")) + If (args.Exists("key_dir")) Then key_dir = args("key_dir") + If (args.Exists("max_session_life")) Then max_session_life = Int(args("max_session_life")) + If (args.Exists("timeout_message")) Then timeout_message = args("timeout_message") + If (args.Exists("hostname")) Then hostname = args("hostname") + If (args.Exists("cookie_key")) Then cookie_key = args("cookie_key") + If (args.Exists("cookie_name")) Then cookie_name = args("cookie_name") + If (args.Exists("cookie_path")) Then cookie_path = args("cookie_path") + If (args.Exists("cookie_domain")) Then cookie_domain = args("cookie_domain") + If (args.Exists("auth_service")) Then auth_service = args("auth_service") + If (args.Exists("authrequest_desc")) Then authrequest_desc = args("authrequest_desc") + If (args.Exists("authrequest_params")) Then authrequest_params = args("authrequest_params") + If (args.Exists("authrequest_skew")) Then authrequest_skew = Int(args("authrequest_skew")) + If (args.Exists("authrequest_fail")) Then authrequest_fail = CBool(args("authrequest_fail")) + If (args.Exists("authrequest_iact")) Then + authrequest_iact = CBool(args("authrequest_iact")) + use_authrequest_iact = True + End If + + End Function + + ' **************************************** + ' + ' ---------------------------------------- + ' -- PRIMARY FUNCTION - Authenticate() --- + ' ---------------------------------------- + ' + ' **************************************** + + Public Function Authenticate() + + ' **************************************** + ' Authenticate() + ' + ' This function is called three times in + ' order to complete the authentication process. + ' + ' STEP 1: A fresh user requests an Authenticated + ' resource with the URL 'X'. 'Authenticate' + ' redirects the user's browser to a Web Login + ' Service (WLS) via 'SendAuthenticationRequest()'. + ' + ' STEP 2: The WLS processes the user's user id + ' and password and then redirects the user's + ' browser back to the client's Web Application + ' Agent (WAA) with a specific set of parameters + ' in a 'WLS-Response' GET variable. + ' 'Authenticate' is called again and validates + ' these values using 'ProcessAuthenticationRequest()'. + ' If they all check out, it creates a + ' local authentication cookie on the user's + ' browser and redirects the user's browser + ' back to the original URL 'X'. + ' + ' STEP 3: We return to our original page, except + ' this time we have a local authentication cookie + ' set. 'Authenticate' calls + ' 'ProcessAuthenticationCookie' which checks + ' this cookie is valid and if the status code + ' of the cookie is '200', the user was successfully + ' verified at the WLS - + ' 'AUTHENTICATE_COMPLETE_AUTHENTICATED' is then + ' returned to the user. + ' + ' **************************************** + + + ' First off, perform a sanity check on basic variables + + If (CheckSetup() = False) Then + ResetState() + Authenticate = AUTHENTICATE_COMPLETE_ERROR + Exit Function + End If + + ' Now work out where we are in the authentication process: + ' + ' STATE_NEW_AUTHENTICATION + ' A completely fresh authentication attempt. + ' + ' STATE_WLS_RESPONSE_RECEIVED + ' The user has already been redirected to the WLS, which has + ' then redirected them back here. They may have successfully + ' authenticated or simply pressed cancel. As long as it's a + ' valid, signed WLS-Response - regardless of whether it's a + ' successful authentication or not - we set a new + ' authentication cookie which indicates to the code + ' that the user has been processed by the WLS. + ' + ' STATE_WAA_AUTHENTICATIONCOOKIE_SET + ' We have a valid authentication cookie and just need to + ' check what the status of that is. The user may have + ' successfully authenticated, the authentication token + ' may have expired, or the user may have skipped out + ' the authentication process. In the event of expiration, + ' 'ProcessAuthenticationCookie' redirects the user back + ' to the WLS. + ' + ' STATE_ERROR + ' There was an error somewhere along the way. + ' If this happens, it's not a simple case of + ' an invalid authentication but something more serious + ' that falls outside the expected process flow. + + state = GetCurrentState() + + Select Case state + + Case STATE_NEW_AUTHENTICATION + + Authenticate = SendAuthenticationRequest("") + Exit Function + + Case STATE_WLS_RESPONSE_RECEIVED + + Authenticate = ProcessAuthenticationResponse() + Exit Function + + Case STATE_WAA_AUTHENTICATIONCOOKIE_SET + + Authenticate = ProcessAuthenticationCookie() + Exit Function + + Case Else ' This includes the case STATE_ERROR + + write_log("STATE_ERROR received: " & status() & ": " & msg()) + ResetState() + Authenticate = AUTHENTICATE_COMPLETE_ERROR + Exit Function + + End Select + + End Function + + + ' **************************************** + ' + ' ---------------------------------------- + ' ---- SECONDARY FUNCTIONS TRIGGERED ----- + ' ------- FROM 'Authenticate()' ---------- + ' ---------------------------------------- + ' + ' 1. SendAuthenticationRequest() + ' 2. ProcessAuthenticationResponse() + ' 3. ProcessAuthenticationCookie() + ' + ' **************************************** + + Public Function SendAuthenticationRequest(msg) + + ' **************************************** + ' 1. SendAuthenticationRequest() + ' + ' Send an authentication request from the WAA to the WLS. + ' + ' **************************************** + + + ' Write a long line of astericks to make log easier to read. + + write_log("****************************************************************") + write_log("SendAuthenticationRequest: Starting...") + + ' If the hostname from the request (Host: header) does not match the + ' server's preferred name for itself (which should be what's configured + ' as hostname), cookies are likely to break "randomly" (or more + ' accurately, the cookie may not be sent by the browser since it"s for + ' a different hostname) as a result of following links that use the + ' preferred name, or server-level redirects e.g. to fix "directory" + ' URLs lacking the trailing "/". Attempt to avoid that by redirecting + ' to an equivalent URL using the configured hostname. + + http_host = Request.ServerVariables("HTTP_HOST") + + If ((http_host <> "") And (LCase(hostname) <> LCase(http_host))) Then + write_log("SendAuthenticationRequest: Redirect to tidy up hostname mismatch") + Redirect(url()) + SendAuthenticationRequest = AUTHENTICATE_INCOMPLETE + Exit Function + End If + + ' We set the authentication cookie to 'AUTHENTICATIONCOOKIE_REDIRECT_WLS' + ' to keep a track of state. + + write_log("SendAuthenticationRequest: Setting pre-session cookie") + + authentication_cookie = AUTHENTICATIONCOOKIE_REDIRECT_WLS + + ' Build the full 'Authentication Request' URL that will + ' redirect the user to the WLS. + ' + ' Full information about each of these parameters can be + ' found in Raven v3 documentation. + + wls_redirect = auth_service + wls_redirect = wls_redirect & "?ver=" & PROTOCOL_VERSION + wls_redirect = wls_redirect & "&url=" & Server.URLEncode(url()) + + If (authrequest_desc <> "") Then wls_redirect = wls_redirect & "&desc=" & Server.URLEncode(authrequest_desc) + If (authrequest_aauth <> "") Then wls_redirect = wls_redirect & "&aauth=" & Server.URLEncode(authrequest_aauth) + + If use_authrequest_iact Then + If authrequest_iact Then + wls_redirect = wls_redirect & "&iact=yes" + Else + wls_redirect = wls_redirect & "&iact=no" + End If + End If + + If (msg <> "") Then wls_redirect = wls_redirect & "&msg=" & Server.URLEncode(msg) + if (authrequest_params <> "") Then wls_redirect = wls_redirect & "¶ms=" & Server.URLEncode(authrequest_params) + + wls_redirect = wls_redirect & "&date=" & Server.URLEncode(time2iso(DateDiff("s", "01/01/1970 00:00:00", UTCNow()))) + + ' If (clock_skew <> 0) THen wls_redirect = wls_redirect & "&skew=" & Server.URLEncode(Convert.ToString(clock_skew)) ' 'skew' parameter deprecated in v3 + + If (authrequest_fail = True) Then wls_redirect = wls_redirect & "&fail=yes" + + write_log("SendAuthenticationRequest: Redirecting to WLS with URL=" & wls_redirect) + + Redirect(wls_redirect) + + SendAuthenticationRequest = AUTHENTICATE_INCOMPLETE + + End Function + + + Public Function ProcessAuthenticationResponse() + + ' **************************************** + ' 2. ProcessAuthenticationResponse() + ' + ' Process the authentication response received from the WLS. + ' + ' **************************************** + + write_log("ProcessAuthenticationResponse: Starting...") + write_log("ProcessAuthenticationResponse: WLS response=" & authentication_response_string) + + wls_response = Split(authentication_response_string, "!") + + set_status "200", "" + + + If (UBound(wls_response) < 1) Then + + ' Response is too short to have been signed or have a status. + + set_status "620", "WLS response has too few parameters" + ResetState() + ProcessAuthenticationResponse = AUTHENTICATE_COMPLETE_ERROR + Exit Function + + End If + + ' We only check signature if status = "200". + + If (wls_response(WLS_RESPONSE_STATUS) = "200") Then + + ' Get signature and key_id off the end of the wls_response array + ' and collapse the remaining array into a string. + ' It's this string that will have been signed by the WLS + ' and whose signature we then verify using the WLS + ' public certificate on our server. + + signature = wls_response(UBound(wls_response)) + key_id = wls_response(UBound(wls_response) - 1) + Redim Preserve wls_response (UBound(wls_response) - 2) + wls_response_signedstring = Join(wls_response, "!") + + ' write_log("Signature=" & signature) + ' write_log("Signed string=" & wls_response_signedstring) + + If (check_signature(wls_response_signedstring, signature, key_id) = False) Then + + ' Signature is not correct for the wls_response + + set_status "606", "Invalid WLS wls_response signature" + ResetState() + ProcessAuthenticationResponse = AUTHENTICATE_COMPLETE_ERROR + Exit Function + + End If + + write_log("ProcessAuthenticationResponse: Signature is correct.") + + End If + + + ' Expand 'wls_response' array to maximum size just in case it's too small + ' and subsequent calls to wls_response(WLS_RESPONSE_XXX) raise 'IndexOutOfRangeException' + + Redim Preserve wls_response (WLS_RESPONSE_SIZE) + + + ' Remove the query part of our current url + ' and the url provided by the WLS and check + ' they match. + + Set rgx = New RegExp + rgx.Global = True + rgx.IgnoreCase = False + rgx.Pattern = "\?.*$" + this_url = rgx.Replace(url(), "") + + If (wls_response(WLS_RESPONSE_URL) = "") Then + set_status "607", "Null URL in response ticket doesn't match this URL: " & this_url + ResetState() + ProcessAuthenticationResponse = AUTHENTICATE_COMPLETE_ERROR + Exit Function + End If + + response_url = wls_response(WLS_RESPONSE_URL) + response_url = rgx.Replace(response_url, "") + + If (this_url <> response_url) Then + set_status "607", "URL in response ticket doesn't match this URL: " & response_url & " != " & this_url + ResetState() + ProcessAuthenticationResponse = AUTHENTICATE_COMPLETE_ERROR + Exit Function + End If + + + ' Go through the possible different response codes + ' from the WLS and set our status accordingly. + + If (wls_response(WLS_RESPONSE_STATUS) = "410") Then + + set_status "410", status_codes("410") + + ElseIf ((wls_response(WLS_RESPONSE_VER) <> PROTOCOL_VERSION) And (wls_response(WLS_RESPONSE_STATUS) <> "520")) Then + + set_status "608", "Wrong protocol version in authentication service reply" + + ElseIf (wls_response(WLS_RESPONSE_STATUS) <> "200") Then + + ' If status code != "200" then we have an error of some description. + ' First off, check that it's an error for which we have an error code / msg. + + If (status_codes.Exists(wls_response(WLS_RESPONSE_STATUS)) = False) Then + write_log("No status code for error " & wls_response(WLS_RESPONSE_STATUS)) + ProcessAuthenticationResponse = AUTHENTICATE_COMPLETE_ERROR + Exit Function + End If + + ' If we have an error code / msg for the error, then set status to that code / msg. + + set_status wls_response(WLS_RESPONSE_STATUS), status_codes(wls_response(WLS_RESPONSE_STATUS)) + + ' If the authentication response provided a response message then set status msg to that. + + If (wls_response(WLS_RESPONSE_MSG) <> "") Then m_authentication_response(AUTHENTICATION_RESPONSE_MSG) = wls_response(WLS_RESPONSE_MSG) + + Else + + ' Status code must be '200' to get here. + ' But we need to check the issue time of the + ' authentication response is close to our current time. + + timestamp_now = DateDiff("s", "01/01/1970 00:00:00", UTCNow()) + timestamp_issue = iso2time(wls_response(WLS_RESPONSE_ISSUE)) + + If (timestamp_issue = 0) Then + + set_status "609", "Unable to read issue time in authentication service reply" + + ElseIf (timestamp_issue > (timestamp_now + authrequest_skew + 1)) Then + + set_status "610", "Authentication service reply apparently issued in the future: " & wls_response(WLS_RESPONSE_ISSUE) + + ElseIf ((timestamp_now - authrequest_skew - 1) > (timestamp_issue + response_timeout)) Then + + set_status "611", "Stale authentication service reply issue at " & wls_response(WLS_RESPONSE_ISSUE) + + End If + + End If + + + ' Calculate session expiry time + + expiry = max_session_life + + If (wls_response(WLS_RESPONSE_LIFE) <> "") Then + + wls_token_life = Int(wls_response(WLS_RESPONSE_LIFE)) + + If ((wls_token_life > 0) And (wls_token_life < expiry)) Then expiry = wls_token_life + + End If + + + ' Populate authentication response with information collected so far + + m_authentication_response(AUTHENTICATION_RESPONSE_ISSUE) = CStr(time2iso(DateDiff("s", "01/01/1970 00:00:00", UTCNow()))) + m_authentication_response(AUTHENTICATION_RESPONSE_EXPIRE) = CStr(time2iso(DateDiff("s", "01/01/1970 00:00:00", UTCNow()) + expiry)) + m_authentication_response(AUTHENTICATION_RESPONSE_ID) = wls_response(WLS_RESPONSE_ID) + m_authentication_response(AUTHENTICATION_RESPONSE_PRINCIPAL) = wls_response(WLS_RESPONSE_PRINCIPAL) + m_authentication_response(AUTHENTICATION_RESPONSE_AUTH) = wls_response(WLS_RESPONSE_AUTH) + m_authentication_response(AUTHENTICATION_RESPONSE_SSO) = wls_response(WLS_RESPONSE_SSO) + m_authentication_response(AUTHENTICATION_RESPONSE_PARAMS) = wls_response(WLS_RESPONSE_PARAMS) + m_authentication_response(AUTHENTICATION_RESPONSE_PTAGS) = wls_response(WLS_RESPONSE_PTAGS) + m_authentication_response(AUTHENTICATION_RESPONSE_VER) = AUTHENTICATION_RESPONSE_VERSION + + + ' Collapse parameters of authentication_response into a string + ' then create HMAC hash code of this string and append this code + ' onto the string to form the value of our authentication cookie. + + authentication_cookie_value = "" + + For i = 0 To (AUTHENTICATION_RESPONSE_PARAMS - 1) + If (m_authentication_response(i) <> "") Then authentication_cookie_value = authentication_cookie_value & m_authentication_response(i) + authentication_cookie_value = authentication_cookie_value & "!" + Next + + If (m_authentication_response(AUTHENTICATION_RESPONSE_PARAMS) <> "") Then + authentication_cookie_value = authentication_cookie_value & m_authentication_response(AUTHENTICATION_RESPONSE_PARAMS) + End If + + hmac_signature = hmac_sha1(cookie_key, authentication_cookie_value) + authentication_cookie_value = authentication_cookie_value & "!" & hmac_signature + + write_log("ProcessAuthenticationResponse: Setting cookie=" & authentication_cookie_value) + + authentication_cookie = authentication_cookie_value + + ' Now the authentication cookie's in place, we + ' can redirect user back to the page they started from. + ' As long as our authentication cookie doesn't expire, + ' we then only need to call 'ProcessAuthenticationCookie' + ' to check the cookie is valid - ie. we don't need to + ' keep returning to the WLS for every single + ' authentication request. + + write_log("ProcessAuthenticationResponse: Session cookie established, redirecting...") + + Redirect(wls_response(WLS_RESPONSE_URL)) + + ProcessAuthenticationResponse = AUTHENTICATE_INCOMPLETE + + End Function + + + Public Function ProcessAuthenticationCookie() + + ' **************************************** + ' 3. ProcessAuthenticationCookie() + ' + ' Check the signature of the cookie is valid and if so, + ' process/interpret the values of the authentication cookie. + ' + ' **************************************** + + write_log("ProcessAuthenticationCookie: Starting...") + + ' Do some quick checks to ensure the authentication + ' cookie looks like a valid response from WLS. + + If (authentication_cookie = AUTHENTICATIONCOOKIE_REDIRECT_WLS) Then + write_log("ProcessAuthenticationCookie: Processing authentication cookie when it's still set to REDIRECT_WLS.") + set_status "612", "Processing authentication cookie when its still set to REDIRECT_WLS" + ResetState() + ProcessAuthenticationCookie = AUTHENTICATE_COMPLETE_ERROR + Exit Function + End If + + If (CheckValidAuthenticationCookie(authentication_cookie) = False) Then + write_log("ProcessAuthenticationCookie: Authentication cookie looks invalid.") + set_status "613", "Authentication cookie invalid" + ResetState() + ProcessAuthenticationCookie = AUTHENTICATE_COMPLETE_ERROR + Exit Function + End If + + write_log("ProcessAuthenticationCookie: Interpreting authentication cookie=" & authentication_cookie) + + ' Split up authentication cookie into _authentication_response array + ' of response parameters using '!' as the delimiter. + + m_authentication_response = Split(url_decode(authentication_cookie), "!") + + ' **************************************** + ' Check authentication cookie has been correctly signed + ' **************************************** + + ' Get signature from last element of authentication response array. + + signature = m_authentication_response(UBound(m_authentication_response)) + + ' Copy m_authentication_response into a separate array + ' then remove the last element of that array + ' and bundle together as a string. + + Dim values_for_verify() + ReDim values_for_verify(UBound(m_authentication_response) - 1) + + For i = 0 To (UBound(values_for_verify)) + values_for_verify(i) = m_authentication_response(i) + Next + + values_for_verify_string = Join(values_for_verify, "!") + + ' Check whether the hash of this shorter string matches the signature + ' we generated in the previous stage of the authentication process. + + If (False = hmac_sha1_verify(cookie_key, values_for_verify_string, signature)) Then + write_log("ProcessAuthenticationCookie: AUTHENTICATION FAILED, session cookie signature invalid") + set_status "614", "Session cookie signature invalid" + ResetState() + ProcessAuthenticationCookie = AUTHENTICATE_COMPLETE_ERROR + Exit Function + End If + + write_log("ProcessAuthenticationCookie: Existing authentication cookie verified") + + ' **************************************** + ' Check authentication cookie hasn't expired + ' **************************************** + + timestamp_issue = iso2time(m_authentication_response(AUTHENTICATION_RESPONSE_ISSUE)) + timestamp_expire = iso2time(m_authentication_response(AUTHENTICATION_RESPONSE_EXPIRE)) + timestamp_now = DateDiff("s", "01/01/1970 00:00:00", UTCNow()) ' Get current time as Unix timestamp + + If ((timestamp_issue > timestamp_now) Or (timestamp_now >= timestamp_expire)) Then + + ' Session has expired so send new authentication request to WLS. + + write_log("ProcessAuthenticationCookie: Local session cookie expired. Issue/now/expire: " & Cstr(timestamp_issue) & "/" & CStr(timestamp_now) & "/" & CStr(timestamp_expire)) + + ' this.ResetState(); This won't work as we need to set the cookie during 'SendAuthenticationRequest' + + ProcessAuthenticationCookie = SendAuthenticationRequest(timeout_message) + Exit Function + + End If + + ' **************************************** + ' Authentication process is COMPLETE + ' though the user may not have been + ' successfully authenticated. + ' **************************************** + + If (m_authentication_response(AUTHENTICATION_RESPONSE_STATUS) <> "200") Then + write_log("ProcessAuthenticationCookie: AUTHENTICATION COMPLETE but not successfully authenticated.") + write_log("****************************************************************") + ResetState() + ProcessAuthenticationCookie = AUTHENTICATE_COMPLETE_NOT_AUTHENTICATED + Exit Function + End If + + write_log("ProcessAuthenticationCookie: AUTHENTICATION COMPLETE and user authenticated.") + write_log("****************************************************************") + ProcessAuthenticationCookie = AUTHENTICATE_COMPLETE_AUTHENTICATED + + End Function + + + ' **************************************** + ' + ' ---------------------------------------- + ' --- AUTHENTICATE()-SPECIFIC FUNCTIONS -- + ' ---------------------------------------- + ' + ' **************************************** + + Public Function CheckSetup() + + ' **************************************** + ' CheckSetup() + ' + ' Check the essential variables are in place. + ' + ' **************************************** + + request_method = Request.ServerVariables("REQUEST_METHOD") + + ' Check 'cookie_key' is defined, the key we will be using to create hash of cookie value. + + If (cookie_key = "") Then + set_status "601", "No key defined for session cookie" + CheckSetup = False + Exit Function + End If + + ' Log a warning if being used to authenticate POST requests. + + If (request_method = "POST") Then + write_log("Ucam_Webauth agent invoked for POST request, which it doesn't really support") + End If + + ' Check that the hostname is set explicitly (since we cannot trust + ' the Host: header); if it returns false (i.e. not set). + + If (hostname = "") Then + write_log("hostname not set in Ucam_Webauth object, but is mandatory") + set_status "602", "Ucam_Webauth configuration error - mandatory hostname not defined" + CheckSetup = False + Exit Function + End If + + ' If we have got this far without problems, then everything is good. + + CheckSetup = True + + End Function + + + Public Sub ResetState() + + ' Reset state as if a new user has just loaded a + ' fresh browser window. Unfortunately we can't reset + ' any cookies that the remote WLS may have set. + ' This will not completely log you out of Raven as + ' the Raven WLS also stores a session cookie that + ' you cannot delete remotely. So accessing Raven + ' after logout may elicit a "You are already logged + ' in" from the Raven WLS. + ' + ' As both local and WLS cookies are session cookies, the safest + ' thing to do is to quit the browser to remove both session cookies. + ' Note that some browsers with 'Restore session' functionality, + ' eg. Firefox, may not remove session cookies properly. + ' 'true' whatever happens. + + ' By setting the expiry to '1', we ensure the + ' authentication cookie is removed straightaway. + + setcookie full_cookie_name(), "", 1, cookie_path, cookie_domain, using_https(), False + + End Sub + + + Public Function GetCurrentState() + + ' If no authentication cookie and no WLS-response, then we're + ' starting fresh so return 'STAGE_AUTHENTICATION_NEW' + + If ((authentication_cookie = "") And (authentication_response_string = "")) Then + GetCurrentState = STATE_NEW_AUTHENTICATION + Exit Function + End If + + ' If no cookie and a non-empty WLS-Response, then either (i) we have + ' returned from the WLS without the previous cookie that we set staying intact. + ' So there must have been a problem setting that earlier cookie. + ' Or (ii) a 'WLS-Response' GET variable was supplied to our initial + ' page to begin with, which is going to cause confusion. + ' This may be due to reloading the post-WLS page after an error. + + If ((authentication_cookie = "") And (authentication_response_string <> "")) Then + set_status "610", "Either browser is not accepting session cookie or you supplied WLS-Response variable to initial page." + + ' Don't do any redirecting back to the original + ' page as it might catch us in an infinite loop. + ' Instead show a page to the user with the + ' option to click on a particular link or + ' put something in code to go to a specific + ' safe page. + + GetCurrentState = STATE_ERROR + Exit Function + End If + + ' If authentication cookie = 'AUTHENTICATIONCOOKIE_REDIRECT_WLS' + ' and WLS-Response is non-empty, then we've been redirected here + ' by the WLS (though you could simulate this redirection manually by + ' interrupting the WLS process and manually pasting in a URL with a + ' WLS-Response GET variable.) + + If ((authentication_cookie = AUTHENTICATIONCOOKIE_REDIRECT_WLS) And (authentication_response_string <> "")) Then + GetCurrentState = STATE_WLS_RESPONSE_RECEIVED + Exit Function + End If + + + ' If authentication cookie = 'AUTHENTICATIONCOOKIE_REDIRECT_WLS' + ' and WLS-Response is empty, then the WLS is not working correctly. + ' So we trigger another authentication request. + ' Ideally we'd 'ResetState()' but this seems to create + ' confusion when we subsequently set the authentication + ' cookie to 'AUTHENTICATIONCOOKIE_REDIRECT_WLS' again - + ' so we leave it as is, with authentication cookie still + ' with this value. + + If ((authentication_cookie = AUTHENTICATIONCOOKIE_REDIRECT_WLS) And (authentication_response_string = "")) Then + GetCurrentState = STATE_NEW_AUTHENTICATION + Exit Function + End If + + + ' If authentication cookie != "" and != 'AUTHENTICATIONCOOKIE_REDIRECT_WLS' + ' then there's a possibility we have a legitimate authentication cookie. + ' Run 'CheckValidAuthenticationCookie' to check it looks in the + ' right format. + + If ((authentication_cookie <> "") And (authentication_cookie <> AUTHENTICATIONCOOKIE_REDIRECT_WLS)) Then + + If (CheckValidAuthenticationCookie(authentication_cookie)) Then + GetCurrentState = STATE_WAA_AUTHENTICATIONCOOKIE_SET + Exit Function + End If + + set_status "604", "Authentication cookie invalid" + GetCurrentState = STATE_ERROR + Exit Function + End If + + ' If none of the conditions have been satisfied so far, + ' there must have been an error along the way. + + If (status() <> "200") Then set_status "605", "Miscellaneous error while getting current state." + + GetCurrentState = STATE_ERROR + + End Function + + + Public Function CheckValidAuthenticationCookie(ByVal vAuthenticationCookie) + + ' A quick check to ensure the cookie value looks the + ' right format to be an authentication cookie. + ' ie. it has the correct number of values, delimited by '!'. + + If (vAuthenticationCookie = "") Then + CheckValidAuthenticationCookie = False + Exit Function + End If + + ' Split up authentication cookie into Array + ' using '!' as the delimiter. + + authentication_response = Split(url_decode(vAuthenticationCookie), "!") + + If (UBound(authentication_response) <> (AUTHENTICATION_RESPONSE_SIZE - 1)) Then + CheckValidAuthenticationCookie = False + Exit Function + End If + + CheckValidAuthenticationCookie = True + + End Function + + + Public Sub Redirect(url) + + ' Redirect user's browser making + ' sure to set redirected flag accordingly + + Response.Redirect(url) + redirected = True + + End Sub + + + ' **************************************** + ' + ' ---------------------------------------- + ' ------- MISCELLANEOUS FUNCTIONS -------- + ' ---------------------------------------- + ' + ' **************************************** + + Public Sub write_log(ByVal message ) + + ' Write a message to the log file with a timestamp prefix on every line + ' + ' Note relative paths, eg. 'logfile.txt', will be relative + ' to the IIS server directories where permissions to create + ' new files may not be available. So provide an absolute + ' path in the initial arguments to Ucam_Webauth ("log_file" => Path) + + Set objFSO = CreateObject("Scripting.FileSystemObject") + + If (objFSO.FileExists(log_file) = False) Then + Set objFile = objFSO.CreateTextFile(log_file) + Else + Set objFile = objFSO.OpenTextFile(log_file, 8) + End If + + date_prefix = "[" & lpad(Year(Date()), 4) & "-" & lpad(Month(Date()),2) & "-" & lpad(Day(Date()),2) & " " & _ + lpad(Hour(Time()), 2) & ":" & lpad(Minute(Time()),2) & ":" & lpad(Second(Time()),2) & "] " + + objFile.WriteLine(date_prefix & message) + objFile.Close + + End Sub + + + Public Sub set_status(response_status, response_msg) + + ' Quick function to set 'status' and 'msg' in a single line. + ' Makes the code look a little neater. + + m_authentication_response(AUTHENTICATION_RESPONSE_STATUS) = response_status + m_authentication_response(AUTHENTICATION_RESPONSE_MSG) = response_msg + + End Sub + + + Public Function using_https() + + ' Determines whether we're using https or Not + + using_https = False + + If (Request.ServerVariables("HTTPS") <> "") Then + servertype = Request.ServerVariables("HTTPS") + If (servertype = "on") Then using_https = True + End If + + End Function + + + Public Function url() + + ' Get the url to redirect the browser to after a successful authentication attempt. + ' + ' This is typically identical to the url that first calls this script. + ' But due to the possibility of faking 'HOST' variables in a server response, + ' the 'hostname' must be supplied as a setup / default parameter in the code. + ' + ' In versions 2 and 3, we must include the query component (GET parameters) of the + ' original calling url if they exist. + + + ' Strip out port number from hostname + + Set rgx = New RegExp + rgx.Global = True + rgx.IgnoreCase = False + rgx.Pattern = ":[0-9]+$" + + basichostname = rgx.Replace(hostname, "") + port = Request.ServerVariables("SERVER_PORT") + protocol = "http://" + + If (using_https()) Then + protocol = "https://" + If (port = "443") Then port = "" + Else + If (port = "80") Then port = "" + End If + + finalurl = protocol & basichostname + If (port <> "") Then finalurl = finalurl & ":" & port + + ' Remove any possible WLS-Response variables + ' from query part of URL to avoid + ' confusion and just in case we've + ' called 'SendAuthenticationRequest' + ' after WLS returned incorrect WLS-Response + ' 'GET' - which could lead to multiple + ' 'WLS-Response=&WLS-Response=...' + ' coming back from WLS server. + + url_query = Request.ServerVariables("REQUEST_URI") + rgx.Pattern = "&WLS-Response=[^&]*" + url_query = rgx.Replace(url_query, "") + rgx.Pattern = "\?WLS-Response=[^&]*" + url_query = rgx.Replace(url_query, "?") + rgx.Pattern = "\?&" + url_query = rgx.Replace(url_query, "?") + rgx.Pattern = "\?$" + url_query = rgx.Replace(url_query, "") + + url = finalurl & url_query + + End Function + + + Public Function full_cookie_name() + + ' Get name of cookie, typically 'Ucam-WebAuth-Session' + ' If 'https', then distinguish the name of the cookie by suffixing '-S' + + full_cookie_name = cookie_name + + If (using_https()) Then full_cookie_name = cookie_name & "-S" + + End Function + + + Public Sub setcookie(ByVal name , ByVal value , ByVal expire , ByVal path , ByVal domain , ByVal secure , ByVal httponly ) + + ' Sets cookie. + ' + ' name: Name of cookie. + ' value: Value of cookie. + ' expire: Expiry of cookie. Don't set it to make it a session cookie. + ' path: Path of cookie. + ' domain: Domain. + ' secure: Only allow on secure domains. + ' httponly: Only allow on http non-secure domains. + + If (expire <> 0) Then + If (expire = 1) Then + expire_datetime = DateAdd("s", 1, UTCNow()) + Else + timestamp_now = DateDiff("s", "01/01/1970 00:00:00", UTCNow()) + + If (expire < timestamp_now) Then + write_log("setcookie: Setting expire to past so don't bother setting cookie.") + Exit Sub + End If + + expire_datetime = DateAdd("s", expire, "01/01/1970 00:00:00") + End If + End If + + Response.Cookies(name) = value + + ' Whats correct value for Expires field when expire = 0? + + If (expire_datetime <> 0) Then + Response.Cookies(name).Expires = expire_datetime + End If + + ' Problems setting 'httponly' in VBScript as + ' VBScript encodes everything to do with cookies. + ' So if 'httponly' is required, a different + ' way of setting cookies by directly setting + ' the header with 'Set-Cookie' will be necessary. + + ' If (httponly) Then + ' Response.Cookies(name).Path = path & "; HttpOnly" + ' Else + ' Response.Cookies(name).Path = path + ' End If + + Response.Cookies(name).Path = path + + If (domain <> "") Then Response.Cookies(name).Domain = domain + + Response.Cookies(name).Secure = secure + + ' Response.Cookies.Add(cookie) + End Sub + + + Public Function time2iso(t) + + ' Convert a Unix timestamp into the format required by Raven. + ' Format based on RFC 3339, but see Raven documentation for + ' a full description. + + unUDate = DateAdd("s", t, "01/01/1970 00:00:00") + + time2iso = (lpad(Year(unUDate), 4) & lpad(Month(unUDate),2) & lpad(Day(unUDate),2) & "T" &_ + lpad(Hour(unUDate), 2) & lpad(Minute(unUDate),2) & lpad(Second(unUDate),2) & "Z") + + End Function + + + Public Function iso2time(t) + + ' Convert a time in Raven format into a Unix timestamp + ' ie. the number of seconds since epoch. + + iso2time = 0 + + if (Len(t) <> 16) Then Exit Function + + On Error Resume Next + + sYear = Mid(t,1,4) + sMonth = Mid(t, 5, 2) + sDay = Mid(t, 7, 2) + sHour = Mid(t, 10, 2) + sMinute = Mid(t, 12, 2) + sSecond = Mid(t, 14, 2) + + var_origin = CDate("01/01/1970 00:00:00") + var_date = CDate(sDay & "/" & sMonth & "/" & sYear & " " & sHour & ":" & sMinute & ":" & sSecond) + + iso2time = DateDiff("s", var_origin, var_date) + + On Error GoTo 0 + + End Function + + + Public Function load_key(ByVal key_id ) + + ' Returns content of a certificate key as a string + + key_filename = key_dir & "/" & key_id & ".crt" + + Set fso = CreateObject("Scripting.FileSystemObject") + Set file = fso.getFile(key_filename) + If isNull(file) Then + Exit Function + End If + + Set ts = file.OpenAsTextStream() + s = Space(file.size) + a = Split(s," ") + + i = 0 + ' Do not replace the following block by readBinary = by ts.readAll(), + ' it would result in broken output, because that method is not intended for binary data + While Not ts.atEndOfStream + a(i) = ts.read(1) + i = i + 1 + Wend + ts.close + + load_key = Join(a,"") + + End Function + + + Public Function check_signature(ByVal data , ByVal sig , ByVal key_id ) + + ' Checks the 'signature' provided by the WLS when it signed 'data' + ' is a valid signature for the data. This ensures the data has not been + ' tampered with. + + key_str = load_key(key_id) + + ' We make a call to a some Javascript libraries to do the verification + + check_signature = JavascriptCertVerify(data, wls_decode(sig), key_str) + + End Function + + + Public Function wls_encode(plainTextBytes) + + ' Encode a byte array of data in a way that can be + ' easily sent to the WLS + + Set rgx = New RegExp + rgx.Global = True + rgx.IgnoreCase = False + rgx.Pattern = "\+": plainTextBytes = rgx.Replace(plainTextBytes, "_") + rgx.Pattern = "/": plainTextBytes = rgx.Replace(plainTextBytes, ".") + rgx.Pattern = "=": plainTextBytes = rgx.Replace(plainTextBytes, "_") + + wls_encode = plainTextBytes + + End Function + + + Public Function wls_decode(ByVal sig ) + + ' Decode a string of data received from the WLS + ' into a string with data as hex doubledigits (as used by javascript security library) + + Set rgx = New RegExp + rgx.Global = True + rgx.IgnoreCase = False + rgx.Pattern = "-": sig = rgx.Replace(sig, "+") + rgx.Pattern = "\.": sig = rgx.Replace(sig, "/") + rgx.Pattern = "_": sig = rgx.Replace(sig, "=") + + sig_base64 = base64_decode(sig) + + sig_hex = "" + For i = 1 To LenB(sig_base64) + sig_hex = sig_hex & Right(String(2, "0") & LCase(Hex(AscB(MidB(sig_base64, i, 1)))), 2) + Next + + wls_decode = sig_hex + + End Function + + + Public Function hmac_sha1(ByVal key , ByVal data ) + + ' Create HMACSHA1 hash value for 'data' using public 'key'. + ' + ' key: raw content of a certificate file as string. + ' data: data to create hash value from as string. + + hmac_sha1 = wls_encode(b64_hmac_sha1(key, data)) + + End Function + + + Public Function hmac_sha1_verify(ByVal key , ByVal data , ByVal sig ) + + ' Verify the 'data' has been signed by public 'key' + ' + ' Compute HMACSHA1 hash value for 'data' using public 'key' + ' then compare the value to 'sig'(nature). + ' + ' key: Full text for public key. + ' data: Data to be verified. + ' signature: Signature of signed data (ie. hash value generated by us earlier). + + hmac_sha1_verify = (sig = hmac_sha1(key, data)) + + End Function + + + ' **************************************** + ' + ' ---------------------------------------- + ' ------- MISCELLANEOUS FUNCTIONS -------- + ' ------- SPECIFIC TO ASP VERSION -------- + ' ---------------------------------------- + ' + ' **************************************** + + Function lpad(strInput, length) + + ' Left pad string with zeros. + + lpad = Right(String(length, "0") & strInput, length) + + End Function + + + Public Function url_decode(ByVal url_encoded) + + ' Decodes URL-encoded string + + url_decode = "" + + If (url_encoded = "") Then Exit Function + + Dim aSplit + Dim sOutput + Dim I + If IsNull(url_encoded) Then + Exit Function + End If + + ' convert all pluses to spaces + sOutput = REPLACE(url_encoded, "+", " ") + + ' next convert %hexdigits to the character + aSplit = Split(sOutput, "%") + + If IsArray(aSplit) Then + sOutput = aSplit(0) + For I = 0 to UBound(aSplit) - 1 + sOutput = sOutput & _ + Chr("&H" & Left(aSplit(i + 1), 2)) &_ + Right(aSplit(i + 1), Len(aSplit(i + 1)) - 2) + Next + End If + + url_decode = sOutput + + End Function + + + Public Function UTCNow() + + ' Gets the UTC current time + ' The UTC time is the standard time the Raven server is operating with. + + Set dateTime = CreateObject("WbemScripting.SWbemDateTime") + dateTime.SetVarDate (now()) + UTCNow = dateTime.GetVarDate (false) + + End Function + + + Public Function base64_decode(strB64) + + ' Base64 decodes a string + + strXML = "" & _ + strB64 & "" + Set oXMLDoc = CreateObject("MSXML2.DOMDocument.3.0") + oXMLDoc.LoadXML(strXML) + + base64_decode = oXMLDoc.selectsinglenode("B64DECODE").nodeTypedValue + + set oXMLDoc = Nothing + + End Function + + + ' **************************************** + ' + ' Special get/set methods to enable + ' seamless access to cookies or query + ' variables as if they were ordinary + ' member variables. + ' + ' **************************************** + + ' Get/set authentication_cookie + ' 'authentication_cookie' is used to get and set + ' the value of the authentication cookie. + + Public Property Get authentication_cookie + + ' If the current value of the private variable + ' m_authentication_cookie is null then we check + ' to see what the value of the actual cookie is + ' and use that to set the variable accordingly. + + If (m_authentication_cookie = "") Then + On Error Resume Next + m_authentication_cookie = Request.Cookies(full_cookie_name()) + On Error GoTo 0 + End If + + authentication_cookie = m_authentication_cookie + + End Property + + Public Property Let authentication_cookie(v_authentication_cookie) + + ' Reset the private variable _authentication_cookie + ' so the system is forced to query the cookie directly + ' next time it wants to check the value through + ' authentication_cookie. + + m_authentication_cookie = "" + + setcookie full_cookie_name(), v_authentication_cookie, 0, cookie_path, cookie_domain, using_https(), False + + End Property + + + Public Property Get authentication_response_string() + + ' Get authentication_response_string + ' + ' Checks to see if there is a 'WLS-Response' + ' variable set and uses this as the value + ' for authentication_response_string + + ' If the value is already set, we just return it straightaway + + If (m_authentication_response_string <> "") Then + authentication_response_string = m_authentication_response_string + Exit Property + End If + + ' If the value is not set, we look for the value of 'WLS-Response' in 'QUERY_STRING' + + query_string = Request.ServerVariables("QUERY_STRING") + + If (query_string = "") Then + authentication_response_string = m_authentication_response_string + Exit Property + End If + + + ' We're processing urls with possible name-value pairs + ' in addition to WLS-Response=... so we need to extract all + ' name-value pairs and check specifically for WLS-Response. + + namevaluepairs = Split(query_string, "&") + + For Each namevalue In namevaluepairs + + pair = Split(namevalue, "=") + + If (UBound(pair) = 1) Then + If (pair(0) = "WLS-Response") Then + authentication_response_string = url_decode(pair(1)) + Exit Property + End If + End If + Next + + authentication_response_string = "" + + End Property + + + ' **************************************** + ' + ' Get/set methods to enable public access + ' to private variables. + ' + ' **************************************** + + ' Get/set auth_service + + Public Property Get auth_service + auth_service = m_auth_service + End Property + Public Property Let auth_service(v_auth_service) + m_auth_service = v_auth_service + End Property + + ' Get/set authrequest_desc + + Public Property Get authrequest_desc + authrequest_desc = m_description + End Property + Public Property Let authrequest_desc(v_authrequest_desc) + m_authrequest_desc = v_authrequest_desc + End Property + + ' Get/set authrequest_skew + + Public Property Get authrequest_skew + authrequest_skew = m_authrequest_skew + End Property + Public Property Let authrequest_skew(v_authrequest_skew) + m_authrequest_skew = v_authrequest_skew + End Property + + ' Get/set authrequest_fail + + Public Property Get authrequest_fail + authrequest_fail = m_authrequest_fail + End Property + Public Property Let authrequest_fail(v_authrequest_fail) + m_authrequest_fail = v_authrequest_fail + End Property + + ' Get/set authrequest_iact + + Public Property Get authrequest_iact + authrequest_iact = m_authrequest_iact + End Property + Public Property Let authrequest_iact(v_authrequest_iact) + m_authrequest_iact = v_authrequest_iact + End Property + + ' Get/set use_authrequest_iact + + Public Property Get use_authrequest_iact + use_authrequest_iact = m_use_authrequest_iact + End Property + Public Property Let use_authrequest_iact(v_use_authrequest_iact) + m_use_authrequest_iact = v_use_authrequest_iact + End Property + + ' Get/set authrequest_aauth + + Public Property Get authrequest_aauth + authrequest_aauth = m_authrequest_aauth + End Property + Public Property Let authrequest_aauth(v_authrequest_aauth) + m_authrequest_aauth = v_authrequest_aauth + End Property + + ' Get/set authrequest_params + + Public Property Get authrequest_params + authrequest_params = m_authrequest_params + End Property + Public Property Let authrequest_params(v_authrequest_params) + m_authrequest_params = v_authrequest_params + End Property + ' Get/set cookie_key + + Public Property Get cookie_key + cookie_key = m_cookie_key + End Property + Public Property Let cookie_key(v_cookie_key) + m_cookie_key = v_cookie_key + End Property + + ' Get/set redirected + ' + ' 'redirected' is a flag that says + ' whether a redirect has been sent + ' which is useful to check before + ' attempting to output any information + ' to the browser. + + Public Property Get redirected + redirected = m_redirected + End Property + Public Property Let redirected(v_redirected) + m_redirected = v_redirected + End Property + + ' Get/set cookie_path + + Public Property Get cookie_path + cookie_path = m_cookie_path + End Property + Public Property Let cookie_path(v_cookie_path) + m_cookie_path = v_cookie_path + End Property + + ' Get/set response_timeout + + Public Property Get response_timeout + response_timeout = m_response_timeout + End Property + Public Property Let response_timeout(v_response_timeout) + m_response_timeout = v_response_timeout + End Property + + ' Get/set hostname + + Public Property Get hostname + hostname = m_hostname + End Property + Public Property Let hostname(v_hostname) + m_hostname = v_hostname + End Property + + ' Get/set key_dir + + Public Property Get key_dir + key_dir = m_key_dir + End Property + Public Property Let key_dir(v_key_dir) + m_key_dir = v_key_dir + End Property + + ' Get/set max_session_life + + Public Property Get max_session_life + max_session_life = m_max_session_life + End Property + Public Property Let max_session_life(v_max_session_life) + m_max_session_life = v_max_session_life + End Property + + ' Get/set timeout_message + + Public Property Get timeout_message + timeout_message = m_timeout_message + End Property + Public Property Let timeout_message(v_timeout_message) + m_timeout_message = v_timeout_message + End Property + + ' Get/set cookie_name + + Public Property Get cookie_name + cookie_name = m_cookie_name + End Property + Public Property Let cookie_name(v_cookie_name) + m_cookie_name = v_cookie_name + End Property + + ' Get/set cookie_domain + + Public Property Get cookie_domain + cookie_domain = m_cookie_domain + End Property + Public Property Let cookie_domain(v_cookie_domain) + m_cookie_domain = v_cookie_domain + End Property + + ' Get/set log_file + + Public Property Get log_file + log_file = m_log_file + End Property + Public Property Let log_file(v_log_file) + m_log_file = v_log_file + End Property + + ' **************************************** + ' + ' Read-only methods to retrieve + ' authentication response values. + ' + ' See Raven documentation for a full + ' explanation of each parameter. + ' + ' **************************************** + + Public Function status() + + ' Read-only status + + status = "" + + If (UBound(m_authentication_response) >= AUTHENTICATION_RESPONSE_STATUS) Then + status = m_authentication_response(AUTHENTICATION_RESPONSE_STATUS) + End If + + End Function + + Public Function success() + + ' Read-only success + + success = False + + If (UBound(m_authentication_response) >= AUTHENTICATION_RESPONSE_STATUS) Then + success = (m_authentication_response(AUTHENTICATION_RESPONSE_STATUS) = "200") + End If + + End Function + + Public Function msg() + + ' Read-only msg + + msg = "" + + If (UBound(m_authentication_response) >= AUTHENTICATION_RESPONSE_MSG) Then + msg = m_authentication_response(AUTHENTICATION_RESPONSE_MSG) + End If + + End Function + + Public Function issue() + + ' Read-only issue + + issue = "" + + If (UBound(m_authentication_response) >= AUTHENTICATION_RESPONSE_ISSUE) Then + issue = m_authentication_response(AUTHENTICATION_RESPONSE_ISSUE) + End If + + End Function + + Public Function expire() + + ' Read-only expire + + expire = "" + + If (UBound(m_authentication_response) >= AUTHENTICATION_RESPONSE_EXPIRE) Then + expire = m_authentication_response(AUTHENTICATION_RESPONSE_EXPIRE) + End If + + End Function + + Public Function id() + + ' Read-only id + + id = "" + + If (UBound(m_authentication_response) >= AUTHENTICATION_RESPONSE_ID) Then + id = m_authentication_response(AUTHENTICATION_RESPONSE_ID) + End If + + End Function + + Public Function principal() + + ' Read-only principal + ' ie. the user id of the authenticated user + + principal = "" + + If (UBound(m_authentication_response) >= AUTHENTICATION_RESPONSE_PRINCIPAL) Then + principal = m_authentication_response(AUTHENTICATION_RESPONSE_PRINCIPAL) + End If + + End Function + + Public Function auth() + + ' Read-only auth + + auth = "" + + If (UBound(m_authentication_response) >= AUTHENTICATION_RESPONSE_AUTH) Then + auth = m_authentication_response(AUTHENTICATION_RESPONSE_AUTH) + End If + + End Function + + Public Function sso() + + ' Read-only sso + + sso = "" + + If (UBound(m_authentication_response) >= AUTHENTICATION_RESPONSE_SSO) Then + sso = m_authentication_response(AUTHENTICATION_RESPONSE_SSO) + End If + + End Function + + Public Function webauth_params() + + ' Read-only params + + webauth_params = "" + + If (UBound(m_authentication_response) >= AUTHENTICATION_RESPONSE_PARAMS) Then + webauth_params = m_authentication_response(AUTHENTICATION_RESPONSE_PARAMS) + End If + + End Function + + Public Function ptags() + + ' Read-only ptags + ' ie. whether user is 'current' staff/student + ' or another type of user. + + ptags = "" + + If (UBound(m_authentication_response) >= AUTHENTICATION_RESPONSE_PTAGS) Then + ptags = m_authentication_response(AUTHENTICATION_RESPONSE_PTAGS) + End If + + End Function + +End Class + +%> + + + + + + + + + + + + + + + + + + + + diff --git a/certificates/901.crt b/certificates/901.crt new file mode 100644 index 0000000..cb36708 --- /dev/null +++ b/certificates/901.crt @@ -0,0 +1,23 @@ +-----BEGIN CERTIFICATE----- +MIIDzTCCAzagAwIBAgIBADANBgkqhkiG9w0BAQQFADCBpjELMAkGA1UEBhMCR0Ix +EDAOBgNVBAgTB0VuZ2xhbmQxEjAQBgNVBAcTCUNhbWJyaWRnZTEgMB4GA1UEChMX +VW5pdmVyc2l0eSBvZiBDYW1icmlkZ2UxLTArBgNVBAsTJENvbXB1dGluZyBTZXJ2 +aWNlIERFTU8gUmF2ZW4gU2VydmljZTEgMB4GA1UEAxMXUmF2ZW4gREVNTyBwdWJs +aWMga2V5IDEwHhcNMDUwNzI2MTMyMTIwWhcNMDUwODI1MTMyMTIwWjCBpjELMAkG +A1UEBhMCR0IxEDAOBgNVBAgTB0VuZ2xhbmQxEjAQBgNVBAcTCUNhbWJyaWRnZTEg +MB4GA1UEChMXVW5pdmVyc2l0eSBvZiBDYW1icmlkZ2UxLTArBgNVBAsTJENvbXB1 +dGluZyBTZXJ2aWNlIERFTU8gUmF2ZW4gU2VydmljZTEgMB4GA1UEAxMXUmF2ZW4g +REVNTyBwdWJsaWMga2V5IDEwgZ8wDQYJKoZIhvcNAQEBBQADgY0AMIGJAoGBALhF +i9tIZvjYQQRfOzP3cy5ujR91ZntQnQehldByHlchHRmXwA1ot/e1WlHPgIjYkFRW +lSNcSDM5r7BkFu69zM66IHcF80NIopBp+3FYqi5uglEDlpzFrd+vYllzw7lBzUnp +CrwTxyO5JBaWnFMZrQkSdspXv89VQUO4V4QjXV7/AgMBAAGjggEHMIIBAzAdBgNV +HQ4EFgQUgjC6WtA4jFf54kxlidhFi8w+0HkwgdMGA1UdIwSByzCByIAUgjC6WtA4 +jFf54kxlidhFi8w+0HmhgaykgakwgaYxCzAJBgNVBAYTAkdCMRAwDgYDVQQIEwdF +bmdsYW5kMRIwEAYDVQQHEwlDYW1icmlkZ2UxIDAeBgNVBAoTF1VuaXZlcnNpdHkg +b2YgQ2FtYnJpZGdlMS0wKwYDVQQLEyRDb21wdXRpbmcgU2VydmljZSBERU1PIFJh +dmVuIFNlcnZpY2UxIDAeBgNVBAMTF1JhdmVuIERFTU8gcHVibGljIGtleSAxggEA +MAwGA1UdEwQFMAMBAf8wDQYJKoZIhvcNAQEEBQADgYEAsdyB+9szctHHIHE+S2Kg +LSxbGuFG9yfPFIqaSntlYMxKKB5ba/tIAMzyAOHxdEM5hi1DXRsOok3ElWjOw9oN +6Psvk/hLUN+YfC1saaUs3oh+OTfD7I4gRTbXPgsd6JgJQ0TQtuGygJdaht9cRBHW +wOq24EIbX5LquL9w+uvnfXw= +-----END CERTIFICATE----- diff --git a/certificates/raventest.crt b/certificates/raventest.crt new file mode 100644 index 0000000..108e5ed --- /dev/null +++ b/certificates/raventest.crt @@ -0,0 +1,18 @@ +-----BEGIN CERTIFICATE----- +MIICzjCCAjegAwIBAgIJALfog7E7XoTvMA0GCSqGSIb3DQEBBQUAME8xCzAJBgNV +BAYTAkFVMRMwEQYDVQQIEwpTb21lLVN0YXRlMQ0wCwYDVQQKEwRUZXN0MQ0wCwYD +VQQLEwRUZXN0MQ0wCwYDVQQDEwRUZXN0MB4XDTE0MDQwNDE1MDUzNloXDTE1MDQw +NDE1MDUzNlowTzELMAkGA1UEBhMCQVUxEzARBgNVBAgTClNvbWUtU3RhdGUxDTAL +BgNVBAoTBFRlc3QxDTALBgNVBAsTBFRlc3QxDTALBgNVBAMTBFRlc3QwgZ8wDQYJ +KoZIhvcNAQEBBQADgY0AMIGJAoGBAOG1Ire2quEcidKWI0WQ3XjHQ1gI/QXifX2O +FzuvETOpvKlRImI2IpRPKL3+ebsDnw3X96Dzer0tW/aNMtSrjV8QsiS/kWWIQzmb +1wRjxjBTSf2SY4/xW0aBGVYzH/YrzmLMYUl2Kmuq0Zpk85ZQ2mlN0TL46W8iTFrr +br9JH6RjAgMBAAGjgbEwga4wHQYDVR0OBBYEFD8vDiIdpN5qwc12dVKkQso/59GX +MH8GA1UdIwR4MHaAFD8vDiIdpN5qwc12dVKkQso/59GXoVOkUTBPMQswCQYDVQQG +EwJBVTETMBEGA1UECBMKU29tZS1TdGF0ZTENMAsGA1UEChMEVGVzdDENMAsGA1UE +CxMEVGVzdDENMAsGA1UEAxMEVGVzdIIJALfog7E7XoTvMAwGA1UdEwQFMAMBAf8w +DQYJKoZIhvcNAQEFBQADgYEAJEoknXd8iXVHkUpwKQmf1xWbNXxqhuLkweDD6JEN +/fQpfHVnWEj+Et2VBtvtF2zO3b9gZij75pNOk+yw8wLs1xhSL7MJYXSx5rXEXE3i +Y4Y6bRdH1/BAoWJvkGfun9wLhA22z3cS2iMx7xsdaWvZBrT36JKIZ4kNOLqQOjFH +ukE= +-----END CERTIFICATE----- diff --git a/docs/I - Overview of Raven Authentication Process.pdf b/docs/I - Overview of Raven Authentication Process.pdf new file mode 100644 index 0000000..b634236 Binary files /dev/null and b/docs/I - Overview of Raven Authentication Process.pdf differ diff --git a/docs/II - Ucam_Webauth - Flowchart for Valid Authentication.pdf b/docs/II - Ucam_Webauth - Flowchart for Valid Authentication.pdf new file mode 100644 index 0000000..f788d7f Binary files /dev/null and b/docs/II - Ucam_Webauth - Flowchart for Valid Authentication.pdf differ diff --git a/docs/III - Ucam_Webauth - Flowchart for Cancelled Authentication.pdf b/docs/III - Ucam_Webauth - Flowchart for Cancelled Authentication.pdf new file mode 100644 index 0000000..1ac7199 Binary files /dev/null and b/docs/III - Ucam_Webauth - Flowchart for Cancelled Authentication.pdf differ diff --git a/js/asn1hex-1.1.js b/js/asn1hex-1.1.js new file mode 100644 index 0000000..73a8117 --- /dev/null +++ b/js/asn1hex-1.1.js @@ -0,0 +1,292 @@ +/*! asn1hex-1.1.4.js (c) 2012-2013 Kenji Urushima | kjur.github.com/jsrsasign/license + */ +/* + * asn1hex.js - Hexadecimal represented ASN.1 string library + * + * Copyright (c) 2010-2013 Kenji Urushima (kenji.urushima@gmail.com) + * + * This software is licensed under the terms of the MIT License. + * http://kjur.github.com/jsrsasign/license/ + * + * The above copyright and license notice shall be + * included in all copies or substantial portions of the Software. + */ + +/** + * @fileOverview + * @name asn1hex-1.1.js + * @author Kenji Urushima kenji.urushima@gmail.com + * @version asn1hex 1.1.4 (2013-Oct-02) + * @license MIT License + */ + +/* + * MEMO: + * f('3082025b02...', 2) ... 82025b ... 3bytes + * f('020100', 2) ... 01 ... 1byte + * f('0203001...', 2) ... 03 ... 1byte + * f('02818003...', 2) ... 8180 ... 2bytes + * f('3080....0000', 2) ... 80 ... -1 + * + * Requirements: + * - ASN.1 type octet length MUST be 1. + * (i.e. ASN.1 primitives like SET, SEQUENCE, INTEGER, OCTETSTRING ...) + */ + +/** + * ASN.1 DER encoded hexadecimal string utility class + * @name ASN1HEX + * @class ASN.1 DER encoded hexadecimal string utility class + * @since jsrsasign 1.1 + */ +var ASN1HEX = new function() { + /** + * get byte length for ASN.1 L(length) bytes + * @name getByteLengthOfL_AtObj + * @memberOf ASN1HEX + * @function + * @param {String} s hexadecimal string of ASN.1 DER encoded data + * @param {Number} pos string index + * @return byte length for ASN.1 L(length) bytes + */ + this.getByteLengthOfL_AtObj = function(s, pos) { + if (s.substring(pos + 2, pos + 3) != '8') return 1; + var i = parseInt(s.substring(pos + 3, pos + 4)); + if (i == 0) return -1; // length octet '80' indefinite length + if (0 < i && i < 10) return i + 1; // including '8?' octet; + return -2; // malformed format + }; + + /** + * get hexadecimal string for ASN.1 L(length) bytes + * @name getHexOfL_AtObj + * @memberOf ASN1HEX + * @function + * @param {String} s hexadecimal string of ASN.1 DER encoded data + * @param {Number} pos string index + * @return {String} hexadecimal string for ASN.1 L(length) bytes + */ + this.getHexOfL_AtObj = function(s, pos) { + var len = this.getByteLengthOfL_AtObj(s, pos); + if (len < 1) return ''; + return s.substring(pos + 2, pos + 2 + len * 2); + }; + + // getting ASN.1 length value at the position 'idx' of + // hexa decimal string 's'. + // + // f('3082025b02...', 0) ... 82025b ... ??? + // f('020100', 0) ... 01 ... 1 + // f('0203001...', 0) ... 03 ... 3 + // f('02818003...', 0) ... 8180 ... 128 + /** + * get integer value of ASN.1 length for ASN.1 data + * @name getIntOfL_AtObj + * @memberOf ASN1HEX + * @function + * @param {String} s hexadecimal string of ASN.1 DER encoded data + * @param {Number} pos string index + * @return ASN.1 L(length) integer value + */ + this.getIntOfL_AtObj = function(s, pos) { + var hLength = this.getHexOfL_AtObj(s, pos); + if (hLength == '') return -1; + var bi; + if (parseInt(hLength.substring(0, 1)) < 8) { + bi = new BigInteger(hLength, 16); + } else { + bi = new BigInteger(hLength.substring(2), 16); + } + return bi.intValue(); + }; + + /** + * get ASN.1 value starting string position for ASN.1 object refered by index 'idx'. + * @name getStartPosOfV_AtObj + * @memberOf ASN1HEX + * @function + * @param {String} s hexadecimal string of ASN.1 DER encoded data + * @param {Number} pos string index + */ + this.getStartPosOfV_AtObj = function(s, pos) { + var l_len = this.getByteLengthOfL_AtObj(s, pos); + if (l_len < 0) return l_len; + return pos + (l_len + 1) * 2; + }; + + /** + * get hexadecimal string of ASN.1 V(value) + * @name getHexOfV_AtObj + * @memberOf ASN1HEX + * @function + * @param {String} s hexadecimal string of ASN.1 DER encoded data + * @param {Number} pos string index + * @return {String} hexadecimal string of ASN.1 value. + */ + this.getHexOfV_AtObj = function(s, pos) { + var pos1 = this.getStartPosOfV_AtObj(s, pos); + var len = this.getIntOfL_AtObj(s, pos); + return s.substring(pos1, pos1 + len * 2); + }; + + /** + * get hexadecimal string of ASN.1 TLV at + * @name getHexOfTLV_AtObj + * @memberOf ASN1HEX + * @function + * @param {String} s hexadecimal string of ASN.1 DER encoded data + * @param {Number} pos string index + * @return {String} hexadecimal string of ASN.1 TLV. + * @since 1.1 + */ + this.getHexOfTLV_AtObj = function(s, pos) { + var hT = s.substr(pos, 2); + var hL = this.getHexOfL_AtObj(s, pos); + var hV = this.getHexOfV_AtObj(s, pos); + return hT + hL + hV; + }; + + /** + * get next sibling starting index for ASN.1 object string + * @name getPosOfNextSibling_AtObj + * @memberOf ASN1HEX + * @function + * @param {String} s hexadecimal string of ASN.1 DER encoded data + * @param {Number} pos string index + * @return next sibling starting index for ASN.1 object string + */ + this.getPosOfNextSibling_AtObj = function(s, pos) { + var pos1 = this.getStartPosOfV_AtObj(s, pos); + var len = this.getIntOfL_AtObj(s, pos); + return pos1 + len * 2; + }; + + /** + * get array of indexes of child ASN.1 objects + * @name getPosArrayOfChildren_AtObj + * @memberOf ASN1HEX + * @function + * @param {String} s hexadecimal string of ASN.1 DER encoded data + * @param {Number} start string index of ASN.1 object + * @return {Array of Number} array of indexes for childen of ASN.1 objects + */ + this.getPosArrayOfChildren_AtObj = function(h, pos) { + var a = new Array(); + var p0 = this.getStartPosOfV_AtObj(h, pos); + a.push(p0); + + var len = this.getIntOfL_AtObj(h, pos); + var p = p0; + var k = 0; + while (1) { + var pNext = this.getPosOfNextSibling_AtObj(h, p); + if (pNext == null || (pNext - p0 >= (len * 2))) break; + if (k >= 200) break; + + a.push(pNext); + p = pNext; + + k++; + } + + return a; + }; + + /** + * get string index of nth child object of ASN.1 object refered by h, idx + * @name getNthChildIndex_AtObj + * @memberOf ASN1HEX + * @function + * @param {String} h hexadecimal string of ASN.1 DER encoded data + * @param {Number} idx start string index of ASN.1 object + * @param {Number} nth for child + * @return {Number} string index of nth child. + * @since 1.1 + */ + this.getNthChildIndex_AtObj = function(h, idx, nth) { + var a = this.getPosArrayOfChildren_AtObj(h, idx); + return a[nth]; + }; + + // ========== decendant methods ============================== + /** + * get string index of nth child object of ASN.1 object refered by h, idx + * @name getDecendantIndexByNthList + * @memberOf ASN1HEX + * @function + * @param {String} h hexadecimal string of ASN.1 DER encoded data + * @param {Number} currentIndex start string index of ASN.1 object + * @param {Array of Number} nthList array list of nth + * @return {Number} string index refered by nthList + * @since 1.1 + * @example + * The "nthList" is a index list of structured ASN.1 object + * reference. Here is a sample structure and "nthList"s which + * refers each objects. + * + * SQUENCE - [0] + * SEQUENCE - [0, 0] + * IA5STRING 000 - [0, 0, 0] + * UTF8STRING 001 - [0, 0, 1] + * SET - [0, 1] + * IA5STRING 010 - [0, 1, 0] + * UTF8STRING 011 - [0, 1, 1] + */ + this.getDecendantIndexByNthList = function(h, currentIndex, nthList) { + if (nthList.length == 0) { + return currentIndex; + } + var firstNth = nthList.shift(); + var a = this.getPosArrayOfChildren_AtObj(h, currentIndex); + return this.getDecendantIndexByNthList(h, a[firstNth], nthList); + }; + + /** + * get hexadecimal string of ASN.1 TLV refered by current index and nth index list. + * @name getDecendantHexTLVByNthList + * @memberOf ASN1HEX + * @function + * @param {String} h hexadecimal string of ASN.1 DER encoded data + * @param {Number} currentIndex start string index of ASN.1 object + * @param {Array of Number} nthList array list of nth + * @return {Number} hexadecimal string of ASN.1 TLV refered by nthList + * @since 1.1 + */ + this.getDecendantHexTLVByNthList = function(h, currentIndex, nthList) { + var idx = this.getDecendantIndexByNthList(h, currentIndex, nthList); + return this.getHexOfTLV_AtObj(h, idx); + }; + + /** + * get hexadecimal string of ASN.1 V refered by current index and nth index list. + * @name getDecendantHexVByNthList + * @memberOf ASN1HEX + * @function + * @param {String} h hexadecimal string of ASN.1 DER encoded data + * @param {Number} currentIndex start string index of ASN.1 object + * @param {Array of Number} nthList array list of nth + * @return {Number} hexadecimal string of ASN.1 V refered by nthList + * @since 1.1 + */ + this.getDecendantHexVByNthList = function(h, currentIndex, nthList) { + var idx = this.getDecendantIndexByNthList(h, currentIndex, nthList); + return this.getHexOfV_AtObj(h, idx); + }; +}; + +/* + * @since asn1hex 1.1.4 + */ +ASN1HEX.getVbyList = function(h, currentIndex, nthList, checkingTag) { + var idx = this.getDecendantIndexByNthList(h, currentIndex, nthList); + if (idx === undefined) { + throw "can't find nthList object"; + } + if (checkingTag !== undefined) { + if (h.substr(idx, 2) != checkingTag) { + throw "checking tag doesn't match: " + h.substr(idx,2) + "!=" + checkingTag; + } + } + return this.getHexOfV_AtObj(h, idx); +}; + diff --git a/js/base64.js b/js/base64.js new file mode 100644 index 0000000..e8757ac --- /dev/null +++ b/js/base64.js @@ -0,0 +1,74 @@ +/*! (c) Tom Wu | http://www-cs-students.stanford.edu/~tjw/jsbn/ + */ +var b64map="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; +var b64pad="="; + +function hex2b64(h) { + var i; + var c; + var ret = ""; + for(i = 0; i+3 <= h.length; i+=3) { + c = parseInt(h.substring(i,i+3),16); + ret += b64map.charAt(c >> 6) + b64map.charAt(c & 63); + } + if(i+1 == h.length) { + c = parseInt(h.substring(i,i+1),16); + ret += b64map.charAt(c << 2); + } + else if(i+2 == h.length) { + c = parseInt(h.substring(i,i+2),16); + ret += b64map.charAt(c >> 2) + b64map.charAt((c & 3) << 4); + } + if (b64pad) while((ret.length & 3) > 0) ret += b64pad; + return ret; +} + +// convert a base64 string to hex +function b64tohex(s) { + var ret = "" + var i; + var k = 0; // b64 state, 0-3 + var slop; + var v; + for(i = 0; i < s.length; ++i) { + if(s.charAt(i) == b64pad) break; + v = b64map.indexOf(s.charAt(i)); + if(v < 0) continue; + if(k == 0) { + ret += int2char(v >> 2); + slop = v & 3; + k = 1; + } + else if(k == 1) { + ret += int2char((slop << 2) | (v >> 4)); + slop = v & 0xf; + k = 2; + } + else if(k == 2) { + ret += int2char(slop); + ret += int2char(v >> 2); + slop = v & 3; + k = 3; + } + else { + ret += int2char((slop << 2) | (v >> 4)); + ret += int2char(v & 0xf); + k = 0; + } + } + if(k == 1) + ret += int2char(slop << 2); + return ret; +} + +// convert a base64 string to a byte/number array +function b64toBA(s) { + //piggyback on b64tohex for now, optimize later + var h = b64tohex(s); + var i; + var a = new Array(); + for(i = 0; 2*i < h.length; ++i) { + a[i] = parseInt(h.substring(2*i,2*i+2),16); + } + return a; +} diff --git a/js/core.js b/js/core.js new file mode 100644 index 0000000..996aa07 --- /dev/null +++ b/js/core.js @@ -0,0 +1,712 @@ +/* +CryptoJS v3.1.2 +code.google.com/p/crypto-js +(c) 2009-2013 by Jeff Mott. All rights reserved. +code.google.com/p/crypto-js/wiki/License +*/ +/** + * CryptoJS core components. + */ +var CryptoJS = CryptoJS || (function (Math, undefined) { + /** + * CryptoJS namespace. + */ + var C = {}; + + /** + * Library namespace. + */ + var C_lib = C.lib = {}; + + /** + * Base object for prototypal inheritance. + */ + var Base = C_lib.Base = (function () { + function F() {} + + return { + /** + * Creates a new object that inherits from this object. + * + * @param {Object} overrides Properties to copy into the new object. + * + * @return {Object} The new object. + * + * @static + * + * @example + * + * var MyType = CryptoJS.lib.Base.extend({ + * field: 'value', + * + * method: function () { + * } + * }); + */ + extend: function (overrides) { + // Spawn + F.prototype = this; + var subtype = new F(); + + // Augment + if (overrides) { + subtype.mixIn(overrides); + } + + // Create default initializer + if (!subtype.hasOwnProperty('init')) { + subtype.init = function () { + subtype.$super.init.apply(this, arguments); + }; + } + + // Initializer's prototype is the subtype object + subtype.init.prototype = subtype; + + // Reference supertype + subtype.$super = this; + + return subtype; + }, + + /** + * Extends this object and runs the init method. + * Arguments to create() will be passed to init(). + * + * @return {Object} The new object. + * + * @static + * + * @example + * + * var instance = MyType.create(); + */ + create: function () { + var instance = this.extend(); + instance.init.apply(instance, arguments); + + return instance; + }, + + /** + * Initializes a newly created object. + * Override this method to add some logic when your objects are created. + * + * @example + * + * var MyType = CryptoJS.lib.Base.extend({ + * init: function () { + * // ... + * } + * }); + */ + init: function () { + }, + + /** + * Copies properties into this object. + * + * @param {Object} properties The properties to mix in. + * + * @example + * + * MyType.mixIn({ + * field: 'value' + * }); + */ + mixIn: function (properties) { + for (var propertyName in properties) { + if (properties.hasOwnProperty(propertyName)) { + this[propertyName] = properties[propertyName]; + } + } + + // IE won't copy toString using the loop above + if (properties.hasOwnProperty('toString')) { + this.toString = properties.toString; + } + }, + + /** + * Creates a copy of this object. + * + * @return {Object} The clone. + * + * @example + * + * var clone = instance.clone(); + */ + clone: function () { + return this.init.prototype.extend(this); + } + }; + }()); + + /** + * An array of 32-bit words. + * + * @property {Array} words The array of 32-bit words. + * @property {number} sigBytes The number of significant bytes in this word array. + */ + var WordArray = C_lib.WordArray = Base.extend({ + /** + * Initializes a newly created word array. + * + * @param {Array} words (Optional) An array of 32-bit words. + * @param {number} sigBytes (Optional) The number of significant bytes in the words. + * + * @example + * + * var wordArray = CryptoJS.lib.WordArray.create(); + * var wordArray = CryptoJS.lib.WordArray.create([0x00010203, 0x04050607]); + * var wordArray = CryptoJS.lib.WordArray.create([0x00010203, 0x04050607], 6); + */ + init: function (words, sigBytes) { + words = this.words = words || []; + + if (sigBytes != undefined) { + this.sigBytes = sigBytes; + } else { + this.sigBytes = words.length * 4; + } + }, + + /** + * Converts this word array to a string. + * + * @param {Encoder} encoder (Optional) The encoding strategy to use. Default: CryptoJS.enc.Hex + * + * @return {string} The stringified word array. + * + * @example + * + * var string = wordArray + ''; + * var string = wordArray.toString(); + * var string = wordArray.toString(CryptoJS.enc.Utf8); + */ + toString: function (encoder) { + return (encoder || Hex).stringify(this); + }, + + /** + * Concatenates a word array to this word array. + * + * @param {WordArray} wordArray The word array to append. + * + * @return {WordArray} This word array. + * + * @example + * + * wordArray1.concat(wordArray2); + */ + concat: function (wordArray) { + // Shortcuts + var thisWords = this.words; + var thatWords = wordArray.words; + var thisSigBytes = this.sigBytes; + var thatSigBytes = wordArray.sigBytes; + + // Clamp excess bits + this.clamp(); + + // Concat + if (thisSigBytes % 4) { + // Copy one byte at a time + for (var i = 0; i < thatSigBytes; i++) { + var thatByte = (thatWords[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff; + thisWords[(thisSigBytes + i) >>> 2] |= thatByte << (24 - ((thisSigBytes + i) % 4) * 8); + } + } else if (thatWords.length > 0xffff) { + // Copy one word at a time + for (var i = 0; i < thatSigBytes; i += 4) { + thisWords[(thisSigBytes + i) >>> 2] = thatWords[i >>> 2]; + } + } else { + // Copy all words at once + thisWords.push.apply(thisWords, thatWords); + } + this.sigBytes += thatSigBytes; + + // Chainable + return this; + }, + + /** + * Removes insignificant bits. + * + * @example + * + * wordArray.clamp(); + */ + clamp: function () { + // Shortcuts + var words = this.words; + var sigBytes = this.sigBytes; + + // Clamp + words[sigBytes >>> 2] &= 0xffffffff << (32 - (sigBytes % 4) * 8); + words.length = Math.ceil(sigBytes / 4); + }, + + /** + * Creates a copy of this word array. + * + * @return {WordArray} The clone. + * + * @example + * + * var clone = wordArray.clone(); + */ + clone: function () { + var clone = Base.clone.call(this); + clone.words = this.words.slice(0); + + return clone; + }, + + /** + * Creates a word array filled with random bytes. + * + * @param {number} nBytes The number of random bytes to generate. + * + * @return {WordArray} The random word array. + * + * @static + * + * @example + * + * var wordArray = CryptoJS.lib.WordArray.random(16); + */ + random: function (nBytes) { + var words = []; + for (var i = 0; i < nBytes; i += 4) { + words.push((Math.random() * 0x100000000) | 0); + } + + return new WordArray.init(words, nBytes); + } + }); + + /** + * Encoder namespace. + */ + var C_enc = C.enc = {}; + + /** + * Hex encoding strategy. + */ + var Hex = C_enc.Hex = { + /** + * Converts a word array to a hex string. + * + * @param {WordArray} wordArray The word array. + * + * @return {string} The hex string. + * + * @static + * + * @example + * + * var hexString = CryptoJS.enc.Hex.stringify(wordArray); + */ + stringify: function (wordArray) { + // Shortcuts + var words = wordArray.words; + var sigBytes = wordArray.sigBytes; + + // Convert + var hexChars = []; + for (var i = 0; i < sigBytes; i++) { + var bite = (words[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff; + hexChars.push((bite >>> 4).toString(16)); + hexChars.push((bite & 0x0f).toString(16)); + } + + return hexChars.join(''); + }, + + /** + * Converts a hex string to a word array. + * + * @param {string} hexStr The hex string. + * + * @return {WordArray} The word array. + * + * @static + * + * @example + * + * var wordArray = CryptoJS.enc.Hex.parse(hexString); + */ + parse: function (hexStr) { + // Shortcut + var hexStrLength = hexStr.length; + + // Convert + var words = []; + for (var i = 0; i < hexStrLength; i += 2) { + words[i >>> 3] |= parseInt(hexStr.substr(i, 2), 16) << (24 - (i % 8) * 4); + } + + return new WordArray.init(words, hexStrLength / 2); + } + }; + + /** + * Latin1 encoding strategy. + */ + var Latin1 = C_enc.Latin1 = { + /** + * Converts a word array to a Latin1 string. + * + * @param {WordArray} wordArray The word array. + * + * @return {string} The Latin1 string. + * + * @static + * + * @example + * + * var latin1String = CryptoJS.enc.Latin1.stringify(wordArray); + */ + stringify: function (wordArray) { + // Shortcuts + var words = wordArray.words; + var sigBytes = wordArray.sigBytes; + + // Convert + var latin1Chars = []; + for (var i = 0; i < sigBytes; i++) { + var bite = (words[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff; + latin1Chars.push(String.fromCharCode(bite)); + } + + return latin1Chars.join(''); + }, + + /** + * Converts a Latin1 string to a word array. + * + * @param {string} latin1Str The Latin1 string. + * + * @return {WordArray} The word array. + * + * @static + * + * @example + * + * var wordArray = CryptoJS.enc.Latin1.parse(latin1String); + */ + parse: function (latin1Str) { + // Shortcut + var latin1StrLength = latin1Str.length; + + // Convert + var words = []; + for (var i = 0; i < latin1StrLength; i++) { + words[i >>> 2] |= (latin1Str.charCodeAt(i) & 0xff) << (24 - (i % 4) * 8); + } + + return new WordArray.init(words, latin1StrLength); + } + }; + + /** + * UTF-8 encoding strategy. + */ + var Utf8 = C_enc.Utf8 = { + /** + * Converts a word array to a UTF-8 string. + * + * @param {WordArray} wordArray The word array. + * + * @return {string} The UTF-8 string. + * + * @static + * + * @example + * + * var utf8String = CryptoJS.enc.Utf8.stringify(wordArray); + */ + stringify: function (wordArray) { + try { + return decodeURIComponent(escape(Latin1.stringify(wordArray))); + } catch (e) { + throw new Error('Malformed UTF-8 data'); + } + }, + + /** + * Converts a UTF-8 string to a word array. + * + * @param {string} utf8Str The UTF-8 string. + * + * @return {WordArray} The word array. + * + * @static + * + * @example + * + * var wordArray = CryptoJS.enc.Utf8.parse(utf8String); + */ + parse: function (utf8Str) { + return Latin1.parse(unescape(encodeURIComponent(utf8Str))); + } + }; + + /** + * Abstract buffered block algorithm template. + * + * The property blockSize must be implemented in a concrete subtype. + * + * @property {number} _minBufferSize The number of blocks that should be kept unprocessed in the buffer. Default: 0 + */ + var BufferedBlockAlgorithm = C_lib.BufferedBlockAlgorithm = Base.extend({ + /** + * Resets this block algorithm's data buffer to its initial state. + * + * @example + * + * bufferedBlockAlgorithm.reset(); + */ + reset: function () { + // Initial values + this._data = new WordArray.init(); + this._nDataBytes = 0; + }, + + /** + * Adds new data to this block algorithm's buffer. + * + * @param {WordArray|string} data The data to append. Strings are converted to a WordArray using UTF-8. + * + * @example + * + * bufferedBlockAlgorithm._append('data'); + * bufferedBlockAlgorithm._append(wordArray); + */ + _append: function (data) { + // Convert string to WordArray, else assume WordArray already + if (typeof data == 'string') { + data = Utf8.parse(data); + } + + // Append + this._data.concat(data); + this._nDataBytes += data.sigBytes; + }, + + /** + * Processes available data blocks. + * + * This method invokes _doProcessBlock(offset), which must be implemented by a concrete subtype. + * + * @param {boolean} doFlush Whether all blocks and partial blocks should be processed. + * + * @return {WordArray} The processed data. + * + * @example + * + * var processedData = bufferedBlockAlgorithm._process(); + * var processedData = bufferedBlockAlgorithm._process(!!'flush'); + */ + _process: function (doFlush) { + // Shortcuts + var data = this._data; + var dataWords = data.words; + var dataSigBytes = data.sigBytes; + var blockSize = this.blockSize; + var blockSizeBytes = blockSize * 4; + + // Count blocks ready + var nBlocksReady = dataSigBytes / blockSizeBytes; + if (doFlush) { + // Round up to include partial blocks + nBlocksReady = Math.ceil(nBlocksReady); + } else { + // Round down to include only full blocks, + // less the number of blocks that must remain in the buffer + nBlocksReady = Math.max((nBlocksReady | 0) - this._minBufferSize, 0); + } + + // Count words ready + var nWordsReady = nBlocksReady * blockSize; + + // Count bytes ready + var nBytesReady = Math.min(nWordsReady * 4, dataSigBytes); + + // Process blocks + if (nWordsReady) { + for (var offset = 0; offset < nWordsReady; offset += blockSize) { + // Perform concrete-algorithm logic + this._doProcessBlock(dataWords, offset); + } + + // Remove processed words + var processedWords = dataWords.splice(0, nWordsReady); + data.sigBytes -= nBytesReady; + } + + // Return processed words + return new WordArray.init(processedWords, nBytesReady); + }, + + /** + * Creates a copy of this object. + * + * @return {Object} The clone. + * + * @example + * + * var clone = bufferedBlockAlgorithm.clone(); + */ + clone: function () { + var clone = Base.clone.call(this); + clone._data = this._data.clone(); + + return clone; + }, + + _minBufferSize: 0 + }); + + /** + * Abstract hasher template. + * + * @property {number} blockSize The number of 32-bit words this hasher operates on. Default: 16 (512 bits) + */ + var Hasher = C_lib.Hasher = BufferedBlockAlgorithm.extend({ + /** + * Configuration options. + */ + cfg: Base.extend(), + + /** + * Initializes a newly created hasher. + * + * @param {Object} cfg (Optional) The configuration options to use for this hash computation. + * + * @example + * + * var hasher = CryptoJS.algo.SHA256.create(); + */ + init: function (cfg) { + // Apply config defaults + this.cfg = this.cfg.extend(cfg); + + // Set initial values + this.reset(); + }, + + /** + * Resets this hasher to its initial state. + * + * @example + * + * hasher.reset(); + */ + reset: function () { + // Reset data buffer + BufferedBlockAlgorithm.reset.call(this); + + // Perform concrete-hasher logic + this._doReset(); + }, + + /** + * Updates this hasher with a message. + * + * @param {WordArray|string} messageUpdate The message to append. + * + * @return {Hasher} This hasher. + * + * @example + * + * hasher.update('message'); + * hasher.update(wordArray); + */ + update: function (messageUpdate) { + // Append + this._append(messageUpdate); + + // Update the hash + this._process(); + + // Chainable + return this; + }, + + /** + * Finalizes the hash computation. + * Note that the finalize operation is effectively a destructive, read-once operation. + * + * @param {WordArray|string} messageUpdate (Optional) A final message update. + * + * @return {WordArray} The hash. + * + * @example + * + * var hash = hasher.finalize(); + * var hash = hasher.finalize('message'); + * var hash = hasher.finalize(wordArray); + */ + finalize: function (messageUpdate) { + // Final message update + if (messageUpdate) { + this._append(messageUpdate); + } + + // Perform concrete-hasher logic + var hash = this._doFinalize(); + + return hash; + }, + + blockSize: 512/32, + + /** + * Creates a shortcut function to a hasher's object interface. + * + * @param {Hasher} hasher The hasher to create a helper for. + * + * @return {Function} The shortcut function. + * + * @static + * + * @example + * + * var SHA256 = CryptoJS.lib.Hasher._createHelper(CryptoJS.algo.SHA256); + */ + _createHelper: function (hasher) { + return function (message, cfg) { + return new hasher.init(cfg).finalize(message); + }; + }, + + /** + * Creates a shortcut function to the HMAC's object interface. + * + * @param {Hasher} hasher The hasher to use in this HMAC helper. + * + * @return {Function} The shortcut function. + * + * @static + * + * @example + * + * var HmacSHA256 = CryptoJS.lib.Hasher._createHmacHelper(CryptoJS.algo.SHA256); + */ + _createHmacHelper: function (hasher) { + return function (message, key) { + return new C_algo.HMAC.init(hasher, key).finalize(message); + }; + } + }); + + /** + * Algorithm namespace. + */ + var C_algo = C.algo = {}; + + return C; +}(Math)); diff --git a/js/crypto-1.1.js b/js/crypto-1.1.js new file mode 100644 index 0000000..2282b97 --- /dev/null +++ b/js/crypto-1.1.js @@ -0,0 +1,1136 @@ +/*! crypto-1.1.5.js (c) 2013 Kenji Urushima | kjur.github.com/jsrsasign/license + */ +/* + * crypto.js - Cryptographic Algorithm Provider class + * + * Copyright (c) 2013 Kenji Urushima (kenji.urushima@gmail.com) + * + * This software is licensed under the terms of the MIT License. + * http://kjur.github.com/jsrsasign/license + * + * The above copyright and license notice shall be + * included in all copies or substantial portions of the Software. + */ + +/** + * @fileOverview + * @name crypto-1.1.js + * @author Kenji Urushima kenji.urushima@gmail.com + * @version 1.1.5 (2013-Oct-06) + * @since jsrsasign 2.2 + * @license MIT License + */ + +/** + * kjur's class library name space + * @name KJUR + * @namespace kjur's class library name space + */ +if (typeof KJUR == "undefined" || !KJUR) KJUR = {}; +/** + * kjur's cryptographic algorithm provider library name space + *

+ * This namespace privides following crytpgrahic classes. + *

+ * NOTE: Please ignore method summary and document of this namespace. This caused by a bug of jsdoc2. + *

+ * @name KJUR.crypto + * @namespace + */ +if (typeof KJUR.crypto == "undefined" || !KJUR.crypto) KJUR.crypto = {}; + +/** + * static object for cryptographic function utilities + * @name KJUR.crypto.Util + * @class static object for cryptographic function utilities + * @property {Array} DIGESTINFOHEAD PKCS#1 DigestInfo heading hexadecimal bytes for each hash algorithms + * @property {Array} DEFAULTPROVIDER associative array of default provider name for each hash and signature algorithms + * @description + */ +KJUR.crypto.Util = new function() { + this.DIGESTINFOHEAD = { + 'sha1': "3021300906052b0e03021a05000414", + 'sha224': "302d300d06096086480165030402040500041c", + 'sha256': "3031300d060960864801650304020105000420", + 'sha384': "3041300d060960864801650304020205000430", + 'sha512': "3051300d060960864801650304020305000440", + 'md2': "3020300c06082a864886f70d020205000410", + 'md5': "3020300c06082a864886f70d020505000410", + 'ripemd160': "3021300906052b2403020105000414" + }; + + /* + * @since crypto 1.1.1 + */ + this.DEFAULTPROVIDER = { + 'md5': 'cryptojs', + 'sha1': 'cryptojs', + 'sha224': 'cryptojs', + 'sha256': 'cryptojs', + 'sha384': 'cryptojs', + 'sha512': 'cryptojs', + 'ripemd160': 'cryptojs', + 'hmacmd5': 'cryptojs', + 'hmacsha1': 'cryptojs', + 'hmacsha224': 'cryptojs', + 'hmacsha256': 'cryptojs', + 'hmacsha384': 'cryptojs', + 'hmacsha512': 'cryptojs', + 'hmacripemd160': 'cryptojs', + + 'MD5withRSA': 'cryptojs/jsrsa', + 'SHA1withRSA': 'cryptojs/jsrsa', + 'SHA224withRSA': 'cryptojs/jsrsa', + 'SHA256withRSA': 'cryptojs/jsrsa', + 'SHA384withRSA': 'cryptojs/jsrsa', + 'SHA512withRSA': 'cryptojs/jsrsa', + 'RIPEMD160withRSA': 'cryptojs/jsrsa', + + 'MD5withECDSA': 'cryptojs/jsrsa', + 'SHA1withECDSA': 'cryptojs/jsrsa', + 'SHA224withECDSA': 'cryptojs/jsrsa', + 'SHA256withECDSA': 'cryptojs/jsrsa', + 'SHA384withECDSA': 'cryptojs/jsrsa', + 'SHA512withECDSA': 'cryptojs/jsrsa', + 'RIPEMD160withECDSA': 'cryptojs/jsrsa', + + 'SHA1withDSA': 'cryptojs/jsrsa', + 'SHA224withDSA': 'cryptojs/jsrsa', + 'SHA256withDSA': 'cryptojs/jsrsa', + + 'MD5withRSAandMGF1': 'cryptojs/jsrsa', + 'SHA1withRSAandMGF1': 'cryptojs/jsrsa', + 'SHA224withRSAandMGF1': 'cryptojs/jsrsa', + 'SHA256withRSAandMGF1': 'cryptojs/jsrsa', + 'SHA384withRSAandMGF1': 'cryptojs/jsrsa', + 'SHA512withRSAandMGF1': 'cryptojs/jsrsa', + 'RIPEMD160withRSAandMGF1': 'cryptojs/jsrsa' + }; + + /* + * @since crypto 1.1.2 + */ + this.CRYPTOJSMESSAGEDIGESTNAME = { + 'md5': 'CryptoJS.algo.MD5', + 'sha1': 'CryptoJS.algo.SHA1', + 'sha224': 'CryptoJS.algo.SHA224', + 'sha256': 'CryptoJS.algo.SHA256', + 'sha384': 'CryptoJS.algo.SHA384', + 'sha512': 'CryptoJS.algo.SHA512', + 'ripemd160': 'CryptoJS.algo.RIPEMD160' + }; + + /** + * get hexadecimal DigestInfo + * @name getDigestInfoHex + * @memberOf KJUR.crypto.Util + * @function + * @param {String} hHash hexadecimal hash value + * @param {String} alg hash algorithm name (ex. 'sha1') + * @return {String} hexadecimal string DigestInfo ASN.1 structure + */ + this.getDigestInfoHex = function(hHash, alg) { + if (typeof this.DIGESTINFOHEAD[alg] == "undefined") + throw "alg not supported in Util.DIGESTINFOHEAD: " + alg; + return this.DIGESTINFOHEAD[alg] + hHash; + }; + + /** + * get PKCS#1 padded hexadecimal DigestInfo + * @name getPaddedDigestInfoHex + * @memberOf KJUR.crypto.Util + * @function + * @param {String} hHash hexadecimal hash value of message to be signed + * @param {String} alg hash algorithm name (ex. 'sha1') + * @param {Integer} keySize key bit length (ex. 1024) + * @return {String} hexadecimal string of PKCS#1 padded DigestInfo + */ + this.getPaddedDigestInfoHex = function(hHash, alg, keySize) { + var hDigestInfo = this.getDigestInfoHex(hHash, alg); + var pmStrLen = keySize / 4; // minimum PM length + + if (hDigestInfo.length + 22 > pmStrLen) // len(0001+ff(*8)+00+hDigestInfo)=22 + throw "key is too short for SigAlg: keylen=" + keySize + "," + alg; + + var hHead = "0001"; + var hTail = "00" + hDigestInfo; + var hMid = ""; + var fLen = pmStrLen - hHead.length - hTail.length; + for (var i = 0; i < fLen; i += 2) { + hMid += "ff"; + } + var hPaddedMessage = hHead + hMid + hTail; + return hPaddedMessage; + }; + + /** + * get hexadecimal hash of string with specified algorithm + * @name hashString + * @memberOf KJUR.crypto.Util + * @function + * @param {String} s input string to be hashed + * @param {String} alg hash algorithm name + * @return {String} hexadecimal string of hash value + * @since 1.1.1 + */ + this.hashString = function(s, alg) { + var md = new KJUR.crypto.MessageDigest({'alg': alg}); + return md.digestString(s); + }; + + /** + * get hexadecimal hash of hexadecimal string with specified algorithm + * @name hashHex + * @memberOf KJUR.crypto.Util + * @function + * @param {String} sHex input hexadecimal string to be hashed + * @param {String} alg hash algorithm name + * @return {String} hexadecimal string of hash value + * @since 1.1.1 + */ + this.hashHex = function(sHex, alg) { + var md = new KJUR.crypto.MessageDigest({'alg': alg}); + return md.digestHex(sHex); + }; + + /** + * get hexadecimal SHA1 hash of string + * @name sha1 + * @memberOf KJUR.crypto.Util + * @function + * @param {String} s input string to be hashed + * @return {String} hexadecimal string of hash value + * @since 1.0.3 + */ + this.sha1 = function(s) { + var md = new KJUR.crypto.MessageDigest({'alg':'sha1', 'prov':'cryptojs'}); + return md.digestString(s); + }; + + /** + * get hexadecimal SHA256 hash of string + * @name sha256 + * @memberOf KJUR.crypto.Util + * @function + * @param {String} s input string to be hashed + * @return {String} hexadecimal string of hash value + * @since 1.0.3 + */ + this.sha256 = function(s) { + var md = new KJUR.crypto.MessageDigest({'alg':'sha256', 'prov':'cryptojs'}); + return md.digestString(s); + }; + + this.sha256Hex = function(s) { + var md = new KJUR.crypto.MessageDigest({'alg':'sha256', 'prov':'cryptojs'}); + return md.digestHex(s); + }; + + /** + * get hexadecimal SHA512 hash of string + * @name sha512 + * @memberOf KJUR.crypto.Util + * @function + * @param {String} s input string to be hashed + * @return {String} hexadecimal string of hash value + * @since 1.0.3 + */ + this.sha512 = function(s) { + var md = new KJUR.crypto.MessageDigest({'alg':'sha512', 'prov':'cryptojs'}); + return md.digestString(s); + }; + + this.sha512Hex = function(s) { + var md = new KJUR.crypto.MessageDigest({'alg':'sha512', 'prov':'cryptojs'}); + return md.digestHex(s); + }; + + /** + * get hexadecimal MD5 hash of string + * @name md5 + * @memberOf KJUR.crypto.Util + * @function + * @param {String} s input string to be hashed + * @return {String} hexadecimal string of hash value + * @since 1.0.3 + */ + this.md5 = function(s) { + var md = new KJUR.crypto.MessageDigest({'alg':'md5', 'prov':'cryptojs'}); + return md.digestString(s); + }; + + /** + * get hexadecimal RIPEMD160 hash of string + * @name ripemd160 + * @memberOf KJUR.crypto.Util + * @function + * @param {String} s input string to be hashed + * @return {String} hexadecimal string of hash value + * @since 1.0.3 + */ + this.ripemd160 = function(s) { + var md = new KJUR.crypto.MessageDigest({'alg':'ripemd160', 'prov':'cryptojs'}); + return md.digestString(s); + }; + + /* + * @since 1.1.2 + */ + this.getCryptoJSMDByName = function(s) { + + }; +}; + +/** + * MessageDigest class which is very similar to java.security.MessageDigest class + * @name KJUR.crypto.MessageDigest + * @class MessageDigest class which is very similar to java.security.MessageDigest class + * @param {Array} params parameters for constructor + * @description + *
+ * Currently this supports following algorithm and providers combination: + * + * @example + * // CryptoJS provider sample + * <script src="http://crypto-js.googlecode.com/svn/tags/3.1.2/build/components/core.js"></script> + * <script src="http://crypto-js.googlecode.com/svn/tags/3.1.2/build/components/sha1.js"></script> + * <script src="crypto-1.0.js"></script> + * var md = new KJUR.crypto.MessageDigest({alg: "sha1", prov: "cryptojs"}); + * md.updateString('aaa') + * var mdHex = md.digest() + * + * // SJCL(Stanford JavaScript Crypto Library) provider sample + * <script src="http://bitwiseshiftleft.github.io/sjcl/sjcl.js"></script> + * <script src="crypto-1.0.js"></script> + * var md = new KJUR.crypto.MessageDigest({alg: "sha256", prov: "sjcl"}); // sjcl supports sha256 only + * md.updateString('aaa') + * var mdHex = md.digest() + */ +KJUR.crypto.MessageDigest = function(params) { + var md = null; + var algName = null; + var provName = null; + + /** + * set hash algorithm and provider + * @name setAlgAndProvider + * @memberOf KJUR.crypto.MessageDigest + * @function + * @param {String} alg hash algorithm name + * @param {String} prov provider name + * @description + * @example + * // for SHA1 + * md.setAlgAndProvider('sha1', 'cryptojs'); + * // for RIPEMD160 + * md.setAlgAndProvider('ripemd160', 'cryptojs'); + */ + this.setAlgAndProvider = function(alg, prov) { + if (alg != null && prov === undefined) prov = KJUR.crypto.Util.DEFAULTPROVIDER[alg]; + + // for cryptojs + if (':md5:sha1:sha224:sha256:sha384:sha512:ripemd160:'.indexOf(alg) != -1 && + prov == 'cryptojs') { + try { + this.md = eval(KJUR.crypto.Util.CRYPTOJSMESSAGEDIGESTNAME[alg]).create(); + } catch (ex) { + throw "setAlgAndProvider hash alg set fail alg=" + alg + "/" + ex; + } + this.updateString = function(str) { + this.md.update(str); + }; + this.updateHex = function(hex) { + var wHex = CryptoJS.enc.Hex.parse(hex); + this.md.update(wHex); + }; + this.digest = function() { + var hash = this.md.finalize(); + return hash.toString(CryptoJS.enc.Hex); + }; + this.digestString = function(str) { + this.updateString(str); + return this.digest(); + }; + this.digestHex = function(hex) { + this.updateHex(hex); + return this.digest(); + }; + } + if (':sha256:'.indexOf(alg) != -1 && + prov == 'sjcl') { + try { + this.md = new sjcl.hash.sha256(); + } catch (ex) { + throw "setAlgAndProvider hash alg set fail alg=" + alg + "/" + ex; + } + this.updateString = function(str) { + this.md.update(str); + }; + this.updateHex = function(hex) { + var baHex = sjcl.codec.hex.toBits(hex); + this.md.update(baHex); + }; + this.digest = function() { + var hash = this.md.finalize(); + return sjcl.codec.hex.fromBits(hash); + }; + this.digestString = function(str) { + this.updateString(str); + return this.digest(); + }; + this.digestHex = function(hex) { + this.updateHex(hex); + return this.digest(); + }; + } + }; + + /** + * update digest by specified string + * @name updateString + * @memberOf KJUR.crypto.MessageDigest + * @function + * @param {String} str string to update + * @description + * @example + * md.updateString('New York'); + */ + this.updateString = function(str) { + throw "updateString(str) not supported for this alg/prov: " + this.algName + "/" + this.provName; + }; + + /** + * update digest by specified hexadecimal string + * @name updateHex + * @memberOf KJUR.crypto.MessageDigest + * @function + * @param {String} hex hexadecimal string to update + * @description + * @example + * md.updateHex('0afe36'); + */ + this.updateHex = function(hex) { + throw "updateHex(hex) not supported for this alg/prov: " + this.algName + "/" + this.provName; + }; + + /** + * completes hash calculation and returns hash result + * @name digest + * @memberOf KJUR.crypto.MessageDigest + * @function + * @description + * @example + * md.digest() + */ + this.digest = function() { + throw "digest() not supported for this alg/prov: " + this.algName + "/" + this.provName; + }; + + /** + * performs final update on the digest using string, then completes the digest computation + * @name digestString + * @memberOf KJUR.crypto.MessageDigest + * @function + * @param {String} str string to final update + * @description + * @example + * md.digestString('aaa') + */ + this.digestString = function(str) { + throw "digestString(str) not supported for this alg/prov: " + this.algName + "/" + this.provName; + }; + + /** + * performs final update on the digest using hexadecimal string, then completes the digest computation + * @name digestHex + * @memberOf KJUR.crypto.MessageDigest + * @function + * @param {String} hex hexadecimal string to final update + * @description + * @example + * md.digestHex('0f2abd') + */ + this.digestHex = function(hex) { + throw "digestHex(hex) not supported for this alg/prov: " + this.algName + "/" + this.provName; + }; + + if (params !== undefined) { + if (params['alg'] !== undefined) { + this.algName = params['alg']; + if (params['prov'] === undefined) + this.provName = KJUR.crypto.Util.DEFAULTPROVIDER[this.algName]; + this.setAlgAndProvider(this.algName, this.provName); + } + } +}; + +/** + * Mac(Message Authentication Code) class which is very similar to java.security.Mac class + * @name KJUR.crypto.Mac + * @class Mac class which is very similar to java.security.Mac class + * @param {Array} params parameters for constructor + * @description + *
+ * Currently this supports following algorithm and providers combination: + * + * NOTE: HmacSHA224 and HmacSHA384 issue was fixed since jsrsasign 4.1.4. + * Please use 'ext/cryptojs-312-core-fix*.js' instead of 'core.js' of original CryptoJS + * to avoid those issue. + * @example + * var mac = new KJUR.crypto.Mac({alg: "HmacSHA1", prov: "cryptojs", "pass": "pass"}); + * mac.updateString('aaa') + * var macHex = md.doFinal() + */ +KJUR.crypto.Mac = function(params) { + var mac = null; + var pass = null; + var algName = null; + var provName = null; + var algProv = null; + + this.setAlgAndProvider = function(alg, prov) { + if (alg == null) alg = "hmacsha1"; + + alg = alg.toLowerCase(); + if (alg.substr(0, 4) != "hmac") { + throw "setAlgAndProvider unsupported HMAC alg: " + alg; + } + + if (prov === undefined) prov = KJUR.crypto.Util.DEFAULTPROVIDER[alg]; + this.algProv = alg + "/" + prov; + + var hashAlg = alg.substr(4); + + // for cryptojs + if (':md5:sha1:sha224:sha256:sha384:sha512:ripemd160:'.indexOf(hashAlg) != -1 && + prov == 'cryptojs') { + try { + var mdObj = eval(KJUR.crypto.Util.CRYPTOJSMESSAGEDIGESTNAME[hashAlg]); + this.mac = CryptoJS.algo.HMAC.create(mdObj, this.pass); + } catch (ex) { + throw "setAlgAndProvider hash alg set fail hashAlg=" + hashAlg + "/" + ex; + } + this.updateString = function(str) { + this.mac.update(str); + }; + this.updateHex = function(hex) { + var wHex = CryptoJS.enc.Hex.parse(hex); + this.mac.update(wHex); + }; + this.doFinal = function() { + var hash = this.mac.finalize(); + return hash.toString(CryptoJS.enc.Hex); + }; + this.doFinalString = function(str) { + this.updateString(str); + return this.doFinal(); + }; + this.doFinalHex = function(hex) { + this.updateHex(hex); + return this.doFinal(); + }; + } + }; + + /** + * update digest by specified string + * @name updateString + * @memberOf KJUR.crypto.Mac + * @function + * @param {String} str string to update + * @description + * @example + * md.updateString('New York'); + */ + this.updateString = function(str) { + throw "updateString(str) not supported for this alg/prov: " + this.algProv; + }; + + /** + * update digest by specified hexadecimal string + * @name updateHex + * @memberOf KJUR.crypto.Mac + * @function + * @param {String} hex hexadecimal string to update + * @description + * @example + * md.updateHex('0afe36'); + */ + this.updateHex = function(hex) { + throw "updateHex(hex) not supported for this alg/prov: " + this.algProv; + }; + + /** + * completes hash calculation and returns hash result + * @name doFinal + * @memberOf KJUR.crypto.Mac + * @function + * @description + * @example + * md.digest() + */ + this.doFinal = function() { + throw "digest() not supported for this alg/prov: " + this.algProv; + }; + + /** + * performs final update on the digest using string, then completes the digest computation + * @name doFinalString + * @memberOf KJUR.crypto.Mac + * @function + * @param {String} str string to final update + * @description + * @example + * md.digestString('aaa') + */ + this.doFinalString = function(str) { + throw "digestString(str) not supported for this alg/prov: " + this.algProv; + }; + + /** + * performs final update on the digest using hexadecimal string, + * then completes the digest computation + * @name doFinalHex + * @memberOf KJUR.crypto.Mac + * @function + * @param {String} hex hexadecimal string to final update + * @description + * @example + * md.digestHex('0f2abd') + */ + this.doFinalHex = function(hex) { + throw "digestHex(hex) not supported for this alg/prov: " + this.algProv; + }; + + if (params !== undefined) { + if (params['pass'] !== undefined) { + this.pass = params['pass']; + } + if (params['alg'] !== undefined) { + this.algName = params['alg']; + if (params['prov'] === undefined) + this.provName = KJUR.crypto.Util.DEFAULTPROVIDER[this.algName]; + this.setAlgAndProvider(this.algName, this.provName); + } + } +}; + +/** + * Signature class which is very similar to java.security.Signature class + * @name KJUR.crypto.Signature + * @class Signature class which is very similar to java.security.Signature class + * @param {Array} params parameters for constructor + * @property {String} state Current state of this signature object whether 'SIGN', 'VERIFY' or null + * @description + *
+ * As for params of constructor's argument, it can be specify following attributes: + * + *

SUPPORTED ALGORITHMS AND PROVIDERS

+ * This Signature class supports following signature algorithm and provider names: + * + * Here are supported elliptic cryptographic curve names and their aliases for ECDSA: + * + * NOTE1: DSA signing algorithm is also supported since crypto 1.1.5. + *

EXAMPLES

+ * @example + * // RSA signature generation + * var sig = new KJUR.crypto.Signature({"alg": "SHA1withRSA"}); + * sig.init(prvKeyPEM); + * sig.updateString('aaa'); + * var hSigVal = sig.sign(); + * + * // DSA signature validation + * var sig2 = new KJUR.crypto.Signature({"alg": "SHA1withDSA"}); + * sig2.init(certPEM); + * sig.updateString('aaa'); + * var isValid = sig2.verify(hSigVal); + * + * // ECDSA signing + * var sig = new KJUR.crypto.Signature({'alg':'SHA1withECDSA'}); + * sig.init(prvKeyPEM); + * sig.updateString('aaa'); + * var sigValueHex = sig.sign(); + * + * // ECDSA verifying + * var sig2 = new KJUR.crypto.Signature({'alg':'SHA1withECDSA'}); + * sig.init(certPEM); + * sig.updateString('aaa'); + * var isValid = sig.verify(sigValueHex); + */ +KJUR.crypto.Signature = function(params) { + var prvKey = null; // RSAKey/KJUR.crypto.{ECDSA,DSA} object for signing + var pubKey = null; // RSAKey/KJUR.crypto.{ECDSA,DSA} object for verifying + + var md = null; // KJUR.crypto.MessageDigest object + var sig = null; + var algName = null; + var provName = null; + var algProvName = null; + var mdAlgName = null; + var pubkeyAlgName = null; // rsa,ecdsa,rsaandmgf1(=rsapss) + var state = null; + var pssSaltLen = -1; + var initParams = null; + + var sHashHex = null; // hex hash value for hex + var hDigestInfo = null; + var hPaddedDigestInfo = null; + var hSign = null; + + this._setAlgNames = function() { + if (this.algName.match(/^(.+)with(.+)$/)) { + this.mdAlgName = RegExp.$1.toLowerCase(); + this.pubkeyAlgName = RegExp.$2.toLowerCase(); + } + }; + + this._zeroPaddingOfSignature = function(hex, bitLength) { + var s = ""; + var nZero = bitLength / 4 - hex.length; + for (var i = 0; i < nZero; i++) { + s = s + "0"; + } + return s + hex; + }; + + /** + * set signature algorithm and provider + * @name setAlgAndProvider + * @memberOf KJUR.crypto.Signature + * @function + * @param {String} alg signature algorithm name + * @param {String} prov provider name + * @description + * @example + * md.setAlgAndProvider('SHA1withRSA', 'cryptojs/jsrsa'); + */ + this.setAlgAndProvider = function(alg, prov) { + this._setAlgNames(); + if (prov != 'cryptojs/jsrsa') + throw "provider not supported: " + prov; + + if (':md5:sha1:sha224:sha256:sha384:sha512:ripemd160:'.indexOf(this.mdAlgName) != -1) { + try { + this.md = new KJUR.crypto.MessageDigest({'alg':this.mdAlgName}); + } catch (ex) { + throw "setAlgAndProvider hash alg set fail alg=" + + this.mdAlgName + "/" + ex; + } + + this.init = function(keyparam, pass) { + var keyObj = null; + try { + if (pass === undefined) { + keyObj = KEYUTIL.getKey(keyparam); + } else { + keyObj = KEYUTIL.getKey(keyparam, pass); + } + } catch (ex) { + throw "init failed:" + ex; + } + + if (keyObj.isPrivate === true) { + this.prvKey = keyObj; + this.state = "SIGN"; + } else if (keyObj.isPublic === true) { + this.pubKey = keyObj; + this.state = "VERIFY"; + } else { + throw "init failed.:" + keyObj; + } + }; + + this.initSign = function(params) { + if (typeof params['ecprvhex'] == 'string' && + typeof params['eccurvename'] == 'string') { + this.ecprvhex = params['ecprvhex']; + this.eccurvename = params['eccurvename']; + } else { + this.prvKey = params; + } + this.state = "SIGN"; + }; + + this.initVerifyByPublicKey = function(params) { + if (typeof params['ecpubhex'] == 'string' && + typeof params['eccurvename'] == 'string') { + this.ecpubhex = params['ecpubhex']; + this.eccurvename = params['eccurvename']; + } else if (params instanceof KJUR.crypto.ECDSA) { + this.pubKey = params; + } else if (params instanceof RSAKey) { + this.pubKey = params; + } + this.state = "VERIFY"; + }; + + this.initVerifyByCertificatePEM = function(certPEM) { + var x509 = new X509(); + x509.readCertPEM(certPEM); + this.pubKey = x509.subjectPublicKeyRSA; + this.state = "VERIFY"; + }; + + this.updateString = function(str) { + this.md.updateString(str); + }; + this.updateHex = function(hex) { + this.md.updateHex(hex); + }; + + this.sign = function() { + this.sHashHex = this.md.digest(); + if (typeof this.ecprvhex != "undefined" && + typeof this.eccurvename != "undefined") { + var ec = new KJUR.crypto.ECDSA({'curve': this.eccurvename}); + this.hSign = ec.signHex(this.sHashHex, this.ecprvhex); + } else if (this.pubkeyAlgName == "rsaandmgf1") { + this.hSign = this.prvKey.signWithMessageHashPSS(this.sHashHex, + this.mdAlgName, + this.pssSaltLen); + } else if (this.pubkeyAlgName == "rsa") { + this.hSign = this.prvKey.signWithMessageHash(this.sHashHex, + this.mdAlgName); + } else if (this.prvKey instanceof KJUR.crypto.ECDSA) { + this.hSign = this.prvKey.signWithMessageHash(this.sHashHex); + } else if (this.prvKey instanceof KJUR.crypto.DSA) { + this.hSign = this.prvKey.signWithMessageHash(this.sHashHex); + } else { + throw "Signature: unsupported public key alg: " + this.pubkeyAlgName; + } + return this.hSign; + }; + this.signString = function(str) { + this.updateString(str); + this.sign(); + }; + this.signHex = function(hex) { + this.updateHex(hex); + this.sign(); + }; + this.verify = function(hSigVal) { + this.sHashHex = this.md.digest(); + if (typeof this.ecpubhex != "undefined" && + typeof this.eccurvename != "undefined") { + var ec = new KJUR.crypto.ECDSA({curve: this.eccurvename}); + return ec.verifyHex(this.sHashHex, hSigVal, this.ecpubhex); + } else if (this.pubkeyAlgName == "rsaandmgf1") { + return this.pubKey.verifyWithMessageHashPSS(this.sHashHex, hSigVal, + this.mdAlgName, + this.pssSaltLen); + } else if (this.pubkeyAlgName == "rsa") { + return this.pubKey.verifyWithMessageHash(this.sHashHex, hSigVal); + } else if (this.pubKey instanceof KJUR.crypto.ECDSA) { + return this.pubKey.verifyWithMessageHash(this.sHashHex, hSigVal); + } else if (this.pubKey instanceof KJUR.crypto.DSA) { + return this.pubKey.verifyWithMessageHash(this.sHashHex, hSigVal); + } else { + throw "Signature: unsupported public key alg: " + this.pubkeyAlgName; + } + }; + } + }; + + /** + * Initialize this object for signing or verifying depends on key + * @name init + * @memberOf KJUR.crypto.Signature + * @function + * @param {Object} key specifying public or private key as plain/encrypted PKCS#5/8 PEM file, certificate PEM or {@link RSAKey}, {@link KJUR.crypto.DSA} or {@link KJUR.crypto.ECDSA} object + * @param {String} pass (OPTION) passcode for encrypted private key + * @since crypto 1.1.3 + * @description + * This method is very useful initialize method for Signature class since + * you just specify key then this method will automatically initialize it + * using {@link KEYUTIL.getKey} method. + * As for 'key', following argument type are supported: + *
signing
+ * + *
verification
+ * + * @example + * sig.init(sCertPEM) + */ + this.init = function(key, pass) { + throw "init(key, pass) not supported for this alg:prov=" + + this.algProvName; + }; + + /** + * Initialize this object for verifying with a public key + * @name initVerifyByPublicKey + * @memberOf KJUR.crypto.Signature + * @function + * @param {Object} param RSAKey object of public key or associative array for ECDSA + * @since 1.0.2 + * @deprecated from crypto 1.1.5. please use init() method instead. + * @description + * Public key information will be provided as 'param' parameter and the value will be + * following: + * + * @example + * sig.initVerifyByPublicKey(rsaPrvKey) + */ + this.initVerifyByPublicKey = function(rsaPubKey) { + throw "initVerifyByPublicKey(rsaPubKeyy) not supported for this alg:prov=" + + this.algProvName; + }; + + /** + * Initialize this object for verifying with a certficate + * @name initVerifyByCertificatePEM + * @memberOf KJUR.crypto.Signature + * @function + * @param {String} certPEM PEM formatted string of certificate + * @since 1.0.2 + * @deprecated from crypto 1.1.5. please use init() method instead. + * @description + * @example + * sig.initVerifyByCertificatePEM(certPEM) + */ + this.initVerifyByCertificatePEM = function(certPEM) { + throw "initVerifyByCertificatePEM(certPEM) not supported for this alg:prov=" + + this.algProvName; + }; + + /** + * Initialize this object for signing + * @name initSign + * @memberOf KJUR.crypto.Signature + * @function + * @param {Object} param RSAKey object of public key or associative array for ECDSA + * @deprecated from crypto 1.1.5. please use init() method instead. + * @description + * Private key information will be provided as 'param' parameter and the value will be + * following: + * + * @example + * sig.initSign(prvKey) + */ + this.initSign = function(prvKey) { + throw "initSign(prvKey) not supported for this alg:prov=" + this.algProvName; + }; + + /** + * Updates the data to be signed or verified by a string + * @name updateString + * @memberOf KJUR.crypto.Signature + * @function + * @param {String} str string to use for the update + * @description + * @example + * sig.updateString('aaa') + */ + this.updateString = function(str) { + throw "updateString(str) not supported for this alg:prov=" + this.algProvName; + }; + + /** + * Updates the data to be signed or verified by a hexadecimal string + * @name updateHex + * @memberOf KJUR.crypto.Signature + * @function + * @param {String} hex hexadecimal string to use for the update + * @description + * @example + * sig.updateHex('1f2f3f') + */ + this.updateHex = function(hex) { + throw "updateHex(hex) not supported for this alg:prov=" + this.algProvName; + }; + + /** + * Returns the signature bytes of all data updates as a hexadecimal string + * @name sign + * @memberOf KJUR.crypto.Signature + * @function + * @return the signature bytes as a hexadecimal string + * @description + * @example + * var hSigValue = sig.sign() + */ + this.sign = function() { + throw "sign() not supported for this alg:prov=" + this.algProvName; + }; + + /** + * performs final update on the sign using string, then returns the signature bytes of all data updates as a hexadecimal string + * @name signString + * @memberOf KJUR.crypto.Signature + * @function + * @param {String} str string to final update + * @return the signature bytes of a hexadecimal string + * @description + * @example + * var hSigValue = sig.signString('aaa') + */ + this.signString = function(str) { + throw "digestString(str) not supported for this alg:prov=" + this.algProvName; + }; + + /** + * performs final update on the sign using hexadecimal string, then returns the signature bytes of all data updates as a hexadecimal string + * @name signHex + * @memberOf KJUR.crypto.Signature + * @function + * @param {String} hex hexadecimal string to final update + * @return the signature bytes of a hexadecimal string + * @description + * @example + * var hSigValue = sig.signHex('1fdc33') + */ + this.signHex = function(hex) { + throw "digestHex(hex) not supported for this alg:prov=" + this.algProvName; + }; + + /** + * verifies the passed-in signature. + * @name verify + * @memberOf KJUR.crypto.Signature + * @function + * @param {String} str string to final update + * @return {Boolean} true if the signature was verified, otherwise false + * @description + * @example + * var isValid = sig.verify('1fbcefdca4823a7(snip)') + */ + this.verify = function(hSigVal) { + throw "verify(hSigVal) not supported for this alg:prov=" + this.algProvName; + }; + + this.initParams = params; + + if (params !== undefined) { + if (params['alg'] !== undefined) { + this.algName = params['alg']; + if (params['prov'] === undefined) { + this.provName = KJUR.crypto.Util.DEFAULTPROVIDER[this.algName]; + } else { + this.provName = params['prov']; + } + this.algProvName = this.algName + ":" + this.provName; + this.setAlgAndProvider(this.algName, this.provName); + this._setAlgNames(); + } + + if (params['psssaltlen'] !== undefined) this.pssSaltLen = params['psssaltlen']; + + if (params['prvkeypem'] !== undefined) { + if (params['prvkeypas'] !== undefined) { + throw "both prvkeypem and prvkeypas parameters not supported"; + } else { + try { + var prvKey = new RSAKey(); + prvKey.readPrivateKeyFromPEMString(params['prvkeypem']); + this.initSign(prvKey); + } catch (ex) { + throw "fatal error to load pem private key: " + ex; + } + } + } + } +}; + +/** + * static object for cryptographic function utilities + * @name KJUR.crypto.OID + * @class static object for cryptography related OIDs + * @property {Array} oidhex2name key value of hexadecimal OID and its name + * (ex. '2a8648ce3d030107' and 'secp256r1') + * @since crypto 1.1.3 + * @description + */ + + +KJUR.crypto.OID = new function() { + this.oidhex2name = { + '2a864886f70d010101': 'rsaEncryption', + '2a8648ce3d0201': 'ecPublicKey', + '2a8648ce380401': 'dsa', + '2a8648ce3d030107': 'secp256r1', + '2b8104001f': 'secp192k1', + '2b81040021': 'secp224r1', + '2b8104000a': 'secp256k1', + '2b81040023': 'secp521r1', + '2b81040022': 'secp384r1', + '2a8648ce380403': 'SHA1withDSA', // 1.2.840.10040.4.3 + '608648016503040301': 'SHA224withDSA', // 2.16.840.1.101.3.4.3.1 + '608648016503040302': 'SHA256withDSA' // 2.16.840.1.101.3.4.3.2 + }; +}; diff --git a/js/hex_sha1_js.js b/js/hex_sha1_js.js new file mode 100644 index 0000000..ee73a63 --- /dev/null +++ b/js/hex_sha1_js.js @@ -0,0 +1,202 @@ +/* + * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined + * in FIPS PUB 180-1 + * Version 2.1a Copyright Paul Johnston 2000 - 2002. + * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet + * Distributed under the BSD License + * See http://pajhome.org.uk/crypt/md5 for details. + */ + +/* + * Configurable variables. You may need to tweak these to be compatible with + * the server-side, but the defaults work in most cases. + */ +var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */ +var b64pad = "="; /* base-64 pad character. "=" for strict RFC compliance */ +var chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode */ + +/* + * These are the functions you'll usually want to call + * They take string arguments and return either hex or base-64 encoded strings + */ +function hex_sha1(s){return binb2hex(core_sha1(str2binb(s),s.length * chrsz));} +function b64_sha1(s){return binb2b64(core_sha1(str2binb(s),s.length * chrsz));} +function str_sha1(s){return binb2str(core_sha1(str2binb(s),s.length * chrsz));} +function hex_hmac_sha1(key, data){ return binb2hex(core_hmac_sha1(key, data));} +function b64_hmac_sha1(key, data){ return binb2b64(core_hmac_sha1(key, data));} +function str_hmac_sha1(key, data){ return binb2str(core_hmac_sha1(key, data));} + +/* + * Perform a simple self-test to see if the VM is working + */ +function sha1_vm_test() +{ + return hex_sha1("abc") == "a9993e364706816aba3e25717850c26c9cd0d89d"; +} + +/* + * Calculate the SHA-1 of an array of big-endian words, and a bit length + */ +function core_sha1(x, len) +{ + /* append padding */ + x[len >> 5] |= 0x80 << (24 - len % 32); + x[((len + 64 >> 9) << 4) + 15] = len; + + var w = Array(80); + var a = 1732584193; + var b = -271733879; + var c = -1732584194; + var d = 271733878; + var e = -1009589776; + + for(var i = 0; i < x.length; i += 16) + { + var olda = a; + var oldb = b; + var oldc = c; + var oldd = d; + var olde = e; + + for(var j = 0; j < 80; j++) + { + if(j < 16) w[j] = x[i + j]; + else w[j] = rol(w[j-3] ^ w[j-8] ^ w[j-14] ^ w[j-16], 1); + var t = safe_add(safe_add(rol(a, 5), sha1_ft(j, b, c, d)), + safe_add(safe_add(e, w[j]), sha1_kt(j))); + e = d; + d = c; + c = rol(b, 30); + b = a; + a = t; + } + + a = safe_add(a, olda); + b = safe_add(b, oldb); + c = safe_add(c, oldc); + d = safe_add(d, oldd); + e = safe_add(e, olde); + } + return Array(a, b, c, d, e); + +} + +/* + * Perform the appropriate triplet combination function for the current + * iteration + */ +function sha1_ft(t, b, c, d) +{ + if(t < 20) return (b & c) | ((~b) & d); + if(t < 40) return b ^ c ^ d; + if(t < 60) return (b & c) | (b & d) | (c & d); + return b ^ c ^ d; +} + +/* + * Determine the appropriate additive constant for the current iteration + */ +function sha1_kt(t) +{ + return (t < 20) ? 1518500249 : (t < 40) ? 1859775393 : + (t < 60) ? -1894007588 : -899497514; +} + +/* + * Calculate the HMAC-SHA1 of a key and some data + */ +function core_hmac_sha1(key, data) +{ + var bkey = str2binb(key); + if(bkey.length > 16) bkey = core_sha1(bkey, key.length * chrsz); + + var ipad = Array(16), opad = Array(16); + for(var i = 0; i < 16; i++) + { + ipad[i] = bkey[i] ^ 0x36363636; + opad[i] = bkey[i] ^ 0x5C5C5C5C; + } + + var hash = core_sha1(ipad.concat(str2binb(data)), 512 + data.length * chrsz); + return core_sha1(opad.concat(hash), 512 + 160); +} + +/* + * Add integers, wrapping at 2^32. This uses 16-bit operations internally + * to work around bugs in some JS interpreters. + */ +function safe_add(x, y) +{ + var lsw = (x & 0xFFFF) + (y & 0xFFFF); + var msw = (x >> 16) + (y >> 16) + (lsw >> 16); + return (msw << 16) | (lsw & 0xFFFF); +} + +/* + * Bitwise rotate a 32-bit number to the left. + */ +function rol(num, cnt) +{ + return (num << cnt) | (num >>> (32 - cnt)); +} + +/* + * Convert an 8-bit or 16-bit string to an array of big-endian words + * In 8-bit function, characters >255 have their hi-byte silently ignored. + */ +function str2binb(str) +{ + var bin = Array(); + var mask = (1 << chrsz) - 1; + for(var i = 0; i < str.length * chrsz; i += chrsz) + bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (32 - chrsz - i%32); + return bin; +} + +/* + * Convert an array of big-endian words to a string + */ +function binb2str(bin) +{ + var str = ""; + var mask = (1 << chrsz) - 1; + for(var i = 0; i < bin.length * 32; i += chrsz) + str += String.fromCharCode((bin[i>>5] >>> (32 - chrsz - i%32)) & mask); + return str; +} + +/* + * Convert an array of big-endian words to a hex string. + */ +function binb2hex(binarray) +{ + var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef"; + var str = ""; + for(var i = 0; i < binarray.length * 4; i++) + { + str += hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8+4)) & 0xF) + + hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8 )) & 0xF); + } + return str; +} + +/* + * Convert an array of big-endian words to a base-64 string + */ +function binb2b64(binarray) +{ + var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; + var str = ""; + for(var i = 0; i < binarray.length * 4; i += 3) + { + var triplet = (((binarray[i >> 2] >> 8 * (3 - i %4)) & 0xFF) << 16) + | (((binarray[i+1 >> 2] >> 8 * (3 - (i+1)%4)) & 0xFF) << 8 ) + | ((binarray[i+2 >> 2] >> 8 * (3 - (i+2)%4)) & 0xFF); + for(var j = 0; j < 4; j++) + { + if(i * 8 + j * 6 > binarray.length * 32) str += b64pad; + else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F); + } + } + return str; +} diff --git a/js/jsbn.js b/js/jsbn.js new file mode 100644 index 0000000..4e81b02 --- /dev/null +++ b/js/jsbn.js @@ -0,0 +1,561 @@ +/*! (c) Tom Wu | http://www-cs-students.stanford.edu/~tjw/jsbn/ + */ +// Copyright (c) 2005 Tom Wu +// All Rights Reserved. +// See "LICENSE" for details. + +// Basic JavaScript BN library - subset useful for RSA encryption. + +// Bits per digit +var dbits; + +// JavaScript engine analysis +var canary = 0xdeadbeefcafe; +var j_lm = ((canary&0xffffff)==0xefcafe); + +// (public) Constructor +function BigInteger(a,b,c) { + if(a != null) + if("number" == typeof a) this.fromNumber(a,b,c); + else if(b == null && "string" != typeof a) this.fromString(a,256); + else this.fromString(a,b); +} + +// return new, unset BigInteger +function nbi() { return new BigInteger(null); } + +// am: Compute w_j += (x*this_i), propagate carries, +// c is initial carry, returns final carry. +// c < 3*dvalue, x < 2*dvalue, this_i < dvalue +// We need to select the fastest one that works in this environment. + +// am1: use a single mult and divide to get the high bits, +// max digit bits should be 26 because +// max internal value = 2*dvalue^2-2*dvalue (< 2^53) +function am1(i,x,w,j,c,n) { + while(--n >= 0) { + var v = x*this[i++]+w[j]+c; + c = Math.floor(v/0x4000000); + w[j++] = v&0x3ffffff; + } + return c; +} +// am2 avoids a big mult-and-extract completely. +// Max digit bits should be <= 30 because we do bitwise ops +// on values up to 2*hdvalue^2-hdvalue-1 (< 2^31) +function am2(i,x,w,j,c,n) { + var xl = x&0x7fff, xh = x>>15; + while(--n >= 0) { + var l = this[i]&0x7fff; + var h = this[i++]>>15; + var m = xh*l+h*xl; + l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff); + c = (l>>>30)+(m>>>15)+xh*h+(c>>>30); + w[j++] = l&0x3fffffff; + } + return c; +} +// Alternately, set max digit bits to 28 since some +// browsers slow down when dealing with 32-bit numbers. +function am3(i,x,w,j,c,n) { + var xl = x&0x3fff, xh = x>>14; + while(--n >= 0) { + var l = this[i]&0x3fff; + var h = this[i++]>>14; + var m = xh*l+h*xl; + l = xl*l+((m&0x3fff)<<14)+w[j]+c; + c = (l>>28)+(m>>14)+xh*h; + w[j++] = l&0xfffffff; + } + return c; +} +if(j_lm ) { + BigInteger.prototype.am = am2; + dbits = 30; +} + + + + + + + + + +BigInteger.prototype.DB = dbits; +BigInteger.prototype.DM = ((1<= 0; --i) r[i] = this[i]; + r.t = this.t; + r.s = this.s; +} + +// (protected) set from integer value x, -DV <= x < DV +function bnpFromInt(x) { + this.t = 1; + this.s = (x<0)?-1:0; + if(x > 0) this[0] = x; + else if(x < -1) this[0] = x+this.DV; + else this.t = 0; +} + +// return bigint initialized to value +function nbv(i) { var r = nbi(); r.fromInt(i); return r; } + +// (protected) set from string and radix +function bnpFromString(s,b) { + var k; + if(b == 16) k = 4; + else if(b == 8) k = 3; + else if(b == 256) k = 8; // byte array + else if(b == 2) k = 1; + else if(b == 32) k = 5; + else if(b == 4) k = 2; + else { this.fromRadix(s,b); return; } + this.t = 0; + this.s = 0; + var i = s.length, mi = false, sh = 0; + while(--i >= 0) { + var x = (k==8)?s[i]&0xff:intAt(s,i); + if(x < 0) { + if(s.charAt(i) == "-") mi = true; + continue; + } + mi = false; + if(sh == 0) + this[this.t++] = x; + else if(sh+k > this.DB) { + this[this.t-1] |= (x&((1<<(this.DB-sh))-1))<>(this.DB-sh)); + } + else + this[this.t-1] |= x<= this.DB) sh -= this.DB; + } + if(k == 8 && (s[0]&0x80) != 0) { + this.s = -1; + if(sh > 0) this[this.t-1] |= ((1<<(this.DB-sh))-1)< 0 && this[this.t-1] == c) --this.t; +} + +// (public) return string representation in given radix +function bnToString(b) { + if(this.s < 0) return "-"+this.negate().toString(b); + var k; + if(b == 16) k = 4; + else if(b == 8) k = 3; + else if(b == 2) k = 1; + else if(b == 32) k = 5; + else if(b == 4) k = 2; + else return this.toRadix(b); + var km = (1< 0) { + if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); } + while(i >= 0) { + if(p < k) { + d = (this[i]&((1<>(p+=this.DB-k); + } + else { + d = (this[i]>>(p-=k))&km; + if(p <= 0) { p += this.DB; --i; } + } + if(d > 0) m = true; + if(m) r += int2char(d); + } + } + return m?r:"0"; +} + +// (public) -this +function bnNegate() { var r = nbi(); BigInteger.ZERO.subTo(this,r); return r; } + +// (public) |this| +function bnAbs() { return (this.s<0)?this.negate():this; } + +// (public) return + if this > a, - if this < a, 0 if equal +function bnCompareTo(a) { + var r = this.s-a.s; + if(r != 0) return r; + var i = this.t; + r = i-a.t; + if(r != 0) return (this.s<0)?-r:r; + while(--i >= 0) if((r=this[i]-a[i]) != 0) return r; + return 0; +} + +// returns bit length of the integer x +function nbits(x) { + var r = 1, t; + if((t=x>>>16) != 0) { x = t; r += 16; } + if((t=x>>8) != 0) { x = t; r += 8; } + if((t=x>>4) != 0) { x = t; r += 4; } + if((t=x>>2) != 0) { x = t; r += 2; } + if((t=x>>1) != 0) { x = t; r += 1; } + return r; +} + +// (public) return the number of bits in "this" +function bnBitLength() { + if(this.t <= 0) return 0; + return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM)); +} + +// (protected) r = this << n*DB +function bnpDLShiftTo(n,r) { + var i; + for(i = this.t-1; i >= 0; --i) r[i+n] = this[i]; + for(i = n-1; i >= 0; --i) r[i] = 0; + r.t = this.t+n; + r.s = this.s; +} + +// (protected) r = this >> n*DB +function bnpDRShiftTo(n,r) { + for(var i = n; i < this.t; ++i) r[i-n] = this[i]; + r.t = Math.max(this.t-n,0); + r.s = this.s; +} + +// (protected) r = this << n +function bnpLShiftTo(n,r) { + var bs = n%this.DB; + var cbs = this.DB-bs; + var bm = (1<= 0; --i) { + r[i+ds+1] = (this[i]>>cbs)|c; + c = (this[i]&bm)<= 0; --i) r[i] = 0; + r[ds] = c; + r.t = this.t+ds+1; + r.s = this.s; + r.clamp(); +} + +// (protected) r = this >> n +function bnpRShiftTo(n,r) { + r.s = this.s; + var ds = Math.floor(n/this.DB); + if(ds >= this.t) { r.t = 0; return; } + var bs = n%this.DB; + var cbs = this.DB-bs; + var bm = (1<>bs; + for(var i = ds+1; i < this.t; ++i) { + r[i-ds-1] |= (this[i]&bm)<>bs; + } + if(bs > 0) r[this.t-ds-1] |= (this.s&bm)<>= this.DB; + } + if(a.t < this.t) { + c -= a.s; + while(i < this.t) { + c += this[i]; + r[i++] = c&this.DM; + c >>= this.DB; + } + c += this.s; + } + else { + c += this.s; + while(i < a.t) { + c -= a[i]; + r[i++] = c&this.DM; + c >>= this.DB; + } + c -= a.s; + } + r.s = (c<0)?-1:0; + if(c < -1) r[i++] = this.DV+c; + else if(c > 0) r[i++] = c; + r.t = i; + r.clamp(); +} + +// (protected) r = this * a, r != this,a (HAC 14.12) +// "this" should be the larger one if appropriate. +function bnpMultiplyTo(a,r) { + var x = this.abs(), y = a.abs(); + var i = x.t; + r.t = i+y.t; + while(--i >= 0) r[i] = 0; + for(i = 0; i < y.t; ++i) r[i+x.t] = x.am(0,y[i],r,i,0,x.t); + r.s = 0; + r.clamp(); + if(this.s != a.s) BigInteger.ZERO.subTo(r,r); +} + +// (protected) r = this^2, r != this (HAC 14.16) +function bnpSquareTo(r) { + var x = this.abs(); + var i = r.t = 2*x.t; + while(--i >= 0) r[i] = 0; + for(i = 0; i < x.t-1; ++i) { + var c = x.am(i,x[i],r,2*i,0,1); + if((r[i+x.t]+=x.am(i+1,2*x[i],r,2*i+1,c,x.t-i-1)) >= x.DV) { + r[i+x.t] -= x.DV; + r[i+x.t+1] = 1; + } + } + if(r.t > 0) r[r.t-1] += x.am(i,x[i],r,2*i,0,1); + r.s = 0; + r.clamp(); +} + +// (protected) divide this by m, quotient and remainder to q, r (HAC 14.20) +// r != q, this != m. q or r may be null. +function bnpDivRemTo(m,q,r) { + var pm = m.abs(); + if(pm.t <= 0) return; + var pt = this.abs(); + if(pt.t < pm.t) { + if(q != null) q.fromInt(0); + if(r != null) this.copyTo(r); + return; + } + if(r == null) r = nbi(); + var y = nbi(), ts = this.s, ms = m.s; + var nsh = this.DB-nbits(pm[pm.t-1]); // normalize modulus + if(nsh > 0) { pm.lShiftTo(nsh,y); pt.lShiftTo(nsh,r); } + else { pm.copyTo(y); pt.copyTo(r); } + var ys = y.t; + var y0 = y[ys-1]; + if(y0 == 0) return; + var yt = y0*(1<1)?y[ys-2]>>this.F2:0); + var d1 = this.FV/yt, d2 = (1<= 0) { + r[r.t++] = 1; + r.subTo(t,r); + } + BigInteger.ONE.dlShiftTo(ys,t); + t.subTo(y,y); // "negative" y so we can replace sub with am later + while(y.t < ys) y[y.t++] = 0; + while(--j >= 0) { + // Estimate quotient digit + var qd = (r[--i]==y0)?this.DM:Math.floor(r[i]*d1+(r[i-1]+e)*d2); + if((r[i]+=y.am(0,qd,r,j,0,ys)) < qd) { // Try it out + y.dlShiftTo(j,t); + r.subTo(t,r); + while(r[i] < --qd) r.subTo(t,r); + } + } + if(q != null) { + r.drShiftTo(ys,q); + if(ts != ms) BigInteger.ZERO.subTo(q,q); + } + r.t = ys; + r.clamp(); + if(nsh > 0) r.rShiftTo(nsh,r); // Denormalize remainder + if(ts < 0) BigInteger.ZERO.subTo(r,r); +} + +// (public) this mod a +function bnMod(a) { + var r = nbi(); + this.abs().divRemTo(a,null,r); + if(this.s < 0 && r.compareTo(BigInteger.ZERO) > 0) a.subTo(r,r); + return r; +} + +// Modular reduction using "classic" algorithm +function Classic(m) { this.m = m; } +function cConvert(x) { + if(x.s < 0 || x.compareTo(this.m) >= 0) return x.mod(this.m); + else return x; +} +function cRevert(x) { return x; } +function cReduce(x) { x.divRemTo(this.m,null,x); } +function cMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); } +function cSqrTo(x,r) { x.squareTo(r); this.reduce(r); } + +Classic.prototype.convert = cConvert; +Classic.prototype.revert = cRevert; +Classic.prototype.reduce = cReduce; +Classic.prototype.mulTo = cMulTo; +Classic.prototype.sqrTo = cSqrTo; + +// (protected) return "-1/this % 2^DB"; useful for Mont. reduction +// justification: +// xy == 1 (mod m) +// xy = 1+km +// xy(2-xy) = (1+km)(1-km) +// x[y(2-xy)] = 1-k^2m^2 +// x[y(2-xy)] == 1 (mod m^2) +// if y is 1/x mod m, then y(2-xy) is 1/x mod m^2 +// should reduce x and y(2-xy) by m^2 at each step to keep size bounded. +// JS multiply "overflows" differently from C/C++, so care is needed here. +function bnpInvDigit() { + if(this.t < 1) return 0; + var x = this[0]; + if((x&1) == 0) return 0; + var y = x&3; // y == 1/x mod 2^2 + y = (y*(2-(x&0xf)*y))&0xf; // y == 1/x mod 2^4 + y = (y*(2-(x&0xff)*y))&0xff; // y == 1/x mod 2^8 + y = (y*(2-(((x&0xffff)*y)&0xffff)))&0xffff; // y == 1/x mod 2^16 + // last step - calculate inverse mod DV directly; + // assumes 16 < DB <= 32 and assumes ability to handle 48-bit ints + y = (y*(2-x*y%this.DV))%this.DV; // y == 1/x mod 2^dbits + // we really want the negative inverse, and -DV < y < DV + return (y>0)?this.DV-y:-y; +} + +// Montgomery reduction +function Montgomery(m) { + this.m = m; + this.mp = m.invDigit(); + this.mpl = this.mp&0x7fff; + this.mph = this.mp>>15; + this.um = (1<<(m.DB-15))-1; + this.mt2 = 2*m.t; +} + +// xR mod m +function montConvert(x) { + var r = nbi(); + x.abs().dlShiftTo(this.m.t,r); + r.divRemTo(this.m,null,r); + if(x.s < 0 && r.compareTo(BigInteger.ZERO) > 0) this.m.subTo(r,r); + return r; +} + +// x/R mod m +function montRevert(x) { + var r = nbi(); + x.copyTo(r); + this.reduce(r); + return r; +} + +// x = x/R mod m (HAC 14.32) +function montReduce(x) { + while(x.t <= this.mt2) // pad x so am has enough room later + x[x.t++] = 0; + for(var i = 0; i < this.m.t; ++i) { + // faster way of calculating u0 = x[i]*mp mod DV + var j = x[i]&0x7fff; + var u0 = (j*this.mpl+(((j*this.mph+(x[i]>>15)*this.mpl)&this.um)<<15))&x.DM; + // use am to combine the multiply-shift-add into one call + j = i+this.m.t; + x[j] += this.m.am(0,u0,x,i,0,this.m.t); + // propagate carry + while(x[j] >= x.DV) { x[j] -= x.DV; x[++j]++; } + } + x.clamp(); + x.drShiftTo(this.m.t,x); + if(x.compareTo(this.m) >= 0) x.subTo(this.m,x); +} + +// r = "x^2/R mod m"; x != r +function montSqrTo(x,r) { x.squareTo(r); this.reduce(r); } + +// r = "xy/R mod m"; x,y != r +function montMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); } + +Montgomery.prototype.convert = montConvert; +Montgomery.prototype.revert = montRevert; +Montgomery.prototype.reduce = montReduce; +Montgomery.prototype.mulTo = montMulTo; +Montgomery.prototype.sqrTo = montSqrTo; + +// (protected) true iff this is even +function bnpIsEven() { return ((this.t>0)?(this[0]&1):this.s) == 0; } + +// (protected) this^e, e < 2^32, doing sqr and mul with "r" (HAC 14.79) +function bnpExp(e,z) { + if(e > 0xffffffff || e < 1) return BigInteger.ONE; + var r = nbi(), r2 = nbi(), g = z.convert(this), i = nbits(e)-1; + g.copyTo(r); + while(--i >= 0) { + z.sqrTo(r,r2); + if((e&(1< 0) z.mulTo(r2,g,r); + else { var t = r; r = r2; r2 = t; } + } + return z.revert(r); +} + +// (public) this^e % m, 0 <= e < 2^32 +function bnModPowInt(e,m) { + var z; + if(e < 256 || m.isEven()) z = new Classic(m); else z = new Montgomery(m); + return this.exp(e,z); +} + +// protected +BigInteger.prototype.copyTo = bnpCopyTo; +BigInteger.prototype.fromInt = bnpFromInt; +BigInteger.prototype.fromString = bnpFromString; +BigInteger.prototype.clamp = bnpClamp; +BigInteger.prototype.dlShiftTo = bnpDLShiftTo; +BigInteger.prototype.drShiftTo = bnpDRShiftTo; +BigInteger.prototype.lShiftTo = bnpLShiftTo; +BigInteger.prototype.rShiftTo = bnpRShiftTo; +BigInteger.prototype.subTo = bnpSubTo; +BigInteger.prototype.multiplyTo = bnpMultiplyTo; +BigInteger.prototype.squareTo = bnpSquareTo; +BigInteger.prototype.divRemTo = bnpDivRemTo; +BigInteger.prototype.invDigit = bnpInvDigit; +BigInteger.prototype.isEven = bnpIsEven; +BigInteger.prototype.exp = bnpExp; + +// public +BigInteger.prototype.toString = bnToString; +BigInteger.prototype.negate = bnNegate; +BigInteger.prototype.abs = bnAbs; +BigInteger.prototype.compareTo = bnCompareTo; +BigInteger.prototype.bitLength = bnBitLength; +BigInteger.prototype.mod = bnMod; +BigInteger.prototype.modPowInt = bnModPowInt; + +// "constants" +BigInteger.ZERO = nbv(0); +BigInteger.ONE = nbv(1); diff --git a/js/jsbn2.js b/js/jsbn2.js new file mode 100644 index 0000000..732ffae --- /dev/null +++ b/js/jsbn2.js @@ -0,0 +1,658 @@ +/*! (c) Tom Wu | http://www-cs-students.stanford.edu/~tjw/jsbn/ + */ +// Copyright (c) 2005-2009 Tom Wu +// All Rights Reserved. +// See "LICENSE" for details. + +// Extended JavaScript BN functions, required for RSA private ops. + +// Version 1.1: new BigInteger("0", 10) returns "proper" zero +// Version 1.2: square() API, isProbablePrime fix + +// (public) +function bnClone() { var r = nbi(); this.copyTo(r); return r; } + +// (public) return value as integer +function bnIntValue() { + if(this.s < 0) { + if(this.t == 1) return this[0]-this.DV; + else if(this.t == 0) return -1; + } + else if(this.t == 1) return this[0]; + else if(this.t == 0) return 0; + // assumes 16 < DB < 32 + return ((this[1]&((1<<(32-this.DB))-1))<>24; } + +// (public) return value as short (assumes DB>=16) +function bnShortValue() { return (this.t==0)?this.s:(this[0]<<16)>>16; } + +// (protected) return x s.t. r^x < DV +function bnpChunkSize(r) { return Math.floor(Math.LN2*this.DB/Math.log(r)); } + +// (public) 0 if this == 0, 1 if this > 0 +function bnSigNum() { + if(this.s < 0) return -1; + else if(this.t <= 0 || (this.t == 1 && this[0] <= 0)) return 0; + else return 1; +} + +// (protected) convert to radix string +function bnpToRadix(b) { + if(b == null) b = 10; + if(this.signum() == 0 || b < 2 || b > 36) return "0"; + var cs = this.chunkSize(b); + var a = Math.pow(b,cs); + var d = nbv(a), y = nbi(), z = nbi(), r = ""; + this.divRemTo(d,y,z); + while(y.signum() > 0) { + r = (a+z.intValue()).toString(b).substr(1) + r; + y.divRemTo(d,y,z); + } + return z.intValue().toString(b) + r; +} + +// (protected) convert from radix string +function bnpFromRadix(s,b) { + this.fromInt(0); + if(b == null) b = 10; + var cs = this.chunkSize(b); + var d = Math.pow(b,cs), mi = false, j = 0, w = 0; + for(var i = 0; i < s.length; ++i) { + var x = intAt(s,i); + if(x < 0) { + if(s.charAt(i) == "-" && this.signum() == 0) mi = true; + continue; + } + w = b*w+x; + if(++j >= cs) { + this.dMultiply(d); + this.dAddOffset(w,0); + j = 0; + w = 0; + } + } + if(j > 0) { + this.dMultiply(Math.pow(b,j)); + this.dAddOffset(w,0); + } + if(mi) BigInteger.ZERO.subTo(this,this); +} + +// (protected) alternate constructor +function bnpFromNumber(a,b,c) { + if("number" == typeof b) { + // new BigInteger(int,int,RNG) + if(a < 2) this.fromInt(1); + else { + this.fromNumber(a,c); + if(!this.testBit(a-1)) // force MSB set + this.bitwiseTo(BigInteger.ONE.shiftLeft(a-1),op_or,this); + if(this.isEven()) this.dAddOffset(1,0); // force odd + while(!this.isProbablePrime(b)) { + this.dAddOffset(2,0); + if(this.bitLength() > a) this.subTo(BigInteger.ONE.shiftLeft(a-1),this); + } + } + } + else { + // new BigInteger(int,RNG) + var x = new Array(), t = a&7; + x.length = (a>>3)+1; + b.nextBytes(x); + if(t > 0) x[0] &= ((1< 0) { + if(p < this.DB && (d = this[i]>>p) != (this.s&this.DM)>>p) + r[k++] = d|(this.s<<(this.DB-p)); + while(i >= 0) { + if(p < 8) { + d = (this[i]&((1<>(p+=this.DB-8); + } + else { + d = (this[i]>>(p-=8))&0xff; + if(p <= 0) { p += this.DB; --i; } + } + if((d&0x80) != 0) d |= -256; + if(k == 0 && (this.s&0x80) != (d&0x80)) ++k; + if(k > 0 || d != this.s) r[k++] = d; + } + } + return r; +} + +function bnEquals(a) { return(this.compareTo(a)==0); } +function bnMin(a) { return(this.compareTo(a)<0)?this:a; } +function bnMax(a) { return(this.compareTo(a)>0)?this:a; } + +// (protected) r = this op a (bitwise) +function bnpBitwiseTo(a,op,r) { + var i, f, m = Math.min(a.t,this.t); + for(i = 0; i < m; ++i) r[i] = op(this[i],a[i]); + if(a.t < this.t) { + f = a.s&this.DM; + for(i = m; i < this.t; ++i) r[i] = op(this[i],f); + r.t = this.t; + } + else { + f = this.s&this.DM; + for(i = m; i < a.t; ++i) r[i] = op(f,a[i]); + r.t = a.t; + } + r.s = op(this.s,a.s); + r.clamp(); +} + +// (public) this & a +function op_and(x,y) { return x&y; } +function bnAnd(a) { var r = nbi(); this.bitwiseTo(a,op_and,r); return r; } + +// (public) this | a +function op_or(x,y) { return x|y; } +function bnOr(a) { var r = nbi(); this.bitwiseTo(a,op_or,r); return r; } + +// (public) this ^ a +function op_xor(x,y) { return x^y; } +function bnXor(a) { var r = nbi(); this.bitwiseTo(a,op_xor,r); return r; } + +// (public) this & ~a +function op_andnot(x,y) { return x&~y; } +function bnAndNot(a) { var r = nbi(); this.bitwiseTo(a,op_andnot,r); return r; } + +// (public) ~this +function bnNot() { + var r = nbi(); + for(var i = 0; i < this.t; ++i) r[i] = this.DM&~this[i]; + r.t = this.t; + r.s = ~this.s; + return r; +} + +// (public) this << n +function bnShiftLeft(n) { + var r = nbi(); + if(n < 0) this.rShiftTo(-n,r); else this.lShiftTo(n,r); + return r; +} + +// (public) this >> n +function bnShiftRight(n) { + var r = nbi(); + if(n < 0) this.lShiftTo(-n,r); else this.rShiftTo(n,r); + return r; +} + +// return index of lowest 1-bit in x, x < 2^31 +function lbit(x) { + if(x == 0) return -1; + var r = 0; + if((x&0xffff) == 0) { x >>= 16; r += 16; } + if((x&0xff) == 0) { x >>= 8; r += 8; } + if((x&0xf) == 0) { x >>= 4; r += 4; } + if((x&3) == 0) { x >>= 2; r += 2; } + if((x&1) == 0) ++r; + return r; +} + +// (public) returns index of lowest 1-bit (or -1 if none) +function bnGetLowestSetBit() { + for(var i = 0; i < this.t; ++i) + if(this[i] != 0) return i*this.DB+lbit(this[i]); + if(this.s < 0) return this.t*this.DB; + return -1; +} + +// return number of 1 bits in x +function cbit(x) { + var r = 0; + while(x != 0) { x &= x-1; ++r; } + return r; +} + +// (public) return number of set bits +function bnBitCount() { + var r = 0, x = this.s&this.DM; + for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x); + return r; +} + +// (public) true iff nth bit is set +function bnTestBit(n) { + var j = Math.floor(n/this.DB); + if(j >= this.t) return(this.s!=0); + return((this[j]&(1<<(n%this.DB)))!=0); +} + +// (protected) this op (1<>= this.DB; + } + if(a.t < this.t) { + c += a.s; + while(i < this.t) { + c += this[i]; + r[i++] = c&this.DM; + c >>= this.DB; + } + c += this.s; + } + else { + c += this.s; + while(i < a.t) { + c += a[i]; + r[i++] = c&this.DM; + c >>= this.DB; + } + c += a.s; + } + r.s = (c<0)?-1:0; + if(c > 0) r[i++] = c; + else if(c < -1) r[i++] = this.DV+c; + r.t = i; + r.clamp(); +} + +// (public) this + a +function bnAdd(a) { var r = nbi(); this.addTo(a,r); return r; } + +// (public) this - a +function bnSubtract(a) { var r = nbi(); this.subTo(a,r); return r; } + +// (public) this * a +function bnMultiply(a) { var r = nbi(); this.multiplyTo(a,r); return r; } + +// (public) this^2 +function bnSquare() { var r = nbi(); this.squareTo(r); return r; } + +// (public) this / a +function bnDivide(a) { var r = nbi(); this.divRemTo(a,r,null); return r; } + +// (public) this % a +function bnRemainder(a) { var r = nbi(); this.divRemTo(a,null,r); return r; } + +// (public) [this/a,this%a] +function bnDivideAndRemainder(a) { + var q = nbi(), r = nbi(); + this.divRemTo(a,q,r); + return new Array(q,r); +} + +// (protected) this *= n, this >= 0, 1 < n < DV +function bnpDMultiply(n) { + this[this.t] = this.am(0,n-1,this,0,0,this.t); + ++this.t; + this.clamp(); +} + +// (protected) this += n << w words, this >= 0 +function bnpDAddOffset(n,w) { + if(n == 0) return; + while(this.t <= w) this[this.t++] = 0; + this[w] += n; + while(this[w] >= this.DV) { + this[w] -= this.DV; + if(++w >= this.t) this[this.t++] = 0; + ++this[w]; + } +} + +// A "null" reducer +function NullExp() {} +function nNop(x) { return x; } +function nMulTo(x,y,r) { x.multiplyTo(y,r); } +function nSqrTo(x,r) { x.squareTo(r); } + +NullExp.prototype.convert = nNop; +NullExp.prototype.revert = nNop; +NullExp.prototype.mulTo = nMulTo; +NullExp.prototype.sqrTo = nSqrTo; + +// (public) this^e +function bnPow(e) { return this.exp(e,new NullExp()); } + +// (protected) r = lower n words of "this * a", a.t <= n +// "this" should be the larger one if appropriate. +function bnpMultiplyLowerTo(a,n,r) { + var i = Math.min(this.t+a.t,n); + r.s = 0; // assumes a,this >= 0 + r.t = i; + while(i > 0) r[--i] = 0; + var j; + for(j = r.t-this.t; i < j; ++i) r[i+this.t] = this.am(0,a[i],r,i,0,this.t); + for(j = Math.min(a.t,n); i < j; ++i) this.am(0,a[i],r,i,0,n-i); + r.clamp(); +} + +// (protected) r = "this * a" without lower n words, n > 0 +// "this" should be the larger one if appropriate. +function bnpMultiplyUpperTo(a,n,r) { + --n; + var i = r.t = this.t+a.t-n; + r.s = 0; // assumes a,this >= 0 + while(--i >= 0) r[i] = 0; + for(i = Math.max(n-this.t,0); i < a.t; ++i) + r[this.t+i-n] = this.am(n-i,a[i],r,0,0,this.t+i-n); + r.clamp(); + r.drShiftTo(1,r); +} + +// Barrett modular reduction +function Barrett(m) { + // setup Barrett + this.r2 = nbi(); + this.q3 = nbi(); + BigInteger.ONE.dlShiftTo(2*m.t,this.r2); + this.mu = this.r2.divide(m); + this.m = m; +} + +function barrettConvert(x) { + if(x.s < 0 || x.t > 2*this.m.t) return x.mod(this.m); + else if(x.compareTo(this.m) < 0) return x; + else { var r = nbi(); x.copyTo(r); this.reduce(r); return r; } +} + +function barrettRevert(x) { return x; } + +// x = x mod m (HAC 14.42) +function barrettReduce(x) { + x.drShiftTo(this.m.t-1,this.r2); + if(x.t > this.m.t+1) { x.t = this.m.t+1; x.clamp(); } + this.mu.multiplyUpperTo(this.r2,this.m.t+1,this.q3); + this.m.multiplyLowerTo(this.q3,this.m.t+1,this.r2); + while(x.compareTo(this.r2) < 0) x.dAddOffset(1,this.m.t+1); + x.subTo(this.r2,x); + while(x.compareTo(this.m) >= 0) x.subTo(this.m,x); +} + +// r = x^2 mod m; x != r +function barrettSqrTo(x,r) { x.squareTo(r); this.reduce(r); } + +// r = x*y mod m; x,y != r +function barrettMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); } + +Barrett.prototype.convert = barrettConvert; +Barrett.prototype.revert = barrettRevert; +Barrett.prototype.reduce = barrettReduce; +Barrett.prototype.mulTo = barrettMulTo; +Barrett.prototype.sqrTo = barrettSqrTo; + +// (public) this^e % m (HAC 14.85) +function bnModPow(e,m) { + var i = e.bitLength(), k, r = nbv(1), z; + if(i <= 0) return r; + else if(i < 18) k = 1; + else if(i < 48) k = 3; + else if(i < 144) k = 4; + else if(i < 768) k = 5; + else k = 6; + if(i < 8) + z = new Classic(m); + else if(m.isEven()) + z = new Barrett(m); + else + z = new Montgomery(m); + + // precomputation + var g = new Array(), n = 3, k1 = k-1, km = (1< 1) { + var g2 = nbi(); + z.sqrTo(g[1],g2); + while(n <= km) { + g[n] = nbi(); + z.mulTo(g2,g[n-2],g[n]); + n += 2; + } + } + + var j = e.t-1, w, is1 = true, r2 = nbi(), t; + i = nbits(e[j])-1; + while(j >= 0) { + if(i >= k1) w = (e[j]>>(i-k1))&km; + else { + w = (e[j]&((1<<(i+1))-1))<<(k1-i); + if(j > 0) w |= e[j-1]>>(this.DB+i-k1); + } + + n = k; + while((w&1) == 0) { w >>= 1; --n; } + if((i -= n) < 0) { i += this.DB; --j; } + if(is1) { // ret == 1, don't bother squaring or multiplying it + g[w].copyTo(r); + is1 = false; + } + else { + while(n > 1) { z.sqrTo(r,r2); z.sqrTo(r2,r); n -= 2; } + if(n > 0) z.sqrTo(r,r2); else { t = r; r = r2; r2 = t; } + z.mulTo(r2,g[w],r); + } + + while(j >= 0 && (e[j]&(1< 0) { + x.rShiftTo(g,x); + y.rShiftTo(g,y); + } + while(x.signum() > 0) { + if((i = x.getLowestSetBit()) > 0) x.rShiftTo(i,x); + if((i = y.getLowestSetBit()) > 0) y.rShiftTo(i,y); + if(x.compareTo(y) >= 0) { + x.subTo(y,x); + x.rShiftTo(1,x); + } + else { + y.subTo(x,y); + y.rShiftTo(1,y); + } + } + if(g > 0) y.lShiftTo(g,y); + return y; +} + +// (protected) this % n, n < 2^26 +function bnpModInt(n) { + if(n <= 0) return 0; + var d = this.DV%n, r = (this.s<0)?n-1:0; + if(this.t > 0) + if(d == 0) r = this[0]%n; + else for(var i = this.t-1; i >= 0; --i) r = (d*r+this[i])%n; + return r; +} + +// (public) 1/this % m (HAC 14.61) +function bnModInverse(m) { + var ac = m.isEven(); + if((this.isEven() && ac) || m.signum() == 0) return BigInteger.ZERO; + var u = m.clone(), v = this.clone(); + var a = nbv(1), b = nbv(0), c = nbv(0), d = nbv(1); + while(u.signum() != 0) { + while(u.isEven()) { + u.rShiftTo(1,u); + if(ac) { + if(!a.isEven() || !b.isEven()) { a.addTo(this,a); b.subTo(m,b); } + a.rShiftTo(1,a); + } + else if(!b.isEven()) b.subTo(m,b); + b.rShiftTo(1,b); + } + while(v.isEven()) { + v.rShiftTo(1,v); + if(ac) { + if(!c.isEven() || !d.isEven()) { c.addTo(this,c); d.subTo(m,d); } + c.rShiftTo(1,c); + } + else if(!d.isEven()) d.subTo(m,d); + d.rShiftTo(1,d); + } + if(u.compareTo(v) >= 0) { + u.subTo(v,u); + if(ac) a.subTo(c,a); + b.subTo(d,b); + } + else { + v.subTo(u,v); + if(ac) c.subTo(a,c); + d.subTo(b,d); + } + } + if(v.compareTo(BigInteger.ONE) != 0) return BigInteger.ZERO; + if(d.compareTo(m) >= 0) return d.subtract(m); + if(d.signum() < 0) d.addTo(m,d); else return d; + if(d.signum() < 0) return d.add(m); else return d; +} + +var lowprimes = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997]; +var lplim = (1<<26)/lowprimes[lowprimes.length-1]; + +// (public) test primality with certainty >= 1-.5^t +function bnIsProbablePrime(t) { + var i, x = this.abs(); + if(x.t == 1 && x[0] <= lowprimes[lowprimes.length-1]) { + for(i = 0; i < lowprimes.length; ++i) + if(x[0] == lowprimes[i]) return true; + return false; + } + if(x.isEven()) return false; + i = 1; + while(i < lowprimes.length) { + var m = lowprimes[i], j = i+1; + while(j < lowprimes.length && m < lplim) m *= lowprimes[j++]; + m = x.modInt(m); + while(i < j) if(m%lowprimes[i++] == 0) return false; + } + return x.millerRabin(t); +} + +// (protected) true if probably prime (HAC 4.24, Miller-Rabin) +function bnpMillerRabin(t) { + var n1 = this.subtract(BigInteger.ONE); + var k = n1.getLowestSetBit(); + if(k <= 0) return false; + var r = n1.shiftRight(k); + t = (t+1)>>1; + if(t > lowprimes.length) t = lowprimes.length; + var a = nbi(); + for(var i = 0; i < t; ++i) { + //Pick bases at random, instead of starting at 2 + a.fromInt(lowprimes[Math.floor(Math.random()*lowprimes.length)]); + var y = a.modPow(r,this); + if(y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) { + var j = 1; + while(j++ < k && y.compareTo(n1) != 0) { + y = y.modPowInt(2,this); + if(y.compareTo(BigInteger.ONE) == 0) return false; + } + if(y.compareTo(n1) != 0) return false; + } + } + return true; +} + +// protected +BigInteger.prototype.chunkSize = bnpChunkSize; +BigInteger.prototype.toRadix = bnpToRadix; +BigInteger.prototype.fromRadix = bnpFromRadix; +BigInteger.prototype.fromNumber = bnpFromNumber; +BigInteger.prototype.bitwiseTo = bnpBitwiseTo; +BigInteger.prototype.changeBit = bnpChangeBit; +BigInteger.prototype.addTo = bnpAddTo; +BigInteger.prototype.dMultiply = bnpDMultiply; +BigInteger.prototype.dAddOffset = bnpDAddOffset; +BigInteger.prototype.multiplyLowerTo = bnpMultiplyLowerTo; +BigInteger.prototype.multiplyUpperTo = bnpMultiplyUpperTo; +BigInteger.prototype.modInt = bnpModInt; +BigInteger.prototype.millerRabin = bnpMillerRabin; + +// public +BigInteger.prototype.clone = bnClone; +BigInteger.prototype.intValue = bnIntValue; +BigInteger.prototype.byteValue = bnByteValue; +BigInteger.prototype.shortValue = bnShortValue; +BigInteger.prototype.signum = bnSigNum; +BigInteger.prototype.toByteArray = bnToByteArray; +BigInteger.prototype.equals = bnEquals; +BigInteger.prototype.min = bnMin; +BigInteger.prototype.max = bnMax; +BigInteger.prototype.and = bnAnd; +BigInteger.prototype.or = bnOr; +BigInteger.prototype.xor = bnXor; +BigInteger.prototype.andNot = bnAndNot; +BigInteger.prototype.not = bnNot; +BigInteger.prototype.shiftLeft = bnShiftLeft; +BigInteger.prototype.shiftRight = bnShiftRight; +BigInteger.prototype.getLowestSetBit = bnGetLowestSetBit; +BigInteger.prototype.bitCount = bnBitCount; +BigInteger.prototype.testBit = bnTestBit; +BigInteger.prototype.setBit = bnSetBit; +BigInteger.prototype.clearBit = bnClearBit; +BigInteger.prototype.flipBit = bnFlipBit; +BigInteger.prototype.add = bnAdd; +BigInteger.prototype.subtract = bnSubtract; +BigInteger.prototype.multiply = bnMultiply; +BigInteger.prototype.divide = bnDivide; +BigInteger.prototype.remainder = bnRemainder; +BigInteger.prototype.divideAndRemainder = bnDivideAndRemainder; +BigInteger.prototype.modPow = bnModPow; +BigInteger.prototype.modInverse = bnModInverse; +BigInteger.prototype.pow = bnPow; +BigInteger.prototype.gcd = bnGCD; +BigInteger.prototype.isProbablePrime = bnIsProbablePrime; + +// JSBN-specific extension +BigInteger.prototype.square = bnSquare; + +// BigInteger interfaces not implemented in jsbn: + +// BigInteger(int signum, byte[] magnitude) +// double doubleValue() +// float floatValue() +// int hashCode() +// long longValue() +// static BigInteger valueOf(long val) diff --git a/js/md5.js b/js/md5.js new file mode 100644 index 0000000..f4c46b9 --- /dev/null +++ b/js/md5.js @@ -0,0 +1,254 @@ +/* +CryptoJS v3.1.2 +code.google.com/p/crypto-js +(c) 2009-2013 by Jeff Mott. All rights reserved. +code.google.com/p/crypto-js/wiki/License +*/ +(function (Math) { + // Shortcuts + var C = CryptoJS; + var C_lib = C.lib; + var WordArray = C_lib.WordArray; + var Hasher = C_lib.Hasher; + var C_algo = C.algo; + + // Constants table + var T = []; + + // Compute constants + (function () { + for (var i = 0; i < 64; i++) { + T[i] = (Math.abs(Math.sin(i + 1)) * 0x100000000) | 0; + } + }()); + + /** + * MD5 hash algorithm. + */ + var MD5 = C_algo.MD5 = Hasher.extend({ + _doReset: function () { + this._hash = new WordArray.init([ + 0x67452301, 0xefcdab89, + 0x98badcfe, 0x10325476 + ]); + }, + + _doProcessBlock: function (M, offset) { + // Swap endian + for (var i = 0; i < 16; i++) { + // Shortcuts + var offset_i = offset + i; + var M_offset_i = M[offset_i]; + + M[offset_i] = ( + (((M_offset_i << 8) | (M_offset_i >>> 24)) & 0x00ff00ff) | + (((M_offset_i << 24) | (M_offset_i >>> 8)) & 0xff00ff00) + ); + } + + // Shortcuts + var H = this._hash.words; + + var M_offset_0 = M[offset + 0]; + var M_offset_1 = M[offset + 1]; + var M_offset_2 = M[offset + 2]; + var M_offset_3 = M[offset + 3]; + var M_offset_4 = M[offset + 4]; + var M_offset_5 = M[offset + 5]; + var M_offset_6 = M[offset + 6]; + var M_offset_7 = M[offset + 7]; + var M_offset_8 = M[offset + 8]; + var M_offset_9 = M[offset + 9]; + var M_offset_10 = M[offset + 10]; + var M_offset_11 = M[offset + 11]; + var M_offset_12 = M[offset + 12]; + var M_offset_13 = M[offset + 13]; + var M_offset_14 = M[offset + 14]; + var M_offset_15 = M[offset + 15]; + + // Working varialbes + var a = H[0]; + var b = H[1]; + var c = H[2]; + var d = H[3]; + + // Computation + a = FF(a, b, c, d, M_offset_0, 7, T[0]); + d = FF(d, a, b, c, M_offset_1, 12, T[1]); + c = FF(c, d, a, b, M_offset_2, 17, T[2]); + b = FF(b, c, d, a, M_offset_3, 22, T[3]); + a = FF(a, b, c, d, M_offset_4, 7, T[4]); + d = FF(d, a, b, c, M_offset_5, 12, T[5]); + c = FF(c, d, a, b, M_offset_6, 17, T[6]); + b = FF(b, c, d, a, M_offset_7, 22, T[7]); + a = FF(a, b, c, d, M_offset_8, 7, T[8]); + d = FF(d, a, b, c, M_offset_9, 12, T[9]); + c = FF(c, d, a, b, M_offset_10, 17, T[10]); + b = FF(b, c, d, a, M_offset_11, 22, T[11]); + a = FF(a, b, c, d, M_offset_12, 7, T[12]); + d = FF(d, a, b, c, M_offset_13, 12, T[13]); + c = FF(c, d, a, b, M_offset_14, 17, T[14]); + b = FF(b, c, d, a, M_offset_15, 22, T[15]); + + a = GG(a, b, c, d, M_offset_1, 5, T[16]); + d = GG(d, a, b, c, M_offset_6, 9, T[17]); + c = GG(c, d, a, b, M_offset_11, 14, T[18]); + b = GG(b, c, d, a, M_offset_0, 20, T[19]); + a = GG(a, b, c, d, M_offset_5, 5, T[20]); + d = GG(d, a, b, c, M_offset_10, 9, T[21]); + c = GG(c, d, a, b, M_offset_15, 14, T[22]); + b = GG(b, c, d, a, M_offset_4, 20, T[23]); + a = GG(a, b, c, d, M_offset_9, 5, T[24]); + d = GG(d, a, b, c, M_offset_14, 9, T[25]); + c = GG(c, d, a, b, M_offset_3, 14, T[26]); + b = GG(b, c, d, a, M_offset_8, 20, T[27]); + a = GG(a, b, c, d, M_offset_13, 5, T[28]); + d = GG(d, a, b, c, M_offset_2, 9, T[29]); + c = GG(c, d, a, b, M_offset_7, 14, T[30]); + b = GG(b, c, d, a, M_offset_12, 20, T[31]); + + a = HH(a, b, c, d, M_offset_5, 4, T[32]); + d = HH(d, a, b, c, M_offset_8, 11, T[33]); + c = HH(c, d, a, b, M_offset_11, 16, T[34]); + b = HH(b, c, d, a, M_offset_14, 23, T[35]); + a = HH(a, b, c, d, M_offset_1, 4, T[36]); + d = HH(d, a, b, c, M_offset_4, 11, T[37]); + c = HH(c, d, a, b, M_offset_7, 16, T[38]); + b = HH(b, c, d, a, M_offset_10, 23, T[39]); + a = HH(a, b, c, d, M_offset_13, 4, T[40]); + d = HH(d, a, b, c, M_offset_0, 11, T[41]); + c = HH(c, d, a, b, M_offset_3, 16, T[42]); + b = HH(b, c, d, a, M_offset_6, 23, T[43]); + a = HH(a, b, c, d, M_offset_9, 4, T[44]); + d = HH(d, a, b, c, M_offset_12, 11, T[45]); + c = HH(c, d, a, b, M_offset_15, 16, T[46]); + b = HH(b, c, d, a, M_offset_2, 23, T[47]); + + a = II(a, b, c, d, M_offset_0, 6, T[48]); + d = II(d, a, b, c, M_offset_7, 10, T[49]); + c = II(c, d, a, b, M_offset_14, 15, T[50]); + b = II(b, c, d, a, M_offset_5, 21, T[51]); + a = II(a, b, c, d, M_offset_12, 6, T[52]); + d = II(d, a, b, c, M_offset_3, 10, T[53]); + c = II(c, d, a, b, M_offset_10, 15, T[54]); + b = II(b, c, d, a, M_offset_1, 21, T[55]); + a = II(a, b, c, d, M_offset_8, 6, T[56]); + d = II(d, a, b, c, M_offset_15, 10, T[57]); + c = II(c, d, a, b, M_offset_6, 15, T[58]); + b = II(b, c, d, a, M_offset_13, 21, T[59]); + a = II(a, b, c, d, M_offset_4, 6, T[60]); + d = II(d, a, b, c, M_offset_11, 10, T[61]); + c = II(c, d, a, b, M_offset_2, 15, T[62]); + b = II(b, c, d, a, M_offset_9, 21, T[63]); + + // Intermediate hash value + H[0] = (H[0] + a) | 0; + H[1] = (H[1] + b) | 0; + H[2] = (H[2] + c) | 0; + H[3] = (H[3] + d) | 0; + }, + + _doFinalize: function () { + // Shortcuts + var data = this._data; + var dataWords = data.words; + + var nBitsTotal = this._nDataBytes * 8; + var nBitsLeft = data.sigBytes * 8; + + // Add padding + dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32); + + var nBitsTotalH = Math.floor(nBitsTotal / 0x100000000); + var nBitsTotalL = nBitsTotal; + dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 15] = ( + (((nBitsTotalH << 8) | (nBitsTotalH >>> 24)) & 0x00ff00ff) | + (((nBitsTotalH << 24) | (nBitsTotalH >>> 8)) & 0xff00ff00) + ); + dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = ( + (((nBitsTotalL << 8) | (nBitsTotalL >>> 24)) & 0x00ff00ff) | + (((nBitsTotalL << 24) | (nBitsTotalL >>> 8)) & 0xff00ff00) + ); + + data.sigBytes = (dataWords.length + 1) * 4; + + // Hash final blocks + this._process(); + + // Shortcuts + var hash = this._hash; + var H = hash.words; + + // Swap endian + for (var i = 0; i < 4; i++) { + // Shortcut + var H_i = H[i]; + + H[i] = (((H_i << 8) | (H_i >>> 24)) & 0x00ff00ff) | + (((H_i << 24) | (H_i >>> 8)) & 0xff00ff00); + } + + // Return final computed hash + return hash; + }, + + clone: function () { + var clone = Hasher.clone.call(this); + clone._hash = this._hash.clone(); + + return clone; + } + }); + + function FF(a, b, c, d, x, s, t) { + var n = a + ((b & c) | (~b & d)) + x + t; + return ((n << s) | (n >>> (32 - s))) + b; + } + + function GG(a, b, c, d, x, s, t) { + var n = a + ((b & d) | (c & ~d)) + x + t; + return ((n << s) | (n >>> (32 - s))) + b; + } + + function HH(a, b, c, d, x, s, t) { + var n = a + (b ^ c ^ d) + x + t; + return ((n << s) | (n >>> (32 - s))) + b; + } + + function II(a, b, c, d, x, s, t) { + var n = a + (c ^ (b | ~d)) + x + t; + return ((n << s) | (n >>> (32 - s))) + b; + } + + /** + * Shortcut function to the hasher's object interface. + * + * @param {WordArray|string} message The message to hash. + * + * @return {WordArray} The hash. + * + * @static + * + * @example + * + * var hash = CryptoJS.MD5('message'); + * var hash = CryptoJS.MD5(wordArray); + */ + C.MD5 = Hasher._createHelper(MD5); + + /** + * Shortcut function to the HMAC's object interface. + * + * @param {WordArray|string} message The message to hash. + * @param {WordArray|string} key The secret key. + * + * @return {WordArray} The HMAC. + * + * @static + * + * @example + * + * var hmac = CryptoJS.HmacMD5(message, key); + */ + C.HmacMD5 = Hasher._createHmacHelper(MD5); +}(Math)); diff --git a/js/ripemd160.js b/js/ripemd160.js new file mode 100644 index 0000000..4acab8b --- /dev/null +++ b/js/ripemd160.js @@ -0,0 +1,253 @@ +/* +CryptoJS v3.1.2 +code.google.com/p/crypto-js +(c) 2009-2013 by Jeff Mott. All rights reserved. +code.google.com/p/crypto-js/wiki/License +*/ +/** @preserve +(c) 2012 by Cédric Mesnil. All rights reserved. + +Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: + + - Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. + - Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. + +THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. +*/ + +(function (Math) { + // Shortcuts + var C = CryptoJS; + var C_lib = C.lib; + var WordArray = C_lib.WordArray; + var Hasher = C_lib.Hasher; + var C_algo = C.algo; + + // Constants table + var _zl = WordArray.create([ + 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, + 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8, + 3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12, + 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2, + 4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13]); + var _zr = WordArray.create([ + 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12, + 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2, + 15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13, + 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14, + 12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11]); + var _sl = WordArray.create([ + 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8, + 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12, + 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5, + 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12, + 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6 ]); + var _sr = WordArray.create([ + 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6, + 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11, + 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5, + 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8, + 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11 ]); + + var _hl = WordArray.create([ 0x00000000, 0x5A827999, 0x6ED9EBA1, 0x8F1BBCDC, 0xA953FD4E]); + var _hr = WordArray.create([ 0x50A28BE6, 0x5C4DD124, 0x6D703EF3, 0x7A6D76E9, 0x00000000]); + + /** + * RIPEMD160 hash algorithm. + */ + var RIPEMD160 = C_algo.RIPEMD160 = Hasher.extend({ + _doReset: function () { + this._hash = WordArray.create([0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0]); + }, + + _doProcessBlock: function (M, offset) { + + // Swap endian + for (var i = 0; i < 16; i++) { + // Shortcuts + var offset_i = offset + i; + var M_offset_i = M[offset_i]; + + // Swap + M[offset_i] = ( + (((M_offset_i << 8) | (M_offset_i >>> 24)) & 0x00ff00ff) | + (((M_offset_i << 24) | (M_offset_i >>> 8)) & 0xff00ff00) + ); + } + // Shortcut + var H = this._hash.words; + var hl = _hl.words; + var hr = _hr.words; + var zl = _zl.words; + var zr = _zr.words; + var sl = _sl.words; + var sr = _sr.words; + + // Working variables + var al, bl, cl, dl, el; + var ar, br, cr, dr, er; + + ar = al = H[0]; + br = bl = H[1]; + cr = cl = H[2]; + dr = dl = H[3]; + er = el = H[4]; + // Computation + var t; + for (var i = 0; i < 80; i += 1) { + t = (al + M[offset+zl[i]])|0; + if (i<16){ + t += f1(bl,cl,dl) + hl[0]; + } else if (i<32) { + t += f2(bl,cl,dl) + hl[1]; + } else if (i<48) { + t += f3(bl,cl,dl) + hl[2]; + } else if (i<64) { + t += f4(bl,cl,dl) + hl[3]; + } else {// if (i<80) { + t += f5(bl,cl,dl) + hl[4]; + } + t = t|0; + t = rotl(t,sl[i]); + t = (t+el)|0; + al = el; + el = dl; + dl = rotl(cl, 10); + cl = bl; + bl = t; + + t = (ar + M[offset+zr[i]])|0; + if (i<16){ + t += f5(br,cr,dr) + hr[0]; + } else if (i<32) { + t += f4(br,cr,dr) + hr[1]; + } else if (i<48) { + t += f3(br,cr,dr) + hr[2]; + } else if (i<64) { + t += f2(br,cr,dr) + hr[3]; + } else {// if (i<80) { + t += f1(br,cr,dr) + hr[4]; + } + t = t|0; + t = rotl(t,sr[i]) ; + t = (t+er)|0; + ar = er; + er = dr; + dr = rotl(cr, 10); + cr = br; + br = t; + } + // Intermediate hash value + t = (H[1] + cl + dr)|0; + H[1] = (H[2] + dl + er)|0; + H[2] = (H[3] + el + ar)|0; + H[3] = (H[4] + al + br)|0; + H[4] = (H[0] + bl + cr)|0; + H[0] = t; + }, + + _doFinalize: function () { + // Shortcuts + var data = this._data; + var dataWords = data.words; + + var nBitsTotal = this._nDataBytes * 8; + var nBitsLeft = data.sigBytes * 8; + + // Add padding + dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32); + dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = ( + (((nBitsTotal << 8) | (nBitsTotal >>> 24)) & 0x00ff00ff) | + (((nBitsTotal << 24) | (nBitsTotal >>> 8)) & 0xff00ff00) + ); + data.sigBytes = (dataWords.length + 1) * 4; + + // Hash final blocks + this._process(); + + // Shortcuts + var hash = this._hash; + var H = hash.words; + + // Swap endian + for (var i = 0; i < 5; i++) { + // Shortcut + var H_i = H[i]; + + // Swap + H[i] = (((H_i << 8) | (H_i >>> 24)) & 0x00ff00ff) | + (((H_i << 24) | (H_i >>> 8)) & 0xff00ff00); + } + + // Return final computed hash + return hash; + }, + + clone: function () { + var clone = Hasher.clone.call(this); + clone._hash = this._hash.clone(); + + return clone; + } + }); + + + function f1(x, y, z) { + return ((x) ^ (y) ^ (z)); + + } + + function f2(x, y, z) { + return (((x)&(y)) | ((~x)&(z))); + } + + function f3(x, y, z) { + return (((x) | (~(y))) ^ (z)); + } + + function f4(x, y, z) { + return (((x) & (z)) | ((y)&(~(z)))); + } + + function f5(x, y, z) { + return ((x) ^ ((y) |(~(z)))); + + } + + function rotl(x,n) { + return (x<>>(32-n)); + } + + + /** + * Shortcut function to the hasher's object interface. + * + * @param {WordArray|string} message The message to hash. + * + * @return {WordArray} The hash. + * + * @static + * + * @example + * + * var hash = CryptoJS.RIPEMD160('message'); + * var hash = CryptoJS.RIPEMD160(wordArray); + */ + C.RIPEMD160 = Hasher._createHelper(RIPEMD160); + + /** + * Shortcut function to the HMAC's object interface. + * + * @param {WordArray|string} message The message to hash. + * @param {WordArray|string} key The secret key. + * + * @return {WordArray} The HMAC. + * + * @static + * + * @example + * + * var hmac = CryptoJS.HmacRIPEMD160(message, key); + */ + C.HmacRIPEMD160 = Hasher._createHmacHelper(RIPEMD160); +}(Math)); diff --git a/js/rsa.js b/js/rsa.js new file mode 100644 index 0000000..2007296 --- /dev/null +++ b/js/rsa.js @@ -0,0 +1,191 @@ +/*! (c) Tom Wu | http://www-cs-students.stanford.edu/~tjw/jsbn/ + */ +// Depends on jsbn.js and rng.js + +// Version 1.1: support utf-8 encoding in pkcs1pad2 + +// convert a (hex) string to a bignum object +function parseBigInt(str,r) { + return new BigInteger(str,r); +} + +function linebrk(s,n) { + var ret = ""; + var i = 0; + while(i + n < s.length) { + ret += s.substring(i,i+n) + "\n"; + i += n; + } + return ret + s.substring(i,s.length); +} + +function byte2Hex(b) { + if(b < 0x10) + return "0" + b.toString(16); + else + return b.toString(16); +} + +// PKCS#1 (type 2, random) pad input string s to n bytes, and return a bigint +function pkcs1pad2(s,n) { + if(n < s.length + 11) { // TODO: fix for utf-8 + alert("Message too long for RSA"); + return null; + } + var ba = new Array(); + var i = s.length - 1; + while(i >= 0 && n > 0) { + var c = s.charCodeAt(i--); + if(c < 128) { // encode using utf-8 + ba[--n] = c; + } + else if((c > 127) && (c < 2048)) { + ba[--n] = (c & 63) | 128; + ba[--n] = (c >> 6) | 192; + } + else { + ba[--n] = (c & 63) | 128; + ba[--n] = ((c >> 6) & 63) | 128; + ba[--n] = (c >> 12) | 224; + } + } + ba[--n] = 0; + var rng = new SecureRandom(); + var x = new Array(); + while(n > 2) { // random non-zero pad + x[0] = 0; + while(x[0] == 0) rng.nextBytes(x); + ba[--n] = x[0]; + } + ba[--n] = 2; + ba[--n] = 0; + return new BigInteger(ba); +} + +// PKCS#1 (OAEP) mask generation function +function oaep_mgf1_arr(seed, len, hash) +{ + var mask = '', i = 0; + + while (mask.length < len) + { + mask += hash(String.fromCharCode.apply(String, seed.concat([ + (i & 0xff000000) >> 24, + (i & 0x00ff0000) >> 16, + (i & 0x0000ff00) >> 8, + i & 0x000000ff]))); + i += 1; + } + + return mask; +} + +var SHA1_SIZE = 20; + +// PKCS#1 (OAEP) pad input string s to n bytes, and return a bigint +function oaep_pad(s, n, hash) +{ + if (s.length + 2 * SHA1_SIZE + 2 > n) + { + throw "Message too long for RSA"; + } + + var PS = '', i; + + for (i = 0; i < n - s.length - 2 * SHA1_SIZE - 2; i += 1) + { + PS += '\x00'; + } + + var DB = rstr_sha1('') + PS + '\x01' + s; + var seed = new Array(SHA1_SIZE); + new SecureRandom().nextBytes(seed); + + var dbMask = oaep_mgf1_arr(seed, DB.length, hash || rstr_sha1); + var maskedDB = []; + + for (i = 0; i < DB.length; i += 1) + { + maskedDB[i] = DB.charCodeAt(i) ^ dbMask.charCodeAt(i); + } + + var seedMask = oaep_mgf1_arr(maskedDB, seed.length, rstr_sha1); + var maskedSeed = [0]; + + for (i = 0; i < seed.length; i += 1) + { + maskedSeed[i + 1] = seed[i] ^ seedMask.charCodeAt(i); + } + + return new BigInteger(maskedSeed.concat(maskedDB)); +} + +// "empty" RSA key constructor +function RSAKey() { + this.n = null; + this.e = 0; + this.d = null; + this.p = null; + this.q = null; + this.dmp1 = null; + this.dmq1 = null; + this.coeff = null; +} + +// Set the public key fields N and e from hex strings +function RSASetPublic(N,E) { + this.isPublic = true; + if (typeof N !== "string") + { + this.n = N; + this.e = E; + } + else if(N != null && E != null && N.length > 0 && E.length > 0) { + this.n = parseBigInt(N,16); + this.e = parseInt(E,16); + } + else + alert("Invalid RSA public key"); +} + +// Perform raw public operation on "x": return x^e (mod n) +function RSADoPublic(x) { + return x.modPowInt(this.e, this.n); +} + +// Return the PKCS#1 RSA encryption of "text" as an even-length hex string +function RSAEncrypt(text) { + var m = pkcs1pad2(text,(this.n.bitLength()+7)>>3); + if(m == null) return null; + var c = this.doPublic(m); + if(c == null) return null; + var h = c.toString(16); + if((h.length & 1) == 0) return h; else return "0" + h; +} + +// Return the PKCS#1 OAEP RSA encryption of "text" as an even-length hex string +function RSAEncryptOAEP(text, hash) { + var m = oaep_pad(text, (this.n.bitLength()+7)>>3, hash); + if(m == null) return null; + var c = this.doPublic(m); + if(c == null) return null; + var h = c.toString(16); + if((h.length & 1) == 0) return h; else return "0" + h; +} + +// Return the PKCS#1 RSA encryption of "text" as a Base64-encoded string +//function RSAEncryptB64(text) { +// var h = this.encrypt(text); +// if(h) return hex2b64(h); else return null; +//} + +// protected +RSAKey.prototype.doPublic = RSADoPublic; + +// public +RSAKey.prototype.setPublic = RSASetPublic; +RSAKey.prototype.encrypt = RSAEncrypt; +RSAKey.prototype.encryptOAEP = RSAEncryptOAEP; +//RSAKey.prototype.encrypt_b64 = RSAEncryptB64; + +RSAKey.prototype.type = "RSA"; diff --git a/js/rsa2.js b/js/rsa2.js new file mode 100644 index 0000000..c470230 --- /dev/null +++ b/js/rsa2.js @@ -0,0 +1,246 @@ +/*! (c) Tom Wu | http://www-cs-students.stanford.edu/~tjw/jsbn/ + */ +// Depends on rsa.js and jsbn2.js + +// Version 1.1: support utf-8 decoding in pkcs1unpad2 + +// Undo PKCS#1 (type 2, random) padding and, if valid, return the plaintext +function pkcs1unpad2(d,n) { + var b = d.toByteArray(); + var i = 0; + while(i < b.length && b[i] == 0) ++i; + if(b.length-i != n-1 || b[i] != 2) + return null; + ++i; + while(b[i] != 0) + if(++i >= b.length) return null; + var ret = ""; + while(++i < b.length) { + var c = b[i] & 255; + if(c < 128) { // utf-8 decode + ret += String.fromCharCode(c); + } + else if((c > 191) && (c < 224)) { + ret += String.fromCharCode(((c & 31) << 6) | (b[i+1] & 63)); + ++i; + } + else { + ret += String.fromCharCode(((c & 15) << 12) | ((b[i+1] & 63) << 6) | (b[i+2] & 63)); + i += 2; + } + } + return ret; +} + +// PKCS#1 (OAEP) mask generation function +function oaep_mgf1_str(seed, len, hash) +{ + var mask = '', i = 0; + + while (mask.length < len) + { + mask += hash(seed + String.fromCharCode.apply(String, [ + (i & 0xff000000) >> 24, + (i & 0x00ff0000) >> 16, + (i & 0x0000ff00) >> 8, + i & 0x000000ff])); + i += 1; + } + + return mask; +} + +var SHA1_SIZE = 20; + +// Undo PKCS#1 (OAEP) padding and, if valid, return the plaintext +function oaep_unpad(d, n, hash) +{ + d = d.toByteArray(); + + var i; + + for (i = 0; i < d.length; i += 1) + { + d[i] &= 0xff; + } + + while (d.length < n) + { + d.unshift(0); + } + + d = String.fromCharCode.apply(String, d); + + if (d.length < 2 * SHA1_SIZE + 2) + { + throw "Cipher too short"; + } + + var maskedSeed = d.substr(1, SHA1_SIZE) + var maskedDB = d.substr(SHA1_SIZE + 1); + + var seedMask = oaep_mgf1_str(maskedDB, SHA1_SIZE, hash || rstr_sha1); + var seed = [], i; + + for (i = 0; i < maskedSeed.length; i += 1) + { + seed[i] = maskedSeed.charCodeAt(i) ^ seedMask.charCodeAt(i); + } + + var dbMask = oaep_mgf1_str(String.fromCharCode.apply(String, seed), + d.length - SHA1_SIZE, rstr_sha1); + + var DB = []; + + for (i = 0; i < maskedDB.length; i += 1) + { + DB[i] = maskedDB.charCodeAt(i) ^ dbMask.charCodeAt(i); + } + + DB = String.fromCharCode.apply(String, DB); + + if (DB.substr(0, SHA1_SIZE) !== rstr_sha1('')) + { + throw "Hash mismatch"; + } + + DB = DB.substr(SHA1_SIZE); + + var first_one = DB.indexOf('\x01'); + var last_zero = (first_one != -1) ? DB.substr(0, first_one).lastIndexOf('\x00') : -1; + + if (last_zero + 1 != first_one) + { + throw "Malformed data"; + } + + return DB.substr(first_one + 1); +} + +// Set the private key fields N, e, and d from hex strings +function RSASetPrivate(N,E,D) { + this.isPrivate = true; + if (typeof N !== "string") + { + this.n = N; + this.e = E; + this.d = D; + } + else if(N != null && E != null && N.length > 0 && E.length > 0) { + this.n = parseBigInt(N,16); + this.e = parseInt(E,16); + this.d = parseBigInt(D,16); + } + else + alert("Invalid RSA private key"); +} + +// Set the private key fields N, e, d and CRT params from hex strings +function RSASetPrivateEx(N,E,D,P,Q,DP,DQ,C) { + this.isPrivate = true; + if (N == null) throw "RSASetPrivateEx N == null"; + if (E == null) throw "RSASetPrivateEx E == null"; + if (N.length == 0) throw "RSASetPrivateEx N.length == 0"; + if (E.length == 0) throw "RSASetPrivateEx E.length == 0"; + + if (N != null && E != null && N.length > 0 && E.length > 0) { + this.n = parseBigInt(N,16); + this.e = parseInt(E,16); + this.d = parseBigInt(D,16); + this.p = parseBigInt(P,16); + this.q = parseBigInt(Q,16); + this.dmp1 = parseBigInt(DP,16); + this.dmq1 = parseBigInt(DQ,16); + this.coeff = parseBigInt(C,16); + } else { + alert("Invalid RSA private key in RSASetPrivateEx"); + } +} + +// Generate a new random private key B bits long, using public expt E +function RSAGenerate(B,E) { + var rng = new SecureRandom(); + var qs = B>>1; + this.e = parseInt(E,16); + var ee = new BigInteger(E,16); + for(;;) { + for(;;) { + this.p = new BigInteger(B-qs,1,rng); + if(this.p.subtract(BigInteger.ONE).gcd(ee).compareTo(BigInteger.ONE) == 0 && this.p.isProbablePrime(10)) break; + } + for(;;) { + this.q = new BigInteger(qs,1,rng); + if(this.q.subtract(BigInteger.ONE).gcd(ee).compareTo(BigInteger.ONE) == 0 && this.q.isProbablePrime(10)) break; + } + if(this.p.compareTo(this.q) <= 0) { + var t = this.p; + this.p = this.q; + this.q = t; + } + var p1 = this.p.subtract(BigInteger.ONE); // p1 = p - 1 + var q1 = this.q.subtract(BigInteger.ONE); // q1 = q - 1 + var phi = p1.multiply(q1); + if(phi.gcd(ee).compareTo(BigInteger.ONE) == 0) { + this.n = this.p.multiply(this.q); // this.n = p * q + this.d = ee.modInverse(phi); // this.d = + this.dmp1 = this.d.mod(p1); // this.dmp1 = d mod (p - 1) + this.dmq1 = this.d.mod(q1); // this.dmq1 = d mod (q - 1) + this.coeff = this.q.modInverse(this.p); // this.coeff = (q ^ -1) mod p + break; + } + } +} + +// Perform raw private operation on "x": return x^d (mod n) +function RSADoPrivate(x) { + if(this.p == null || this.q == null) + return x.modPow(this.d, this.n); + + // TODO: re-calculate any missing CRT params + var xp = x.mod(this.p).modPow(this.dmp1, this.p); // xp=cp? + var xq = x.mod(this.q).modPow(this.dmq1, this.q); // xq=cq? + + while(xp.compareTo(xq) < 0) + xp = xp.add(this.p); + // NOTE: + // xp.subtract(xq) => cp -cq + // xp.subtract(xq).multiply(this.coeff).mod(this.p) => (cp - cq) * u mod p = h + // xp.subtract(xq).multiply(this.coeff).mod(this.p).multiply(this.q).add(xq) => cq + (h * q) = M + return xp.subtract(xq).multiply(this.coeff).mod(this.p).multiply(this.q).add(xq); +} + +// Return the PKCS#1 RSA decryption of "ctext". +// "ctext" is an even-length hex string and the output is a plain string. +function RSADecrypt(ctext) { + var c = parseBigInt(ctext, 16); + var m = this.doPrivate(c); + if(m == null) return null; + return pkcs1unpad2(m, (this.n.bitLength()+7)>>3); +} + +// Return the PKCS#1 OAEP RSA decryption of "ctext". +// "ctext" is an even-length hex string and the output is a plain string. +function RSADecryptOAEP(ctext, hash) { + var c = parseBigInt(ctext, 16); + var m = this.doPrivate(c); + if(m == null) return null; + return oaep_unpad(m, (this.n.bitLength()+7)>>3, hash); +} + +// Return the PKCS#1 RSA decryption of "ctext". +// "ctext" is a Base64-encoded string and the output is a plain string. +//function RSAB64Decrypt(ctext) { +// var h = b64tohex(ctext); +// if(h) return this.decrypt(h); else return null; +//} + +// protected +RSAKey.prototype.doPrivate = RSADoPrivate; + +// public +RSAKey.prototype.setPrivate = RSASetPrivate; +RSAKey.prototype.setPrivateEx = RSASetPrivateEx; +RSAKey.prototype.generate = RSAGenerate; +RSAKey.prototype.decrypt = RSADecrypt; +RSAKey.prototype.decryptOAEP = RSADecryptOAEP; +//RSAKey.prototype.b64_decrypt = RSAB64Decrypt; diff --git a/js/rsapem-1.1.js b/js/rsapem-1.1.js new file mode 100644 index 0000000..f7371ce --- /dev/null +++ b/js/rsapem-1.1.js @@ -0,0 +1,102 @@ +/*! rsapem-1.1.js (c) 2012 Kenji Urushima | kjur.github.com/jsrsasign/license + */ +// +// rsa-pem.js - adding function for reading/writing PKCS#1 PEM private key +// to RSAKey class. +// +// version: 1.1.1 (2013-Apr-12) +// +// Copyright (c) 2010-2013 Kenji Urushima (kenji.urushima@gmail.com) +// +// This software is licensed under the terms of the MIT License. +// http://kjur.github.com/jsrsasign/license/ +// +// The above copyright and license notice shall be +// included in all copies or substantial portions of the Software. +// +// +// Depends on: +// +// +// +// _RSApem_pemToBase64(sPEM) +// +// removing PEM header, PEM footer and space characters including +// new lines from PEM formatted RSA private key string. +// + +/** + * @fileOverview + * @name rsapem-1.1.js + * @author Kenji Urushima kenji.urushima@gmail.com + * @version 1.1 + * @license MIT License + */ +function _rsapem_pemToBase64(sPEMPrivateKey) { + var s = sPEMPrivateKey; + s = s.replace("-----BEGIN RSA PRIVATE KEY-----", ""); + s = s.replace("-----END RSA PRIVATE KEY-----", ""); + s = s.replace(/[ \n]+/g, ""); + return s; +} + +function _rsapem_getPosArrayOfChildrenFromHex(hPrivateKey) { + var a = new Array(); + var v1 = ASN1HEX.getStartPosOfV_AtObj(hPrivateKey, 0); + var n1 = ASN1HEX.getPosOfNextSibling_AtObj(hPrivateKey, v1); + var e1 = ASN1HEX.getPosOfNextSibling_AtObj(hPrivateKey, n1); + var d1 = ASN1HEX.getPosOfNextSibling_AtObj(hPrivateKey, e1); + var p1 = ASN1HEX.getPosOfNextSibling_AtObj(hPrivateKey, d1); + var q1 = ASN1HEX.getPosOfNextSibling_AtObj(hPrivateKey, p1); + var dp1 = ASN1HEX.getPosOfNextSibling_AtObj(hPrivateKey, q1); + var dq1 = ASN1HEX.getPosOfNextSibling_AtObj(hPrivateKey, dp1); + var co1 = ASN1HEX.getPosOfNextSibling_AtObj(hPrivateKey, dq1); + a.push(v1, n1, e1, d1, p1, q1, dp1, dq1, co1); + return a; +} + +function _rsapem_getHexValueArrayOfChildrenFromHex(hPrivateKey) { + var posArray = _rsapem_getPosArrayOfChildrenFromHex(hPrivateKey); + var v = ASN1HEX.getHexOfV_AtObj(hPrivateKey, posArray[0]); + var n = ASN1HEX.getHexOfV_AtObj(hPrivateKey, posArray[1]); + var e = ASN1HEX.getHexOfV_AtObj(hPrivateKey, posArray[2]); + var d = ASN1HEX.getHexOfV_AtObj(hPrivateKey, posArray[3]); + var p = ASN1HEX.getHexOfV_AtObj(hPrivateKey, posArray[4]); + var q = ASN1HEX.getHexOfV_AtObj(hPrivateKey, posArray[5]); + var dp = ASN1HEX.getHexOfV_AtObj(hPrivateKey, posArray[6]); + var dq = ASN1HEX.getHexOfV_AtObj(hPrivateKey, posArray[7]); + var co = ASN1HEX.getHexOfV_AtObj(hPrivateKey, posArray[8]); + var a = new Array(); + a.push(v, n, e, d, p, q, dp, dq, co); + return a; +} + +/** + * read RSA private key from a ASN.1 hexadecimal string + * @name readPrivateKeyFromASN1HexString + * @memberOf RSAKey# + * @function + * @param {String} keyHex ASN.1 hexadecimal string of PKCS#1 private key. + * @since 1.1.1 + */ +function _rsapem_readPrivateKeyFromASN1HexString(keyHex) { + var a = _rsapem_getHexValueArrayOfChildrenFromHex(keyHex); + this.setPrivateEx(a[1],a[2],a[3],a[4],a[5],a[6],a[7],a[8]); +} + +/** + * read PKCS#1 private key from a string + * @name readPrivateKeyFromPEMString + * @memberOf RSAKey# + * @function + * @param {String} keyPEM string of PKCS#1 private key. + */ +function _rsapem_readPrivateKeyFromPEMString(keyPEM) { + var keyB64 = _rsapem_pemToBase64(keyPEM); + var keyHex = b64tohex(keyB64) // depends base64.js + var a = _rsapem_getHexValueArrayOfChildrenFromHex(keyHex); + this.setPrivateEx(a[1],a[2],a[3],a[4],a[5],a[6],a[7],a[8]); +} + +RSAKey.prototype.readPrivateKeyFromPEMString = _rsapem_readPrivateKeyFromPEMString; +RSAKey.prototype.readPrivateKeyFromASN1HexString = _rsapem_readPrivateKeyFromASN1HexString; diff --git a/js/rsasign-1.2.js b/js/rsasign-1.2.js new file mode 100644 index 0000000..1a3c3cb --- /dev/null +++ b/js/rsasign-1.2.js @@ -0,0 +1,456 @@ +/*! rsasign-1.2.7.js (c) 2012 Kenji Urushima | kjur.github.com/jsrsasign/license + */ +/* + * rsa-sign.js - adding signing functions to RSAKey class. + * + * version: 1.2.7 (2013 Aug 25) + * + * Copyright (c) 2010-2013 Kenji Urushima (kenji.urushima@gmail.com) + * + * This software is licensed under the terms of the MIT License. + * http://kjur.github.com/jsrsasign/license/ + * + * The above copyright and license notice shall be + * included in all copies or substantial portions of the Software. + */ + +/** + * @fileOverview + * @name rsasign-1.2.js + * @author Kenji Urushima kenji.urushima@gmail.com + * @version rsasign 1.2.7 + * @license MIT License + */ + +var _RE_HEXDECONLY = new RegExp(""); +_RE_HEXDECONLY.compile("[^0-9a-f]", "gi"); + +// ======================================================================== +// Signature Generation +// ======================================================================== + +function _rsasign_getHexPaddedDigestInfoForString(s, keySize, hashAlg) { + var hashFunc = function(s) { return KJUR.crypto.Util.hashString(s, hashAlg); }; + var sHashHex = hashFunc(s); + + return KJUR.crypto.Util.getPaddedDigestInfoHex(sHashHex, hashAlg, keySize); +} + +function _zeroPaddingOfSignature(hex, bitLength) { + var s = ""; + var nZero = bitLength / 4 - hex.length; + for (var i = 0; i < nZero; i++) { + s = s + "0"; + } + return s + hex; +} + +/** + * sign for a message string with RSA private key.
+ * @name signString + * @memberOf RSAKey + * @function + * @param {String} s message string to be signed. + * @param {String} hashAlg hash algorithm name for signing.
+ * @return returns hexadecimal string of signature value. + */ +function _rsasign_signString(s, hashAlg) { + var hashFunc = function(s) { return KJUR.crypto.Util.hashString(s, hashAlg); }; + var sHashHex = hashFunc(s); + + return this.signWithMessageHash(sHashHex, hashAlg); +} + +/** + * sign hash value of message to be signed with RSA private key.
+ * @name signWithMessageHash + * @memberOf RSAKey + * @function + * @param {String} sHashHex hexadecimal string of hash value of message to be signed. + * @param {String} hashAlg hash algorithm name for signing.
+ * @return returns hexadecimal string of signature value. + * @since rsasign 1.2.6 + */ +function _rsasign_signWithMessageHash(sHashHex, hashAlg) { + var hPM = KJUR.crypto.Util.getPaddedDigestInfoHex(sHashHex, hashAlg, this.n.bitLength()); + var biPaddedMessage = parseBigInt(hPM, 16); + var biSign = this.doPrivate(biPaddedMessage); + var hexSign = biSign.toString(16); + return _zeroPaddingOfSignature(hexSign, this.n.bitLength()); +} + +function _rsasign_signStringWithSHA1(s) { + return _rsasign_signString.call(this, s, 'sha1'); +} + +function _rsasign_signStringWithSHA256(s) { + return _rsasign_signString.call(this, s, 'sha256'); +} + +// PKCS#1 (PSS) mask generation function +function pss_mgf1_str(seed, len, hash) { + var mask = '', i = 0; + + while (mask.length < len) { + mask += hextorstr(hash(rstrtohex(seed + String.fromCharCode.apply(String, [ + (i & 0xff000000) >> 24, + (i & 0x00ff0000) >> 16, + (i & 0x0000ff00) >> 8, + i & 0x000000ff])))); + i += 1; + } + + return mask; +} + +/** + * sign for a message string with RSA private key by PKCS#1 PSS signing.
+ * @name signStringPSS + * @memberOf RSAKey + * @function + * @param {String} s message string to be signed. + * @param {String} hashAlg hash algorithm name for signing. + * @param {Integer} sLen salt byte length from 0 to (keybytelen - hashbytelen - 2). + * There are two special values: + *
    + *
  • -1: sets the salt length to the digest length
    • + *
  • -2: sets the salt length to maximum permissible value + * (i.e. keybytelen - hashbytelen - 2)
    • + *
+ * DEFAULT is -1. (NOTE: OpenSSL's default is -2.) + * @return returns hexadecimal string of signature value. + */ +function _rsasign_signStringPSS(s, hashAlg, sLen) { + var hashFunc = function(sHex) { return KJUR.crypto.Util.hashHex(sHex, hashAlg); } + var hHash = hashFunc(rstrtohex(s)); + + if (sLen === undefined) sLen = -1; + return this.signWithMessageHashPSS(hHash, hashAlg, sLen); +} + +/** + * sign hash value of message with RSA private key by PKCS#1 PSS signing.
+ * @name signWithMessageHashPSS + * @memberOf RSAKey + * @function + * @param {String} hHash hexadecimal hash value of message to be signed. + * @param {String} hashAlg hash algorithm name for signing. + * @param {Integer} sLen salt byte length from 0 to (keybytelen - hashbytelen - 2). + * There are two special values: + *
    + *
  • -1: sets the salt length to the digest length
    • + *
  • -2: sets the salt length to maximum permissible value + * (i.e. keybytelen - hashbytelen - 2)
    • + *
+ * DEFAULT is -1. (NOTE: OpenSSL's default is -2.) + * @return returns hexadecimal string of signature value. + * @since rsasign 1.2.6 + */ +function _rsasign_signWithMessageHashPSS(hHash, hashAlg, sLen) { + var mHash = hextorstr(hHash); + var hLen = mHash.length; + var emBits = this.n.bitLength() - 1; + var emLen = Math.ceil(emBits / 8); + var i; + var hashFunc = function(sHex) { return KJUR.crypto.Util.hashHex(sHex, hashAlg); } + + if (sLen === -1 || sLen === undefined) { + sLen = hLen; // same as hash length + } else if (sLen === -2) { + sLen = emLen - hLen - 2; // maximum + } else if (sLen < -2) { + throw "invalid salt length"; + } + + if (emLen < (hLen + sLen + 2)) { + throw "data too long"; + } + + var salt = ''; + + if (sLen > 0) { + salt = new Array(sLen); + new SecureRandom().nextBytes(salt); + salt = String.fromCharCode.apply(String, salt); + } + + var H = hextorstr(hashFunc(rstrtohex('\x00\x00\x00\x00\x00\x00\x00\x00' + mHash + salt))); + var PS = []; + + for (i = 0; i < emLen - sLen - hLen - 2; i += 1) { + PS[i] = 0x00; + } + + var DB = String.fromCharCode.apply(String, PS) + '\x01' + salt; + var dbMask = pss_mgf1_str(H, DB.length, hashFunc); + var maskedDB = []; + + for (i = 0; i < DB.length; i += 1) { + maskedDB[i] = DB.charCodeAt(i) ^ dbMask.charCodeAt(i); + } + + var mask = (0xff00 >> (8 * emLen - emBits)) & 0xff; + maskedDB[0] &= ~mask; + + for (i = 0; i < hLen; i++) { + maskedDB.push(H.charCodeAt(i)); + } + + maskedDB.push(0xbc); + + return _zeroPaddingOfSignature(this.doPrivate(new BigInteger(maskedDB)).toString(16), + this.n.bitLength()); +} + +// ======================================================================== +// Signature Verification +// ======================================================================== + +function _rsasign_getDecryptSignatureBI(biSig, hN, hE) { + var rsa = new RSAKey(); + rsa.setPublic(hN, hE); + var biDecryptedSig = rsa.doPublic(biSig); + return biDecryptedSig; +} + +function _rsasign_getHexDigestInfoFromSig(biSig, hN, hE) { + var biDecryptedSig = _rsasign_getDecryptSignatureBI(biSig, hN, hE); + var hDigestInfo = biDecryptedSig.toString(16).replace(/^1f+00/, ''); + return hDigestInfo; +} + +function _rsasign_getAlgNameAndHashFromHexDisgestInfo(hDigestInfo) { + for (var algName in KJUR.crypto.Util.DIGESTINFOHEAD) { + var head = KJUR.crypto.Util.DIGESTINFOHEAD[algName]; + var len = head.length; + if (hDigestInfo.substring(0, len) == head) { + var a = [algName, hDigestInfo.substring(len)]; + return a; + } + } + return []; +} + +function _rsasign_verifySignatureWithArgs(sMsg, biSig, hN, hE) { + var hDigestInfo = _rsasign_getHexDigestInfoFromSig(biSig, hN, hE); + var digestInfoAry = _rsasign_getAlgNameAndHashFromHexDisgestInfo(hDigestInfo); + if (digestInfoAry.length == 0) return false; + var algName = digestInfoAry[0]; + var diHashValue = digestInfoAry[1]; + var ff = function(s) { return KJUR.crypto.Util.hashString(s, algName); }; + var msgHashValue = ff(sMsg); + return (diHashValue == msgHashValue); +} + +function _rsasign_verifyHexSignatureForMessage(hSig, sMsg) { + var biSig = parseBigInt(hSig, 16); + var result = _rsasign_verifySignatureWithArgs(sMsg, biSig, + this.n.toString(16), + this.e.toString(16)); + return result; +} + +/** + * verifies a sigature for a message string with RSA public key.
+ * @name verifyString + * @memberOf RSAKey# + * @function + * @param {String} sMsg message string to be verified. + * @param {String} hSig hexadecimal string of siganture.
+ * non-hexadecimal charactors including new lines will be ignored. + * @return returns 1 if valid, otherwise 0 + */ +function _rsasign_verifyString(sMsg, hSig) { + hSig = hSig.replace(_RE_HEXDECONLY, ''); + hSig = hSig.replace(/[ \n]+/g, ""); + var biSig = parseBigInt(hSig, 16); + if (biSig.bitLength() > this.n.bitLength()) return 0; + var biDecryptedSig = this.doPublic(biSig); + var hDigestInfo = biDecryptedSig.toString(16).replace(/^1f+00/, ''); + var digestInfoAry = _rsasign_getAlgNameAndHashFromHexDisgestInfo(hDigestInfo); + + if (digestInfoAry.length == 0) return false; + var algName = digestInfoAry[0]; + var diHashValue = digestInfoAry[1]; + var ff = function(s) { return KJUR.crypto.Util.hashString(s, algName); }; + var msgHashValue = ff(sMsg); + return (diHashValue == msgHashValue); +} + +/** + * verifies a sigature for a message string with RSA public key.
+ * @name verifyWithMessageHash + * @memberOf RSAKey + * @function + * @param {String} sHashHex hexadecimal hash value of message to be verified. + * @param {String} hSig hexadecimal string of siganture.
+ * non-hexadecimal charactors including new lines will be ignored. + * @return returns 1 if valid, otherwise 0 + * @since rsasign 1.2.6 + */ +function _rsasign_verifyWithMessageHash(sHashHex, hSig) { + hSig = hSig.replace(_RE_HEXDECONLY, ''); + hSig = hSig.replace(/[ \n]+/g, ""); + var biSig = parseBigInt(hSig, 16); + if (biSig.bitLength() > this.n.bitLength()) return 0; + var biDecryptedSig = this.doPublic(biSig); + var hDigestInfo = biDecryptedSig.toString(16).replace(/^1f+00/, ''); + var digestInfoAry = _rsasign_getAlgNameAndHashFromHexDisgestInfo(hDigestInfo); + + if (digestInfoAry.length == 0) return false; + var algName = digestInfoAry[0]; + var diHashValue = digestInfoAry[1]; + return (diHashValue == sHashHex); +} + +/** + * verifies a sigature for a message string with RSA public key by PKCS#1 PSS sign.
+ * @name verifyStringPSS + * @memberOf RSAKey + * @function + * @param {String} sMsg message string to be verified. + * @param {String} hSig hexadecimal string of signature value + * @param {String} hashAlg hash algorithm name + * @param {Integer} sLen salt byte length from 0 to (keybytelen - hashbytelen - 2). + * There are two special values: + *
    + *
  • -1: sets the salt length to the digest length
    • + *
  • -2: sets the salt length to maximum permissible value + * (i.e. keybytelen - hashbytelen - 2)
    • + *
+ * DEFAULT is -1. (NOTE: OpenSSL's default is -2.) + * @return returns true if valid, otherwise false + */ +function _rsasign_verifyStringPSS(sMsg, hSig, hashAlg, sLen) { + var hashFunc = function(sHex) { return KJUR.crypto.Util.hashHex(sHex, hashAlg); }; + var hHash = hashFunc(rstrtohex(sMsg)); + + if (sLen === undefined) sLen = -1; + return this.verifyWithMessageHashPSS(hHash, hSig, hashAlg, sLen); +} + +/** + * verifies a sigature for a hash value of message string with RSA public key by PKCS#1 PSS sign.
+ * @name verifyWithMessageHashPSS + * @memberOf RSAKey + * @function + * @param {String} hHash hexadecimal hash value of message string to be verified. + * @param {String} hSig hexadecimal string of signature value + * @param {String} hashAlg hash algorithm name + * @param {Integer} sLen salt byte length from 0 to (keybytelen - hashbytelen - 2). + * There are two special values: + *
    + *
  • -1: sets the salt length to the digest length
    • + *
  • -2: sets the salt length to maximum permissible value + * (i.e. keybytelen - hashbytelen - 2)
    • + *
+ * DEFAULT is -1 (NOTE: OpenSSL's default is -2.) + * @return returns true if valid, otherwise false + * @since rsasign 1.2.6 + */ +function _rsasign_verifyWithMessageHashPSS(hHash, hSig, hashAlg, sLen) { + var biSig = new BigInteger(hSig, 16); + + if (biSig.bitLength() > this.n.bitLength()) { + return false; + } + + var hashFunc = function(sHex) { return KJUR.crypto.Util.hashHex(sHex, hashAlg); }; + var mHash = hextorstr(hHash); + var hLen = mHash.length; + var emBits = this.n.bitLength() - 1; + var emLen = Math.ceil(emBits / 8); + var i; + + if (sLen === -1 || sLen === undefined) { + sLen = hLen; // same as hash length + } else if (sLen === -2) { + sLen = emLen - hLen - 2; // recover + } else if (sLen < -2) { + throw "invalid salt length"; + } + + if (emLen < (hLen + sLen + 2)) { + throw "data too long"; + } + + var em = this.doPublic(biSig).toByteArray(); + + for (i = 0; i < em.length; i += 1) { + em[i] &= 0xff; + } + + while (em.length < emLen) { + em.unshift(0); + } + + if (em[emLen -1] !== 0xbc) { + throw "encoded message does not end in 0xbc"; + } + + em = String.fromCharCode.apply(String, em); + + var maskedDB = em.substr(0, emLen - hLen - 1); + var H = em.substr(maskedDB.length, hLen); + + var mask = (0xff00 >> (8 * emLen - emBits)) & 0xff; + + if ((maskedDB.charCodeAt(0) & mask) !== 0) { + throw "bits beyond keysize not zero"; + } + + var dbMask = pss_mgf1_str(H, maskedDB.length, hashFunc); + var DB = []; + + for (i = 0; i < maskedDB.length; i += 1) { + DB[i] = maskedDB.charCodeAt(i) ^ dbMask.charCodeAt(i); + } + + DB[0] &= ~mask; + + var checkLen = emLen - hLen - sLen - 2; + + for (i = 0; i < checkLen; i += 1) { + if (DB[i] !== 0x00) { + throw "leftmost octets not zero"; + } + } + + if (DB[checkLen] !== 0x01) { + throw "0x01 marker not found"; + } + + return H === hextorstr(hashFunc(rstrtohex('\x00\x00\x00\x00\x00\x00\x00\x00' + mHash + + String.fromCharCode.apply(String, DB.slice(-sLen))))); +} + +RSAKey.prototype.signWithMessageHash = _rsasign_signWithMessageHash; +RSAKey.prototype.signString = _rsasign_signString; +RSAKey.prototype.signStringWithSHA1 = _rsasign_signStringWithSHA1; +RSAKey.prototype.signStringWithSHA256 = _rsasign_signStringWithSHA256; +RSAKey.prototype.sign = _rsasign_signString; +RSAKey.prototype.signWithSHA1 = _rsasign_signStringWithSHA1; +RSAKey.prototype.signWithSHA256 = _rsasign_signStringWithSHA256; + +RSAKey.prototype.signWithMessageHashPSS = _rsasign_signWithMessageHashPSS; +RSAKey.prototype.signStringPSS = _rsasign_signStringPSS; +RSAKey.prototype.signPSS = _rsasign_signStringPSS; +RSAKey.SALT_LEN_HLEN = -1; +RSAKey.SALT_LEN_MAX = -2; + +RSAKey.prototype.verifyWithMessageHash = _rsasign_verifyWithMessageHash; +RSAKey.prototype.verifyString = _rsasign_verifyString; +RSAKey.prototype.verifyHexSignatureForMessage = _rsasign_verifyHexSignatureForMessage; +RSAKey.prototype.verify = _rsasign_verifyString; +RSAKey.prototype.verifyHexSignatureForByteArrayMessage = _rsasign_verifyHexSignatureForMessage; + +RSAKey.prototype.verifyWithMessageHashPSS = _rsasign_verifyWithMessageHashPSS; +RSAKey.prototype.verifyStringPSS = _rsasign_verifyStringPSS; +RSAKey.prototype.verifyPSS = _rsasign_verifyStringPSS; +RSAKey.SALT_LEN_RECOVER = -2; + +/** + * @name RSAKey + * @class key of RSA public key algorithm + * @description Tom Wu's RSA Key class and extension + */ diff --git a/js/sha1.js b/js/sha1.js new file mode 100644 index 0000000..01861f4 --- /dev/null +++ b/js/sha1.js @@ -0,0 +1,136 @@ +/* +CryptoJS v3.1.2 +code.google.com/p/crypto-js +(c) 2009-2013 by Jeff Mott. All rights reserved. +code.google.com/p/crypto-js/wiki/License +*/ +(function () { + // Shortcuts + var C = CryptoJS; + var C_lib = C.lib; + var WordArray = C_lib.WordArray; + var Hasher = C_lib.Hasher; + var C_algo = C.algo; + + // Reusable object + var W = []; + + /** + * SHA-1 hash algorithm. + */ + var SHA1 = C_algo.SHA1 = Hasher.extend({ + _doReset: function () { + this._hash = new WordArray.init([ + 0x67452301, 0xefcdab89, + 0x98badcfe, 0x10325476, + 0xc3d2e1f0 + ]); + }, + + _doProcessBlock: function (M, offset) { + // Shortcut + var H = this._hash.words; + + // Working variables + var a = H[0]; + var b = H[1]; + var c = H[2]; + var d = H[3]; + var e = H[4]; + + // Computation + for (var i = 0; i < 80; i++) { + if (i < 16) { + W[i] = M[offset + i] | 0; + } else { + var n = W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16]; + W[i] = (n << 1) | (n >>> 31); + } + + var t = ((a << 5) | (a >>> 27)) + e + W[i]; + if (i < 20) { + t += ((b & c) | (~b & d)) + 0x5a827999; + } else if (i < 40) { + t += (b ^ c ^ d) + 0x6ed9eba1; + } else if (i < 60) { + t += ((b & c) | (b & d) | (c & d)) - 0x70e44324; + } else /* if (i < 80) */ { + t += (b ^ c ^ d) - 0x359d3e2a; + } + + e = d; + d = c; + c = (b << 30) | (b >>> 2); + b = a; + a = t; + } + + // Intermediate hash value + H[0] = (H[0] + a) | 0; + H[1] = (H[1] + b) | 0; + H[2] = (H[2] + c) | 0; + H[3] = (H[3] + d) | 0; + H[4] = (H[4] + e) | 0; + }, + + _doFinalize: function () { + // Shortcuts + var data = this._data; + var dataWords = data.words; + + var nBitsTotal = this._nDataBytes * 8; + var nBitsLeft = data.sigBytes * 8; + + // Add padding + dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32); + dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = Math.floor(nBitsTotal / 0x100000000); + dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 15] = nBitsTotal; + data.sigBytes = dataWords.length * 4; + + // Hash final blocks + this._process(); + + // Return final computed hash + return this._hash; + }, + + clone: function () { + var clone = Hasher.clone.call(this); + clone._hash = this._hash.clone(); + + return clone; + } + }); + + /** + * Shortcut function to the hasher's object interface. + * + * @param {WordArray|string} message The message to hash. + * + * @return {WordArray} The hash. + * + * @static + * + * @example + * + * var hash = CryptoJS.SHA1('message'); + * var hash = CryptoJS.SHA1(wordArray); + */ + C.SHA1 = Hasher._createHelper(SHA1); + + /** + * Shortcut function to the HMAC's object interface. + * + * @param {WordArray|string} message The message to hash. + * @param {WordArray|string} key The secret key. + * + * @return {WordArray} The HMAC. + * + * @static + * + * @example + * + * var hmac = CryptoJS.HmacSHA1(message, key); + */ + C.HmacSHA1 = Hasher._createHmacHelper(SHA1); +}()); diff --git a/js/sha256.js b/js/sha256.js new file mode 100644 index 0000000..16cee0c --- /dev/null +++ b/js/sha256.js @@ -0,0 +1,185 @@ +/* +CryptoJS v3.1.2 +code.google.com/p/crypto-js +(c) 2009-2013 by Jeff Mott. All rights reserved. +code.google.com/p/crypto-js/wiki/License +*/ +(function (Math) { + // Shortcuts + var C = CryptoJS; + var C_lib = C.lib; + var WordArray = C_lib.WordArray; + var Hasher = C_lib.Hasher; + var C_algo = C.algo; + + // Initialization and round constants tables + var H = []; + var K = []; + + // Compute constants + (function () { + function isPrime(n) { + var sqrtN = Math.sqrt(n); + for (var factor = 2; factor <= sqrtN; factor++) { + if (!(n % factor)) { + return false; + } + } + + return true; + } + + function getFractionalBits(n) { + return ((n - (n | 0)) * 0x100000000) | 0; + } + + var n = 2; + var nPrime = 0; + while (nPrime < 64) { + if (isPrime(n)) { + if (nPrime < 8) { + H[nPrime] = getFractionalBits(Math.pow(n, 1 / 2)); + } + K[nPrime] = getFractionalBits(Math.pow(n, 1 / 3)); + + nPrime++; + } + + n++; + } + }()); + + // Reusable object + var W = []; + + /** + * SHA-256 hash algorithm. + */ + var SHA256 = C_algo.SHA256 = Hasher.extend({ + _doReset: function () { + this._hash = new WordArray.init(H.slice(0)); + }, + + _doProcessBlock: function (M, offset) { + // Shortcut + var H = this._hash.words; + + // Working variables + var a = H[0]; + var b = H[1]; + var c = H[2]; + var d = H[3]; + var e = H[4]; + var f = H[5]; + var g = H[6]; + var h = H[7]; + + // Computation + for (var i = 0; i < 64; i++) { + if (i < 16) { + W[i] = M[offset + i] | 0; + } else { + var gamma0x = W[i - 15]; + var gamma0 = ((gamma0x << 25) | (gamma0x >>> 7)) ^ + ((gamma0x << 14) | (gamma0x >>> 18)) ^ + (gamma0x >>> 3); + + var gamma1x = W[i - 2]; + var gamma1 = ((gamma1x << 15) | (gamma1x >>> 17)) ^ + ((gamma1x << 13) | (gamma1x >>> 19)) ^ + (gamma1x >>> 10); + + W[i] = gamma0 + W[i - 7] + gamma1 + W[i - 16]; + } + + var ch = (e & f) ^ (~e & g); + var maj = (a & b) ^ (a & c) ^ (b & c); + + var sigma0 = ((a << 30) | (a >>> 2)) ^ ((a << 19) | (a >>> 13)) ^ ((a << 10) | (a >>> 22)); + var sigma1 = ((e << 26) | (e >>> 6)) ^ ((e << 21) | (e >>> 11)) ^ ((e << 7) | (e >>> 25)); + + var t1 = h + sigma1 + ch + K[i] + W[i]; + var t2 = sigma0 + maj; + + h = g; + g = f; + f = e; + e = (d + t1) | 0; + d = c; + c = b; + b = a; + a = (t1 + t2) | 0; + } + + // Intermediate hash value + H[0] = (H[0] + a) | 0; + H[1] = (H[1] + b) | 0; + H[2] = (H[2] + c) | 0; + H[3] = (H[3] + d) | 0; + H[4] = (H[4] + e) | 0; + H[5] = (H[5] + f) | 0; + H[6] = (H[6] + g) | 0; + H[7] = (H[7] + h) | 0; + }, + + _doFinalize: function () { + // Shortcuts + var data = this._data; + var dataWords = data.words; + + var nBitsTotal = this._nDataBytes * 8; + var nBitsLeft = data.sigBytes * 8; + + // Add padding + dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32); + dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = Math.floor(nBitsTotal / 0x100000000); + dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 15] = nBitsTotal; + data.sigBytes = dataWords.length * 4; + + // Hash final blocks + this._process(); + + // Return final computed hash + return this._hash; + }, + + clone: function () { + var clone = Hasher.clone.call(this); + clone._hash = this._hash.clone(); + + return clone; + } + }); + + /** + * Shortcut function to the hasher's object interface. + * + * @param {WordArray|string} message The message to hash. + * + * @return {WordArray} The hash. + * + * @static + * + * @example + * + * var hash = CryptoJS.SHA256('message'); + * var hash = CryptoJS.SHA256(wordArray); + */ + C.SHA256 = Hasher._createHelper(SHA256); + + /** + * Shortcut function to the HMAC's object interface. + * + * @param {WordArray|string} message The message to hash. + * @param {WordArray|string} key The secret key. + * + * @return {WordArray} The HMAC. + * + * @static + * + * @example + * + * var hmac = CryptoJS.HmacSHA256(message, key); + */ + C.HmacSHA256 = Hasher._createHmacHelper(SHA256); +}(Math)); diff --git a/js/sha512.js b/js/sha512.js new file mode 100644 index 0000000..4c6940c --- /dev/null +++ b/js/sha512.js @@ -0,0 +1,309 @@ +/* +CryptoJS v3.1.2 +code.google.com/p/crypto-js +(c) 2009-2013 by Jeff Mott. All rights reserved. +code.google.com/p/crypto-js/wiki/License +*/ +(function () { + // Shortcuts + var C = CryptoJS; + var C_lib = C.lib; + var Hasher = C_lib.Hasher; + var C_x64 = C.x64; + var X64Word = C_x64.Word; + var X64WordArray = C_x64.WordArray; + var C_algo = C.algo; + + function X64Word_create() { + return X64Word.create.apply(X64Word, arguments); + } + + // Constants + var K = [ + X64Word_create(0x428a2f98, 0xd728ae22), X64Word_create(0x71374491, 0x23ef65cd), + X64Word_create(0xb5c0fbcf, 0xec4d3b2f), X64Word_create(0xe9b5dba5, 0x8189dbbc), + X64Word_create(0x3956c25b, 0xf348b538), X64Word_create(0x59f111f1, 0xb605d019), + X64Word_create(0x923f82a4, 0xaf194f9b), X64Word_create(0xab1c5ed5, 0xda6d8118), + X64Word_create(0xd807aa98, 0xa3030242), X64Word_create(0x12835b01, 0x45706fbe), + X64Word_create(0x243185be, 0x4ee4b28c), X64Word_create(0x550c7dc3, 0xd5ffb4e2), + X64Word_create(0x72be5d74, 0xf27b896f), X64Word_create(0x80deb1fe, 0x3b1696b1), + X64Word_create(0x9bdc06a7, 0x25c71235), X64Word_create(0xc19bf174, 0xcf692694), + X64Word_create(0xe49b69c1, 0x9ef14ad2), X64Word_create(0xefbe4786, 0x384f25e3), + X64Word_create(0x0fc19dc6, 0x8b8cd5b5), X64Word_create(0x240ca1cc, 0x77ac9c65), + X64Word_create(0x2de92c6f, 0x592b0275), X64Word_create(0x4a7484aa, 0x6ea6e483), + X64Word_create(0x5cb0a9dc, 0xbd41fbd4), X64Word_create(0x76f988da, 0x831153b5), + X64Word_create(0x983e5152, 0xee66dfab), X64Word_create(0xa831c66d, 0x2db43210), + X64Word_create(0xb00327c8, 0x98fb213f), X64Word_create(0xbf597fc7, 0xbeef0ee4), + X64Word_create(0xc6e00bf3, 0x3da88fc2), X64Word_create(0xd5a79147, 0x930aa725), + X64Word_create(0x06ca6351, 0xe003826f), X64Word_create(0x14292967, 0x0a0e6e70), + X64Word_create(0x27b70a85, 0x46d22ffc), X64Word_create(0x2e1b2138, 0x5c26c926), + X64Word_create(0x4d2c6dfc, 0x5ac42aed), X64Word_create(0x53380d13, 0x9d95b3df), + X64Word_create(0x650a7354, 0x8baf63de), X64Word_create(0x766a0abb, 0x3c77b2a8), + X64Word_create(0x81c2c92e, 0x47edaee6), X64Word_create(0x92722c85, 0x1482353b), + X64Word_create(0xa2bfe8a1, 0x4cf10364), X64Word_create(0xa81a664b, 0xbc423001), + X64Word_create(0xc24b8b70, 0xd0f89791), X64Word_create(0xc76c51a3, 0x0654be30), + X64Word_create(0xd192e819, 0xd6ef5218), X64Word_create(0xd6990624, 0x5565a910), + X64Word_create(0xf40e3585, 0x5771202a), X64Word_create(0x106aa070, 0x32bbd1b8), + X64Word_create(0x19a4c116, 0xb8d2d0c8), X64Word_create(0x1e376c08, 0x5141ab53), + X64Word_create(0x2748774c, 0xdf8eeb99), X64Word_create(0x34b0bcb5, 0xe19b48a8), + X64Word_create(0x391c0cb3, 0xc5c95a63), X64Word_create(0x4ed8aa4a, 0xe3418acb), + X64Word_create(0x5b9cca4f, 0x7763e373), X64Word_create(0x682e6ff3, 0xd6b2b8a3), + X64Word_create(0x748f82ee, 0x5defb2fc), X64Word_create(0x78a5636f, 0x43172f60), + X64Word_create(0x84c87814, 0xa1f0ab72), X64Word_create(0x8cc70208, 0x1a6439ec), + X64Word_create(0x90befffa, 0x23631e28), X64Word_create(0xa4506ceb, 0xde82bde9), + X64Word_create(0xbef9a3f7, 0xb2c67915), X64Word_create(0xc67178f2, 0xe372532b), + X64Word_create(0xca273ece, 0xea26619c), X64Word_create(0xd186b8c7, 0x21c0c207), + X64Word_create(0xeada7dd6, 0xcde0eb1e), X64Word_create(0xf57d4f7f, 0xee6ed178), + X64Word_create(0x06f067aa, 0x72176fba), X64Word_create(0x0a637dc5, 0xa2c898a6), + X64Word_create(0x113f9804, 0xbef90dae), X64Word_create(0x1b710b35, 0x131c471b), + X64Word_create(0x28db77f5, 0x23047d84), X64Word_create(0x32caab7b, 0x40c72493), + X64Word_create(0x3c9ebe0a, 0x15c9bebc), X64Word_create(0x431d67c4, 0x9c100d4c), + X64Word_create(0x4cc5d4be, 0xcb3e42b6), X64Word_create(0x597f299c, 0xfc657e2a), + X64Word_create(0x5fcb6fab, 0x3ad6faec), X64Word_create(0x6c44198c, 0x4a475817) + ]; + + // Reusable objects + var W = []; + (function () { + for (var i = 0; i < 80; i++) { + W[i] = X64Word_create(); + } + }()); + + /** + * SHA-512 hash algorithm. + */ + var SHA512 = C_algo.SHA512 = Hasher.extend({ + _doReset: function () { + this._hash = new X64WordArray.init([ + new X64Word.init(0x6a09e667, 0xf3bcc908), new X64Word.init(0xbb67ae85, 0x84caa73b), + new X64Word.init(0x3c6ef372, 0xfe94f82b), new X64Word.init(0xa54ff53a, 0x5f1d36f1), + new X64Word.init(0x510e527f, 0xade682d1), new X64Word.init(0x9b05688c, 0x2b3e6c1f), + new X64Word.init(0x1f83d9ab, 0xfb41bd6b), new X64Word.init(0x5be0cd19, 0x137e2179) + ]); + }, + + _doProcessBlock: function (M, offset) { + // Shortcuts + var H = this._hash.words; + + var H0 = H[0]; + var H1 = H[1]; + var H2 = H[2]; + var H3 = H[3]; + var H4 = H[4]; + var H5 = H[5]; + var H6 = H[6]; + var H7 = H[7]; + + var H0h = H0.high; + var H0l = H0.low; + var H1h = H1.high; + var H1l = H1.low; + var H2h = H2.high; + var H2l = H2.low; + var H3h = H3.high; + var H3l = H3.low; + var H4h = H4.high; + var H4l = H4.low; + var H5h = H5.high; + var H5l = H5.low; + var H6h = H6.high; + var H6l = H6.low; + var H7h = H7.high; + var H7l = H7.low; + + // Working variables + var ah = H0h; + var al = H0l; + var bh = H1h; + var bl = H1l; + var ch = H2h; + var cl = H2l; + var dh = H3h; + var dl = H3l; + var eh = H4h; + var el = H4l; + var fh = H5h; + var fl = H5l; + var gh = H6h; + var gl = H6l; + var hh = H7h; + var hl = H7l; + + // Rounds + for (var i = 0; i < 80; i++) { + // Shortcut + var Wi = W[i]; + + // Extend message + if (i < 16) { + var Wih = Wi.high = M[offset + i * 2] | 0; + var Wil = Wi.low = M[offset + i * 2 + 1] | 0; + } else { + // Gamma0 + var gamma0x = W[i - 15]; + var gamma0xh = gamma0x.high; + var gamma0xl = gamma0x.low; + var gamma0h = ((gamma0xh >>> 1) | (gamma0xl << 31)) ^ ((gamma0xh >>> 8) | (gamma0xl << 24)) ^ (gamma0xh >>> 7); + var gamma0l = ((gamma0xl >>> 1) | (gamma0xh << 31)) ^ ((gamma0xl >>> 8) | (gamma0xh << 24)) ^ ((gamma0xl >>> 7) | (gamma0xh << 25)); + + // Gamma1 + var gamma1x = W[i - 2]; + var gamma1xh = gamma1x.high; + var gamma1xl = gamma1x.low; + var gamma1h = ((gamma1xh >>> 19) | (gamma1xl << 13)) ^ ((gamma1xh << 3) | (gamma1xl >>> 29)) ^ (gamma1xh >>> 6); + var gamma1l = ((gamma1xl >>> 19) | (gamma1xh << 13)) ^ ((gamma1xl << 3) | (gamma1xh >>> 29)) ^ ((gamma1xl >>> 6) | (gamma1xh << 26)); + + // W[i] = gamma0 + W[i - 7] + gamma1 + W[i - 16] + var Wi7 = W[i - 7]; + var Wi7h = Wi7.high; + var Wi7l = Wi7.low; + + var Wi16 = W[i - 16]; + var Wi16h = Wi16.high; + var Wi16l = Wi16.low; + + var Wil = gamma0l + Wi7l; + var Wih = gamma0h + Wi7h + ((Wil >>> 0) < (gamma0l >>> 0) ? 1 : 0); + var Wil = Wil + gamma1l; + var Wih = Wih + gamma1h + ((Wil >>> 0) < (gamma1l >>> 0) ? 1 : 0); + var Wil = Wil + Wi16l; + var Wih = Wih + Wi16h + ((Wil >>> 0) < (Wi16l >>> 0) ? 1 : 0); + + Wi.high = Wih; + Wi.low = Wil; + } + + var chh = (eh & fh) ^ (~eh & gh); + var chl = (el & fl) ^ (~el & gl); + var majh = (ah & bh) ^ (ah & ch) ^ (bh & ch); + var majl = (al & bl) ^ (al & cl) ^ (bl & cl); + + var sigma0h = ((ah >>> 28) | (al << 4)) ^ ((ah << 30) | (al >>> 2)) ^ ((ah << 25) | (al >>> 7)); + var sigma0l = ((al >>> 28) | (ah << 4)) ^ ((al << 30) | (ah >>> 2)) ^ ((al << 25) | (ah >>> 7)); + var sigma1h = ((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9)); + var sigma1l = ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9)); + + // t1 = h + sigma1 + ch + K[i] + W[i] + var Ki = K[i]; + var Kih = Ki.high; + var Kil = Ki.low; + + var t1l = hl + sigma1l; + var t1h = hh + sigma1h + ((t1l >>> 0) < (hl >>> 0) ? 1 : 0); + var t1l = t1l + chl; + var t1h = t1h + chh + ((t1l >>> 0) < (chl >>> 0) ? 1 : 0); + var t1l = t1l + Kil; + var t1h = t1h + Kih + ((t1l >>> 0) < (Kil >>> 0) ? 1 : 0); + var t1l = t1l + Wil; + var t1h = t1h + Wih + ((t1l >>> 0) < (Wil >>> 0) ? 1 : 0); + + // t2 = sigma0 + maj + var t2l = sigma0l + majl; + var t2h = sigma0h + majh + ((t2l >>> 0) < (sigma0l >>> 0) ? 1 : 0); + + // Update working variables + hh = gh; + hl = gl; + gh = fh; + gl = fl; + fh = eh; + fl = el; + el = (dl + t1l) | 0; + eh = (dh + t1h + ((el >>> 0) < (dl >>> 0) ? 1 : 0)) | 0; + dh = ch; + dl = cl; + ch = bh; + cl = bl; + bh = ah; + bl = al; + al = (t1l + t2l) | 0; + ah = (t1h + t2h + ((al >>> 0) < (t1l >>> 0) ? 1 : 0)) | 0; + } + + // Intermediate hash value + H0l = H0.low = (H0l + al); + H0.high = (H0h + ah + ((H0l >>> 0) < (al >>> 0) ? 1 : 0)); + H1l = H1.low = (H1l + bl); + H1.high = (H1h + bh + ((H1l >>> 0) < (bl >>> 0) ? 1 : 0)); + H2l = H2.low = (H2l + cl); + H2.high = (H2h + ch + ((H2l >>> 0) < (cl >>> 0) ? 1 : 0)); + H3l = H3.low = (H3l + dl); + H3.high = (H3h + dh + ((H3l >>> 0) < (dl >>> 0) ? 1 : 0)); + H4l = H4.low = (H4l + el); + H4.high = (H4h + eh + ((H4l >>> 0) < (el >>> 0) ? 1 : 0)); + H5l = H5.low = (H5l + fl); + H5.high = (H5h + fh + ((H5l >>> 0) < (fl >>> 0) ? 1 : 0)); + H6l = H6.low = (H6l + gl); + H6.high = (H6h + gh + ((H6l >>> 0) < (gl >>> 0) ? 1 : 0)); + H7l = H7.low = (H7l + hl); + H7.high = (H7h + hh + ((H7l >>> 0) < (hl >>> 0) ? 1 : 0)); + }, + + _doFinalize: function () { + // Shortcuts + var data = this._data; + var dataWords = data.words; + + var nBitsTotal = this._nDataBytes * 8; + var nBitsLeft = data.sigBytes * 8; + + // Add padding + dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32); + dataWords[(((nBitsLeft + 128) >>> 10) << 5) + 30] = Math.floor(nBitsTotal / 0x100000000); + dataWords[(((nBitsLeft + 128) >>> 10) << 5) + 31] = nBitsTotal; + data.sigBytes = dataWords.length * 4; + + // Hash final blocks + this._process(); + + // Convert hash to 32-bit word array before returning + var hash = this._hash.toX32(); + + // Return final computed hash + return hash; + }, + + clone: function () { + var clone = Hasher.clone.call(this); + clone._hash = this._hash.clone(); + + return clone; + }, + + blockSize: 1024/32 + }); + + /** + * Shortcut function to the hasher's object interface. + * + * @param {WordArray|string} message The message to hash. + * + * @return {WordArray} The hash. + * + * @static + * + * @example + * + * var hash = CryptoJS.SHA512('message'); + * var hash = CryptoJS.SHA512(wordArray); + */ + C.SHA512 = Hasher._createHelper(SHA512); + + /** + * Shortcut function to the HMAC's object interface. + * + * @param {WordArray|string} message The message to hash. + * @param {WordArray|string} key The secret key. + * + * @return {WordArray} The HMAC. + * + * @static + * + * @example + * + * var hmac = CryptoJS.HmacSHA512(message, key); + */ + C.HmacSHA512 = Hasher._createHmacHelper(SHA512); +}()); diff --git a/js/x509-1.1.js b/js/x509-1.1.js new file mode 100644 index 0000000..783873c --- /dev/null +++ b/js/x509-1.1.js @@ -0,0 +1,371 @@ +/*! x509-1.1.2.js (c) 2012 Kenji Urushima | kjur.github.com/jsrsasign/license + */ +/* + * x509.js - X509 class to read subject public key from certificate. + * + * Copyright (c) 2010-2013 Kenji Urushima (kenji.urushima@gmail.com) + * + * This software is licensed under the terms of the MIT License. + * http://kjur.github.com/jsrsasign/license + * + * The above copyright and license notice shall be + * included in all copies or substantial portions of the Software. + */ + +/** + * @fileOverview + * @name x509-1.1.js + * @author Kenji Urushima kenji.urushima@gmail.com + * @version x509 1.1.2 (2013-Oct-06) + * @since jsrsasign 1.x.x + * @license MIT License + */ + +/* + * Depends: + * base64.js + * rsa.js + * asn1hex.js + */ + +/** + * X.509 certificate class.
+ * @class X.509 certificate class + * @property {RSAKey} subjectPublicKeyRSA Tom Wu's RSAKey object + * @property {String} subjectPublicKeyRSA_hN hexadecimal string for modulus of RSA public key + * @property {String} subjectPublicKeyRSA_hE hexadecimal string for public exponent of RSA public key + * @property {String} hex hexacedimal string for X.509 certificate. + * @author Kenji Urushima + * @version 1.0.1 (08 May 2012) + * @see 'jwrsasign'(RSA Sign JavaScript Library) home page http://kjur.github.com/jsrsasign/ + */ +function X509() { + this.subjectPublicKeyRSA = null; + this.subjectPublicKeyRSA_hN = null; + this.subjectPublicKeyRSA_hE = null; + this.hex = null; + + // ===== get basic fields from hex ===================================== + + /** + * get hexadecimal string of serialNumber field of certificate.
+ * @name getSerialNumberHex + * @memberOf X509# + * @function + */ + this.getSerialNumberHex = function() { + return ASN1HEX.getDecendantHexVByNthList(this.hex, 0, [0, 1]); + }; + + /** + * get hexadecimal string of issuer field of certificate.
+ * @name getIssuerHex + * @memberOf X509# + * @function + */ + this.getIssuerHex = function() { + return ASN1HEX.getDecendantHexTLVByNthList(this.hex, 0, [0, 3]); + }; + + /** + * get string of issuer field of certificate.
+ * @name getIssuerString + * @memberOf X509# + * @function + */ + this.getIssuerString = function() { + return X509.hex2dn(ASN1HEX.getDecendantHexTLVByNthList(this.hex, 0, [0, 3])); + }; + + /** + * get hexadecimal string of subject field of certificate.
+ * @name getSubjectHex + * @memberOf X509# + * @function + */ + this.getSubjectHex = function() { + return ASN1HEX.getDecendantHexTLVByNthList(this.hex, 0, [0, 5]); + }; + + /** + * get string of subject field of certificate.
+ * @name getSubjectString + * @memberOf X509# + * @function + */ + this.getSubjectString = function() { + return X509.hex2dn(ASN1HEX.getDecendantHexTLVByNthList(this.hex, 0, [0, 5])); + }; + + /** + * get notBefore field string of certificate.
+ * @name getNotBefore + * @memberOf X509# + * @function + */ + this.getNotBefore = function() { + var s = ASN1HEX.getDecendantHexVByNthList(this.hex, 0, [0, 4, 0]); + s = s.replace(/(..)/g, "%$1"); + s = decodeURIComponent(s); + return s; + }; + + /** + * get notAfter field string of certificate.
+ * @name getNotAfter + * @memberOf X509# + * @function + */ + this.getNotAfter = function() { + var s = ASN1HEX.getDecendantHexVByNthList(this.hex, 0, [0, 4, 1]); + s = s.replace(/(..)/g, "%$1"); + s = decodeURIComponent(s); + return s; + }; + + // ===== read certificate public key ========================== + + // ===== read certificate ===================================== + /** + * read PEM formatted X.509 certificate from string.
+ * @name readCertPEM + * @memberOf X509# + * @function + * @param {String} sCertPEM string for PEM formatted X.509 certificate + */ + this.readCertPEM = function(sCertPEM) { + var hCert = X509.pemToHex(sCertPEM); + var a = X509.getPublicKeyHexArrayFromCertHex(hCert); + var rsa = new RSAKey(); + rsa.setPublic(a[0], a[1]); + this.subjectPublicKeyRSA = rsa; + this.subjectPublicKeyRSA_hN = a[0]; + this.subjectPublicKeyRSA_hE = a[1]; + this.hex = hCert; + }; + + this.readCertPEMWithoutRSAInit = function(sCertPEM) { + var hCert = X509.pemToHex(sCertPEM); + var a = X509.getPublicKeyHexArrayFromCertHex(hCert); + this.subjectPublicKeyRSA.setPublic(a[0], a[1]); + this.subjectPublicKeyRSA_hN = a[0]; + this.subjectPublicKeyRSA_hE = a[1]; + this.hex = hCert; + }; +}; + +X509.pemToBase64 = function(sCertPEM) { + var s = sCertPEM; + s = s.replace("-----BEGIN CERTIFICATE-----", ""); + s = s.replace("-----END CERTIFICATE-----", ""); + s = s.replace(/[ \n]+/g, ""); + return s; +}; + +X509.pemToHex = function(sCertPEM) { + var b64Cert = X509.pemToBase64(sCertPEM); + var hCert = b64tohex(b64Cert); + return hCert; +}; + +// NOTE: Without BITSTRING encapsulation. +X509.getSubjectPublicKeyPosFromCertHex = function(hCert) { + var pInfo = X509.getSubjectPublicKeyInfoPosFromCertHex(hCert); + if (pInfo == -1) return -1; + var a = ASN1HEX.getPosArrayOfChildren_AtObj(hCert, pInfo); + if (a.length != 2) return -1; + var pBitString = a[1]; + if (hCert.substring(pBitString, pBitString + 2) != '03') return -1; + var pBitStringV = ASN1HEX.getStartPosOfV_AtObj(hCert, pBitString); + + if (hCert.substring(pBitStringV, pBitStringV + 2) != '00') return -1; + return pBitStringV + 2; +}; + +// NOTE: privateKeyUsagePeriod field of X509v2 not supported. +// NOTE: v1 and v3 supported +X509.getSubjectPublicKeyInfoPosFromCertHex = function(hCert) { + var pTbsCert = ASN1HEX.getStartPosOfV_AtObj(hCert, 0); + var a = ASN1HEX.getPosArrayOfChildren_AtObj(hCert, pTbsCert); + if (a.length < 1) return -1; + if (hCert.substring(a[0], a[0] + 10) == "a003020102") { // v3 + if (a.length < 6) return -1; + return a[6]; + } else { + if (a.length < 5) return -1; + return a[5]; + } +}; + +X509.getPublicKeyHexArrayFromCertHex = function(hCert) { + var p = X509.getSubjectPublicKeyPosFromCertHex(hCert); + var a = ASN1HEX.getPosArrayOfChildren_AtObj(hCert, p); + if (a.length != 2) return []; + var hN = ASN1HEX.getHexOfV_AtObj(hCert, a[0]); + var hE = ASN1HEX.getHexOfV_AtObj(hCert, a[1]); + if (hN != null && hE != null) { + return [hN, hE]; + } else { + return []; + } +}; + +X509.getHexTbsCertificateFromCert = function(hCert) { + var pTbsCert = ASN1HEX.getStartPosOfV_AtObj(hCert, 0); + return pTbsCert; +}; + +X509.getPublicKeyHexArrayFromCertPEM = function(sCertPEM) { + var hCert = X509.pemToHex(sCertPEM); + var a = X509.getPublicKeyHexArrayFromCertHex(hCert); + return a; +}; + +X509.hex2dn = function(hDN) { + var s = ""; + var a = ASN1HEX.getPosArrayOfChildren_AtObj(hDN, 0); + for (var i = 0; i < a.length; i++) { + var hRDN = ASN1HEX.getHexOfTLV_AtObj(hDN, a[i]); + s = s + "/" + X509.hex2rdn(hRDN); + } + return s; +}; + +X509.hex2rdn = function(hRDN) { + var hType = ASN1HEX.getDecendantHexTLVByNthList(hRDN, 0, [0, 0]); + var hValue = ASN1HEX.getDecendantHexVByNthList(hRDN, 0, [0, 1]); + var type = ""; + try { type = X509.DN_ATTRHEX[hType]; } catch (ex) { type = hType; } + hValue = hValue.replace(/(..)/g, "%$1"); + var value = decodeURIComponent(hValue); + return type + "=" + value; +}; + +X509.DN_ATTRHEX = { + "0603550406": "C", + "060355040a": "O", + "060355040b": "OU", + "0603550403": "CN", + "0603550405": "SN", + "0603550408": "ST", + "0603550407": "L" +}; + +/** + * get RSAKey/ECDSA public key object from PEM certificate string + * @name getPublicKeyFromCertPEM + * @memberOf X509 + * @function + * @param {String} sCertPEM PEM formatted RSA/ECDSA/DSA X.509 certificate + * @return returns RSAKey/KJUR.crypto.{ECDSA,DSA} object of public key + * @since x509 1.1.1 + * @description + * NOTE: DSA is also supported since x509 1.1.2. + */ +X509.getPublicKeyFromCertPEM = function(sCertPEM) { + var info = X509.getPublicKeyInfoPropOfCertPEM(sCertPEM); + + if (info.algoid == "2a864886f70d010101") { // RSA + var aRSA = KEYUTIL.parsePublicRawRSAKeyHex(info.keyhex); + var key = new RSAKey(); + key.setPublic(aRSA.n, aRSA.e); + return key; + } else if (info.algoid == "2a8648ce3d0201") { // ECC + var curveName = KJUR.crypto.OID.oidhex2name[info.algparam]; + var key = new KJUR.crypto.ECDSA({'curve': curveName, 'info': info.keyhex}); + key.setPublicKeyHex(info.keyhex); + return key; + } else if (info.algoid == "2a8648ce380401") { // DSA 1.2.840.10040.4.1 + var p = ASN1HEX.getVbyList(info.algparam, 0, [0], "02"); + var q = ASN1HEX.getVbyList(info.algparam, 0, [1], "02"); + var g = ASN1HEX.getVbyList(info.algparam, 0, [2], "02"); + var y = ASN1HEX.getHexOfV_AtObj(info.keyhex, 0); + y = y.substr(2); + var key = new KJUR.crypto.DSA(); + key.setPublic(new BigInteger(p, 16), + new BigInteger(q, 16), + new BigInteger(g, 16), + new BigInteger(y, 16)); + return key; + } else { + throw "unsupported key"; + } +}; + +/** + * get public key information from PEM certificate + * @name getPublicKeyInfoPropOfCertPEM + * @memberOf X509 + * @function + * @param {String} sCertPEM string of PEM formatted certificate + * @return {Hash} hash of information for public key + * @since x509 1.1.1 + * @description + * Resulted associative array has following properties: + *
    + *
  • algoid - hexadecimal string of OID of asymmetric key algorithm
    • + *
  • algparam - hexadecimal string of OID of ECC curve name or null
    • + *
  • keyhex - hexadecimal string of key in the certificate
    • + *
+ * @since x509 1.1.1 + */ +X509.getPublicKeyInfoPropOfCertPEM = function(sCertPEM) { + var result = {}; + result.algparam = null; + var hCert = X509.pemToHex(sCertPEM); + + // 1. Certificate ASN.1 + var a1 = ASN1HEX.getPosArrayOfChildren_AtObj(hCert, 0); + if (a1.length != 3) + throw "malformed X.509 certificate PEM (code:001)"; // not 3 item of seq Cert + + // 2. tbsCertificate + if (hCert.substr(a1[0], 2) != "30") + throw "malformed X.509 certificate PEM (code:002)"; // tbsCert not seq + + var a2 = ASN1HEX.getPosArrayOfChildren_AtObj(hCert, a1[0]); + + // 3. subjectPublicKeyInfo + if (a2.length < 7) + throw "malformed X.509 certificate PEM (code:003)"; // no subjPubKeyInfo + + var a3 = ASN1HEX.getPosArrayOfChildren_AtObj(hCert, a2[6]); + + if (a3.length != 2) + throw "malformed X.509 certificate PEM (code:004)"; // not AlgId and PubKey + + // 4. AlgId + var a4 = ASN1HEX.getPosArrayOfChildren_AtObj(hCert, a3[0]); + + if (a4.length != 2) + throw "malformed X.509 certificate PEM (code:005)"; // not 2 item in AlgId + + result.algoid = ASN1HEX.getHexOfV_AtObj(hCert, a4[0]); + + if (hCert.substr(a4[1], 2) == "06") { // EC + result.algparam = ASN1HEX.getHexOfV_AtObj(hCert, a4[1]); + } else if (hCert.substr(a4[1], 2) == "30") { // DSA + result.algparam = ASN1HEX.getHexOfTLV_AtObj(hCert, a4[1]); + } + + // 5. Public Key Hex + if (hCert.substr(a3[1], 02) != "03") + throw "malformed X.509 certificate PEM (code:006)"; // not bitstring + + var unusedBitAndKeyHex = ASN1HEX.getHexOfV_AtObj(hCert, a3[1]); + result.keyhex = unusedBitAndKeyHex.substr(2); + + return result; +}; + +/* +X509.prototype.readCertPEM = _x509_readCertPEM; +X509.prototype.readCertPEMWithoutRSAInit = _x509_readCertPEMWithoutRSAInit; +X509.prototype.getSerialNumberHex = _x509_getSerialNumberHex; +X509.prototype.getIssuerHex = _x509_getIssuerHex; +X509.prototype.getSubjectHex = _x509_getSubjectHex; +X509.prototype.getIssuerString = _x509_getIssuerString; +X509.prototype.getSubjectString = _x509_getSubjectString; +X509.prototype.getNotBefore = _x509_getNotBefore; +X509.prototype.getNotAfter = _x509_getNotAfter; +*/ diff --git a/js/x64-core.js b/js/x64-core.js new file mode 100644 index 0000000..7a5be33 --- /dev/null +++ b/js/x64-core.js @@ -0,0 +1,290 @@ +/* +CryptoJS v3.1.2 +code.google.com/p/crypto-js +(c) 2009-2013 by Jeff Mott. All rights reserved. +code.google.com/p/crypto-js/wiki/License +*/ +(function (undefined) { + // Shortcuts + var C = CryptoJS; + var C_lib = C.lib; + var Base = C_lib.Base; + var X32WordArray = C_lib.WordArray; + + /** + * x64 namespace. + */ + var C_x64 = C.x64 = {}; + + /** + * A 64-bit word. + */ + var X64Word = C_x64.Word = Base.extend({ + /** + * Initializes a newly created 64-bit word. + * + * @param {number} high The high 32 bits. + * @param {number} low The low 32 bits. + * + * @example + * + * var x64Word = CryptoJS.x64.Word.create(0x00010203, 0x04050607); + */ + init: function (high, low) { + this.high = high; + this.low = low; + } + + /** + * Bitwise NOTs this word. + * + * @return {X64Word} A new x64-Word object after negating. + * + * @example + * + * var negated = x64Word.not(); + */ + // not: function () { + // var high = ~this.high; + // var low = ~this.low; + + // return X64Word.create(high, low); + // }, + + /** + * Bitwise ANDs this word with the passed word. + * + * @param {X64Word} word The x64-Word to AND with this word. + * + * @return {X64Word} A new x64-Word object after ANDing. + * + * @example + * + * var anded = x64Word.and(anotherX64Word); + */ + // and: function (word) { + // var high = this.high & word.high; + // var low = this.low & word.low; + + // return X64Word.create(high, low); + // }, + + /** + * Bitwise ORs this word with the passed word. + * + * @param {X64Word} word The x64-Word to OR with this word. + * + * @return {X64Word} A new x64-Word object after ORing. + * + * @example + * + * var ored = x64Word.or(anotherX64Word); + */ + // or: function (word) { + // var high = this.high | word.high; + // var low = this.low | word.low; + + // return X64Word.create(high, low); + // }, + + /** + * Bitwise XORs this word with the passed word. + * + * @param {X64Word} word The x64-Word to XOR with this word. + * + * @return {X64Word} A new x64-Word object after XORing. + * + * @example + * + * var xored = x64Word.xor(anotherX64Word); + */ + // xor: function (word) { + // var high = this.high ^ word.high; + // var low = this.low ^ word.low; + + // return X64Word.create(high, low); + // }, + + /** + * Shifts this word n bits to the left. + * + * @param {number} n The number of bits to shift. + * + * @return {X64Word} A new x64-Word object after shifting. + * + * @example + * + * var shifted = x64Word.shiftL(25); + */ + // shiftL: function (n) { + // if (n < 32) { + // var high = (this.high << n) | (this.low >>> (32 - n)); + // var low = this.low << n; + // } else { + // var high = this.low << (n - 32); + // var low = 0; + // } + + // return X64Word.create(high, low); + // }, + + /** + * Shifts this word n bits to the right. + * + * @param {number} n The number of bits to shift. + * + * @return {X64Word} A new x64-Word object after shifting. + * + * @example + * + * var shifted = x64Word.shiftR(7); + */ + // shiftR: function (n) { + // if (n < 32) { + // var low = (this.low >>> n) | (this.high << (32 - n)); + // var high = this.high >>> n; + // } else { + // var low = this.high >>> (n - 32); + // var high = 0; + // } + + // return X64Word.create(high, low); + // }, + + /** + * Rotates this word n bits to the left. + * + * @param {number} n The number of bits to rotate. + * + * @return {X64Word} A new x64-Word object after rotating. + * + * @example + * + * var rotated = x64Word.rotL(25); + */ + // rotL: function (n) { + // return this.shiftL(n).or(this.shiftR(64 - n)); + // }, + + /** + * Rotates this word n bits to the right. + * + * @param {number} n The number of bits to rotate. + * + * @return {X64Word} A new x64-Word object after rotating. + * + * @example + * + * var rotated = x64Word.rotR(7); + */ + // rotR: function (n) { + // return this.shiftR(n).or(this.shiftL(64 - n)); + // }, + + /** + * Adds this word with the passed word. + * + * @param {X64Word} word The x64-Word to add with this word. + * + * @return {X64Word} A new x64-Word object after adding. + * + * @example + * + * var added = x64Word.add(anotherX64Word); + */ + // add: function (word) { + // var low = (this.low + word.low) | 0; + // var carry = (low >>> 0) < (this.low >>> 0) ? 1 : 0; + // var high = (this.high + word.high + carry) | 0; + + // return X64Word.create(high, low); + // } + }); + + /** + * An array of 64-bit words. + * + * @property {Array} words The array of CryptoJS.x64.Word objects. + * @property {number} sigBytes The number of significant bytes in this word array. + */ + var X64WordArray = C_x64.WordArray = Base.extend({ + /** + * Initializes a newly created word array. + * + * @param {Array} words (Optional) An array of CryptoJS.x64.Word objects. + * @param {number} sigBytes (Optional) The number of significant bytes in the words. + * + * @example + * + * var wordArray = CryptoJS.x64.WordArray.create(); + * + * var wordArray = CryptoJS.x64.WordArray.create([ + * CryptoJS.x64.Word.create(0x00010203, 0x04050607), + * CryptoJS.x64.Word.create(0x18191a1b, 0x1c1d1e1f) + * ]); + * + * var wordArray = CryptoJS.x64.WordArray.create([ + * CryptoJS.x64.Word.create(0x00010203, 0x04050607), + * CryptoJS.x64.Word.create(0x18191a1b, 0x1c1d1e1f) + * ], 10); + */ + init: function (words, sigBytes) { + words = this.words = words || []; + + if (sigBytes != undefined) { + this.sigBytes = sigBytes; + } else { + this.sigBytes = words.length * 8; + } + }, + + /** + * Converts this 64-bit word array to a 32-bit word array. + * + * @return {CryptoJS.lib.WordArray} This word array's data as a 32-bit word array. + * + * @example + * + * var x32WordArray = x64WordArray.toX32(); + */ + toX32: function () { + // Shortcuts + var x64Words = this.words; + var x64WordsLength = x64Words.length; + + // Convert + var x32Words = []; + for (var i = 0; i < x64WordsLength; i++) { + var x64Word = x64Words[i]; + x32Words.push(x64Word.high); + x32Words.push(x64Word.low); + } + + return X32WordArray.create(x32Words, this.sigBytes); + }, + + /** + * Creates a copy of this word array. + * + * @return {X64WordArray} The clone. + * + * @example + * + * var clone = x64WordArray.clone(); + */ + clone: function () { + var clone = Base.clone.call(this); + + // Clone "words" array + var words = clone.words = this.words.slice(0); + + // Clone each X64Word object + var wordsLength = words.length; + for (var i = 0; i < wordsLength; i++) { + words[i] = words[i].clone(); + } + + return clone; + } + }); +}());