| commit | 8e95c996d22c76fc4d836fb989fce0dd63fc3438 | [log] [tgz] |
|---|---|---|
| author | Stefan Berger <stefanb@linux.vnet.ibm.com> | Tue Jun 18 16:23:12 2019 -0400 |
| committer | Stefan Berger <stefanb@us.ibm.com> | Mon Dec 23 14:14:25 2019 -0500 |
| tree | f2b2f782e3f88fbe5b3671d80223ef8f63108493 | |
| parent | 8dc2415d53c190f88e089e86604a6326453afe29 [diff] |
tests: Add test cases for new CrytpAdjustPrimeCandidate algo Extend the existing key derivation test case for TPM 2 with test cases that use a newer TPM 2 state where we now exercise the new CryptAdjustPrimeCandidate algorithm that produces the same results on big and little enidan 32 bit and 64 bit machines. This newer algorithm is available in libtpms with revision 155 of the TPM 2 code. Signed-off-by: Stefan Berger <stefanb@linux.ibm.com>