Skip to main navigation Skip to search Skip to main content

Efficient rijndael encryption implementation with composite field arithmetic

  • Atri Rudra
  • , Pradeep K. Dubey
  • , Charanjit S. Jutla
  • , Vijay Kumar
  • , Josyula R. Rao
  • , Pankaj Rohatgi
  • IBM

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

196 Scopus citations

Abstract

We explore the use of subfield arithmetic for efficient implementations of Galois Field arithmetic especially in the context of the Rijndael block cipher. Our technique involves mapping field elements to a composite field representation. We describe how to select a representation which minimizes the computation cost of the relevant arithmetic, taking into account the cost of the mapping as well. Our method results in a very compact and fast gate circuit for Rijndael encryption. In conjunction with bit-slicing techniques applied to newly proposed parallelizable modes of operation, our circuit leads to a high-performance software implementation for Rijndael encryption which offers significant speedup compared to previously reported implementations.

Original languageEnglish
Title of host publicationCryptographic Hardware and Embedded Systems - CHES 2001 - 3rd International Workshop, Proceedings
EditorsCetin K. Koc, David Naccache, Christof Paar, Christof Paar
PublisherSpringer Verlag
Pages171-184
Number of pages14
ISBN (Print)3540425217
DOIs
StatePublished - 2001
Event3rd International Workshop on Cryptographic Hardware and Embedded Systems, CHES 2001 - Paris, France
Duration: May 14 2001May 16 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2162
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd International Workshop on Cryptographic Hardware and Embedded Systems, CHES 2001
Country/TerritoryFrance
CityParis
Period05/14/0105/16/01

Fingerprint

Dive into the research topics of 'Efficient rijndael encryption implementation with composite field arithmetic'. Together they form a unique fingerprint.

Cite this