security of very dense cryptographycrypto.2012.rump.cr.yp.to/c48214fea8c79a4318a05f3dc824b6... ·...

17
Security of Very Dense Cryptography Jon Callas, Tamzen Cannoy, Nicko van Someren Tuesday, August 21, 12

Upload: others

Post on 16-Feb-2021

1 views

Category:

Documents


0 download

TRANSCRIPT

  • Security of Very Dense Cryptography

    Jon Callas, Tamzen Cannoy, Nicko van Someren

    Tuesday, August 21, 12

  • Introduction

    • Scientists have long known that stupidity is the most common element in the universe, even more than hydrogen

    Tuesday, August 21, 12

  • Introduction

    • Recent advances show that it consists of more than 90% of everything

    • This substance was thought to be dark matter, but turns out to be merely very dim

    Tuesday, August 21, 12

  • Properties

    • Very useful for quantum systems• Easily entangled• Hard to unentangle• Greatly reduced decoherence issues

    Tuesday, August 21, 12

  • Lack of Complexity

    • Emulated dim matter possible with usable limits

    • Tosh-Marley Theorem shows that iterated hash leads to very dense systems.

    • Leads to using stupidity to generate high-quality PRFs

    Tuesday, August 21, 12

  • Physical Dimness

    • Recent work at the CERN-LHC has identified six elementary dim particles

    • Pictures also obtained

    Tuesday, August 21, 12

  • Six Dim ParticlesTuesday, August 21, 12

  • Dim Particles EntangledTuesday, August 21, 12

  • Dim Particles EntangledTuesday, August 21, 12

  • Very Dense Encryption

    • Similar to Zero-Knowledge Systems• Except has less than zero knowledge

    • Quasi-knowledge leads to universal one-way arguments

    • Easily expandable into Dysfunctional Encryption

    Tuesday, August 21, 12

  • Dysfunctional Encryption

    • Knucklehead Cipher• Assembles iterated dimness through an S-P

    (Slapstick-Permutation) Network

    Tuesday, August 21, 12

  • Pseudo-Random Scuffle

    • Uses the “Slap-or-Scuffle” network• Each bit is subjected to a series of pokes,

    jabs, hair pulls, etc.

    • Bits defend themselves via blocks, dodges, sheer obliviousness as well as counter-attacks

    • Iterated over 845 rounds (a.k.a. “shorts”) to produce a PRP

    Tuesday, August 21, 12

  • Slap-or-ScuffleTuesday, August 21, 12

  • Oblivious Bit DefenseTuesday, August 21, 12

  • Cryptanalysis ApplicationsTuesday, August 21, 12

  • Cryptanalysis & Unnatural Proofs

    • Linear Cryptanalysis• Following bits across multiple S-boxes

    leads to wincing, laughter, and confusion

    • Differential Cryptanalysis• After less than 845 rounds, cryptanalysts

    can no longer distinguish the CCA difference between shorts ≤ 10-10

    Tuesday, August 21, 12

  • Current Work

    • Application to analyzing Three Card Monte as a protocol between dim particles

    • Not presented here because it was actually a good paper

    • Privacy applications• This work was aided by a grant from

    MSR, which wishes to remain anonymous

    Tuesday, August 21, 12