Description:RELATED APPLICATION
[0001] The present application claims priority to U.S. Non-Provisional Patent Application No. 17/484,820 filed on 24 September 2021 and titled “COMBINED POST-QUANTUM SECURITY UTILIZING REDEFINED POLYNOMIAL CALCULATION” the entire disclosure of which is hereby incorporated by reference.
TECHNICAL FIELD
[0002] Embodiments described herein generally relate to the field of electronic devices and, more particularly, combined post-quantum security utilizing redefined polynomial calculation.
BACKGROUND
[0003] Quantum computing is expected to enable attackers to solve problems that were previously impractical to attempt, including the solving of cryptographic mathematics. Attacks may utilize side channels to obtain signals from cryptographic computation, and apply quantum computing to determine secret values. As a result, any existing cryptographic methods may potentially be broken.
[0004] Crystals-Dilithium is a lattice based post-quantum digital signature protocol that is a finalist in the National Institute of Standards and Technology (NIST) Post-Quantum Cryptography (PQC) standardization competition. Further, Saber for public key encapsulation/KEM is also based on lattice calculation. The fundamental calculation is such technology is polynomial calculation. For example, for secret sharing (TLS) key encapsulation to generate a ciphertext and to communicate the ciphertext over the unsecure channel a party is required to utilize the digital signature.
[0005] However, the requirements for such digital signature and public key encapsulation technologies are not consistent, and thus in a conventional implementation each of such operations needs to be supported separately.

BRIEF DESCRIPTION OF THE DRAWINGS
[0006] Embodiments described here are illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings in which like reference numerals refer to similar elements.
[0007] FIG. 1 is a high level illustration of a system or apparatus to provide digital signature and key encapsulation operations, according to some embodiments;
[0008] FIG. 2 is an illustration of an NTT algorithm operation that may be utilized in both digital signature and key encapsulation operations, according to some embodiments;
[0009] FIG. 3 is an illustration of remapping of coefficients for a Saber key encapsulation process for operation with an NTT-based multiplier, according to some embodiments;
[0010] FIG. 4 is an illustration of a process for key encapsulation according to some embodiments;
[0011] FIG. 5 is an illustration of details for a process for key encapsulation, according to some embodiments; and
[0012] FIG. 6 illustrates an embodiment of an exemplary computing architecture for operations including combined post-quantum security utilizing redefined polynomial calculation, according to some embodiments.

DETAILED DESCRIPTION
[0013] Embodiments described herein are directed to combined post-quantum security utilizing redefined polynomial calculation.
[0014] Public key cryptography, also referred to as asymmetric cryptography, is in general a cryptographic system that uses pairs of keys in encryption, the pairs including public keys that may be publicly known and private keys that are securely maintained and only known by the key owner. The key pairs are generated utilizing cryptographic algorithms that are based on difficult mathematical problems.
, Claims:1. An apparatus comprising:
a first circuit for key encapsulation operation;
a second circuit for digital signature operation; and
a NTT (Number Theoretic Transform) multiplier circuit, wherein the NTT multiplier circuit provides for polynomial multiplication for both the first circuit and the second circuit;
wherein the apparatus is to:
remap coefficients of polynomials for the first circuit to a prime modulus for the second circuit, and
perform polynomial multiplication for the first circuit utilizing the remapped coefficients of the polynomials for the first circuit.