Trainee Project
Title:
Design of New Finite State Dynamical Systems Admitting a Matrix Rep- resentation: Application to data privacy and systems security
Dates:
2019/03/01 - 2019/08/31
Supervisor(s): 
Other supervisor(s):
MINIER Marine (LORIA)
Description:
1. Context
The considerable development of new technologies of communication, within
the timely context of digital revolution and Internet of Things, leads nowadays
to an increasing need for security of the exchanges of information. From smart
objects (embedded or mobile units) to smart cities or smart grids (large scale
systems) to mention a few, the issue of security is ubiquitous. It is expected that
200 billion smart objects will be in use in 2020, a one-hundred fold increase over
2006. This unprecedented transformation has also a substantial impact in indus-
trial control equipements. Digital controllers and communication networks in
many control applications have given birth to networked control systems (NCS).
Those information technology (IT) infrastructures, involving digital controllers,
sensors, and actuators at a low-level layer and supervisory systems at a high-level
layer, are named supervisory control and data acquisition (SCADA) systems.
Industrial control systems must face several threats, in particular emanating
from malicious adversaries. Among numerous solutions to tackle the problem
of cyber-security, cryptography plays a major role.

2. Main objective of the work
Finite State Machines are particular primitives widely used in symmetric
cryptography, in particular stream ciphers. Those automata take the form of
dynamical systems. Those mathematical objects are commonly used in auto-
matic control as well since they can describe the behavior of physical systems - in
that case they operate on the field of real numbers - of discrete-events systems.
In the last case, they operate, similarly to cryptography, on finite fields. This
connection is at the core of the proposal. For cryptographic purposes, the de-
sign of Finite State Machines must be guided by the challenging trade-off good
properties with respect to security consideration versus ease and efficiency of
implementation. It enters the cost effective design paradigm. It turns out that,
quite recently and independently, Finite State Machines admitting a matrix
representation have been proposed for the sake of cryptography. On one hand,
Finite State Machines admitting new matrix representations, called Rational
Linear Finite State Machines and Feedback with Carry Shift Registers, have
been proposed in [1,2]. It is a generalization of Linear Feedback Shifts Registers
by extending the set of possible coefficients for the transition matrix to ratio-
nal fractions. This new approach is an interesting tool for constructing more
complex circuits from smaller LFSMs with nice properties. On the other hand,
since the early 90 s and the pioneering work of [3], several architectures based on
dynamical systems have been proposed. But till now, all of these SSSC schemes
have been broken (see [4, 5] as examples). Pursuing this goal, Linear Parameter
Varying (LPV) systems, a usual class of dynamical systems encountered in con-
trol, have been proposed in [6] to design new self-synchronizing architectures.
LPV dynamical systems are described by state transitions matrices where some
of the entries are replaced by time varying parameters. They are appealing for
their inherent nonlinearties while the matrix representation allows to tackle in
an efficient way synchronization issues.
As matrix representation is a common feature of RLFSM, FCSR and LPV sys-
tems, it makes sense and it sounds interesting to propose new Finite State
Machines within the unified framework of dynamical systems admitting a ma-
trix representation. The work of the internship fits in this objective.

3. Expected works
According to the skills of the candidate (expertise in either cryptography or au-
tomatic control), two works will be proposed (selected at will by the candidate).
For candidates who are more confortable with cryptography, the aim will be
to explore the ways on how nonlinearties will be incorporated in the matrix
representation and to study the underlying security issues.
For candidates who are more confortable with automatic control, the aim will
be to study the synchronization issues between the cipher and the decipher (in
the context of self-synchronizing stream ciphers). Control-theoretical concepts
such as state reconstruction, dead-beat stability, flatness and structural analysis
will be used.
An implementation will be carried out in a small scale breeding ICS-SCADA
platform (Industrial Control Systems - Supervisory Control and Data Acquisi-
tion).
At least one, preferably several ones of the following skills are expected:
Control Theory, Mathematics, Cryptography. It must be stressed that this pro-
posal can be pursued by a PhD thesis.

References
[1] F. Arnault, T. Berger, C. Lauradoux, M. Minier, and B. Pousse. A new
approach for FCSRs. In Selected Areas in Cryptography (SAC'2010) , pages
433-448, 2010.
[2] François Arnault, Thierry P. Berger, Marine Minier, and Benjamin Pousse.
Revisiting lfsrs for cryptographic applications. IEEE Transactions on Infor-
mation Theory , 57(12):8095-8113, 2011.
[3] U. M. Maurer. New approaches to the design of self-synchronizing stream
cipher. Advance in Cryptography, In Proc. Eurocrypt '91, Lecture Notes in
Computer Science , pages 548-471, 1991.
[4] A. Joux and F. Muller. Chosen-ciphertext attack against mosquito.
Lecture Note in Computer Science , 2006.
[5] Emilia Käsper, Vincent Rijmen, Tor E. Bjørstad, Christian Rechberger,
Matthew J. B. Robshaw, and Gautham Sekar. Correlated keystreams in
moustique. In Progress in Cryptology - AFRICACRYPT 2008, First In-
ternational Conference on Cryptology in Africa, Casablanca, Morocco, June
11-14, 2008. Proceedings, pages 246257, 2008.
[6] B. Dravie, P. Guillot, and G. Millérioux. Flatness and structural analysis as
a constructive framework for private communication. Nonlinear Analysis:
Hybrid Systems , 30:92-105, 2018
Keywords:
LPV systems, dead-beat stability, flatness, symetric cryptography
Conditions:
Duration: 6 months (01 March 2019 to 31 August 2019 (6 months), to be discussed)
Employer: Université de Lorraine
Grants: at least 577 Euros/month
Expected skills: Automatic control and/or Maths/crypto
Department(s): 
Control Identification Diagnosis
Funds:
at least 577 Euros/month