|
1576 | 1576 | determine correctness, the evaluator shall submit the key pairs to the public |
1577 | 1577 | key validation (PKV) function of the TOE and shall confirm that the results |
1578 | 1578 | correspond as expected for the modified and unmodified values.<h:p/> |
1579 | | - |
| 1579 | + |
| 1580 | + |
| 1581 | + <h:br/><h:b>LMS Key Generation</h:b><h:p/> |
| 1582 | + <h:table border="1"> |
| 1583 | + <h:tr class="header" bgcolor="#cccccc"> |
| 1584 | + <h:td valign="top">Identifier</h:td> |
| 1585 | + <h:td valign="top">Cryptographic Key Generation Algorithm</h:td> |
| 1586 | + <h:td valign="top">Cryptographic Algorithm Parameters</h:td> |
| 1587 | + <h:td valign="top">List of Standards</h:td> |
| 1588 | + </h:tr> |
| 1589 | + <h:tr> |
| 1590 | + <h:td valign="top">LMS</h:td> |
| 1591 | + <h:td valign="top">LMS Key Generation</h:td> |
| 1592 | + <h:td valign="top">Private key size = [<h:b>selection:</h:b> |
| 1593 | + 192 bits with [<h:b>selection:</h:b> SHA-256/192, SHAKE256/192], |
| 1594 | + 256 bits with [<h:b>selection:</h:b> SHA-256, SHAKE256]]; |
| 1595 | + Winternitz parameter = [<h:b>selection:</h:b> 1, 2, 4, 8]; |
| 1596 | + Tree height = [<h:b>selection:</h:b> 5, 10, 15, 20, 25] |
| 1597 | + </h:td> |
| 1598 | + <h:td valign="top">RFC 8554 [LMS]<h:p/>NIST SP 800-208 [parameters]</h:td> |
| 1599 | + </h:tr> |
| 1600 | + </h:table><h:p/> |
| 1601 | + To test the TOE’s ability to generate asymmetric cryptographic keys using LMS, the |
| 1602 | + evaluator shall perform the LMS Key Generation Test using the following input parameters: |
| 1603 | + <h:ul> |
| 1604 | + <h:li>Hash algorithm [SHA-256/192, SHAKE256/192, SHA-256, SHAKE256]</h:li> |
| 1605 | + <h:li>Winternitz [1, 2, 4, 8]</h:li> |
| 1606 | + <h:li>Tree height [5, 10, 15, 20, 25]</h:li></h:ul><h:p/> |
| 1607 | + <h:br/><h:i><h:b>LMS Key Generation Test</h:b></h:i><h:br/> |
| 1608 | + For each supported combination of the hash algorithm, Winternitz parameter, and tree height the |
| 1609 | + evaluator shall generate one public key for each of the test cases. The number of test cases |
| 1610 | + depends on the tree height: |
| 1611 | + <h:b><h:div style="text-align: center;"> |
| 1612 | + <ctr ctr-type="Table" pre="Table " id="lms-test-cases">: Number of LMS Test Cases</ctr> |
| 1613 | + </h:div> |
| 1614 | + </h:b> |
| 1615 | + |
| 1616 | + <h:table border="1" style="width:50%"> |
| 1617 | + <h:tr class="header" bgcolor="#cccccc"> |
| 1618 | + <h:td valign="top">Height</h:td> |
| 1619 | + <h:td valign="top">Number of test cases</h:td> |
| 1620 | + </h:tr> |
| 1621 | + <h:tr> |
| 1622 | + <h:td valign="top">5</h:td> |
| 1623 | + <h:td valign="top">5</h:td> |
| 1624 | + </h:tr> |
| 1625 | + <h:tr> |
| 1626 | + <h:td valign="top">10</h:td> |
| 1627 | + <h:td valign="top">4</h:td> |
| 1628 | + </h:tr> |
| 1629 | + <h:tr> |
| 1630 | + <h:td valign="top">15</h:td> |
| 1631 | + <h:td valign="top">3</h:td> |
| 1632 | + </h:tr> |
| 1633 | + <h:tr> |
| 1634 | + <h:td valign="top">20</h:td> |
| 1635 | + <h:td valign="top">2</h:td> |
| 1636 | + </h:tr> |
| 1637 | + <h:tr> |
| 1638 | + <h:td valign="top">25</h:td> |
| 1639 | + <h:td valign="top">1</h:td> |
| 1640 | + </h:tr> |
| 1641 | + </h:table><h:p/> |
| 1642 | + The evaluator shall verify the correctness of the TSF’s implementation by |
| 1643 | + comparing the public key generated by the TSF with that generated by a known |
| 1644 | + good implementation using the same input parameters.<h:p/> |
| 1645 | + |
| 1646 | + |
1580 | 1647 | <h:br/><h:b>ML-KEM Key Generation</h:b><h:p/> |
1581 | 1648 | <h:table border="1"> |
1582 | 1649 | <h:tr class="header" bgcolor="#cccccc"> |
|
1629 | 1696 | under test to generate 25 key pairs using 25 different randomly generated 32-byte |
1630 | 1697 | seed values. To determine correctness, the evaluator shall compare the resulting |
1631 | 1698 | key pairs with those generated using a known-good implementation using the same |
1632 | | - inputs.<h:p/> |
| 1699 | + inputs.<h:p/> |
| 1700 | + |
| 1701 | + <h:br/><h:b>XMSS Key Generation</h:b><h:p/> |
| 1702 | + <h:table border="1"> |
| 1703 | + <h:tr class="header" bgcolor="#cccccc"> |
| 1704 | + <h:td valign="top">Identifier</h:td> |
| 1705 | + <h:td valign="top">Cryptographic Key Generation Algorithm</h:td> |
| 1706 | + <h:td valign="top">Cryptographic Algorithm Parameters</h:td> |
| 1707 | + <h:td valign="top">List of Standards</h:td> |
| 1708 | + </h:tr> |
| 1709 | + <h:tr> |
| 1710 | + <h:td valign="top">XMSS</h:td> |
| 1711 | + <h:td valign="top">XMSS</h:td> |
| 1712 | + <h:td valign="top">Private key size = [<h:b>selection:</h:b> 192 bits |
| 1713 | + with [<h:b>selection:</h:b> SHA-256/192, SHAKE256/192], 256 bits |
| 1714 | + with [<h:b>selection:</h:b> SHA-256, SHAKE256]], tree height = |
| 1715 | + [<h:b>selection:</h:b> 10, 16, 20]</h:td> |
| 1716 | + <h:td valign="top">RFC 8391 [XMSS]<h:p/> |
| 1717 | + NIST SP 800-208 [parameters]</h:td> |
| 1718 | + </h:tr> |
| 1719 | + </h:table><h:p/> |
| 1720 | + To test the TOE’s ability to generate asymmetric cryptographic keys using |
| 1721 | + XMSS, the evaluator shall perform the XMSS Key |
| 1722 | + Generation Test using the following input parameters:<h:ul> |
| 1723 | + <h:li>Hash algorithm [SHA-256/192, SHAKE256/192, SHA-256, SHAKE256]</h:li> |
| 1724 | + <h:li>Tree height [10, 16, 20] (XMSS only)</h:li></h:ul><h:p/> |
| 1725 | + |
| 1726 | + <h:b><h:div style="text-align: center;"> |
| 1727 | + <ctr ctr-type="Table" pre="Table " id="xmss-akg-test-cases">: Number of Test Cases for XMSS<h:sup>MT</h:sup></ctr> |
| 1728 | + </h:div></h:b> |
| 1729 | + <h:table border="1" style="width:50%"> |
| 1730 | + <h:tr class="header" bgcolor="#cccccc"> |
| 1731 | + <h:td valign="top">Height</h:td> |
| 1732 | + <h:td valign="top">Number of test cases</h:td> |
| 1733 | + </h:tr> |
| 1734 | + <h:tr> |
| 1735 | + <h:td valign="top">10</h:td> |
| 1736 | + <h:td valign="top">5</h:td> |
| 1737 | + </h:tr> |
| 1738 | + <h:tr> |
| 1739 | + <h:td valign="top">16</h:td> |
| 1740 | + <h:td valign="top">4</h:td> |
| 1741 | + </h:tr> |
| 1742 | + <h:tr> |
| 1743 | + <h:td valign="top">20</h:td> |
| 1744 | + <h:td valign="top">3</h:td> |
| 1745 | + </h:tr> |
| 1746 | + <h:tr> |
| 1747 | + <h:td valign="top">40</h:td> |
| 1748 | + <h:td valign="top">2</h:td> |
| 1749 | + </h:tr> |
| 1750 | + <h:tr> |
| 1751 | + <h:td valign="top">60</h:td> |
| 1752 | + <h:td valign="top">1</h:td> |
| 1753 | + </h:tr> |
| 1754 | + </h:table><h:p/> |
| 1755 | + |
| 1756 | + <h:br/><h:i><h:b>XMSS Key Generation Test</h:b></h:i><h:br/> |
| 1757 | + For each supported combination of hash algorithm and tree height, the evaluator |
| 1758 | + shall generate one public key for each test case. The number of test cases |
| 1759 | + depends on the tree height as specified in <xref to="xmss-test-cases"/>.<h:p/> |
| 1760 | + |
| 1761 | + The evaluator shall verify the correctness of the TSF’s implementation by comparing |
| 1762 | + values generated by the TSF with those generated by a known good implementation using |
| 1763 | + the same input parameters.<h:p/> |
| 1764 | + |
| 1765 | + Note: The number of test cases is limited due to the extreme amount of time it can |
| 1766 | + take to generate XMSS trees.<h:p/> |
1633 | 1767 | </Tests> |
1634 | 1768 | </aactivity> |
1635 | 1769 | </f-element> |
|
0 commit comments