Abstract
These days, public-key cryptography is indispensable to ensure both confidentiality and authenticity in numerous applications which comprise securely communicating via mobile phone or email or digitally signing documents.
For all public-key systems, such as RSA, mathematically challenging and technically involved methods are employed which are often above the level of secondary school students as they employ deep results from algebra. Following an approach suggested in 2003 by Tim Bell et al. in Computers and Education, volume 40, number 3, we deal with the question of how to teach young students the main concepts, issues, and solutions of public-key systems without being forced to also teach rather complicated theorems of number theory beforehand.
This work was partially supported by the Hasler Foundation, project “Kantonales Fortbildungszentrum Informatikunterricht”, and by FILEP grant 351 of ETH Zurich.
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.
References
Bauer, F.L.: Decrypted Secrets: Methods and Maxims of Cryptology, 4th edn. Springer, Secaucus (2006)
Bell, T., Fellows, M., Witten, I.H.: Computer Science Unplugged - Off-line activities and games for all ages (1999), www.csunplugged.org (last accessed: October 22, 2009)
Bell, T., Thimbleby, H., Fellows, M., Witten, I., Koblitz, N., Powell, M.: Explaining cryptographic systems. Computers & Education 40(3), 199–215 (2003)
Bundesrat and EDK. Verordnung des Bundesrates/Reglement der EDK über die Anerkennung von gymnasialen Maturitätsausweisen (MAR) (1995), http://www.sbf.admin.ch/evamar/reglemente/VO_MAR_1995_d.pdf (last accessed: October 22, 2009)
Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. In: Proc. of the Nineteenth Annual ACM Symposium on Theory of Computing (STOC 1987), pp. 1–6. ACM, New York (1987)
Cull, P.: Perfect codes on graphs. In: Proc. of the 1997 International Symposium on Information Theory, p. 452 (1997)
Delfs, H., Knebl, H.: Introduction to Cryptography: Principles and Applications. Springer, Heidelberg (2002)
Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory IT-22(6), 644–654 (1976)
Elmiger, D.: Die zweisprachige Maturität in der Schweiz (2008), www.sbf.admin.ch/htm/dokumentation/publikationen/bildung/bilingue_matur_de.pdf (last accessed: October 22, 2009)
Freiermuth, K., Hromkovič, J., Keller, L., Steffen, B.: Kryptologie, Lehrbuch Informatik. Vieweg+Teubner (to appear, 2009)
Hromkovič, J.: Algorithmic Adventures. Springer, Berlin (2009)
Nishida, T., Idosaka, Y., Hofuku, Y., Kanemune, S., Kuno, Y.: New methodology of information education with “computer science unplugged”. In: Mittermeir, R.T., Sysło, M.M. (eds.) ISSEP 2008. LNCS, vol. 5090, pp. 241–252. Springer, Heidelberg (2008)
Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21(2), 120–126 (1978)
Salomaa, A.: Public-Key Cryptography. Springer, Berlin (1996)
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
Keller, L., Komm, D., Serafini, G., Sprock, A., Steffen, B. (2010). Teaching Public-Key Cryptography in School. In: Hromkovič, J., Královič, R., Vahrenhold, J. (eds) Teaching Fundamentals Concepts of Informatics. ISSEP 2010. Lecture Notes in Computer Science, vol 5941. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11376-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-11376-5_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11375-8
Online ISBN: 978-3-642-11376-5
eBook Packages: Computer ScienceComputer Science (R0)