PRN Data Obfuscation Using ValueSampleSpace and Carry-Less Add
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data encryption methods lack high-performance protection and safety, particularly in data obfuscation processes that require efficient and secure encryption of large data sets.
Innovation Solution
A data obfuscation method utilizing a multiplicity-dimensioned ValueSampleSpace, ElementTransitionStrategies, and SamplingStrategies to generate pseudo-random number sequences, followed by carry-less add operations and Vectored IO Scatter Gather techniques for secure data transmission.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional data encryption methods are used, then data security is provided, but encryption performance and speed are insufficient for large data sets
Solution Approach 1:
The patent segments the encryption process into multiple independent stages: ValueSampleSpace generation, ElementTransitionStrategy application, SamplingStrategy execution, and carry-less add operations. Each stage processes data independently and can be parallelized, significantly improving encryption throughput while maintaining security through the cumulative effect of multiple transformation layers
Solution Approach 2:
The patent employs dynamic strategy selection where ElementTransitionStrategies and SamplingStrategies are algorithmically identified based on previous element states and element counters. This dynamic adaptation allows the encryption system to vary its transformation patterns, preventing predictability and enhancing security while maintaining high processing speeds through efficient state-dependent decision making
2Reliability
If data obfuscation is performed using conventional methods, then data protection is achieved, but the complexity of the encryption process increases without sufficient performance gain
Solution Approach 1:
The patent replaces traditional mechanical encryption mechanisms with algorithmic operations in the mathematical domain. Instead of physical substitution boxes or permutation networks, the system uses carry-less add operations, polynomial-based ValueSampleSpace indexing, and algorithmic strategy selection. This substitution reduces hardware complexity while maintaining cryptographic strength through mathematically rigorous transformations
Solution Approach 2:
The patent changes the parameter space of encryption operations by working with polynomial representations and algebraic structures rather than traditional bit-manipulation approaches. The ValueSampleSpace is indexed using polynomial evaluations, and transformations are performed using carry-less addition in GF(2)[x]. These parameter changes enable more efficient computation with reduced operational complexity while preserving security properties
3Reliability
If pseudo-random number generation is used for encryption, then data obfuscation is achieved, but the quality and distribution of random values may be insufficient
Solution Approach 1:
The patent performs preliminary action by pre-generating and storing ValueSampleSpace elements before they are needed for encryption. The multi-dimensional array of pre-computed polynomial evaluations is prepared in advance, allowing rapid retrieval and transformation during actual encryption operations. This pre-computation phase separates the computationally intensive random value generation from the time-critical encryption process, achieving both high quality and high speed
Solution Approach 2:
The patent transitions from traditional one-dimensional random number generation to multi-dimensional ValueSampleSpace navigation. By indexing into multi-dimensional arrays using polynomial-based addressing and applying multiple transformation strategies across different dimensions, the system generates random values with superior statistical properties and distribution characteristics while maintaining efficient access patterns for high-speed generation
Data Source
AI summary
Embodiments are generally directed to a data obfuscation method that has access to a plurality-dimensioned ValueSampleSpace, a multiplicity of ValueSampleSpace ElementTransitionStrategies, and a multiplicity of ValueSampleSpace SamplingStrategies, where each ValueSampleSpace element holds a plurality of data bit values. A suitably plurality-dimensioned array with each element holding a plurality of data bit values can represent a plurality-dimensioned ValueSampleSpace, though other ValueSampleSpace representations are within the scope of the present disclosure.