Please use this identifier to cite or link to this item:
http://hdl.handle.net/2080/3560
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mishra, Ruby | - |
dc.contributor.author | Okade, Manish | - |
dc.contributor.author | Mahapatra, Kamalakanta | - |
dc.date.accessioned | 2021-01-21T05:27:17Z | - |
dc.date.available | 2021-01-21T05:27:17Z | - |
dc.date.issued | 2020-12 | - |
dc.identifier.citation | IEEE-iSES 220, Chennai, India, 14-16Dec2020 | en_US |
dc.identifier.uri | http://hdl.handle.net/2080/3560 | - |
dc.description | Copyright of this paper is with proceedings publisher | en_US |
dc.description.abstract | This paper presents the design of three differenttypes of S-box architectures for the PRESENT cipher with anaim of optimizing the design parameters for resource constrainedapplications. Three variants of S-box design are proposed here.The first includes minimization of the existing Boolean functionusing logic minimization and K-maps, while the other twodesigns focus on MUX-based design optimizations. The proposeddesigns give us an idea about the trade-offs involved in thedesign and performance metrics. FPGA implementations of theproposed design which includes modifying the substitution layer,reduces the slices used by around 27%and also achieves anenhancement of throughput when compared with related state-of-the-art architectures. These results are tailor made to meet thedesign specifications for IoT enabled devices which to the bestof our knowledge has not been investigated earlier | en_US |
dc.subject | cipher | en_US |
dc.subject | substitution layer | en_US |
dc.subject | permutation layer | en_US |
dc.subject | round key | en_US |
dc.subject | IoT applications | en_US |
dc.title | Optimized S-Box Architectures of PRESENTCipher for Resource Constrained Applications | en_US |
Appears in Collections: | Conference Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
RUBYMISHRAIEEE_ises_2020.pdf | 177.99 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.