Paper 2012/547
Constrained Search for a Class of Good S-Boxes with Improved DPA Resistivity
Bodhisatwa Mazumdar, Debdeep Mukhopadhyay, and Indranil Sengupta
Abstract
In FSE 2005, \emph{transparency order} was proposed as a parameter
for the robustness of S-boxes to \emph{Differential Power Analysis} (DPA):lower \emph{transparency order} implying more resistance. However most cryptographically strong Boolean functions have been found to have high \emph{transparency order}. Also it is a difficult problem to search for Boolean functions which are strong cryptographically, and yet have low \emph{transparency order}, the total search space for
Note: Did not get any submission receipt email-id from Cryptology ePrint when we submitted for the first time
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- block ciphersboolean functions
- Contact author(s)
- bodhisatwa @ cse iitkgp ernet in
- History
- 2012-09-22: received
- Short URL
- https://ia.cr/2012/547
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2012/547, author = {Bodhisatwa Mazumdar and Debdeep Mukhopadhyay and Indranil Sengupta}, title = {Constrained Search for a Class of Good S-Boxes with Improved {DPA} Resistivity}, howpublished = {Cryptology {ePrint} Archive, Paper 2012/547}, year = {2012}, url = {https://eprint.iacr.org/2012/547} }