The Cryptoclub

Using Mathematics to Make and Break Secret Codes
1. Auflage 2006
ISBN: 978-1-56881-223-6
Verlag: Taylor & Francis Inc

Buch, Englisch, 216 Seiten, Format (B × H): 202 mm x 228 mm, Gewicht: 484 g

Join the Cryptokids as they apply basic mathematics to make and break secret codes. This book has many hands-on activities that have been tested in both classrooms and informal settings. Classic coding methods are discussed, such as Caesar, substitution, Vigenère, and multiplicative ciphers as well as the modern RSA. Math topics covered include: - Addition and Subtraction with, negative numbers, decimals, and percentages - Factorization - Modular Arithmetic - Exponentiation - Prime Numbers - Frequency Analysis.

The accompanying workbook, The Cryptoclub Workbook: Using Mathematics to Make and Break Secret Codes provides students with problems related to each section to help them master the concepts introduced throughout the book. A PDF version of the workbook is available at no charge on the download tab, a printed workbook is available for $19.95 (K00701). The teacher manual can be requested from the publisher by contacting the Academic Sales Manager, Susie Carlisle

Zielgruppe

Undergraduate Core

Autoren/Hrsg.

Beissinger, Janet

Fachgebiete

• Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Informationstheorie, Kodierungstheorie
• Mathematik | Informatik EDV | Informatik Technische Informatik Computersicherheit Datensicherheit, Datenschutz
• Mathematik | Informatik EDV | Informatik Daten / Datenbanken Informationstheorie, Kodierungstheorie

Inhaltsverzeichnis

Introduction to Cryptography. Caesar Ciphers. Sending Messages with Numbers. Breaking Caesar Ciphers. Substitution Ciphers. Keyword Ciphers. Letter Frequencies. Breaking Substitution Ciphers. Vigenère Ciphers. Combining Caesar Ciphers. Cracking Vigenère Ciphers When You Know the Key Length. Factoring. Using Common Factors to Crack Vigenère Ciphers. Modular (Clock) Arithmetic. Introduction to Modular Arithmetic. Applications of Modular Arithmetic. Multiplicative and Affine Ciphers. Multiplicative Ciphers. Using Inverses to Decrypt. Affine Ciphers. Math for Modern Cryptography. Finding Prime Numbers. Raising to Powers. Public Key Cryptography. The RSA Cryptosystem. Revisiting Inverses in Modular Arithmetic. Sending RSA Messages.

Über Autor(innen)

Janet Beissinger is a research assistant professor at the University of Illinois, Chicago's Institute for Mathematics and Science Education. She helped develop the widely used Math Trailblazers curriculum for grades K-5. Vera Pless, also a professor at UIC, is the author of Introduction to Coding Theory and has published over 100 papers.