loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Third International Conference on Information Technology: New Generations (ITNG'06)
Efficient Implementation of Galois Field Fixed Field Constant Multiplication
Las Vegas, Nevada
April 10-April 12
ISBN: 0-7695-2497-4
AJ Elbirt, University of Massachusetts Lowell
Christof Paar, Ruhr-Universitat Bochum, Germany
Efficient implementation of block ciphers is critical towards achieving both high security and high-speed processing. Numerous block ciphers have been proposed and implemented, using a wide and varied range of functional operations. Existing microprocessor architectures do not provide this broad range of support. However, the advent of intellectual property (IP) microprocessor cores presents the opportunity to augment existing datapaths and instruction sets to add acceleration modules. Therefore, we will present a hardware architecture that achieves efficient implementation of generalized Galois Field fixed field constant multiplication, a core operation of Rijndael, chosen by the National Institute of Standards and Technology (NIST) as the Advanced Encryption Standard (AES) Advanced Encryption Algorithm in October of 2000. A detailed discussion of the architecture will be provided and an analysis of system performance and resource utilization will be performed to demonstrate the efficiency versus other implementations.
Index Terms:
cryptography, embedded systems, block cipher, galois field
Citation:
AJ Elbirt, Christof Paar, "Efficient Implementation of Galois Field Fixed Field Constant Multiplication," itng, pp.172-177, Third International Conference on Information Technology: New Generations (ITNG'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.