Abstract
This paper studies the safe wireless communication of controlling instructions in system of aids to navigation. RSA based authentication algorithm is employed, and Euclid addition chains are used to compute the modular exponentiation of RSA, transforming the shortest addition chains of a large number e into those of three smaller numbers a, b and c, which meets e=a×b+c. Experiment results show that the Euclid addition chains need much less time and space to create. In the case of wireless communication with authentication, controlling instructions can be transmitted safely and accurately, and it is hard for malicious users to control the intelligent lights directly. This is of great significance for navigation trades.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bergeron, F., Berstel, J., Brlek, S., et al.: Addition Chains Using Continued Fractions. J. Algorithms 10, 403–412 (1989)
Rivest, R.L., Shamir, A., Adleman, L.M.: A Method for Obtaining Digital Signatures and Public Key Cryptosystems. Communications of the ACM 21, 120–126 (1978)
Kob litz, N.: A Course in Number Theory and Cryptography. Springer, New York (1987)
Rivest, R.L., Shamir, A., Adleman, L.M.: On Digital Signatures and Public Key Cryptosystems: [Technical Report]. MIT/LCS/ TR-212.MIT Laboratory for Computer Science (1979)
Knuth, D.E.: The Art of Computer Programming: Seminumerical Algorithms, 3rd edn., vol. 2. Addtion-Wesley, Reading (2003)
Bos, J., Coster, M.: Addition chain heuristics. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 400–407. Springer, Heidelberg (1990)
Kunihiro, N., Yamamoto, H.: New Methods for Generating Short Addition Chains. IEICE Trans. Fundamentals E83-A1, 60–67 (2000)
Montgomery, P.L.: Modular Multiplication without Trial Division. J. Mathematics of Computation 170, 519–521 (1985)
Fu-guo, D., Yu-rong, L.: A Novel Shortest Addition Chains Algorithm Based On Euclid Algorithm. In: Proceeding of WiCom (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dong, Fg., Fan, H. (2010). Study on RSA Based Identity Authentication Algorithm and Application in Wireless Controlling System of Aids to Navigation. In: Wang, F.L., Gong, Z., Luo, X., Lei, J. (eds) Web Information Systems and Mining. WISM 2010. Lecture Notes in Computer Science, vol 6318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16515-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-16515-3_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16514-6
Online ISBN: 978-3-642-16515-3
eBook Packages: Computer ScienceComputer Science (R0)