Chapter 3
Selected Design and Analysis Techniques
for Contemporary Symmetric Encryption
Vasily Mikhalev, Miodrag J. Mihaljevi´ c, Orhun Kara,
and Frederik Armknecht
Abstract In this chapter we provide an overview of selected methods for the
design and analysis of symmetric encryption algorithms that have recently been
published. We start by discussing the practical advantages, limitations and security
of the keystream generators with keyed update functions which were proposed for
reducing the area cost of stream ciphers. Then we present an approach to enhancing
the security of certain encryption schemes by employing a universal homophonic
coding and randomized encryption paradigm.
3.1 Introduction
The concept of ubiquitous computing brings new challenges to the designers of
cryptographic algorithms by introducing scenarios where classical crypto primitives
are infeasible due to their costs (such as hardware price, computational time, and
power and energy consumption). In this chapter we provide an overview of selected
recent approaches which deal with such challenges.
An approach [27] which allows one to realize secure stream ciphers with state
size beyond the bound which was previously considered to be the minimum is
summarized in Sect. 3.2. The main idea is to use so-called keystream generators
with keyed update functions (KSGs with KUF) where the secret key is involved
not only in the initialization phase (as is common practice) but during the entire
encryption process. After explaining the advantages [27] of KSGs with KUF in
resisting Time Memory Data Tradeoff (TMDTO) attacks [47, 237] together with
V. Mikhalev () · F. Armknecht
University of Mannheim, Mannheim, Germany
e-mail: mikhalev@uni-mannheim.de
M. J. Mihaljevi´ c
Mathematical Institute, Serbian Academy of Sciences and Arts, Belgrade, Serbia
O. Kara
Department of Mathematics, IZTECH Izmir Institute of Technology, Izmir, Turkey
© The Author(s) 2021
G. Avoine, J. Hernandez-Castro (eds.), Security of Ubiquitous Computing Systems,
https://doi.org/10.1007/978-3-030-10591-4_3
49
Selected Design and Analysis Techniques
for Contemporary Symmetric Encryption
Vasily Mikhalev, Miodrag J. Mihaljevi´ c, Orhun Kara,
and Frederik Armknecht
Abstract In this chapter we provide an overview of selected methods for the
design and analysis of symmetric encryption algorithms that have recently been
published. We start by discussing the practical advantages, limitations and security
of the keystream generators with keyed update functions which were proposed for
reducing the area cost of stream ciphers. Then we present an approach to enhancing
the security of certain encryption schemes by employing a universal homophonic
coding and randomized encryption paradigm.
3.1 Introduction
The concept of ubiquitous computing brings new challenges to the designers of
cryptographic algorithms by introducing scenarios where classical crypto primitives
are infeasible due to their costs (such as hardware price, computational time, and
power and energy consumption). In this chapter we provide an overview of selected
recent approaches which deal with such challenges.
An approach [27] which allows one to realize secure stream ciphers with state
size beyond the bound which was previously considered to be the minimum is
summarized in Sect. 3.2. The main idea is to use so-called keystream generators
with keyed update functions (KSGs with KUF) where the secret key is involved
not only in the initialization phase (as is common practice) but during the entire
encryption process. After explaining the advantages [27] of KSGs with KUF in
resisting Time Memory Data Tradeoff (TMDTO) attacks [47, 237] together with
V. Mikhalev () · F. Armknecht
University of Mannheim, Mannheim, Germany
e-mail: mikhalev@uni-mannheim.de
M. J. Mihaljevi´ c
Mathematical Institute, Serbian Academy of Sciences and Arts, Belgrade, Serbia
O. Kara
Department of Mathematics, IZTECH Izmir Institute of Technology, Izmir, Turkey
© The Author(s) 2021
G. Avoine, J. Hernandez-Castro (eds.), Security of Ubiquitous Computing Systems,
https://doi.org/10.1007/978-3-030-10591-4_3
49