Show simple item record

dc.contributor.authorCanright, David
dc.contributor.authorOsvik, Dag Arne
dc.date.accessioned2014-11-06T22:27:09Z
dc.date.available2014-11-06T22:27:09Z
dc.date.issued2009
dc.identifier.urihttp://hdl.handle.net/10945/43710
dc.description.abstractWe explore ways to reduce the number of bit operations required to implement AES. One way involves optimizing the composite field approach for entire rounds of AES. Another way is integrating the Galois multiplications of MixColumns with the linear transformations of the S-box. Combined with careful optimizations, these reduce the number of bit operations to encrypt one block by 9.0%, compared to earlier work that used the composite field only in the S-box. For decryption, the improvement is 13.5%. This work may be useful both as a starting point for a bit-sliced software implementation, where reducing operations increases speed, and also for hardware with limited resources.en_US
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. As such, it is in the public domain, and under the provisions of Title 17, United States Code, Section 105, may not be copyrighted.en_US
dc.titleA More Compact AESen_US
dc.typeArticleen_US
dc.subject.authorAESen_US
dc.subject.authortower fielden_US
dc.subject.authorcomposite Galois fielden_US
dc.subject.authorbitsliceen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record