/** @file Copyright (C) 2019, Download-Fritz. All rights reserved. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. **/ #include #include #include #include #include #include #include #include #include int verifyRsa (CONST OC_RSA_PUBLIC_KEY *PublicKey, char *Name) { OC_BN_WORD N0Inv; UINTN ModulusSize = PublicKey->Hdr.NumQwords * sizeof (UINT64); OC_BN_WORD *RSqrMod = malloc(ModulusSize); if (RSqrMod == NULL) { printf ("memory allocation error!\n"); return -1; } N0Inv = BigNumCalculateMontParams ( RSqrMod, ModulusSize / OC_BN_WORD_SIZE, (CONST OC_BN_WORD *) PublicKey->Data ); printf ( "%s: results: %d %d (%llX vs %llX)\n", Name, memcmp ( RSqrMod, &PublicKey->Data[PublicKey->Hdr.NumQwords], ModulusSize ), N0Inv != PublicKey->Hdr.N0Inv, (unsigned long long) N0Inv, (unsigned long long) PublicKey->Hdr.N0Inv ); free(RSqrMod); return 0; } int main(int argc, char *argv[]) { unsigned int Index; OC_RSA_PUBLIC_KEY *PublicKey; uint32_t PkSize; for (Index = 1; (int) Index < argc; ++Index) { PublicKey = (OC_RSA_PUBLIC_KEY *)readFile (argv[Index], &PkSize); if (PublicKey == NULL) { printf ("read error\n"); return -1; } verifyRsa (PublicKey, argv[Index]); free (PublicKey); } for (Index = 0; (unsigned long) Index < ARRAY_SIZE (PkDataBase); ++Index) { verifyRsa (PkDataBase[Index].PublicKey, "inbuilt"); } return 0; }