Mercy: A fast large block cipher for disk sector encryption

47Citations
Citations of this article
40Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We discuss the special requirements imposed on the under-lying cipher of systems which encrypt each sector of a disk partition in-dependently, and demonstrate a certificational weakness in some existing block ciphers including Bellare and Rogaway’s 1999 proposal, proposing a new quantitative measure of avalanche. To address these needs, we present Mercy, a new block cipher accepting large (4096-bit) blocks, which uses a key-dependent state machine to build a bijective F function for a Feistel cipher. Mercy achieves 9 cycles/byte on a Pentium compatible processor.

Cite

CITATION STYLE

APA

Crowley, P. (2001). Mercy: A fast large block cipher for disk sector encryption. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1978, pp. 49–63). Springer Verlag. https://doi.org/10.1007/3-540-44706-7_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free