The Seduction of the One-Time Pad

Slides:



Advertisements
Similar presentations
WEP 1 WEP WEP 2 WEP  WEP == Wired Equivalent Privacy  The stated goal of WEP is to make wireless LAN as secure as a wired LAN  According to Tanenbaum:
Advertisements

1 The Fortuna PRNG Niels Ferguson. 2 The problem We need to make “random” choices in cryptographic protocols. Computers are deterministic. Standard “random”
Foundations of Network and Computer Security J J ohn Black Lecture #34 Dec 5 th 2007 CSCI 6268/TLEN 5831, Fall 2007.
Foundations of Network and Computer Security J J ohn Black Lecture #3 Aug 28 th 2009 CSCI 6268/TLEN 5550, Fall 2009.
Overview of Cryptography and Its Applications Dr. Monther Aldwairi New York Institute of Technology- Amman Campus INCS741: Cryptography.
Fall 2010/Lecture 311 CS 426 (Fall 2010) Public Key Encryption and Digital Signatures.
Computer Security CS 426 Lecture 3
Cryptography and Network Security Chapter 11 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.
Practical Techniques for Searches on Encrypted Data Yongdae Kim Written by Song, Wagner, Perrig.
Dan Boneh Stream ciphers The One Time Pad Online Cryptography Course Dan Boneh.
Tonga Institute of Higher Education Design and Analysis of Algorithms IT 254 Lecture 9: Cryptography.
Crypto Bro Rigby. History
One-Time Pad Or Vernam Cipher Sayed Mahdi Mohammad Hasanzadeh Spring 2004.
Giuseppe Bianchi Warm-up example 1 found on a real paper! Warm-up example 1 found on a real paper!
Introduction to Quantum Key Distribution
Attacks on PRNGs - By Nupura Neurgaonkar CS-265 (Prof. Mark Stamp)
Lecture 2: Introduction to Cryptography
CS526Topic 2: Classical Cryptography1 Information Security CS 526 Topic 2 Cryptography: Terminology & Classic Ciphers.
หัวข้อบรรยาย Stream cipher RC4 WEP (in)security LFSR CSS (in)security.
Lecture 3 Page 1 CS 236 Online Basic Encryption Methods Substitutions –Monoalphabetic –Polyalphabetic Permutations.
Symmetric-Key Cryptography CS 161: Computer Security Prof. Raluca Ada Popa Sept 13, 2016.
CSC 108H: Introduction to Computer Programming
Secret Key Cryptography
Outline Basic concepts in computer security
Vocabulary Big Data - “Big data is a broad term for datasets so large or complex that traditional data processing applications are inadequate.” Moore’s.
Password Management Limit login attempts Encrypt your passwords
Public Key Encryption Systems
Public Key Encryption and Digital Signatures
Outline Desirable characteristics of ciphers Uses of cryptography
Certificates An increasingly popular form of authentication
Basic Encryption Methods
Vernam Cipher Group Members: Muhammad Awais Muhammad Hasnain khan
Cryptography.
Outline Desirable characteristics of ciphers Stream and block ciphers
Outline Desirable characteristics of ciphers Uses of cryptography
Chapter 17 Probability Models Copyright © 2010 Pearson Education, Inc.
Digital Signature Schemes and the Random Oracle Model
Quantum Key Distribution
Cryptography Lecture 3.
Random numbers Taken from notes by Dr. Neil Moore
Cryptographic Hash Functions Part I
ANALYSIS OF WIRED EQUIVALENT PRIVACY
B504/I538: Introduction to Cryptography
Cryptography Lecture 4.
CMSC 414 Computer and Network Security Lecture 3
Cryptography Lecture 6.
Security through Encryption
SSH: SECURE LOGIN CONNECTIONS OVER THE INTERNET
CS/ECE 478 Network Security Dr. Attila Altay Yavuz
Quantum Cryptography Scott Roberts CSE /01/2001.
Block vs Stream Ciphers
Cryptography and Network Security Chapter 7
Cryptography Reference: Network Security
One time pad & Many Time pad
RC4 RC
Cryptography Lecture 5.
Block Ciphers (Crypto 2)
Chapter -7 CRYPTOGRAPHIC HASH FUNCTIONS
DISSERTATION ON CRYPTOGRAPHY.
Padding Oracle Attacks
Cryptography Lecture 6.
One Way Functions Motivation Complexity Theory Review, Motivation
CSC 774 Advanced Network Security
Cryptography Lecture 3.
Certificates An increasingly popular form of authentication
Cryptology Design Fundamentals
Public Key Encryption Systems
Pseudorandom Numbers Network Security.
Stream Cipher Structure
Crypto for CTFs.
Presentation transcript:

The Seduction of the One-Time Pad Jon Callas 8 October 1998

The Situation The One-Time Pad (OTP) is the only provably secure form of encryption Cryptography, like life, is filled with uncertainties People want certainty, so they think that if they make their system more like an OTP, it will be more certain and more secure

The Seduction OTPs are hard OTPs attract cranks In other fields, certainties attract cranks OTPs attract people who should know better

The Problem Making crypto like an OTP is like making an airplane like a bird Great idea Great metaphor Some people actually make it work In general, a bad idea

Overview What is an OTP? How do they work? Why don’t they work? Pseudo-OTPs Snake Oil

What is an OTP? OTP takes a string of random numbers as long as the message Combines the random numbers with the message XOR, modular or rotational arithmetic good ways This produces cyphertext Because all random strings are equally likely, cryptanalysis is impossible

How it works Message: ATTACK Pad (key): 4 8 20 10 16 1 Cyphertext: EAMKSL But what if the pad was 25 15 11 10 16 1 Message is FLBACK This is why it’s unbreakable

So Far, So Good But what longer messages? You need a longer pad You need a lot of pad You need a pad for every person you want to talk to.

Dangers The pad must be cryptographically random This takes work Cryptographic random numbers are not like other random numbers They must be conformists You must never reuse a pad http://www.nsa.gov:8080/docs/venona/venona.html You must never lose a pad

Is this Feasible? Suppose we pre-compute 1MB pads Suppose you want enough pads for a 1000 person company That’s ~500K pads That’s 1/2 terabyte I’d like a laptop that big!

Is this Feasible? Suppose we don’t pre-compute pads Pads must be distributed through a secure channel If you use a “secure network,” the security level of the pad is that of the network You lose provable security

Can These Flaws be Fixed? Pseudo-OTP A PRNG replaces the RNG Pads don’t have to be stored Seed material is smaller than pads, easier to secure This isn’t an OTP It’s a stream cypher There is nothing wrong with a stream cypher It’s not an OTP

Snake Oil A term for medicine with over-broad claims Real medicine comes with a list of caveats Snake oil may still cure some things It’s really an error in labeling

Cranks Over-label Vague claims Wear “persecution” as a badge Galileo was persecuted I’m persecuted Therefore, I’m the next Galileo Ignore peer review, publication process Exception -- patents

Identifying Snake Oil No Papers No Algorithms No Publication No Documentation Outrageous claims Thousand to Million bit keys Access to secret knowledge Etc.

Very Long Keys There are 2**85 nanoseconds until the sun goes nova There are 2**170 atoms in Planet Earth If every atom on the planet tests a key per nanosecond, it will check 255 bits of key space when the sun goes nova

Coming Full Circle There’s no certainty in security We settle for predictability Reasonably designed systems have predictable security parameters The reasonable design of 256-bit cyphers is a leap from the reasonable design of 128-bit systems There is no assurance that longer keys in known systems give more security

Questions?