Implicit Certificate Verification in Elliptic Curve Cryptography
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The key authentication step in elliptic curve public-key cryptography protocols adds significant computational load to the key agreement process, making it inefficient.
Innovation Solution
Conjointly computing the shared key and certificate verification using a homogeneous verification equation, which implicitly verifies the certificate and reduces computational overhead by eliminating the need for separate key authentication steps.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If separate key authentication and key establishment steps are used, then authentication reliability is improved, but computational complexity and processing time increase significantly
Solution Approach 1:
The patent merges the key authentication step with the key establishment step by computing the shared key using a homogeneous verification equation that incorporates certificate verification. This combines two previously separate operations (authentication and key establishment) into a single computational process, reducing overall complexity while maintaining authentication reliability through the integrated verification mechanism
2Reliability
If separate key authentication and key establishment steps are used, then authentication reliability is improved, but processing time increases
Solution Approach 1:
The patent combines authentication and key establishment into a single computational step, eliminating the sequential processing time between separate steps. The homogeneous verification equation allows both authentication verification and shared key computation to occur simultaneously in one operation, significantly reducing total processing time while maintaining security
3Adaptability or versatility
If separate key authentication step is used, then authentication flexibility is improved, but computational overhead increases
Solution Approach 1:
The patent merges authentication verification with key computation, reducing computational overhead by eliminating redundant operations. The homogeneous verification equation integrates certificate validation directly into the shared key computation, reducing the total computational power required while maintaining authentication flexibility through the integrated verification mechanism
Data Source
AI summary
A method of computing a cryptographic key to be shared between a pair of correspondents communicating with one another through a cryptographic system is provided, where one of the correspondents receives a certificate of the other correspondents public key information to be combined with private key information of the one correspondent to generate the key. The method comprises the steps of computing the key by combining the public key information and the private key information and including in the computation a component corresponding to verification of the certificate, such that failure of the certificate to verify results in a key at the one correspondent that is different to the key computed at the other correspondent.