Week three!.  8 groups of 2  6 rounds  Ancient cryptosystems  Newer cryptosystems  Modern cryptosystems  Encryption and decryptions  Math  Security.

Slides:

Advertisements

Similar presentations

Public Key Cryptography Nick Feamster CS 6262 Spring 2009.

Advertisements

Public Key Cryptosystem

1 Introduction to Quantum Computation and Quantum Information Dr. Raja Nagarajan University of Warwick.

IS 302: Information Security and Trust Week 4: Asymmetric Encryption

Quantum Cryptography ( EECS 598 Presentation) by Amit Marathe.

Intro 1 Introduction Intro 2 Good Guys and Bad Guys  Alice and Bob are the good guys  Trudy is the bad guy  Trudy is our generic “intruder”

CS 483 – SD SECTION BY DR. DANIYAL ALGHAZZAWI (4) Information Security.

Lecture 3.3: Public Key Cryptography III CS 436/636/736 Spring 2012 Nitesh Saxena.

Elliptic curve arithmetic and applications to cryptography By Uros Abaz Supervised by Dr. Shaun Cooper and Dr. Andre Barczak.

Network Security – Part 2 Public Key Cryptography Spring 2007 V.T. Raja, Ph.D., Oregon State University.

HW6 due tomorrow Teams T will get to pick their presentation day in the order Teams T will get to pick their presentation day in the orderQuestions? Review.

RSA ( Rivest, Shamir, Adleman) Public Key Cryptosystem

CNS2009handout 21 :: quantum cryptography1 ELEC5616 computer and network security matt barrie

Dr. Lo’ai Tawalbeh Fall 2005 Chapter 10 – Key Management; Other Public Key Cryptosystems Dr. Lo’ai Tawalbeh Computer Engineering Department Jordan University.

1 Lecture #10 Public Key Algorithms HAIT Summer 2005 Shimrit Tzur-David.

Overview of Cryptography and Its Applications Dr. Monther Aldwairi New York Institute of Technology- Amman Campus INCS741: Cryptography.

Public Key Cryptography RSA Diffie Hellman Key Management Based on slides by Dr. Lawrie Brown of the Australian Defence Force Academy, University College,

 8 groups of 2  5 rounds  Basic Definitions  Substitution Cryptosystems  Math  Tricky Questions  Comparing Cryptosystems  10 questions per round.

Computer Science CSC 474Dr. Peng Ning1 CSC 474 Information Systems Security Topic 2.5 Public Key Algorithms.

Public-Key Cryptography and RSA CSE 651: Introduction to Network Security.

ASYMMETRIC CIPHERS.

Public Key Model 8. Cryptography part 2.

Tonga Institute of Higher Education Design and Analysis of Algorithms IT 254 Lecture 9: Cryptography.

Lecture slides prepared for “Computer Security: Principles and Practice”, 2/e, by William Stallings and Lawrie Brown, Chapter 21 “Public-Key Cryptography.

Lecture 19 Page 1 CS 111 Online Symmetric Cryptosystems C = E(K,P) P = D(K,C) E() and D() are not necessarily the same operations.

Lecture 7 Discrete Logarithms

Quantum Computing David Dvorak CIS 492. Quantum Computing Overview What is it? How does it work? –The basics –Clarifying with examples Factoring Quantum.

RSA Implementation. What is Encryption ? Encryption is the transformation of data into a form that is as close to impossible as possible to read without.

HW6 due tomorrow Teams T will get to pick their presentation day in the order Teams T will get to pick their presentation day in the order Teams mostly.

Public Key Encryption and the RSA Public Key Algorithm CSCI 5857: Encoding and Encryption.

Day 37 8: Network Security8-1. 8: Network Security8-2 Symmetric key cryptography symmetric key crypto: Bob and Alice share know same (symmetric) key:

Chapter 21 Public-Key Cryptography and Message Authentication.

Cryptography and Network Security (CS435) Part Eight (Key Management)

PUBLIC KEY CRYPTOSYSTEMS Symmetric Cryptosystems 23/10/2015 | pag. 2.

Darci Miyashiro Math 480 April 29, 2013

