Secure key-evolving for public key cryptosystems based on the discrete logarithm problem

Cheng Fen Lu*, Shiuh-Pyng Shieh

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

This paper 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. We 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 Zp* and is efficient for the secret-key holder; the second operates in Zn*, and is efficient for the public-key holder. For both protocols, we provide proofs and analysis for correctness, security and efficiency.

Original languageEnglish
Pages (from-to)391-400
Number of pages10
JournalJournal of Information Science and Engineering
Volume20
Issue number2
DOIs
StatePublished - 1 Mar 2004

Keywords

  • Discrete logarithm
  • Key evolving
  • Key independence
  • Key management
  • Provable security

Fingerprint Dive into the research topics of 'Secure key-evolving for public key cryptosystems based on the discrete logarithm problem'. Together they form a unique fingerprint.

Cite this