Abstract
This paper investigates the strange planet problem for the purpose of secure communication. To this end, the problem is modeled with automata, and the essential principle under the transitions is discovered. Based on it, the sound conditions for secure communications with the strange planet problem are given. Finally, a small application of strange planet protocol is presented.
Similar content being viewed by others
Notes
This problem origins in the automata lecture notes of Stanford University.
The problem equals to the problem of putting \(n\) indistinguishable objects into three buckets. So the answer is \(C_{n+2}^2\).
References
Agrawal, D.P., Zeng, Q.-A.: Introduction to Wireless and Mobile Systems (2nd edn, published by Thomson, April 2005). ISBN: 978-0534493035
Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation (2nd edn.). Pearson Education, London (2000). ISBN: 0-201-44124-1
Holzmann, G.J.: Design and Validation of Computer Protocols. Prentice-Hall, Englewood Cliffs (1991). ISBN: 0-13-539925-4
Perlman, R.: Interconnections: Bridges, Routers, Switches, and Internetworking Protocols. 2nd edn. Addison-Wesley, Reading (1999). ISBN: 0-201-63448-1
Comer, D.E.: Internetworking with TCP/IP—Principles, Protocols and Architecture (4th edn). Prentice-Hall, Englewood Cliffs (2000). ISBN: 0-13-018380-6
Author information
Authors and Affiliations
Corresponding author
Additional information
This research is supported by the NSFC Grant Nos. 61272117, 61202038, 61003078, 60910004 and 61133001, 973 Program Grant No. 2010CB328102 and ISN Lab Grant No. ISN1102001.
Rights and permissions
About this article
Cite this article
Tian, C., Duan, Z. & Liu, J. Secure communications with strange planet protocol. Optim Lett 8, 201–209 (2014). https://doi.org/10.1007/s11590-012-0561-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-012-0561-x