Abstract
In 1991, the first public key protocol involving automaton groups has been proposed. In this paper, we give a survey about algorithmic problems around automaton groups which may have potential applications in cryptography. We then present a new public key protocol based on the conjugacy search problem in some families of automaton groups. At the end, we offer open problems that could be of interest to group theorists and computer scientists in this direction.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computer Mathematics: Computer Systems Theory
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
