~/talk

The struggle for secure cryptography

Talkat dotSecurity 2016 · on Friday, 2016-04-22· [security]
links:none on file
slides:none on file

Claim: only primitives vetted by an open competition and subjected to wide public analysis earn trust. Concrete evidence: Spritz yields an algorithm that recovers internal state in 2 to the power 12 47 operations; MD5 and SHA‑1 admit collision methods faster than brute force; a proprietary MIFARE contactless card cipher collapses billions of deployed cards. Competitions like AES and SHA‑3 (Keccak) produce designs with many rounds unbroken after years of public cryptanalysis.

AI-written summary · about

  1. 0:00Start
  2. 1:32Disasters...
  3. 1:54Attack against MIFARE
  4. 5:06Hash functions
  5. 9:51Is there any difference between
  6. 10:32Hash function competition (SHA-3)
  7. 11:16Let's start the struggle!
  8. 12:30Prize for the best cryptanalysis
  9. 14:04Round-reduced versions
  10. 14:24How many rounds can we break?
  11. 16:33Conclusion
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.