|
Published Articles >> Table of Contents >> Abstract
International Conference on Information Technology: Coding and Computing (ITCC'04) Volume 2
p. 569
On Permutation Operations in Cipher Design
Ruby B. Lee, Princeton University, NJ
Z. J. Shi, Princeton University, NJ
Y. L. Yin, Princeton University, NJ
Ronald L. Rivest, CSAIL, Cambridge, MA
M.J.B. Robshaw, University of London, UK
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ITCC.2004.1286714
Send link to a friend
| Abstract |
|
New and emerging applications can change the mix of
operations commonly used within computer architectures.
It is sometimes surprising when instruction-set architecture
(ISA) innovations intended for one purpose are used for
other (initially unintended) purposes. This paper considers
recent proposals for the processor support of families
of bit-level permutations. From a processor architecture
point of view, the ability to support very fast bit-level permutations
may be viewed as a further validation of the basic
word-orientation of processors, and their ability to support
next-generation secure multimedia processing. However,
bitwise permutations are also fundamental operations
in many cryptographic primitives and we discuss the suitability
of these new operations for cryptographic purposes.
|
 Additional Information
|
Citation:
Ruby B. Lee, Z. J. Shi, Y. L. Yin, Ronald L. Rivest, M.J.B. Robshaw,
"On Permutation Operations in Cipher Design,"
itcc,
p. 569,
International Conference on Information Technology: Coding and Computing (ITCC'04) Volume 2,
2004
|
|
