MAC-Based User Permission Check System for Low-Spec CPUs
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Public key cryptography-based user permission systems require high CPU throughput and processing time, making them unsuitable for low-spec CPU devices, particularly in time-critical applications where prolonged CPU occupation can impact safety and functionality.
Innovation Solution
A user permission check system utilizing a Message Authentication Code (MAC) function with low CPU processing power, where messages are encrypted with multiple secret keys stored across multiple servers, ensuring non-repudiation by aggregating individual validation results.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If public key cryptography algorithms are used for user permission checking, then non-repudiation is achieved, but CPU processing time increases and throughput decreases
Solution Approach 1:
The patent segments the single public key verification process into multiple MAC verification processes using different secret keys stored in different servers. Instead of using one computationally intensive public key algorithm, the system divides the verification into several lighter MAC operations, each handling a portion of the security validation, thereby reducing overall CPU processing time while maintaining non-repudiation through aggregated verification results.
Solution Approach 2:
The patent introduces MAC (Message Authentication Code) as an intermediary mechanism between the user terminal and servers. Rather than directly using public key cryptography for permission checking, the system employs MAC codes generated with secret keys as an intermediate layer that provides verification capability with lower computational overhead, thus reducing CPU processing time while preserving security guarantees.
2Reliability
If public key cryptography algorithms are used for signature generation and verification, then non-repudiation is ensured, but system throughput decreases
Solution Approach 1:
The patent segments the verification workload across multiple servers, each performing MAC verification with different secret keys. This segmentation allows parallel processing of verification tasks, increasing system throughput compared to sequential public key verification, while the aggregation of multiple MAC verification results maintains the non-repudiation property.
Solution Approach 2:
The patent changes the cryptographic parameter from public key algorithms to MAC-based authentication using secret keys. This parameter change reduces the computational complexity of each verification operation, allowing more verification operations to be performed per unit time, thereby increasing system throughput while maintaining security through the use of multiple keys and aggregation.
3Reliability
If public key encryption is used on low-spec CPU devices, then security is maintained, but processing time becomes excessively long
Solution Approach 1:
The patent introduces MAC as an intermediary that bridges security requirements and low-processing-power constraints. The MAC function provides cryptographic verification capability with significantly lower computational demands than public key algorithms, making it suitable for low-spec CPU devices while maintaining security through the use of multiple secret keys and aggregation of verification results.
Solution Approach 2:
The patent employs multiple secret keys that can be independently generated and managed, replacing the need for computationally expensive public key pairs. Each secret key serves as a disposable, lightweight cryptographic element that provides verification capability without the overhead of public key infrastructure, reducing processing time on resource-constrained devices.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A user permission check system with less CPU throughput while ensuring non-repudiation is provided. In order to solve the above-described problem, in the present invention firstly, a MAC function that does not require a CPU to have high processing power is utilized. Additionally, a message is encrypted with a plurality of secret keys and the plurality of keys are distributed to a plurality of servers to make them have the keys in order to ensure validity of the message as a proof of non-repudiation. Subsequently, each server proves the validity of the message within its own range and the validity of the message is ensured by aggregating these individual results, thereby implementing the non-repudiation.