The Cipher SHARK (1996) [20 citations — 2 self]
http://www.esat.kuleuven.ac.be/~cosicart/ps/VR-960
http://homes.esat.kuleuven.be/~cosicart/pdf/VR-960
DBLP
CACHED:
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Vincent Rijmen and Joan Daemen and Bart Preneel and Anton Bosselaers and Erik De Win},
title = {The Cipher SHARK},
booktitle = {Fast Software Encryption, Third International Workshop},
year = {1996},
pages = {99--112},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
. We present the new block cipher SHARK. This cipher combines highly non-linear substitution boxes and maximum distance separable error correcting codes (MDS-codes) to guarantee a good diffusion. The cipher is resistant against differential and linear cryptanalysis after a small number of rounds. The structure of SHARK is such that a fast software implementation is possible, both for the encryption and the decryption. Our C-implementation of SHARK runs more than four times faster than SAFER and IDEA on a 64-bit architecture. 1 Introduction The best known and most used block cipher today is the DES [FIPS46]. The operation of the DES can be described in the following way: the message input X is divided into two halves X 1 and X 2 . These halves are then processed in 16 rounds. The odd-numbered rounds perform the following transformation: Y 1 = X 1 \Phi F (K; X 2 ) Y 2 = X 2 ; while in even-numbered rounds: Y 1 = X 1 Y 2 = X 2 \Phi F (K; X 1 ) : After the last round, both halves a...
Citations
No citations identified.
