On linear finite automata and cryptography

• Type: Technical Report
• Date: 2011

Authors

Ivone Amorim (Author) FCUP; António Machiavelo (Author) FCUP; Rogério Reis (Author) FCUP

Scientific classification

FOS: Natural sciences > Mathematics

Other information

Abstract (EN): Finite automata public-key cryptosystems rely upon characterizations of some types of invertible finite automata, and methods of obtain them as well as their respective inverses. In this paper we provide a much needed clarification of Tao's formalization and basic results on the subject, as well as a new condition for a linear finite automata with memory to be weakly invertible with delay t. This last result, employing an approach with formal series, uses the Smith?s normal form of a polynomial matrix. The proof of the results presented here provides a new way to construct an inverse with delay t of an invertible linear finite automata.

Language: English

Type (Professor's evaluation): Scientific

Reference: Technical Report DCC-2011-11