syn2cat
/
CryptoMessageInABottle
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Finetuning instructions

master
Gunstick 2017-11-07 15:04:59 +01:00 committed by GitHub
parent 6863528b51
commit 594387874e
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 25 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

39
PublicSecretCrypto/README.md
View File

@ -3,9 +3,8 @@
Inspired from https://blog.vrypan.net/2013/08/28/public-key-cryptography-for-non-geeks/ Inspired from https://blog.vrypan.net/2013/08/28/public-key-cryptography-for-non-geeks/
create a lock with 2 keys of which one can only unlock and the other can only lock create a lock with 2 keys of which one can only unlock and the other can only lock
Either the lock in in a box and allows to open it, or the design is like a padlock and allows to lock/sign any item There are 2 lock cylinders, as can be found on normal doors, located in a padlock style device. It allows to close a box, envelope or be attached to items.
The first trials with a prototype were a success. People are amazed.
Prototype is done and people are amazed. This sounds good.
# How to run this workshop # How to run this workshop
Asymetric cryptography adresses the problem of key transmission. Asymetric cryptography adresses the problem of key transmission.
@ -14,35 +13,47 @@ You have a public key which everyone knows and a secret key which only the recie
The keys are generated by the reciever who then publishes the public key in a "phonebook" The keys are generated by the reciever who then publishes the public key in a "phonebook"
## Introduction
* show the padlocks with the 2 locks and the public keys. Take the secret key out of a pocket. "never give this anyone" * show the padlocks with the 2 locks and the public keys. Take the secret key out of a pocket. "never give this anyone"
* show that there are 2 sets of padlocks and keys. The ones for Alice, and the ones for Bob * show that there are 2 sets of padlocks and keys. The ones for Alice, and the ones for Bob
* IMPORTANT: show on a separate lock that there is a one-way function on the lock. It only turns one way around. This is the whole secret behind asymetric encryption systems. WIth one key you can only go in one direction, and never back. * IMPORTANT: show on a separate lock that there is a one-way function on the lock. It only turns one way around. This is the whole secret behind asymetric encryption systems. With one key you can only go in one direction, and never back.
* Chose kids who play Alice and Bob * Chose kids (or groups of kids) who play Alice and Bob
* There are 3 Alice padlocks and 3 Bob padlocks
* The exercise can be done 6 times, by sending 3 messages from Alice to Bob and 3 from Bob to Alice. But this may complicate the explanations. In the following, only the direction Alice to Bob will be detailed.
* Alice wites a message and put it in an envelope/box. close the box by using the padlock and public key. ## Encryption
* Alice wites a message and puts it in an envelope/box. close the box by using the padlock and public key.
* but which key to use? Remember, the keys are created by the reciever. So we need to use Bob's public key. * but which key to use? Remember, the keys are created by the reciever. So we need to use Bob's public key.
* insist that the padlocks and public keys are accessible to anyone. Only the secret keys are... secret * insist that the padlocks and public keys are accessible to anyone. Only the secret keys are... secret
* Bob recieves the box, and can unlock the padlock with his secret key * Bob recieves the box, and can unlock the padlock with his secret key
* he is happy for the message * he is happy for the message
* but who wrote it. It says Alice, but anyone could write that, then use Bob's public key and send it to him * but who wrote it? It says Alice, but anyone could write that, then use Bob's public key and send it to him
* Signing ## Signing
* Alice wants to prove that the message comes from her. * Alice wants to prove that the message comes from her.
* Show that the padlocks have a second function. If you use first the secret key * Show that the padlocks have a second function. If you use the secret key first
* Alice writes her message, then attaches a padlock to it and closes it with her secret key. only she has that key. * Alice writes her message, then attaches a padlock to it and closes it with her secret key. only she has that key.
So she is the only one who is able to close the padlock that way. So she is the only one who is able to close the padlock that way.
* Alice puts the message with the padlock-signature into a bo and encrypts it with the reciever's (Bob) public key. * Alice puts the message with the padlock-signature into a box and encrypts it with the reciever's (Bob) public key.
* Bob recieves the box, aand decrpyt with his secret key * Bob recieves the box, and opens it (decrpyt) with his secret key
* He sees the message with Alice signature * He sees the message with Alice signature
* He veryfies the signature by trying to open the lock with alice's public key. It works! So that proves that the message comes from her. * He veryfies the signature by opening the lock with alice's public key. It works! So that proves that the message comes from her.
* One could explain that it's technically possible to sign, making the message unreadable (but easily made readable with the public key) or to sign by leaving the message in clear text.
* But where does this public key of Alice come from? How do we know it's Alice? Can be anyone...
* Certification authorities ## Certification authorities
* Transform one or two padlocks into Cert padlocks (change cylinders and stickers)
* You can verify a signature, but for that you need a public key. Anyone in the world coud say "I am Alice, here is my key". So we are back to starting square. * You can verify a signature, but for that you need a public key. Anyone in the world coud say "I am Alice, here is my key". So we are back to starting square.
* Some higher instance needs to prove that the public key is the one of Alice. That is called a certification authority. * Some higher instance needs to prove that the public key is the one of Alice. That is called a certification authority.
* The certification authority signs the public key. This creates a certificate. * The certification authority signs the public key. This creates a certificate.
* Demonstrate by attaching the CA's padlock using the CA's secret key (signing) to alice's public key (not to her padlock)
* But who signs the certification authority's public key? * But who signs the certification authority's public key?
* another certification authority, and so on... at some point you need to trus some authority * another certification authority, and so on... at some point you need to trust some authority.
* Demonstrate by attaching another padlock-signature to the CA's public key. => "keychain"
* Finally at the end, the top secret key is secured in a box/envelope by attaching a combination code padlock. And the code is put in your head.
* Web browsers come with built-in certification authorities which the browser trusts. That's how the websites prove that they are who they say. Show a webbrowser's CA list. * Web browsers come with built-in certification authorities which the browser trusts. That's how the websites prove that they are who they say. Show a webbrowser's CA list.
* Show how a website's certificate is signed by a row of CAs.