X

Download Cryptocurrency PowerPoint Presentation

SlidesFinder-Advertising-Design.jpg

Login   OR  Register
X


Iframe embed code :



Presentation url :

Home / Business & Management / Business & Management Presentations / Cryptocurrency PowerPoint Presentation

Cryptocurrency PowerPoint Presentation

Ppt Presentation Embed Code   Zoom Ppt Presentation

PowerPoint is the world's most popular presentation software which can let you create professional Cryptocurrency powerpoint presentation easily and in no time. This helps you give your presentation on Cryptocurrency in a conference, a school lecture, a business proposal, in a webinar and business and professional representations.

The uploader spent his/her valuable time to create this Cryptocurrency powerpoint presentation slides, to share his/her useful content with the world. This ppt presentation uploaded by standsfordotin in Business & Management ppt presentation category is available for free download,and can be used according to your industries like finance, marketing, education, health and many more.

About This Presentation

Cryptocurrency Presentation Transcript

Slide 1 - Crypto Part 1  Cryptography 1
Slide 2 - Crypto Cryptology --- The art and science of making and breaking “secret codes” Cryptography --- making “secret codes” Cryptanalysis --- breaking “secret codes” Crypto --- all of the above (and more) Part 1  Cryptography 2
Slide 3 - How to Speak Crypto A cipher or cryptosystem is used to encrypt the plaintext The result of encryption is ciphertext We decrypt ciphertext to recover plaintext A key is used to configure a cryptosystem A symmetric key cryptosystem uses the same key to encrypt as to decrypt A public key cryptosystem uses a public key to encrypt and a private key to decrypt (sign) Part 1  Cryptography 3
Slide 4 - Crypto Basis assumption The system is completely known to the attacker Only the key is secret Also known as Kerckhoffs Principle Crypto algorithms are not secret Why do we make this assumption? Experience has shown that secret algorithms are weak when exposed Secret algorithms never remain secret Better to find weaknesses beforehand Part 1  Cryptography 4
Slide 5 - Crypto as Black Box Part 1  Cryptography 5 plaintext key key plaintext ciphertext A generic use of crypto encrypt decrypt
Slide 6 - Simple Substitution Plaintext: fourscoreandsevenyearsago Key: Part 1  Cryptography 6 Ciphertext: IRXUVFRUHDAGVHYHABHDUVDIR Shift by 3 is “Caesar’s cipher” Plaintext Ciphertext
Slide 7 - Ceasar’s Cipher Decryption Plaintext: spongebobsquarepants Part 1  Cryptography 7 Plaintext Ciphertext Suppose we know a Ceasar’s cipher is being used Ciphertext: VSRQJHEREVTXDUHSDQWU
Slide 8 - Not-so-Simple Substitution Shift by n for some n  {0,1,2,…,25} Then key is n Example: key = 7 Part 1  Cryptography 8 Plaintext Ciphertext
Slide 9 - Cryptanalysis I: Try Them All A simple substitution (shift by n) is used But the key is unknown Given ciphertext: CSYEVIXIVQMREXIH How to find the key? Only 26 possible keys --- try them all! Exhaustive key search Solution: key = 4 Part 1  Cryptography 9
Slide 10 - Even-less-Simple Substitution Key is some permutation of letters Need not be a shift For example Part 1  Cryptography 10 Plaintext Ciphertext Then 26! > 288 possible keys!
Slide 11 - Cryptanalysis II: Be Clever We know that a simple substitution is used But not necessarily a shift by n Can we find the key given ciphertext: PBFPVYFBQXZTYFPBFEQJHDXXQVAPTPQJKTOYQWIPBVWLXTOXBTFXQWAXBVCXQWAXFQJVWLEQNTOZQGGQLFXQWAKVWLXQWAEBIPBFXFQVXGTVJVWLBTPQWAEBFPBFHCVLXBQUFEVWLXGDPEQVPQGVPPBFTIXPFHXZHVFAGFOTHFEFBQUFTDHZBQPOTHXTYFTODXQHFTDPTOGHFQPBQWAQJJTODXQHFOQPWTBDHHIXQVAPBFZQHCFWPFHPBFIPBQWKFABVYYDZBOTHPBQPQJTQOTOGHFQAPBFEQJHDXXQVAVXEBQPEFZBVFOJIWFFACFCCFHQWAUVWFLQHGFXVAFXQHFUFHILTTAVWAFFAWTEVOITDHFHFQAITIXPFHXAFQHEFZQWGFLVWPTOFFA Part 1  Cryptography 11
Slide 12 - Cryptanalysis II Can’t try all 288 simple substitution keys Can we be more clever? English letter frequency counts… Part 1  Cryptography 12
Slide 13 - Cryptanalysis II Ciphertext: PBFPVYFBQXZTYFPBFEQJHDXXQVAPTPQJKTOYQWIPBVWLXTOXBTFXQWAXBVCXQWAXFQJVWLEQNTOZQGGQLFXQWAKVWLXQWAEBIPBFXFQVXGTVJVWLBTPQWAEBFPBFHCVLXBQUFEVWLXGDPEQVPQGVPPBFTIXPFHXZHVFAGFOTHFEFBQUFTDHZBQPOTHXTYFTODXQHFTDPTOGHFQPBQWAQJJTODXQHFOQPWTBDHHIXQVAPBFZQHCFWPFHPBFIPBQWKFABVYYDZBOTHPBQPQJTQOTOGHFQAPBFEQJHDXXQVAVXEBQPEFZBVFOJIWFFACFCCFHQWAUVWFLQHGFXVAFXQHFUFHILTTAVWAFFAWTEVOITDHFHFQAITIXPFHXAFQHEFZQWGFLVWPTOFFA Part 1  Cryptography 13 Ciphertext frequency counts: Decrypt this message using info below
Slide 14 - Cryptanalysis: Terminology Cryptosystem is secure if best know attack is to try all keys Cryptosystem is insecure if any shortcut attack is known By this definition, an insecure system might be harder to break than a secure system! Part 1  Cryptography 14
Slide 15 - Double Transposition Plaintext: attackxatxdawn Part 1  Cryptography 15 Permute rows and columns  Ciphertext: xtawxnattxadakc Key: matrix size and permutations (3,5,1,4,2) and (1,3,2)
Slide 16 - One-time Pad Part 1  Cryptography 16 e=000 h=001 i=010 k=011 l=100 r=101 s=110 t=111 Encryption: Plaintext  Key = Ciphertext Plaintext: Key: Ciphertext:
Slide 17 - One-time Pad Part 1  Cryptography 17 e=000 h=001 i=010 k=011 l=100 r=101 s=110 t=111 Ciphertext: “key”: “Plaintext”: Double agent claims sender used “key”:
Slide 18 - One-time Pad Part 1  Cryptography 18 e=000 h=001 i=010 k=011 l=100 r=101 s=110 t=111 Ciphertext: “Key”: “Plaintext”: Sender is captured and claims the key is:
Slide 19 - One-time Pad Summary Provably secure, when used correctly Ciphertext provides no info about plaintext All plaintexts are equally likely Pad must be random, used only once Pad is known only by sender and receiver Pad is same size as message No assurance of message integrity Why not distribute message the same way as the pad? Part 1  Cryptography 19
Slide 20 - Real-world One-time Pad Project VENONA Soviet spy messages from U.S. in 1940’s Nuclear espionage, etc. Thousands of messaged Spy carried one-time pad into U.S. Spy used pad to encrypt secret messages Repeats within the “one-time” pads made cryptanalysis possible Part 1  Cryptography 20
Slide 21 - VENONA Decrypt (1944) [C% Ruth] learned that her husband [v] was called up by the army but he was not sent to the front. He is a mechanical engineer and is now working at the ENORMOUS [ENORMOZ] [vi] plant in SANTA FE, New Mexico. [45 groups unrecoverable] detain VOLOK [vii] who is working in a plant on ENORMOUS. He is a FELLOWCOUNTRYMAN [ZEMLYaK] [viii]. Yesterday he learned that they had dismissed him from his work. His active work in progressive organizations in the past was cause of his dismissal. In the FELLOWCOUNTRYMAN line LIBERAL is in touch with CHESTER [ix]. They meet once a month for the payment of dues. CHESTER is interested in whether we are satisfied with the collaboration and whether there are not any misunderstandings. He does not inquire about specific items of work [KONKRETNAYa RABOTA]. In as much as CHESTER knows about the role of LIBERAL's group we beg consent to ask C. through LIBERAL about leads from among people who are working on ENOURMOUS and in other technical fields. Part 1  Cryptography 21 “Ruth” == Ruth Greenglass “Liberal” == Julius Ronsenberg “Enormous” == the atomic bomb
Slide 22 - Codebook Literally, a book filled with “codewords” Zimmerman Telegram encrypted via codebook Februar 13605 fest 13732 finanzielle 13850 folgender 13918 Frieden 17142 Friedenschluss 17149 : : Modern block ciphers are codebooks! More on this later… Part 1  Cryptography 22
Slide 23 - Zimmerman Telegram One of most famous codebook ciphers ever Led to US entry in WWI Ciphertext shown here… Part 1  Cryptography 23
Slide 24 - Zimmerman Telegram Decrypted Part 1  Cryptography 24 British had recovered partial codebook Able to fill in missing parts
Slide 25 - A Few Historical Items Crypto timeline Spartan Scytale --- transposition cipher Caesar’s cipher Poe’s The Gold Bug Election of 1876 Part 1  Cryptography 25
Slide 26 - Election of 1876 “Rutherfraud” Hayes vs “Swindling” Tilden: Popular vote was virtual tie Electoral college delegations for 4 states (including Florida) in dispute Commission: All 4 states to Hayes Tilden accused Hayes of bribery Was it true? Part 1  Cryptography 26
Slide 27 - Election of 1876 Encrypted messages by Tilden supporters later emerged Cipher: Partial codebook, plus transposition Codebook substitution for important words ciphertext plaintext Copenhagen Greenbacks Greece Hayes Rochester votes Russia Tilden Warsaw telegram : : Part 1  Cryptography 27
Slide 28 - Election of 1876 Apply codebook to original message Pad message to multiple of 5 words (total length, 10,15,20,25 or 30 words) For each length, a fixed permutation applied to resulting message Permutations found by comparing many messages of same length Note that the same key is applied to all messages of a given length Part 1  Cryptography 28
Slide 29 - Election of 1876 Ciphertext: Warsaw they read all unchanged last are idiots can’t situation Codebook: Warsaw  telegram Transposition: 9,3,6,1,10,5,2,7,4,8 Plaintext: Can’t read last telegram. Situation unchanged. They are all idiots. A weak cipher made worse by reuse of key Lesson: Don’t reuse/overuse keys! Part 1  Cryptography 29
Slide 30 - Early 20th Century WWI --- Zimmerman Telegram “Gentlemen do not read each other’s mail” --- Henry L. Stimson, Secretary of State, 1929 WWII --- golden age of cryptanalysis Midway/Coral Sea Japanese Purple (codename MAGIC) German Enigma (codename ULTRA) Part 1  Cryptography 30
Slide 31 - Post-WWII History Claude Shannon --- father of the science of information theory Computer revolution --- lots of data Data Encryption Standard (DES), 70’s Public Key cryptography, 70’s CRYPTO conferences, 80’s Advanced Encryption Standard (AES), 90’s Crypto moved out of classified world Part 1  Cryptography 31
Slide 32 - Claude Shannon The founder of Information Theory 1949 paper: Comm. Thy. of Secrecy Systems Confusion and diffusion Confusion --- obscure relationship between plaintext and ciphertext Diffusion --- spread plaintext statistics through the ciphertext Proved that one-time pad is secure One-time pad only uses confusion, while double transposition only uses diffusion Part 1  Cryptography 32
Slide 33 - Taxonomy of Crypto Symmetric Key Same key for encryption as for decryption Stream ciphers Block ciphers Public Key Two keys, one for encryption (public), and one for decryption (private) Digital signatures --- nothing comparable in symmetric key crypto Hash algorithms Part 1  Cryptography 33
Slide 34 - Taxonomy of Cryptanalysis Ciphertext only Known plaintext Chosen plaintext “Lunchtime attack” Protocols might encrypt chosen text Adaptively chosen plaintext Related key Forward search (public key crypto only) Etc., etc. Part 1  Cryptography 34
Slide 35 - Crypto Summary Terminology Symmetric key crypto Stream ciphers A5/1 and RC4 Block ciphers DES, AES, TEA Modes of operation Integrity Part 1  Cryptography 35
Slide 36 - Crypto Summary Public key crypto Knapsack RSA Diffie-Hellman ECC Non-repudiation PKI, etc. Part 1  Cryptography 36
Slide 37 - Crypto Summary Hashing Birthday problem Tiger hash HMAC Secret sharing Random numbers Part 1  Cryptography 37
Slide 38 - Crypto Summary Information hiding Steganography Watermarking Cryptanalysis Linear and differential cryptanalysis RSA timing attack Knapsack attack Hellman’s TMTO Part 1  Cryptography 38
Slide 39 - Coming Attractions… Access Control Authentication -- who goes there? Authorization -- can you do that? We’ll see some crypto in next chapter We’ll see lots of crypto in protocol chapters Part 1  Cryptography 39
Slide 40 - Thank You Part 1  Cryptography 40