Keyless Mixing Function for Secure Data Transmission
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing secrecy coding methods face challenges in maintaining confidentiality and error-free transmission due to uncertainties in noise models and temporary noise failures, which can compromise security.
Innovation Solution
A method that incorporates a keyless mixing function upstream of the secrecy coding block, combining current information with previous blocks, and its inverse downstream for decoding, ensuring self-synchronization and increased security without requiring shared secret keys.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If secrecy coding is used alone, then confidentiality is provided based on noise model assumptions, but security is compromised when noise models are temporarily invalid or fail
Solution Approach 1:
The mixing function combines current information blocks with previous blocks before secrecy coding, preparing the data in advance to ensure that even if noise models fail temporarily, the security is maintained through the mixing of multiple blocks. This preliminary mixing action prevents security compromise during noise model uncertainties.
Solution Approach 2:
The patent creates a composite security mechanism by combining mixing function with secrecy coding. The mixing function processes multiple information blocks together, creating a composite structure where security depends on the combination of blocks rather than a single block, thereby maintaining reliability even when noise models are temporarily invalid.
2Reliability
If mixing function is added upstream of secrecy coding, then security is enhanced and self-synchronization is achieved, but device complexity increases
Solution Approach 1:
The mixing function is self-synchronizing, meaning it automatically maintains synchronization between transmitter and receiver without requiring external control or complex synchronization protocols. The function uses previous blocks to mix with current blocks, and this process naturally keeps both ends synchronized, providing self-service synchronization that enhances security without proportionally increasing complexity.
Solution Approach 2:
The mixing function serves multiple purposes: it enhances security by combining multiple blocks, provides self-synchronization between transmitter and receiver, and prepares data for secrecy coding. This multi-functionality means that one additional component achieves multiple security and operational goals, reducing the overall complexity increase compared to separate mechanisms for each function.
3Reliability
If parameter r (memory size) is increased to enhance security, then more previous blocks are combined, but synchronization time and error propagation increase
Solution Approach 1:
The patent uses a finite memory size r that combines a partial number of previous blocks rather than all possible blocks. This partial action provides sufficient security enhancement while limiting the memory requirements and synchronization time. The parameter r is chosen to provide adequate security without excessive delay, representing an optimal balance between security level and synchronization performance.
Data Source
Figure 1~2
AI summary
A method for increasing security in a message transmission system using a data encryption protocol between a sender A and a receiver B, characterized in that it comprises at least the following steps: When sender A wishes to transmit a message xi to receiver B, the sender adds to the message xi security data obtained by applying a function f which takes as input the α blocks of a RAS memory obtained during the previous α transmissions or during an initialization phase to construct a message of higher security level xi*. The message xi* is transmitted to the coding step using a secret code, and, in parallel, the blocks of the current message xi* are added to the memory of sender A. The coded message is transmitted to receiver B. Upon reception, B adds to the message from the secret coding step the output of the inverse function f-1.that is, the α data contained in a memory RBR of receiver B to obtain the decoded message, then receiver B adds to RBR the data from the secret coding step.