Paper published in a book (Scientific congresses, symposiums and conference proceedings)
An Evaluation of the Multi-Platform Efficiency of Lightweight Cryptographic Permutations
Cardoso Dos Santos, Luan; Groszschädl, Johann
2021In Ryan, Peter Y A; Toma, Cristian (Eds.) Innovative Security Solutions for Information Technology and Communications 14th International Conference, SECITC 2021, Virtual Event, November 25-26, 2021, Revised Selected Papers
Peer reviewed
 

Files


Full Text
SecITC2021.pdf
Author postprint (342.68 kB)
Download

All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
Lightweight Cryptography; Permutation-Based Cryptography; Authenticated Encryption; Assembly Optimization; Performance Evaluation
Abstract :
[en] Permutation-based symmetric cryptography has become increasingly popular over the past ten years, especially in the lightweight domain. More than half of the 32 second-round candidates of NIST's lightweight cryptography standardization project are permutation-based designs or can be instantiated with a permutation. The performance of a permutation-based construction depends, among other aspects, on the rate (i.e. the number of bytes processed per call of the permutation function) and the execution time of the permutation. In this paper we analyze the execution time and code size of assembler implementations of the permutation of Ascon, Gimli, Schwaemm, and Xoodyak on an 8-bit AVR and a 32-bit ARM Cortex-M3 microcontroller. Our aim is to ascertain how well these four permutations perform on microcontrollers with very different architectural and micro-architectural characteristics such as the available register capacity or the latency of multi-bit shifts and rotations. We also determine the impact of flash wait states on the execution time of the permutations on Cortex-M3 development boards with 0, 2, and 4 wait states. Our results show that the throughput (in terms of permutation time divided by rate when the capacity is fixed to 256 bits) of the permutation of Ascon, Schwaemm, and Xoodyak is similar on ARM Cortex-M3 and lies in the range of 41.1 to 48.6 cycles per rate-byte. However, on an 8-bit AVR ATmega128, the permutation of Schwaemm outperforms its counterparts of Ascon and Xoodyak by a factor of 1.20 and 1.59, respectively.
Disciplines :
Computer science
Author, co-author :
Cardoso Dos Santos, Luan ;  University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS)
Groszschädl, Johann ;  University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS)
External co-authors :
no
Language :
English
Title :
An Evaluation of the Multi-Platform Efficiency of Lightweight Cryptographic Permutations
Publication date :
November 2021
Event name :
14th International Conference on Security for Information Technology and Communications (SecITC 2021)
Event place :
Bucharest, Romania
Event date :
from 25-11-2021 to 26-11-2021
Main work title :
Innovative Security Solutions for Information Technology and Communications 14th International Conference, SECITC 2021, Virtual Event, November 25-26, 2021, Revised Selected Papers
Editor :
Ryan, Peter Y A 
Toma, Cristian
Publisher :
Springer Verlag
ISBN/EAN :
978-3-031-17509-1
Collection name :
vol. 13195 of Lecture Notes in Computer Science
Pages :
70-85
Peer reviewed :
Peer reviewed
Focus Area :
Security, Reliability and Trust
Commentary :
A preliminary version of this paper was presented at the 4th NIST Workshop on Lightweight Cryptography (LWC 2020).
Available on ORBilu :
since 10 October 2022

Statistics


Number of views
88 (9 by Unilu)
Number of downloads
108 (9 by Unilu)

Scopus citations®
 
1
Scopus citations®
without self-citations
1
OpenCitations
 
0

Bibliography


Similar publications



Contact ORBilu