LUT-Based Encryption for Lightweight Chiplet Message Verification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
There is a need for secure and lightweight communication between chiplets in resource-constrained devices, which are constrained in computing power, memory resources, or power supply, with a focus on ensuring message integrity and authenticity while minimizing resource-intensive operations such as multiplication and hash functions.
Innovation Solution
A cryptographic method using lookup table (LUT) and keystream table (KST) operations, including XOR operations, to encrypt and decrypt messages, and using cyclic redundancy check (CRC) for verification, which are computed dynamically to reduce computational and memory requirements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional hash functions are used for message verification, then verification security is improved, but computational overhead increases significantly for resource-constrained devices
Solution Approach 1:
The patent replaces expensive hash functions with cheaper verification methods using pre-computed lookup tables and simple XOR operations. The verification process uses disposable cryptographic materials (pre-computed tables and keys) that enable secure verification without requiring computationally expensive operations during runtime.
Solution Approach 2:
The patent performs computationally intensive operations in advance by pre-comuting lookup tables and cryptographic keys during initialization. This preliminary action moves the computational burden from runtime verification to setup phase, enabling lightweight verification operations during actual message authentication.
2Reliability
If resource-intensive encryption operations are used, then security is improved, but processing speed decreases in resource-constrained devices
Solution Approach 1:
The patent replaces complex mechanical encryption operations (multiplication, division, hash functions) with simpler electronic operations (XOR, lookup table access). This substitution maintains cryptographic security while dramatically reducing computational complexity and improving processing speed in resource-constrained environments.
Solution Approach 2:
The patent changes the operational parameters of encryption by using pre-computed lookup tables with fixed key sizes and simple XOR operations instead of dynamic cryptographic computations. This parameter change enables constant-time encryption operations that are both secure and fast.
3Reliability
If more memory resources are allocated for cryptographic operations, then security is improved, but available memory for other functions decreases in resource-constrained devices
Solution Approach 1:
The patent segments cryptographic data into fixed-size blocks that can be processed independently using lookup tables. This segmentation allows efficient memory usage by processing data in manageable chunks rather than requiring large contiguous memory allocations, optimizing memory utilization in resource-constrained devices.
Data Source
AI summary
A cryptographic method includes at least (1) receiving a message for encryption, (2) encrypting the message to obtain message ciphertext, the encryption including at least one or more operations that include at least one or more XOR operations, (3) computing a tag on a concatenation that includes at least a nonce, the message ciphertext, and other data, (4) encrypting the tag to obtain one or more ordered blocks of tag ciphertext, the encryption including at least one or more operations that include at least one or more XOR operations, (5) appending the one or more ordered blocks of tag ciphertext to the message ciphertext to obtain final ciphertext, and (6) transmitting the final ciphertext to a second chiplet.