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...

Full description

Bibliographic Details

Published in:	Applied soft computing Vol. 59; pp. 475 - 486
Main Authors:	Souravlias, Dimitris, Parsopoulos, Konstantinos E., Meletiou, Gerasimos C.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.10.2017
Subjects:	Algorithm Portfolios Cryptography Heuristics Optimization S-boxes Algorithm Portfolios Cryptography Heuristics Optimization S-boxes
ISSN:	1568-4946, 1872-9681
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!