An Efficient Pipelined Multiplicative Inverse Architecture for the AES Cryptosystem
Keywords:
AES cryptosystem, S-Box substitution, multiplicative inverse, pipelined multiplicative inverseAbstract
In this paper, we introduce an architecture for
performing a recursive pipeline algorithm for use in optimizing
the performance of the multiplicative inverse operations in
Galois Field GF(2k). The latter is extensively used in performing
the S-Box byte-Substitution in the AES cryptosystem. Using
composite fields the operations are recursively decomposed into
lower level ones which are mapped into pipelines. Thus, several
gate reductions will be obtained and gate sharing. Eventually,
this enhances the performance of computing the multiplicative
inverse.
Downloads
Downloads
Published
Issue
Section
License
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
