Issue |
RAIRO-Theor. Inf. Appl.
Volume 48, Number 1, January-March 2014
Non-Classical Models of Automata and Applications (NCMA 2012)
|
|
---|---|---|
Page(s) | 107 - 125 | |
DOI | https://doi.org/10.1051/ita/2014004 | |
Published online | 07 March 2014 |
On the invertibility of finite linear transducers
CMUP, Faculdade de Ciências da Universidade do
Porto, Portugal
ivone.amorim@dcc.fc.up.pt; ajmachia@fc.up.pt; rvr@dcc.fc.up.pt
Received:
31
January
2013
Accepted:
31
January
2014
Linear finite transducers underlie a series of schemes for Public Key Cryptography (PKC) proposed in the 90s of the last century. The uninspiring and arid language then used, condemned these works to oblivion. Although some of these schemes were afterwards shown to be insecure, the promise of a new system of PKC relying on different complexity assumptions is still quite exciting. The algorithms there used depend heavily on the results of invertibility of linear transducers. In this paper we introduce the notion of post-initial linear transducer, which is an extension of the notion of linear finite transducer with memory, and for which the previous fundamental results on invertibility still hold. This extension enabled us to give a new method to obtain a left inverse of any invertible linear finite transducer with memory. It also plays an essencial role in the necessary and sufficient condition that we give for left invertibility of linear finite transducers.
Key words: Linear transducers / invertibility of transducers / automata based cryptography / transducer injectivity with delay
© EDP Sciences 2014
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.