N-State Cryptographic Switching for Unpredictable Hash Operations
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing cryptographic procedures are susceptible to attacks due to their widespread use and predictable nature, making them vulnerable to unauthorized access and data breaches in networked devices.
Innovation Solution
Implementing a cryptographic apparatus that modifies standard cryptographic methods using Lab-transformed bitwise XORing and reversible n-state inverters to create an alternate finite field (aGF(n)) with unpredictable parameters, ensuring secure data transmission and obfuscation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If standard cryptographic procedures are used, then cryptographic operations are easy to implement and maintain, but security is compromised due to predictability and widespread vulnerability to attacks
Solution Approach 1:
The patent applies parameter changes by transforming standard cryptographic operations through Lab-transformed bitwise XORing and reversible n-state inverters. These transformations modify the parameters of cryptographic operations (such as transformation matrices and state mappings) to create unpredictable behavior while maintaining the underlying cryptographic structure, thereby enhancing security without completely redesigning the cryptographic system
Solution Approach 2:
The patent introduces intermediary elements including transformation matrices, state inverters, and finite field mappings that act as mediators between standard cryptographic operations and the final cryptographic output. These intermediaries add layers of complexity and unpredictability, making attacks more difficult while allowing the system to build upon established cryptographic procedures
2Reliability
If cryptographic procedures are made unpredictable through novel transformations, then security against attacks is improved, but the procedures become more complex and harder to implement
Solution Approach 1:
The patent segments cryptographic operations into distinct modular components: Lab-transformed bitwise XORing operations, reversible n-state inverter transformations, and finite field GF(n) mappings. Each segment can be independently implemented and tested, facilitating easier deployment of the complex transformed cryptographic procedures while maintaining security through the cumulative effect of multiple transformation layers
Data Source
AI summary
Circuits defined by n-state switching tables with n>2 are transformed by at least one n-state inverter which may be a Finite Lab-transform (FLT) into a Finite Lab-transformed (FLTed) n-state switching devices. Computer operations defined by transformed or modified n-state switching tables are applied in cryptographic operations, including one or more message digests or hashing methods or computer one-way functions. A keyword is generated from a public keyword by at least one modified known hashing method. A known hashing method may be selected from the group consisting of SHA-1, SHA-2, SHA-3, MD5, MD6, Blake2, Blake3 and CubeHash. Internal states of known hashing methods are modified to generate unpredictable hash values.


