Circular Insecure Encryption: from Long Cycles to Short Cycles

Zehou Wu

Paper 2024/1686

Circular Insecure Encryption: from Long Cycles to Short Cycles

Zehou Wu

, University of Victoria

Abstract

We prove that the existence of a CPA-secure encryption scheme that is insecure in the presence of key cycles of length $n$ implies the existence of such a scheme for key cycles of any length less than $n$ . Equivalently, if every encryption scheme in a class is $n$ -circular secure and this class is closed under our construction, then every encryption scheme in this class is $n^{'}$ -circular secure for $n^{'} > n$ .

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Preprint.
Keywords: circular encryption black box counter example
Contact author(s): wuzehouw @ uvic ca
History: 2024-10-18: approved; 2024-10-16: received; See all versions
Short URL: https://ia.cr/2024/1686
License: CC BY

BibTeX

@misc{cryptoeprint:2024/1686,
      author = {Zehou Wu},
      title = {Circular Insecure Encryption: from Long Cycles to Short Cycles},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/1686},
      year = {2024},
      url = {https://eprint.iacr.org/2024/1686}
}