Designing bijective S-boxes using Algorithm Portfolios with limited time budgets

[Display omitted] •Design of bijective S-boxes is transformed into permutation optimization problem.•A new parallel Algorithm Portfolio (AP) with restricted time budget is proposed.•The AP comprises Tabu Search and Simulated Annealing in master/slave model.•The constituent algorithms run concurrentl...

Celý popis

Podrobná bibliografia

Vydané v:	Applied soft computing Ročník 59; s. 475 - 486
Hlavní autori:	Souravlias, Dimitris, Parsopoulos, Konstantinos E., Meletiou, Gerasimos C.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.10.2017
Predmet:	Algorithm Portfolios Cryptography Heuristics Optimization S-boxes Algorithm Portfolios Cryptography Heuristics Optimization S-boxes
ISSN:	1568-4946, 1872-9681
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!