Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  addresses the security and efficiency of key-evolving protocols in public key encryption and signature schemes, where the security assumption is the intractability of the discrete logarithm problem.  identify the key-independence property as the security goal of key-evolving, so that each periodic secret key is independent of each other. The first protocol operates in Z(superscript * subscript p) and is efficient for the secret-key holder, the second operates in Z(superscript * subscript n) and is efficient for the public-key holder For both protocols,  provide proofs and analysis for correctness, security and efficiency
['Cheng-Fen Lu', 'Shiuh-Pyng Shieh']
I am writing a research paper on a idea Secure Key-Evolving for Public Key Cryptosystems Based on the Discrete Logarithm Problem *
[{"from": "human", "value": "I am writing a research paper on a idea Secure Key-Evolving for Public Key Cryptosystems Based on the Discrete Logarithm Problem *"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  addresses the security and efficiency of key-evolving protocols in public key encryption and signature schemes, where the security assumption is the intractability of the discrete logarithm problem.  identify the key-independence property as the security goal of key-evolving, so that each periodic secret key is independent of each other. The first protocol operates in Z(superscript * subscript p) and is efficient for the secret-key holder, the second operates in Z(superscript * subscript n) and is efficient for the public-key holder For both protocols,  provide proofs and analysis for correctness, security and efficiency"}]