Difference between revisions of "AY Honors/Cryptography/Requirements"
Jomegat bot (talk | contribs) (Bot: Automated import of articles *** existing text overwritten ***) |
(Marked this version for translation) |
||
(6 intermediate revisions by 2 users not shown) | |||
Line 1: | Line 1: | ||
{{HonorSubpage}} | {{HonorSubpage}} | ||
+ | <section begin=Body /> | ||
− | + | <b>1. <section begin=req1 /><noinclude><translate><!--T:18--> | |
− | + | </noinclude>Define cryptography and list its major applications. | |
− | |||
− | |||
− | <b>1. <section begin=req1 /><noinclude><translate></noinclude> | ||
<noinclude></translate></noinclude><section end=req1 /></b> | <noinclude></translate></noinclude><section end=req1 /></b> | ||
− | <b>2. <section begin=req2 /><noinclude><translate></noinclude> | + | <b>2. <section begin=req2 /><noinclude><translate><!--T:19--> |
+ | </noinclude>Define the following terms: | ||
<noinclude></translate></noinclude><section end=req2 /></b> | <noinclude></translate></noinclude><section end=req2 /></b> | ||
− | :<b>a. <section begin=req2a /><noinclude><translate></noinclude> | + | :<b>a. <section begin=req2a /><noinclude><translate><!--T:20--> |
+ | </noinclude>Code | ||
<noinclude></translate></noinclude><section end=req2a /></b> | <noinclude></translate></noinclude><section end=req2a /></b> | ||
− | :<b>b. <section begin=req2b /><noinclude><translate></noinclude> | + | :<b>b. <section begin=req2b /><noinclude><translate><!--T:21--> |
+ | </noinclude>Cipher | ||
<noinclude></translate></noinclude><section end=req2b /></b> | <noinclude></translate></noinclude><section end=req2b /></b> | ||
− | :<b>c. <section begin=req2c /><noinclude><translate></noinclude> | + | :<b>c. <section begin=req2c /><noinclude><translate><!--T:22--> |
+ | </noinclude>Steganography | ||
<noinclude></translate></noinclude><section end=req2c /></b> | <noinclude></translate></noinclude><section end=req2c /></b> | ||
− | :<b>d. <section begin=req2d /><noinclude><translate></noinclude> | + | :<b>d. <section begin=req2d /><noinclude><translate><!--T:23--> |
+ | </noinclude>Plain text | ||
<noinclude></translate></noinclude><section end=req2d /></b> | <noinclude></translate></noinclude><section end=req2d /></b> | ||
− | :<b>e. <section begin=req2e /><noinclude><translate></noinclude> | + | :<b>e. <section begin=req2e /><noinclude><translate><!--T:24--> |
+ | </noinclude>Key | ||
<noinclude></translate></noinclude><section end=req2e /></b> | <noinclude></translate></noinclude><section end=req2e /></b> | ||
− | <b>3. <section begin=req3 /><noinclude><translate></noinclude> | + | :<b>f. <section begin=req2f /><noinclude><translate><!--T:25--> |
+ | </noinclude>Public-key cryptography | ||
+ | <noinclude></translate></noinclude><section end=req2f /></b> | ||
+ | |||
+ | :<b>g. <section begin=req2g /><noinclude><translate><!--T:26--> | ||
+ | </noinclude>One-way function | ||
+ | <noinclude></translate></noinclude><section end=req2g /></b> | ||
+ | |||
+ | <b>3. <section begin=req3 /><noinclude><translate><!--T:27--> | ||
+ | </noinclude>Define each of the following categories of ciphers, give an example of each, and encipher your name using each technique. | ||
<noinclude></translate></noinclude><section end=req3 /></b> | <noinclude></translate></noinclude><section end=req3 /></b> | ||
− | <b>4. <section begin=req4 /><noinclude><translate></noinclude> | + | :<b>a. <section begin=req3a /><noinclude><translate><!--T:28--> |
+ | </noinclude>Transposition | ||
+ | <noinclude></translate></noinclude><section end=req3a /></b> | ||
+ | |||
+ | :<b>b. <section begin=req3b /><noinclude><translate><!--T:29--> | ||
+ | </noinclude>Polybius Square | ||
+ | <noinclude></translate></noinclude><section end=req3b /></b> | ||
+ | |||
+ | :<b>c. <section begin=req3c /><noinclude><translate><!--T:30--> | ||
+ | </noinclude>Square | ||
+ | <noinclude></translate></noinclude><section end=req3c /></b> | ||
+ | |||
+ | :<b>d. <section begin=req3d /><noinclude><translate><!--T:31--> | ||
+ | </noinclude>Substitution | ||
+ | <noinclude></translate></noinclude><section end=req3d /></b> | ||
+ | |||
+ | :<b>e. <section begin=req3e /><noinclude><translate><!--T:32--> | ||
+ | </noinclude>Polyalphabetic | ||
+ | <noinclude></translate></noinclude><section end=req3e /></b> | ||
+ | |||
+ | <b>4. <section begin=req4 /><noinclude><translate><!--T:33--> | ||
+ | </noinclude>Investigate whether each item in the list below is a code, a cipher, steganography, or a plain text message. | ||
<noinclude></translate></noinclude><section end=req4 /></b> | <noinclude></translate></noinclude><section end=req4 /></b> | ||
− | <b>5. <section begin=req5 /><noinclude><translate></noinclude> | + | :<b>a. <section begin=req4a /><noinclude><translate><!--T:34--> |
+ | </noinclude>Processing done by a computer to determine if a user enters a correct password | ||
+ | <noinclude></translate></noinclude><section end=req4a /></b> | ||
+ | |||
+ | :<b>b. <section begin=req4b /><noinclude><translate><!--T:35--> | ||
+ | </noinclude>A Bible verse reference | ||
+ | <noinclude></translate></noinclude><section end=req4b /></b> | ||
+ | |||
+ | :<b>c. <section begin=req4c /><noinclude><translate><!--T:36--> | ||
+ | </noinclude>The colors used on a traffic light to mean "Stop," "Go," or "Caution" | ||
+ | <noinclude></translate></noinclude><section end=req4c /></b> | ||
+ | |||
+ | :<b>d. <section begin=req4d /><noinclude><translate><!--T:37--> | ||
+ | </noinclude>HTTPS:// used in a URL over the Internet | ||
+ | <noinclude></translate></noinclude><section end=req4d /></b> | ||
+ | |||
+ | :<b>e. <section begin=req4e /><noinclude><translate><!--T:38--> | ||
+ | </noinclude>Forming a message by entering it into a grid row-by-row and reading it out column-by-column | ||
+ | <noinclude></translate></noinclude><section end=req4e /></b> | ||
+ | |||
+ | :<b>f. <section begin=req4f /><noinclude><translate><!--T:39--> | ||
+ | </noinclude>Invisible ink | ||
+ | <noinclude></translate></noinclude><section end=req4f /></b> | ||
+ | |||
+ | :<b>g. <section begin=req4g /><noinclude><translate><!--T:40--> | ||
+ | </noinclude>Navajo language used by the Code Talkers in World War II | ||
+ | <noinclude></translate></noinclude><section end=req4g /></b> | ||
+ | |||
+ | :<b>h. <section begin=req4h /><noinclude><translate><!--T:41--> | ||
+ | </noinclude>Data representation via a grid of dots (QR codes) or lines (Bar codes) | ||
+ | <noinclude></translate></noinclude><section end=req4h /></b> | ||
+ | |||
+ | :<b>i. <section begin=req4i /><noinclude><translate><!--T:42--> | ||
+ | </noinclude>Enigma machine used in World War II | ||
+ | <noinclude></translate></noinclude><section end=req4i /></b> | ||
+ | |||
+ | :<b>j. <section begin=req4j /><noinclude><translate><!--T:43--> | ||
+ | </noinclude>Recording your computer password on a piece of paper | ||
+ | <noinclude></translate></noinclude><section end=req4j /></b> | ||
+ | |||
+ | :<b>k. <section begin=req4k /><noinclude><translate><!--T:44--> | ||
+ | </noinclude>Signal used by Jonathan and David recounted in 1 Samuel 20:18-23 | ||
+ | <noinclude></translate></noinclude><section end=req4k /></b> | ||
+ | |||
+ | <section begin=challenge /> | ||
+ | <b>5. <section begin=req5 /><noinclude><translate><!--T:45--> | ||
+ | </noinclude>Classical cryptology is the study of codes and ciphers used in the past. Discover how the following cryptographic forms were encoded in antiquity, and try to duplicate their processes to record a message: | ||
<noinclude></translate></noinclude><section end=req5 /></b> | <noinclude></translate></noinclude><section end=req5 /></b> | ||
− | <b>6. <section begin=req6 /><noinclude><translate></noinclude> | + | :<b>a. <section begin=req5a /><noinclude><translate><!--T:46--> |
+ | </noinclude>Egyptian hieroglyphs, 1900 BC | ||
+ | <noinclude></translate></noinclude><section end=req5a /></b> | ||
+ | |||
+ | :<b>b. <section begin=req5b /><noinclude><translate><!--T:47--> | ||
+ | </noinclude>Hebrew Atbash cipher, 500 BC | ||
+ | <noinclude></translate></noinclude><section end=req5b /></b> | ||
+ | |||
+ | :<b>c. <section begin=req5c /><noinclude><translate><!--T:48--> | ||
+ | </noinclude>Julius Caesar's substitution cipher, 100 BC | ||
+ | <noinclude></translate></noinclude><section end=req5c /></b> | ||
+ | <section end=challenge /> | ||
+ | |||
+ | <b>6. <section begin=req6 /><noinclude><translate><!--T:49--> | ||
+ | </noinclude>Prepare a message containing the Pathfinder Law enciphered in a Caesar cipher and indicate the key used. | ||
<noinclude></translate></noinclude><section end=req6 /></b> | <noinclude></translate></noinclude><section end=req6 /></b> | ||
− | <b>7. <section begin=req7 /><noinclude><translate></noinclude> | + | <b>7. <section begin=req7 /><noinclude><translate><!--T:50--> |
+ | </noinclude>Use steganography to write the Pathfinder Pledge. | ||
<noinclude></translate></noinclude><section end=req7 /></b> | <noinclude></translate></noinclude><section end=req7 /></b> | ||
− | <b>8. <section begin=req8 /><noinclude><translate></noinclude> | + | <b>8. <section begin=req8 /><noinclude><translate><!--T:51--> |
+ | </noinclude>Choose a cipher to encrypt a favorite Bible text and let another person decrypt it. Be sure to give that person the type of cipher and the key used. | ||
<noinclude></translate></noinclude><section end=req8 /></b> | <noinclude></translate></noinclude><section end=req8 /></b> | ||
− | <b>9. <section begin=req9 /><noinclude><translate></noinclude> | + | <b>9. <section begin=req9 /><noinclude><translate><!--T:52--> |
+ | </noinclude>Decrypt a message made by another person using the key and cipher type they used. | ||
<noinclude></translate></noinclude><section end=req9 /></b> | <noinclude></translate></noinclude><section end=req9 /></b> | ||
− | |||
− | |||
− | |||
− | |||
− | |||
<section end=Body /> | <section end=Body /> | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− |
Latest revision as of 18:07, 30 May 2025
1. Define cryptography and list its major applications.
2. Define the following terms:
- a. Code
- b. Cipher
- c. Steganography
- d. Plain text
- e. Key
- f. Public-key cryptography
- g. One-way function
3. Define each of the following categories of ciphers, give an example of each, and encipher your name using each technique.
- a. Transposition
- b. Polybius Square
- c. Square
- d. Substitution
- e. Polyalphabetic
4. Investigate whether each item in the list below is a code, a cipher, steganography, or a plain text message.
- a. Processing done by a computer to determine if a user enters a correct password
- b. A Bible verse reference
- c. The colors used on a traffic light to mean "Stop," "Go," or "Caution"
- d. HTTPS:// used in a URL over the Internet
- e. Forming a message by entering it into a grid row-by-row and reading it out column-by-column
- f. Invisible ink
- g. Navajo language used by the Code Talkers in World War II
- h. Data representation via a grid of dots (QR codes) or lines (Bar codes)
- i. Enigma machine used in World War II
- j. Recording your computer password on a piece of paper
- k. Signal used by Jonathan and David recounted in 1 Samuel 20:18-23
5. Classical cryptology is the study of codes and ciphers used in the past. Discover how the following cryptographic forms were encoded in antiquity, and try to duplicate their processes to record a message:
- a. Egyptian hieroglyphs, 1900 BC
- b. Hebrew Atbash cipher, 500 BC
- c. Julius Caesar's substitution cipher, 100 BC
6. Prepare a message containing the Pathfinder Law enciphered in a Caesar cipher and indicate the key used.
7. Use steganography to write the Pathfinder Pledge.
8. Choose a cipher to encrypt a favorite Bible text and let another person decrypt it. Be sure to give that person the type of cipher and the key used.
9. Decrypt a message made by another person using the key and cipher type they used.