Binary Tree Digital Signature Verification for Low Power Devices
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Digital signature creation and verification in consumer electronic devices are hindered by the high computational requirements of existing asymmetric encryption methods, such as RSA, which are not suitable for devices with limited processing power.
Innovation Solution
A method using a signing apparatus and validation apparatus that employs a set of node keys and a binary identification code to create and verify digital signatures, allowing for the revocation of illegitimate signers by encrypting and decrypting data using a binary tree structure, with symmetric encryption algorithms like AES, to reduce computational intensity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If asymmetric encryption methods like RSA are used for digital signature creation and verification, then the authenticity and origin of digital content can be proven, but the computational power requirements become too high for consumer electronic devices
Solution Approach 1:
The patent segments the digital signature verification process into multiple independent signature fields, each verified using a separate node key. Instead of requiring one complex asymmetric decryption operation, the system divides the verification into multiple simpler symmetric encryption/decryption operations on individual signature fields, reducing the computational burden on consumer devices.
Solution Approach 2:
The patent changes the cryptographic parameters by replacing asymmetric encryption (RSA) with symmetric encryption methods. The system uses node keys derived from a binary tree structure where each node key can efficiently verify a corresponding signature field. This parameter change transforms the computationally intensive asymmetric operations into lighter symmetric operations suitable for consumer electronic devices.
2Reliability
If traditional digital signature systems are implemented, then security and authenticity are ensured, but the device complexity and computational requirements increase significantly
Solution Approach 1:
The signature block is segmented into multiple signature fields, each associated with a specific node key number. The verification process segments the validation into checking each signature field independently against its corresponding node key, simplifying the overall complexity by breaking down a single complex verification into multiple simpler independent checks.
Solution Approach 2:
The patent introduces a binary tree structure as an additional dimensional framework for organizing node keys and signature fields. This binary identification code structure adds a hierarchical dimension to the verification process, allowing efficient navigation and validation without increasing the complexity of individual verification operations.
3Power
If a binary identification code system with multiple node keys is used, then signature verification becomes computationally feasible, but the system complexity increases due to multiple keys and signature fields
Solution Approach 1:
The binary tree structure and node keys are pre-computed and stored before the actual signature verification takes place. The signing apparatus pre-generates the signature block with multiple signature fields corresponding to pre-established node keys. This preliminary preparation reduces the complexity during the actual verification process, as the consumer device only needs to perform straightforward comparisons rather than complex key derivations.
Solution Approach 2:
The binary identification code acts as an intermediary structure that systematically organizes the relationship between multiple node keys and signature fields. This intermediary framework provides a clear mapping mechanism that simplifies the verification process by directing which node key corresponds to which signature field, reducing the apparent complexity for the consumer device.
Data Source
AI summary
A method for signing a data package uses a signing apparatus, the signing apparatus having a binary identification code comprises the step of providing a set of node keys and a check value for the data package and the step of determining a signature block having a plurality of signature fields. In addition, the method comprises the step of providing the binary identification code of the signing apparatus and the signature block in order to sign the data package.