Successfully reported this slideshow.
We use your LinkedIn profile and activity data to personalize ads and to show you more relevant ads. You can change your ad preferences anytime.
Hashing
THEN AND NOW
MIKE SMORUL – ADAPT PROJECT
Commodity Storage
Performance
2003

JetStor III IDE-FC

62MB/s

large block

2013
218MB/s

workstation SSD
Perc 6/MD1...
Chip Speed
 2003:

Pentium 4

3.2Ghz

 2013:

Core i7 Extreme

3.5Ghz
Hashing Performance
 SHA-256

Hashing

Java:

85MB/s
Crypto++: 111-134MB/s
 Real

World Penalty

Java:

20-40% penalt...
Implications
 Flipped

bottlenecks
Parallelize Digesting
 Independent

IO and digest

threads
 Always have work for the
digest algorithm.
 Large files saw...
Securing Data in Motion

?
Integrity across the
network
 Internal
 Prove

Auditing
your hardware

 Peer-Auditing
 Prove

 Digital

your friends
...
Chronopolis Integrity
 Current:
Producer

supplied
authoritative manifest
Peers locally monitor
integrity
Manually tra...
Chronopolis Integrity
 In-progress
Single

integrity token back
to ingest

 Ideal
Tokens

issued prior to arrival
‘Pr...
Manifests 2.0
 Token

manifests
 Portable, embeddable
Python,

etc
Integrity supporting
Provenance
 Digests

in a cloud validate
transfer only
 Http headers can pass
extended integrity
in...
Closing
 Why

are you hashing?
 What do you want to
prove?
 Hashing Cost/performance
Contact
Mike Smorul
msmorul@sesync.org

http://adapt.umiacs.umd.edu/ace
Upcoming SlideShare
Loading in …5
×

Pasig - Hashing presentation-2013

408 views

Published on

Presentation to the 2013 Pasig meeting in Washington DC

Published in: Technology
  • Be the first to comment

  • Be the first to like this

Pasig - Hashing presentation-2013

  1. 1. Hashing THEN AND NOW MIKE SMORUL – ADAPT PROJECT
  2. 2. Commodity Storage Performance 2003 JetStor III IDE-FC 62MB/s large block 2013 218MB/s workstation SSD Perc 6/MD1000, 400MB/s+
  3. 3. Chip Speed  2003: Pentium 4 3.2Ghz  2013: Core i7 Extreme 3.5Ghz
  4. 4. Hashing Performance  SHA-256 Hashing Java: 85MB/s Crypto++: 111-134MB/s  Real World Penalty Java: 20-40% penalty on slow seek disk
  5. 5. Implications  Flipped bottlenecks
  6. 6. Parallelize Digesting  Independent IO and digest threads  Always have work for the digest algorithm.  Large files saw over 95% of algorithm potential.  Small files unchanged.
  7. 7. Securing Data in Motion ?
  8. 8. Integrity across the network  Internal  Prove Auditing your hardware  Peer-Auditing  Prove  Digital your friends Signatures Prove identity  Token Based Prove time
  9. 9. Chronopolis Integrity  Current: Producer supplied authoritative manifest Peers locally monitor integrity Manually trace back to point of ingest
  10. 10. Chronopolis Integrity  In-progress Single integrity token back to ingest  Ideal Tokens issued prior to arrival ‘Prove’ the state of data to point before Chronopolis
  11. 11. Manifests 2.0  Token manifests  Portable, embeddable Python, etc
  12. 12. Integrity supporting Provenance  Digests in a cloud validate transfer only  Http headers can pass extended integrity information End-user verification
  13. 13. Closing  Why are you hashing?  What do you want to prove?  Hashing Cost/performance
  14. 14. Contact Mike Smorul msmorul@sesync.org http://adapt.umiacs.umd.edu/ace

×