Abstract
Cryptographic ideas and protocols that are accessible to children are described, and the case is made that cryptography can provide an excellent context and motivation for fundamental ideas of mathematics and computer science in the school curriculum, and in other venues such as children’s science museums. It is pointed out that we may all be doing “Kid Krypto” unawares. Crayon-technology cryptosystems can be a source of interesting research problems; a number of these are described.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Crépeau, C., Kilian, J.: Discreet solitary games. Manuscript, April 1992.
Kari, J.: Cryptosystems based on reversible cellular automata. Manuscript, August 1992.
Kratochvíl, J.: Perfect codes in general graphs. Monograph, Czechoslovakian National Academy of Sciences, Prague, 1991.
Kierstead, H., Trotter, T.: Planar graph coloring with an uncooperative partner. Manuscript, April 1992.
Siromoney, R., Jeyanthi, A., Do Long Van, Subramanian, K. G.: Public key cryptosystems based on word problem. ICOMIDC Symposium on the Mathematics of Computation, Ho Chi Minh City, April 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fellows, M., Koblitz, N. (1993). Kid Krypto. In: Brickell, E.F. (eds) Advances in Cryptology — CRYPTO’ 92. CRYPTO 1992. Lecture Notes in Computer Science, vol 740. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48071-4_27
Download citation
DOI: https://doi.org/10.1007/3-540-48071-4_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57340-1
Online ISBN: 978-3-540-48071-6
eBook Packages: Springer Book Archive