Kid Krypto

  • Michael Fellows
  • Neal Koblitz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 740)


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.


Oblivious Transfer Perfect Code Theoretical Computer Science Boolean Circuit Substitution Scheme 
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.


  1. 1.
    Crépeau, C., Kilian, J.: Discreet solitary games. Manuscript, April 1992.Google Scholar
  2. 2.
    Kari, J.: Cryptosystems based on reversible cellular automata. Manuscript, August 1992.Google Scholar
  3. 3.
    Kratochvíl, J.: Perfect codes in general graphs. Monograph, Czechoslovakian National Academy of Sciences, Prague, 1991.Google Scholar
  4. 4.
    Kierstead, H., Trotter, T.: Planar graph coloring with an uncooperative partner. Manuscript, April 1992.Google Scholar
  5. 5.
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Michael Fellows
    • 1
  • Neal Koblitz
    • 2
  1. 1.Department of Computer ScienceUniversity of VictoriaVictoriaCanada
  2. 2.Department of MathematicsUniversity of WashingtonSeattle, WashingtonUSA

Personalised recommendations