/********************************************************************************/ /* */ /* */ /* Written by Ken Goldman */ /* IBM Thomas J. Watson Research Center */ /* */ /* Licenses and Notices */ /* */ /* 1. Copyright Licenses: */ /* */ /* - Trusted Computing Group (TCG) grants to the user of the source code in */ /* this specification (the "Source Code") a worldwide, irrevocable, */ /* nonexclusive, royalty free, copyright license to reproduce, create */ /* derivative works, distribute, display and perform the Source Code and */ /* derivative works thereof, and to grant others the rights granted herein. */ /* */ /* - The TCG grants to the user of the other parts of the specification */ /* (other than the Source Code) the rights to reproduce, distribute, */ /* display, and perform the specification solely for the purpose of */ /* developing products based on such documents. */ /* */ /* 2. Source Code Distribution Conditions: */ /* */ /* - Redistributions of Source Code must retain the above copyright licenses, */ /* this list of conditions and the following disclaimers. */ /* */ /* - Redistributions in binary form must reproduce the above copyright */ /* licenses, this list of conditions and the following disclaimers in the */ /* documentation and/or other materials provided with the distribution. */ /* */ /* 3. Disclaimers: */ /* */ /* - THE COPYRIGHT LICENSES SET FORTH ABOVE DO NOT REPRESENT ANY FORM OF */ /* LICENSE OR WAIVER, EXPRESS OR IMPLIED, BY ESTOPPEL OR OTHERWISE, WITH */ /* RESPECT TO PATENT RIGHTS HELD BY TCG MEMBERS (OR OTHER THIRD PARTIES) */ /* THAT MAY BE NECESSARY TO IMPLEMENT THIS SPECIFICATION OR OTHERWISE. */ /* Contact TCG Administration (admin@trustedcomputinggroup.org) for */ /* information on specification licensing rights available through TCG */ /* membership agreements. */ /* */ /* - THIS SPECIFICATION IS PROVIDED "AS IS" WITH NO EXPRESS OR IMPLIED */ /* WARRANTIES WHATSOEVER, INCLUDING ANY WARRANTY OF MERCHANTABILITY OR */ /* FITNESS FOR A PARTICULAR PURPOSE, ACCURACY, COMPLETENESS, OR */ /* NONINFRINGEMENT OF INTELLECTUAL PROPERTY RIGHTS, OR ANY WARRANTY */ /* OTHERWISE ARISING OUT OF ANY PROPOSAL, SPECIFICATION OR SAMPLE. */ /* */ /* - Without limitation, TCG and its members and licensors disclaim all */ /* liability, including liability for infringement of any proprietary */ /* rights, relating to use of information in this specification and to the */ /* implementation of this specification, and TCG disclaims all liability for */ /* cost of procurement of substitute goods or services, lost profits, loss */ /* of use, loss of data or any incidental, consequential, direct, indirect, */ /* or special damages, whether under contract, tort, warranty or otherwise, */ /* arising in any way out of use or reliance upon this specification or any */ /* information herein. */ /* */ /* (c) Copyright IBM Corp. and others, 2023 */ /* */ /********************************************************************************/ #include "Tpm.h" #include "TpmEcc_Signature_ECDAA_fp.h" #include "TpmEcc_Signature_Util_fp.h" #include "TpmMath_Debug_fp.h" #include "TpmMath_Util_fp.h" #if ALG_ECC && ALG_ECDAA //*** TpmEcc_SignEcdaa() // // This function performs 's' = 'r' + 'T' * 'd' mod 'q' where // 1) 'r' is a random, or pseudo-random value created in the commit phase // 2) 'nonceK' is a TPM-generated, random value 0 < 'nonceK' < 'n' // 3) 'T' is mod 'q' of "Hash"('nonceK' || 'digest'), and // 4) 'd' is a private key. // // The signature is the tuple ('nonceK', 's') // // Regrettably, the parameters in this function kind of collide with the parameter // names used in ECSCHNORR making for a lot of confusion. // Return Type: TPM_RC // TPM_RC_SCHEME unsupported hash algorithm // TPM_RC_NO_RESULT cannot get values from random number generator TPM_RC TpmEcc_SignEcdaa( TPM2B_ECC_PARAMETER* nonceK, // OUT: 'nonce' component of the signature Crypt_Int* bnS, // OUT: 's' component of the signature const Crypt_EccCurve* E, // IN: the curve used in signing Crypt_Int* bnD, // IN: the private key const TPM2B_DIGEST* digest, // IN: the value to sign (mod 'q') TPMT_ECC_SCHEME* scheme, // IN: signing scheme (contains the // commit count value). OBJECT* eccKey, // IN: The signing key RAND_STATE* rand // IN: a random number state ) { TPM_RC retVal; TPM2B_ECC_PARAMETER r; HASH_STATE state; TPM2B_DIGEST T; CRYPT_INT_MAX(bnT); // NOT_REFERENCED(rand); if(!CryptGenerateR(&r, &scheme->details.ecdaa.count, eccKey->publicArea.parameters.eccDetail.curveID, &eccKey->name)) retVal = TPM_RC_VALUE; else { // This allocation is here because 'r' doesn't have a value until // CrypGenerateR() is done. CRYPT_ECC_INITIALIZED(bnR, &r); do { // generate nonceK such that 0 < nonceK < n // use bnT as a temp. if(!TpmEcc_GenPrivateScalar(bnT, E, rand)) { retVal = TPM_RC_NO_RESULT; break; } TpmMath_IntTo2B(bnT, &nonceK->b, 0); T.t.size = CryptHashStart(&state, scheme->details.ecdaa.hashAlg); if(T.t.size == 0) { retVal = TPM_RC_SCHEME; } else { CryptDigestUpdate2B(&state, &nonceK->b); CryptDigestUpdate2B(&state, &digest->b); CryptHashEnd2B(&state, &T.b); TpmMath_IntFrom2B(bnT, &T.b); // Watch out for the name collisions in this call!! retVal = TpmEcc_SchnorrCalculateS( bnS, bnR, bnT, bnD, ExtEcc_CurveGetOrder(ExtEcc_CurveGetCurveId(E))); } } while(retVal == TPM_RC_NO_RESULT); // Because the rule is that internal state is not modified if the command // fails, only end the commit if the command succeeds. // NOTE that if the result of the Schnorr computation was zero // it will probably not be worthwhile to run the same command again because // the result will still be zero. This means that the Commit command will // need to be run again to get a new commit value for the signature. if(retVal == TPM_RC_SUCCESS) CryptEndCommit(scheme->details.ecdaa.count); } return retVal; } #endif // ALG_ECC && ALG_ECDAA