Cryptographic Device Shared Matrix Pool Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current cryptographic key-exchange schemes face challenges in achieving high efficiency and security, especially with the impending threat of quantum computers, which can break existing public-key algorithms, and they often incur significant overhead due to the use of shared matrices in lattice-based cryptographic systems.
Innovation Solution
A network node implements a cryptographic operation that uses a shared pool instead of a shared matrix, constructing a new matrix for each operation by selecting functions that map elements from the pool, reducing data storage and computation overhead, and employing a lattice problem with adjustable parameters to instantiate different cryptographic schemes such as RLWE, RLWR, module-LWE, and LWR.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a shared matrix is used in lattice-based cryptographic schemes, then security is achieved, but data storage overhead and computation overhead increase significantly
Solution Approach 1:
The patent divides the shared matrix into multiple shared vectors. Instead of storing and processing a complete shared matrix, the system segments it into smaller vector components that can be independently managed and combined during cryptographic operations, thereby reducing storage overhead while maintaining security properties
Solution Approach 2:
The patent extracts only the essential components needed for cryptographic operations. By using shared vectors derived from the shared matrix rather than the full matrix itself, the system takes out only the necessary elements, reducing data storage requirements while preserving the cryptographic functionality
2Reliability
If a shared matrix is used in lattice-based cryptographic schemes, then security is achieved, but computation time and processing overhead increase
Solution Approach 1:
The patent segments the shared matrix into multiple shared vectors, allowing cryptographic operations to be performed on smaller vector components rather than the full matrix. This segmentation reduces computational complexity and processing time while maintaining the security guarantees of the original lattice-based scheme
Solution Approach 2:
The patent changes the parameter representation from a complete shared matrix to a set of shared vectors with associated indexing information. This parameter transformation reduces the computational burden of matrix operations while preserving the cryptographic security properties through careful selection of vector dimensions and indexing schemes
3Reliability
If a large shared matrix is used for cryptographic operations, then security strength is improved, but efficiency and bandwidth requirements deteriorate
Solution Approach 1:
The patent segments the large shared matrix into multiple smaller shared vectors, reducing the bandwidth required for transmission and storage while maintaining security strength through the mathematical properties of lattice-based cryptography. The segmented vectors can be efficiently processed and combined during key exchange operations
Solution Approach 2:
The patent transforms the problem from operating on a two-dimensional shared matrix to operating on one-dimensional shared vectors with additional indexing dimensions. This dimensional transformation reduces the computational and communication overhead while preserving the security properties through the underlying lattice structure
4Reliability
If quantum-resistant algorithms are implemented, then future security is ensured, but current system overhead and complexity increase
Solution Approach 1:
The patent reduces the complexity of quantum-resistant lattice-based cryptography by segmenting the shared matrix into smaller shared vectors. This segmentation simplifies implementation while maintaining quantum resistance, making the system more practical for deployment without sacrificing future security
Solution Approach 2:
The patent optimizes the parameters of lattice-based cryptographic schemes by transforming the shared matrix into shared vectors with carefully selected dimensions and properties. This parameter optimization reduces system overhead and complexity while maintaining the quantum-resistant security properties required for future-proof cryptography
Data Source
AI summary
Some embodiments relate to an electronic network node (110) configured for a cryptographic operation. The network node obtains a shared matrix (A) by selecting integers, polynomials, and/or polynomial-coefficients from a shared pool, the shared pool being shared with the second network node, wherein the selecting is done according to one or more selection functions.