Abstract
In application to public key cryptosystems, for finite automata in public keys no feasible inversion algorithm had been found. In Sect. 3.1 of the preceding chapter, an inversion method by R a R b transformation was given implicitly. In this chapter, a relation between two R a R b transformation sequences beginning at the same equation is derived. It means that in the inversion process it is enough to choose any one of the linear R a R b transformation sequences. Then, by exploring properties of “composition” of two R a R b transformation sequences, it is shown that the inversion method by R a R b transformation works for some special compound finite automata.
Other two inversion methods are by reduced echelon matrices, and by canonical diagonal matrix polynomials. Results in the last two sections show that the two inversion methods are “equivalent” to the inversion method by R a R b transformation.
This chapter provides a foundation for assertions on the weak key of the public key cryptosystem based on finite automata in Sect. 9.4.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag
About this chapter
Cite this chapter
Tao, R. (2009). Relations Between Transformations. In: Finite Automata and Application to Cryptography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78257-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-78257-5_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78256-8
Online ISBN: 978-3-540-78257-5
eBook Packages: Computer ScienceComputer Science (R0)