Public Key Cryptography. symmetric key crypto requires sender, receiver know shared secret key Q: how to agree on key in first place (particularly if.

P1. Public-Key Cryptography and RSA 5351: Introduction to Cryptography Spring 2013.

David Westenberger Lucas Zurek. What’s Happening Now? Silicon-based Computation – Moore’s Law Transistors Physical limitation Then what’s next?

Classical Crypto By: Luong-Sorin VA, IMIT Dith Nimol, IMIT.

1 Simple and Unbreakable: The Mathematics of Internet Security Dr. Monica Nevins Department of Mathematics and Statistics University of Ottawa University.

Symmetric Cryptography, Asymmetric Cryptography, and Digital Signatures.

Key Exchange Methods Diffie-Hellman and RSA CPE 701 Research Case Study Derek Eiler | April 2012.

Chapter 3 (B) – Key Management; Other Public Key Cryptosystems.

Introduction to Quantum Key Distribution

Cryptography 1 Crypto Cryptography 2 Crypto  Cryptology  The art and science of making and breaking “secret codes”  Cryptography  making “secret.

Overview of Cryptography & Its Applications

24-Nov-15Security Cryptography Cryptography is the science and art of transforming messages to make them secure and immune to attacks. It involves plaintext,

Nawaf M Albadia

Quantum computing, teleportation, cryptography Computing Teleportation Cryptography.

Quantum Information Science The size of transistors decreases by half every eighteen months Intel’s 20 and 45 nm transistor Laser MRI Information Theory.

Elliptic Curve Cryptography

COMP 424 Lecture 04 Advanced Encryption Techniques (DES, AES, RSA)

14-1 Last time Internet Application Security and Privacy Basics of cryptography Symmetric-key encryption.

7. Key Length Public key length Kim Hyoung-Shick.

Cryptography issues – elliptic curves Presented by Tom Nykiel.

Lecture 9 Elliptic Curves. In 1984, Hendrik Lenstra described an ingenious algorithm for factoring integers that relies on properties of elliptic curves.

Public-Key encryption structure First publicly proposed by Diffie and Hellman in 1976First publicly proposed by Diffie and Hellman in 1976 Based on mathematical.

Introduction to Pubic Key Encryption CSCI 5857: Encoding and Encryption.

1 Diffie-Hellman (Key Exchange) Protocol Rocky K. C. Chang 9 February 2007.

Information Security and Management 10. Other Public-key Cryptosystems Chih-Hung Wang Fall

Security. Cryptography (1) Intruders and eavesdroppers in communication.

INCS 741: Cryptography Overview and Basic Concepts.

Intro to Cryptography ICS 6D Sandy Irani. Cryptography Intro Alice wants to send a message to Bob so that even if Eve can see the transmitted information,

CMSC 414 Computer and Network Security Lecture 2 Jonathan Katz.

Secret Key Cryptography

Cybersecurity: Aspects of Cryptography from a Classical and Quantum Perspective (An Ongoing Review) Joseph Spring University of Hertfordshire British Council.

Lesson 7: Public Key Cryptography Lesson 8: Rapid Research - Cybercrime Day 37.

Lattices. Svp & cvp. lll algorithm. application in cryptography

Presentation transcript:

Week three!

 8 groups of 2  6 rounds  Ancient cryptosystems  Newer cryptosystems  Modern cryptosystems  Encryption and decryptions  Math  Security and Performance  10 questions per round  Each question is worth 1 point  Bonus Bingo: Fill in 25 things from this class that you think are important. Mark them off if or when they come up.

1. This was the primary cryptosystem used by the Germans during World War II. 2. What was an advantage of the above cryptosystem? 3. What was a disadvantage of the above cryptosystem? 4. This was a cryptosystem used by the Americans during World War II that was never broken. 5. What was an advantage of the above cryptosystem? 6. What was a disadvantage of the above cryptosystem?

7. What cryptosystem was the first major cryptosystem to place its security just in the key? 8. This was the first algorithm released to the public that could enable Alice and Bob to establish cryptographic communication? 9. What algorithm relies on factoring for security? 10. What algorithm relies on the discrete logarithm problem for security?

1. This can replace RSA today. 2. This might some day RSA in the future. 3. This handles the vast majority of cryptography today. 4. In a war, if one side chooses to encrypt their information with AES, what should the other side choose? 5. In Quantum teleportation, what is “teleported”?

6. Name all public-key systems we have covered. 7. In Quantum computing, this describes the ability for a qubit to become 1 and 0 at the same time. 8. In Quantum computing, if two entangled qubits both have the value 0.5, what will they be when you observe them? 9. Will quantum computers make classical computers obsolete? 10. A 512 qubit quantum computer exists … why can’t it break 128-bit ECC?

S

Key size KeyspaceEncryption runtime Decryption runtime Resistant to Frequency Analysis?

The End

 Created in the summer of 2013 by Dr. Jeffrey Beyerl for use in a cryptography class.  This is just a vanilla PowerPoint, but of course like anything you download from the internet: use at your own risk.