Abstract
The notion of linear finite transducer (LFT) plays a crucial role in a family of cryptosystems introduced in the 80’s and 90’s. However, as far as we know, no study was ever conducted to count and enumerate these transducers, which is essential to verify if the size of the key space, of the aforementioned systems, is large enough to prevent an exhaustive search attack. In this paper, we determine the cardinal of the equivalence classes on the set of the LFTs with a given size. This result is sufficient to get an approximate value, by random sampling, for the number of non-equivalent injective LFTs, and subsequently for the size of the key space. We introduce a notion of canonical LFT, give a method to verify if two LFTs are equivalent, and prove that every LFT has exactly one equivalent canonical LFT. We then show how this canonical LFT allows us to calculate the size of each equivalence class on the set of the LFTs with the same number of states.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amorim, I., Machiavelo, A., Reis, R.: On the invertibility of finite linear transducers. RAIRO - Theoretical Informatics and Applications 48, 107–125 (2014)
Bao, F., Igarashi, Y.: Break Finite Automata Public Key Cryptosystem. In: Fülöp, Z. (ed.) ICALP 1995. LNCS, vol. 944, pp. 147–158. Springer, Heidelberg (1995)
Dai, Z., Ye, D., Ou, H.: Self-Injective Rings and Linear (Weak) Inverses of Linear Finite Automata over Rings. Science in China (Series A) 42(2), 140–146 (1999)
Roche, E., Shabes, Y. (eds.): Finite-State Language Processing. MIT Press, Cambridge (1997)
Tao, R.: Invertible Linear Finite Automata. Scientia Sinica XVI(4), 565–581 (1973)
Tao, R.: Invertibility of Linear Finite Automata Over a Ring. In: Lepistö, T., Salomaa, A. (eds.) ICALP 1988. LNCS, vol. 317, pp. 489–501. Springer, Heidelberg (1988)
Tao, R.: Finite Automata and Application to Cryptography. Springer Publishing Company, Incorporated (2009)
Tao, R., Chen, S.: A Finite Automaton Public Key Cryptosystem and Digital Signatures. Chinese Journal of Computers 8(6), 401–409 (1985) (in Chinese)
Tao, R., Chen, S.: A Variant of the Public Key Cryptosystem FAPKC3. J. Netw. Comput. Appl. 20, 283–303 (1997)
Tao, R., Chen, S.: The Generalization of Public Key Cryptosystem FAPKC4. Chinese Science Bulletin 44(9), 784–790 (1999)
Tao, R., Chen, S., Chen, X.: FAPKC3: A New Finite Automaton Public Key Cryptosystem. Journal of Computer Science and Technology 12(4), 289–305 (1997)
Dai, Z.-D., Ye, D.F., Lam, K.-Y.: Weak Invertibility of Finite Automata and Cryptanalysis on FAPKC. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 227–241. Springer, Heidelberg (1998)
Dai, Z., Ye, D., Ou, H.: Weak Invertibility of Linear Finite Automata I, Classification and Enumeration of Transfer Functions. Science in China (Series A) 39(6), 613–623 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Amorim, I., Machiavelo, A., Reis, R. (2014). Counting Equivalent Linear Finite Transducers Using a Canonical Form. In: Holzer, M., Kutrib, M. (eds) Implementation and Application of Automata. CIAA 2014. Lecture Notes in Computer Science, vol 8587. Springer, Cham. https://doi.org/10.1007/978-3-319-08846-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-08846-4_5
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08845-7
Online ISBN: 978-3-319-08846-4
eBook Packages: Computer ScienceComputer Science (R0)