Digital Signature Generation Using Fixed-Weight Code Words
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing digital signature generation methods, such as the RSA and McEliece schemes, are computationally complex and require numerous iterations to produce a digital signature, leading to increased processing time and load on digital signature generators.
Innovation Solution
A method that utilizes a function F to generate a code word with a set weight value, combined with an inverse of a public parity check matrix H, to reduce computations and time in generating digital signatures, and includes a verification process to detect forgeries using a public function F and the received message and digital signature.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional digital signature schemes (RSA or McEliece) are used, then secure authentication is achieved, but computational complexity and processing time increase
Solution Approach 1:
The patent segments the digital signature generation process into distinct functional modules: a mapping section that converts messages to fixed-weight code words, and a decoder that generates signatures using pre-computed inverse matrices. This segmentation allows each module to be optimized independently, reducing overall computational complexity while maintaining security through the structured approach.
Solution Approach 2:
The patent applies preliminary action by pre-computing and storing inverse matrices of parity check matrices during a key generation phase. These pre-computed inverse matrices are then reused during the signature generation process, eliminating the need to perform complex matrix inversion operations repeatedly, thereby significantly reducing computational complexity during actual signing operations.
2Reliability
If conventional digital signature schemes (RSA or McEliece) are used, then secure authentication is achieved, but processing time increases
Solution Approach 1:
By pre-computing inverse matrices during key generation and storing them for reuse, the patent eliminates time-consuming matrix inversion operations during signature generation. This preliminary action significantly reduces processing time for each signature operation while the security is maintained through the cryptographic strength of the underlying code-based system.
Solution Approach 2:
The patent uses code words from a predetermined code book that are copied and mapped to messages during signature generation. Instead of performing complex cryptographic operations for each signature, the system efficiently copies and transforms pre-defined code words, dramatically reducing processing time while maintaining authentication security through the mathematical properties of the code structure.
3Productivity
If iterative methods are used to generate digital signatures, then signatures are produced, but the number of iterations increases computational load
Solution Approach 1:
The patent replaces iterative signature generation methods with a direct copying approach. Pre-defined code words are copied and mapped to messages through a systematic process, eliminating the need for repeated trial-and-error iterations. This reduces computational load significantly while maintaining the ability to generate valid digital signatures efficiently.
Solution Approach 2:
The patent performs preliminary organization of code words into a code book with fixed weight values during setup. This preliminary action allows the signature generation process to proceed through direct lookup and mapping without iterations, reducing computational load during actual signing operations while maintaining productivity through efficient access to pre-organized cryptographic materials.
Data Source
AI summary
Disclosed are a method and apparatus capable of reducing the number of computations required to generate a digital signature by a digital signature generator. A digital signature generator generates a code word for a received message by a function F for generating a code word having a set weight value and generates a digital signature based on the generated code word and an inverse of a public parity check matrix H, the parity check matrix H is one way function. A digital signature receiver converts the received message using the function F for generating a code word, and multiplies a public parity check matrix H by a received digital signal, the public parity check matrix H is a one way function, and comparing the converted value with the multiplication result.