The MacGuffin Block Cipher Algorithm (1995) [7 citations — 2 self]
ftp://ftp.research.att.com/dist/mab/mcg.ps
http://crypto.com/papers/./mcg.ps
DBLP
CACHED:
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Matt Blaze and Bruce Schneier},
title = {The MacGuffin Block Cipher Algorithm},
booktitle = {Fast Software Encryption, volume 1008 of Lecture},
year = {1995},
pages = {97--110},
publisher = {Springer-Verlag}
}
Bookmarks
OpenURL
Abstract:
. This paper introduces MacGuffin, a 64 bit "codebook" block cipher. Many of its characteristics (block size, application domain, performance and implementation structure) are similar to those of the U.S. Data Encryption Standard (DES). It is based on a Feistel network, in which the cleartext is split into two sides with one side repeatedly modified according to a keyed function of the other. Previous block ciphers of this design, such as DES, operate on equal length sides. MacGuffin is unusual in that it is based on a generalized unbalanced Feistel network (GUFN) in which each round of the cipher modifies only 16 bits according to a function of the other 48. We describe the general characteristics of MacGuffin architecture and implementation and give a complete specification for the 32-round, 128-bit key version of the cipher. 1 Introduction Feistel ciphers [1] operate by alternately encrypting the bits in one "side" of their input based on a keyed non-linear function of the bits in ...
Citations
No citations identified.
