Pareto-Optimal Hardware for Substitution Boxes

dc.creatorNedjah,Nadia
dc.creatorMourelle,Luiza
dc.date2006
dc.date.accessioned2024-02-06T12:54:20Z
dc.date.available2024-02-06T12:54:20Z
dc.descriptionIn this paper, we propose a methodology based on genetic programming to automatically generate hardware designs of substitution boxes necessary for many cryptosystems such as DES encryption system. We aim at evolving minimal hardware specifications, which minimise both space (i.e. required gate number), response time (i.e. encryption and decryption time) and dissipated power. We compare our results against existing and well-known designs, which were produced by human designers using conventional methods.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-012-04-0395
dc.identifierhttps://lib.jucs.org/article/28600/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/8997
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 12(4): 395-407
dc.subjectS-box
dc.subjectcryptography
dc.subjectgenetic algorithms
dc.subjectevolvable hardware
dc.subjectmulti-objective optimisation
dc.titlePareto-Optimal Hardware for Substitution Boxes
dc.typeResearch Article
Файлы