The problem associated with the design of a single-finger keyboard layout is denominated SK-QAP and it is defined as a variation of the Quadratic Assignment Problem (QAP), a classical optimization problem.This work approaches the SK-QAP by means of an Iterated Local Search (ILS) algorithm, denominated ILS-SKQAP.Three neighborhood structures were incorporated in the local search fase of the algorithm, in which two of them were previously applied to solve the SK-QAP, whereas two pairs swap was adapted, in this work, from a QAP neighborhood.Furthermore, two perturbation mechanisms were developed for the ILS-SKQAP: ejection chain and multiple pairwise-exchange.ILS-SKQAP was used to solve the 24 existing instances for English, French, Italian and Spanish languages with highly competitive results both in terms of solution quality and CPU time.Moreover, a set of six instances for the Portuguese language was developed and solved by the algorithm.