Abstract
For characterization of the structure of weakly invertible finite automata, the state tree method is presented in Chap. 1. However, from an algorithmic viewpoint, it is rather hard to manipulate such state trees for large state alphabets and delay steps. In this chapter, the R a R b transformation is presented and used to generate a kind of weakly invertible finite automata and their weak inverses. This result paves the way for the key generation of a public key cryptosystem based on finite automata in Chap. 9. For weakly invertible quasi-linear finite automata over finite fields, the structure problem is also solved by means of the R a R b transformation method.
This chapter may be regarded as an introduction to Chap. 9.
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). Ra Rb Transformation Method. In: Finite Automata and Application to Cryptography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78257-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-78257-5_3
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)