01724nas a2200217   4500008004100000245007300041210006900114260000900183300001400192490000600206520101900212653001401231653002801245653002801273653002301301653001501324653000901339100002001348700002101368856011701389       2007                        eng d00aA real time S-box construction using arithmetic modulo prime numbers0 areal time Sbox construction using arithmetic modulo prime number  c2007  a354 - 3600 v53 aThis paper proposes an implementation of the inverse function of the Advanced Encryption Standard using the field of prime numbers instead of the Galois Field originally proposed by Rijndael. The paper will show that the former approach is simpler and requires less execution time and implementation circuitry compared to the latter. The authors analyzed several implementations of the inverse function for the S-Box using various approaches in search for an optimal one. In particular, simulation was used to analyze performances of algorithms for computing the inverse function based on: the arithmetic modulo a power-of-two; arithmetic modulo a power-of-two plus one; and arithmetic modulo a prime number. The simulation revealed that the modulo a prime number approach has the best performance. Furthermore, the analysis revealed that using this approach may enhance security relative to the original approach. The proposed implementation will provide a better alternative that can be embedded in many systems.10aDiffusion10aHardware implementation10aModulo prime arithmetic10aParallel execution10aPipelining10aVHDL1 aAbuelyman, E.S.1 aEl-Affendi, M.A.  uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-49149096383&partnerID=40&md5=a1fe3d6b0e1b163d7545da8586d0fc0f