Re-keying algorithms for symmetric cryptosystems

Cheng Fen Lu, Shiuhpyng Shieh

Research output: Contribution to journalArticlepeer-review


In symmetric cryptosystems, each key has its lifetime. Thus, re-keying algorithms are commonly employed. In this paper, we propose a re-keying algorithm, which ensures the secrecy of other session keys even if the session key of some period is compromised. This re-keying algorithm requires a block cipher and two one-way hash functions. We provide the security analysis and also discuss an implementation option.

Original languageEnglish
Pages (from-to)23-27
Number of pages5
JournalJournal of Discrete Mathematical Sciences and Cryptography
Issue number1
StatePublished - 1 Jan 2004

Fingerprint Dive into the research topics of 'Re-keying algorithms for symmetric cryptosystems'. Together they form a unique fingerprint.

Cite this