HackerPapers

arXiv:1310.4050cs.IT

An Extension of Cook's Elastic Cipher

Emanuele Bellini, Guglielmo Morgari, Marco Coppola

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

Given a block cipher of length L Cook's elastic cipher allows to encrypt messages of variable length from L to 2L. Given some conditions on the key schedule, Cook's elastic cipher is secure against any key recovery attack if the underlying block cipher is, and it achieves complete diffusion in at most q + 1 rounds if the underlying block cipher achieves it in q rounds. We extend Cook's construction inductively, obtaining an elastic cipher for any message length greater than L with the same properties of security as Cook's elastic cipher.

arXiv comments
Journal reference
DOI
Subjects
cs.ITInformation Theory

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Oct 2017 to Oct 2017.

Comments linking this paper, per year.

Discussed in comments1 thread

    • From everything I've seen, the security requirements of "true" RAE are exactly SPRP - that's certainly how Rogaway has framed it. To the best of my knowledge, that's why he designed AEZ under the encode-then-encipher paradigm - encode the plaintext with \tau trailing zero bits…

      eternaleyeView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.